Exercise 13.4.9

Prove that two permutations in S n are conjugate if and only if they have the same cycle type.

Proof.

Let σ S n have cycle type ( k 1 , k 2 , . . . , k l ) . Then σ can be expressed uniquely as the product of disjoint cycles σ = α 1 α 2 α l , where α i is a k i -cycle. Let τ S n such that ρ = τσ τ 1 . Then:

τσ τ 1 = τ α 1 α 2 α l τ 1 = τ α 1 τ 1 τ α 2 τ 1 τ α l τ 1 = α τ ( 1 ) α τ ( 2 ) α τ ( l ) Since α i and α j are disjoint for i , j { 1 , 2 , . . . , l } , then τ α i τ 1 and τ α j τ 1 are also disjoint. Indeed, being disjoint means no number is moved by both α i and α j , i.e., there is no k such that α i ( k ) k and α j ( k ) k . If τ α i τ 1 and τ α j τ 1 are not disjoint, then they both move some number l . Then τ α i τ 1 ( l ) l and τ α j τ 1 ( l ) l , hence α i τ 1 ( l ) τ 1 ( l ) and α j τ 1 ( l ) τ 1 ( l ) , which means that τ 1 ( l ) is moved by both α i and α j . This is a contradiction. Therefore τσ τ 1 is the product of τ -conjugates of disjoint cycles for σ , and these τ -conjugates are disjoint cycles with the same respective lengths, i.e., τσ τ 1 has the same cycle type as σ . For the converse direction, suppose σ 1 and σ 2 have the same cycle type ( k 1 , k 2 , . . . , k l ) . Then σ 1 = ( a 1 a 2 . . . a k 1 ) ( a k 1 + 1 a k 1 + 2 . . . a k 1 + k 2 ) and σ 2 = ( b 1 b 2 . . . b k 1 ) ( b k 1 + 1 b k 1 + 2 . . . b k 1 + k 2 ) where the cycles are disjoint. Let define the permutation τ S n by τ ( a i ) = b i for all i . Then τ σ 1 τ 1 = σ 2 , i.e., σ 1 and σ 2 are τ -conjugate. □

Answers

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