Homepage Solution manuals David S. Dummit Abstract Algebra Exercise 1.3.3 (Orders of some permutations)

Exercise 1.3.3 (Orders of some permutations)

For each of the permutations whose cycle decompositions were computed in the preceding two exercises compute its order.

Answers

Proof. Consider the first example σ = ( 1 3 5 ) ( 24 ) . Since the cycles are disjoints, for all k ,

σ k = e ( 1 3 5 ) k = ( 2 4 ) k = e ( k 3  and  k 2 ) k 6 ,

so | σ | = 6 . More generally, the order of a permutation is the l.c.m. of the lengths of the cycles in its cycle decomposition(see Ex.15). These gives the following results.

Ex.1
cycles order σ ( 1 3 5 ) ( 24 ) 6 τ ( 1 5 ) ( 2 3 ) 2 σ 2 ( 1 5 3 ) 3 στ ( 2 5 3 4 ) 4 τσ ( 1 2 4 3 ) 4 τ 2 σ ( 1 3 5 ) ( 24 ) 6

Ex.2
cycles order σ ( 1 13 5 10 ) ( 3 15 8 ) ( 4 14 11 7 12 9 ) 12 τ ( 1 14 ) ( 2 9 15 13 4 ) ( 3 10 ) ( 5 12 7 ) ( 8 11 ) 30 σ 2 ( 1 5 ) ( 13 10 ) ( 3 8 15 ) ( 4 11 12 ) ( 7 9 14 ) 6 στ ( 1 11 3 ) ( 2 4 ) ( 5 9 8 7 10 15 ) ( 13 14 ) ) 6 τσ ( 1 4 ) ( 2 9 ) ( 3 13 12 15 11 5 ) ( 8 10 14 ) 6 τ 2 σ ( 1 2 15 8 3 4 14 11 12 13 7 5 10 ) 13

User profile picture
2025-09-12 09:40
Comments