Exercise 14.2.2

The wreath product S 3 S 2 S 6 can be thought of as the subgroup of all permutations that preserve the blocs R 1 = { 1 , 2 } , R 2 = { 3 , 4 } , R 3 = { 5 , 6 } . As noted in Example 14.2.11, S 3 S 2 has order 6 3 3 = 48 .

(a)
Show that ( S 3 S 2 ) A 6 has order 24 .
(b)
Show that S 3 S 2 is the centralizer of ( 1 2 ) ( 3 4 ) ( 5 6 ) in S 6 (meaning that S 3 S 2 consists of all permutations in S 6 that commute with ( 1 2 ) ( 3 4 ) ( 5 6 ) ).
(c)
Use part (b) to show that S 3 S 2 is isomorphic to ( ( S 3 S 2 ) A 6 ) × S 2 .

See the next exercise for more on S 3 S 2 and ( S 3 S 2 ) A 6 .

Answers

Proof. (a) Let φ the restriction of the sign sgn to ( S 3 S 2 ) A 6 :

φ { S 3 S 2 { 1 , 1 } σ sgn ( σ )

Since sgn is a morphism, its restriction φ is also a morphism, and φ is surjective (onto), because φ ( e ) = 1 , and φ ( ( 1 2 ) ) = 1 , where ( 1 2 ) S 3 S 2 . Moreover the kernel of φ is ker ( φ ) = ( S 3 S 2 ) A 6 .

Therefore im ( φ ) = { 1 , 1 } ( S 3 S 2 ) ( ( S 3 S 2 ) A 6 ) . This shows that

| ( S 3 S 2 ) A 6 | = 1 2 | S 3 S 2 | = 24 .

(b) Let τ S n . Then τ is in the centralizer of σ = ( 1 2 ) ( 3 4 ) ( 5 6 ) if and only if

τ ( 1 2 ) ( 3 4 ) ( 5 6 ) τ 1 = ( 1 2 ) ( 3 4 ) ( 5 6 ) ,

which is equivalent to

( τ ( 1 ) τ ( 2 ) ) ( τ ( 3 ) τ ( 4 ) ) ( τ ( 5 ) τ ( 6 ) ) = ( 1 2 ) ( 3 4 ) ( 5 6 ) .

Write R 1 = { 1 , 2 } , R 2 = { 3 , 4 } , R 3 = { 4 , 5 } . Then R 1 , R 2 , R 3 are the three orbits of σ acting on { 1 , , 6 } , the supports of the decomposition of σ in disjoint cycles.

Since τ is a bijection, the 6 values τ ( 1 ) , τ ( 2 ) , τ ( 3 ) , τ ( 4 ) , τ ( 5 ) , τ ( 6 ) are distinct, so ( τ ( 1 ) τ ( 2 ) ) , ( τ ( 3 ) τ ( 4 ) ) , ( τ ( 5 ) τ ( 6 ) ) are disjoint 2 -cycles.

If τ is the centralizer of σ , the equality ( τ ( 1 ) τ ( 2 ) ) ( τ ( 3 ) τ ( 4 ) ) ( τ ( 5 ) τ ( 6 ) ) = ( 1 2 ) ( 3 4 ) ( 5 6 ) shows that τ ( R 1 ) , τ ( R 2 ) , τ ( R 3 ) are also the three orbits of σ , so that

{ { 1 , 2 } , { 3 , 4 } , { 5 , 6 } } = { { τ ( 1 ) , τ ( 2 ) } , { τ ( 3 ) , τ ( 4 ) } , { τ ( 5 ) , τ ( 6 ) } } ,

that is

{ R 1 , R 2 , R 3 } = { τ ( R 1 ) , τ ( R 2 ) , τ ( R 3 ) } ,

which means that there is some permutation τ of { 1 , 2 , 3 } such that τ ( R i ) = R τ ( i ) , i = 1 , 2 , 3 . In other words, σ preserves the blocks R 1 , R 2 , R 3 , so that σ S 3 S 2 .

To prove the converse, it is more convenient to use the other usual representation of S 3 S 2 . Then σ = ( e ; μ , μ , μ ) , where μ = ( 1 2 ) S 2 . Let τ = ( λ ; μ 1 , μ 2 , μ 3 ) be any element of S 3 S 2 (then μ i = ( ) or μ i = μ ) . Then (14.7) gives

τσ = ( λ ; μ 1 , μ 2 , μ 3 ) ( e ; μ , μ , μ ) = ( λ ; μ 1 μ , μ 2 μ , μ 3 μ ) στ = ( e ; μ , μ ; μ ) ( λ , μ 2 , μ 2 , μ 3 ) = ( λ ; μ μ 1 , μ μ 2 , μ μ 3 )

Since S 2 = { e , μ } is commutative, μ μ i = μ i μ , i = 1 , 2 , 3 , thus τσ = στ .

The centralizer of ( 1 2 ) ( 3 4 ) ( 5 6 ) in S n is S 3 S 2 . (c) Since the order of σ = ( 1 2 ) ( 3 4 ) ( 5 6 ) is 2 , σ = { e , σ } S 2 and we can write σ 𝜀  , 𝜀 { 0 , 1 } the two elements of σ . Let

φ { ( S 3 S 2 ) A 6 × σ S 3 S 2 ( τ , σ 𝜀 ) τ σ 𝜀 .

φ is a morphism: For all τ , τ ( S 3 S 2 ) A 6 and σ 𝜀 , σ 𝜀 σ , σ τ = τ σ by part (b), thus

φ ( τ σ 𝜀 ) φ ( τ σ 𝜀 ) = τ σ 𝜀 τ σ 𝜀 = τ τ σ 𝜀 σ 𝜀 = φ ( ( τ , σ 𝜀 ) ( τ , σ 𝜀 ) )

ker φ is trivial: if φ ( τ , σ 𝜀 ) = e , then τ σ 𝜀 = e , so that τ = σ 𝜀 { e , σ } . τ = σ is impossible, since τ is an even permutation, and σ is odd. Therefore τ = e , and σ 𝜀 = e . Thus φ is injective (one to one).

Since | ( ( S 3 S 2 ) A 6 ) × σ | = | S 3 S 2 | , φ is a bijection, thus φ is a group isomorphism.

S 3 S 2 ( ( S 3 S 2 ) A 6 ) × σ ( ( S 3 S 2 ) A 6 ) × S 2 .

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