Exercise 14.2.3

One of the challenges of group theory is that the same group can have radically differnet descriptions. For instance, S 4 and the group G = ( S 3 S 2 ) A 6 appearing in Example 14.2.11 both have order 24 . In this exercise, you will prove that they are isomorphic. We will use the notation of Exercise 2.

(a)
There is a natural homomorphism G S 3 given by how elements of G permute the blocks R 1 , R 2 , R 3 . Show that this map is onto, and express the elements of the kernel as products of disjoints cycles.
(b)
Use the Sylow Theorems to show that G has one or four 3 -Sylow subgroups.
(c)
Show that A 6 has no element of order 6 .
(d)
Use part (c) and the kernel of the map G S 3 from part (a) to show that G has four 3 -Sylow subgroups.
(e)
G acts by conjugation on its four 3 -Sylow subgroups. Use this to prove that G S 4 .
(f)
Using Exercise 2, conclude that S 3 S 2 S 4 × S 2 .

We note without proof that S 3 S 2 S 4 × S 2 is also isomorphic to the full symmetry group (rotations and reflexions) of the octahedron.

Answers

Proof. (a) Let φ : G S 3 defined by τ = φ ( σ ) iff σ ( R i ) = R τ ( i ) . In other notations, this is the restriction to G of the homomorphism of part (b) of Lemma 14.2.8, thus φ is an homomorphism.

φ is surjective: Let τ be any permutation in S 3 .

If τ is even, τ = ( 1 2 3 ) k , k = 0 , 1 , 2 . Let

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

σ preserves the block structure defined by R 1 , R 2 , R 3 , and σ A 6 , so that σ G = ( S 3 S 2 ) A 6 . Moreover σ ( R 1 ) = R 2 , σ ( R 2 ) = R 3 , σ ( R 3 ) = R 1 , thus φ ( σ ) = ( 1 2 3 ) , and φ ( σ k ) = ( 1 2 3 ) k = τ .

If τ is odd, then τ { ( 1 2 ) , ( 2 3 ) , ( 1 3 ) } , and

( 1 2 ) = φ ( σ 1 ) , σ 1 = ( 1 2 3 4 5 6 3 4 1 2 5 6 ) = ( 1 3 ) ( 2 4 ) G , ( 2 3 ) = φ ( σ 2 ) , σ 2 = ( 1 2 3 4 5 6 1 2 5 6 3 4 ) = ( 3 5 ) ( 4 6 ) G , ( 1 3 ) = φ ( σ 3 ) , σ 3 = ( 1 2 3 4 5 6 5 6 3 4 1 2 ) = ( 1 5 ) ( 2 6 ) G .

Therefore φ is surjective.

Let σ S 6 . Then σ ker φ iff σ A 6 and σ ( R 1 ) = R 1 , σ ( R 2 ) = R 2 , σ ( R 3 ) = R 3 .

Morerover, for all σ A 6 ,

σ ( R 1 ) = R 1 , σ ( R 2 ) = R 2 , σ ( R 3 ) = R 3 { σ ( 1 ) , σ ( 2 ) } = { 1 , 2 } , { σ ( 3 ) , σ ( 4 ) } = { 3 , 4 } , { σ ( 5 ) , σ ( 6 ) } = { 5 , 6 } σ { e , ( 1 2 ) ( 3 4 ) , ( 1 2 ) ( 5 6 ) , ( 3 4 ) ( 5 6 ) } .

ker φ = { e , ( 1 2 ) ( 3 4 ) , ( 1 2 ) ( 5 6 ) , ( 3 4 ) ( 5 6 ) } .

Verification: 6 = | S 3 | = | G ker ( φ ) | = 24 4 . (b) Let N be the number of 3 -Sylow subgroups of G . By the third Sylow Theorem,

N 24 = | G | , N 1 ( mod 3 ) .

Therefore N = 1 or N = 4 . (c) Let τ S 6 be a permutation of order 6. If τ = τ 1 τ k is the decomposition of τ in disjoint cycles, then the order of τ is the lcm of the order of τ 1 , , τ k . Therefore τ is a 6 -cycle or a product of a 2 -cycle by a 3 -cycle. In both cases τ is odd. Therefore A 6 has no element of order 6 . (d) Reasoning by contradiction, suppose that G has only one 3 -Sylow subgroup H . Then, for all g G , gH g 1 is a 3 -Sylow, thus gH g 1 = H , and H is a normal subgroup of G .

Moreover K = ker φ = { e , ( 1 2 ) ( 3 4 ) , ( 1 2 ) ( 5 6 ) , ( 3 4 ) ( 5 6 ) } is normal in G , and has order 4. Therefore H K = { e } .

The usual characterization of direct products (see Ex. 14.3.7) shows that, for all h H , all k K , hk = kh , and HK is a normal subgroup of G isomorphic to H × K .

Take h an element of order 3 in H , and k and element of order 2 in K . Since kh = hk , the order of hk A 6 is 6, which is impossible by part (c).

Therefore G has exactly four 3 -Sylow subgroups. (e) Write X = { H 1 , H 2 , H 3 , H 4 } the set of 3 -Sylow subgroups of G , and S ( X ) the set of permutations of X . Then S ( X ) S 4 , and g H = gH g 1 defines a left action of G on X , so that

