Thread: Another Cycle Decomposition Question

In let be a cycle of length 4, and be a transposition.

Show is even, and briefly explain why

Let , then the decomposition would be , and let . This means that would be , which is even. Think I've gone about this in the correct way?

For any transposition , , this means that .

For our transpositions above, , so even if , it would still not equal the identity transposition. Would this be enough to briefly explain?

I managed to attempt the first couple of sections of the question, but this last part has got me very confused:

Deduce that is either a cycle of length 3, or a product of 2 disjoint transpositions. Conclude that for some not necessarily disjoint permutations

Would greatly appreciate some help in how to go about this problem.

Thanks in advance

You're definitely on the right track. In general, an n-cycle is even for odd n, and vice-versa, so the first result is immediate. For the second part, I'd just note that the 4-cycle moves 4 elements, and any transposition can only restore at most 2 to their original place.

Originally Posted by Tinyboss

You're definitely on the right track. In general, an n-cycle is even for odd n, and vice-versa, so the first result is immediate. For the second part, I'd just note that the 4-cycle moves 4 elements, and any transposition can only restore at most 2 to their original place.

Thanks for the reply. That's a good idea about only restoring 2, didn't think of that.

Any idea how to approach the last section?

we know there is 12 even permutations in s4, we also know that id is not one of the solutions. (as you have said). solution have to be one of the other 11 even permutation, which are 8x3-cycles and 2xproduct of two disjoint transpositions.

hope it will help

Yes that helps, cheers for the reply!