All you need to do is multiply these cycles out, and I think that is the problem, I am guessing you are not used to cycle notation. It can be a little confusing at first, but in the end it is waaay faster. The thing to remember is that each individual thing inside of parentheses is a permutation, which is a function that simply rearranges the set of n objects. The operation in is function composition. As with normal functions for some reason we compose from right to left . You do f first, and then g which seems backwards as we read left to right.
Anyway, the point is within each set of () you read left to right, but you do the permutations from right to left.
(1 2 6 5)(1 3 6 5)(2 3 4 6)
Start with 1 and see where it goes. (2 3 4 6) does not affect 1, so carry on to the next one we see (1 3 6 5) because 3 follows the 1. Now check to see what (1 2 6 5 ) does to 3... nothing, so this whole set of three cycles takes 1 to 3.
Now you check to see what happens to 3.
(2 3 4 6) takes 3 to 4.
(1 3 6 5) does not affect 4
(1 2 6 5) does not affect 4
Thus we get overall
Now check on 4
This completes the cycle, so write ( 1 3 5 ) as the Abstractionist pointed out.
Now the smallest number not included in this cycle is 2, check and see what happens to 2.
Now see what happens to 5.
This completes the cycle so write (2 5)
The only one missing is 6, so check on this.
so it is fixed as he points out.
So you are left with the final disjoint cycle decomposition theAbstractionist gave you:
(1 3 4) (2 5) (6)
It can be shown this disjoint cycle decomposition is unique up to reordering (disjoint cycles commute) and up to cycling within each cycle [(1 2 3) = (2 3 1)= (3 1 2)]. So you will see this cycle type is perserved. In fact the cycle type is even perserved under conjugation.