Symmetric and Alternating Groups disjoint cycles

[tehme2]

Homework Statement

Let a = (a1a2..ak) and b = (c1c2..ck) be disjoint cycles in Sn. Prove that ab = ba.

The Attempt at a Solution

Sn consists of the permutations of the elements of T where T = {1,2,3,...,n}
so assume we take an i from T. Then either i is in a, i is in b, or i is in neither a or b

1. assume i is in a.
then a o b(i) = a(i) as b(i) = i since b maps it to itself
then b o a(i) = b(a(i)) = a(i) as b maps this a(i) to itself

2. assume i is in b.

then a o b (i) = a(b(i)) = b(i) as a maps this b(i) to itself
then b o a(i) = b(i)

3. assume it is in neither

then a o b (i) = a(i) = i as both a and b map i to itself
then b o a (i) = b(i) = i

so regardless of which permutation i is in, we see ab = ba for disjoint cycles a and b.

 

[Kreizhn]

Your proof is fine. Is there a question about this?