ψ { G S ( X ) g σ = ( H 1 H 2 H 3 H 4 g H 1 g 1 g H 2 g 1 g H 3 g 1 g H 4 g 1 )

is a group homomorphism.

It is not obvious that ψ is bijective. We prove first that ψ is surjective (onto). We give explicitly the 3 -Sylow subgroups. Let

λ 1 = ( 1 2 3 4 5 6 3 4 5 6 1 2 ) = ( 1 3 5 ) ( 2 4 6 ) , λ 2 = ( 1 2 3 4 5 6 3 4 6 5 2 1 ) = ( 1 3 6 ) ( 4 5 2 ) , λ 3 = ( 1 2 3 4 5 6 6 5 2 1 3 4 ) = ( 1 6 4 ) ( 5 3 2 ) , λ 4 = ( 1 2 3 4 5 6 4 3 6 5 1 2 ) = ( 1 4 5 ) ( 3 6 2 ) .

4 Then λ 1 , , λ 4 G have order 3 , and H 1 = λ 1 = { e , λ 1 , λ 1 2 } , , H 4 = λ 4 = { e , λ 4 , λ 4 2 } are distinct, thus they are the four 3 -Sylow of G .

Now take

g = ( 1 2 3 4 5 6 4 3 2 1 5 6 ) = ( 1 4 ) ( 2 3 ) h = ( 1 2 3 4 5 6 2 1 5 6 4 3 ) = ( 1 2 ) ( 3 5 4 6 )

(We give a geometrical explanation of this choice in the final note.)

Then

g λ 1 g 1 = ( 1 4 ) ( 2 3 ) ( 1 3 5 ) ( 2 4 6 ) ( 1 4 ) ( 2 3 ) = ( 1 2 3 4 5 6 6 5 1 2 4 3 ) = ( 1 6 3 ) ( 2 5 4 ) = λ 2 2 ,

thus g H 1 g 1 = H 2 , and since g = g 1 , g H 2 g 1 = H 1 . Moreover

g λ 3 g 1 = ( 1 4 ) ( 2 3 ) ( 1 6 4 ) ( 5 3 2 ) ( 1 4 ) ( 2 3 ) = ( 1 2 3 4 5 6 4 3 5 6 2 1 ) = ( 1 4 6 ) ( 2 3 5 ) = λ 3 2 ,

thus g H 3 g 1 = H 3 , and since ψ ( g ) is a permutation, g H 4 g 1 = H 4 .

Therefore ψ ( g ) S ( X ) is the permutation ( H 1 H 2 H 3 H 4 H 2 H 1 H 3 H 4 ) , which corresponds to the transposition ( 1 2 ) S 4 . Similarly,

h λ 1 h 1 = ( 1 2 ) ( 3 5 4 6 ) ( 1 3 5 ) ( 2 4 6 ) ( 3 6 4 5 ) ( 1 2 ) = ( 1 2 3 4 5 6 6 5 1 2 4 3 ) = ( 1 6 3 ) ( 2 5 4 ) = λ 2 2 , h λ 2 h 1 = ( 1 2 ) ( 3 5 4 6 ) ( 1 3 6 ) ( 4 5 2 ) ( 3 6 4 5 ) ( 1 2 ) = ( 1 2 3 4 5 6 6 5 2 1 3 4 ) = ( 1 6 4 ) ( 2 5 3 ) = λ 3 , h λ 3 h 1 = ( 1 2 ) ( 3 5 4 6 ) ( 1 6 4 ) ( 5 3 2 ) ( 3 6 4 5 ) ( 1 2 ) = ( 1 2 3 4 5 6 4 3 6 5 1 2 ) = ( 1 4 5 ) ( 2 3 6 ) = λ 4 ,

thus h H 1 h 1 = H 2 , h H 2 h 1 = H 3 , h H 1 h 1 = H 4 , and since ψ ( g ) is a permutation, h H 4 h 1 = H 1 . Therefore ψ ( g ) = ( H 1 H 2 H 3 H 4 H 2 H 3 H 4 H 1 ) corresponds to the 4 -cycle ( 1 2 3 4 ) .

Since { ( 1 2 ) , ( 1 2 3 4 ) } is a set of generators of S 4 , S ( X ) is generated by ψ ( g ) , ψ ( h ) , so that S ( X ) = ψ ( G ) , and ψ is surjective. Moreover, | G | = | S ( X ) | = 24 , thus ψ is a bijection, and a group isomorphism:

G S ( X ) S 4 .

(f) To conclude, using Exercise 2, we obtain

S 3 S 2 ( ( S 3 S 2 ) A 6 ) × S 2 = G × S 2 S 4 × S 2 .

Note: We have proved in Exercise 7.5.10 that the symmetry group G 0 of the cube (or octahedron), is isomorphic to S 4 . By composition with the indirect isometry σ : v v , which commutes with all elements in the group, we obtain the full symmetry group, isomorphic to S 4 × S 2 .

We have a geometrical description of G = ( S 3 S 2 ) A 6 by regrouping the opposite faces of a cube in blocs: stick 1 on a face of a dice, 2 on the opposite face, and so on (I stuck labels on my Rubik’s cube). Then the 24 rotations of the cube send opposite faces on opposite faces, so that the bloc structure { { 1 , 2 } , { 3 , 4 } , { 5 , 6 } } is preserved by rotations.

We have proved in Exercise 7.5.10 that G 0 acts on the 4 long diagonals D 1 , D 2 , D 3 , D 4 of the cube, so that G 0 S 4 . Each of the four 3 -Sylow of G 0 is generated by the rotation with angle 2 π 3 around such a long diagonal. They correspond to the 3 -Sylow H 1 , , H 4 of G : this was useful for the above description of the H i . Each 3 -Sylow corresponds to a long diagonal, so that g H i g 1 = H j is equivalent to σ ( D i ) = D j , where σ corresponds to g . It remains to find a rotation which acts on these diagonals as some given permutation in S 4 , such that ( 1 2 ) or ( 1 2 3 4 ) . The corresponding permutations g , h G are given in the text. □

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