Exercise 8.4.2

Prove that A n is generated by 3-cycles when n 3 .

Answers

Proof.

We notice that for all i , j , k such that i j , j k , ( i j ) ( j k ) = ( ijk ) .

As every permutation in A n is the product of an even number of permutations, it is sufficient to prove that the product of ( i j ) ( k l ) , i j , k l , is a product of 3-cycles.

If { i , j } , { k , l } are disjointed, then i , j , k , l are distincts, so

( i j ) ( k l ) = ( i j ) ( j k ) ( j k ) ( k l ) = ( i j k ) ( j k ) .

If { i , j } , { k , l } have one common element, say i = k , i l , then

( i j ) ( k l ) = ( i j ) ( i l ) = ( j i ) ( i l ) = ( j i l )

is a 3-cycle.

If { i , j } = { k , l } , then ( i j ) ( k l ) = ( i j ) 2 = ( ) = e is the empty product.

Conclusion: A n is generated by 3-cycles. □

User profile picture
2022-07-19 00:00
Comments