Homepage › Solution manuals › David A. Cox › Galois Theory › Exercise 14.2.3
Exercise 14.2.3
One of the challenges of group theory is that the same group can have radically differnet descriptions. For instance, and the group appearing in Example 14.2.11 both have order . In this exercise, you will prove that they are isomorphic. We will use the notation of Exercise 2.
- (a)
- There is a natural homomorphism given by how elements of permute the blocks . 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 has one or four -Sylow subgroups.
- (c)
- Show that has no element of order .
- (d)
- Use part (c) and the kernel of the map from part (a) to show that has four -Sylow subgroups.
- (e)
- acts by conjugation on its four -Sylow subgroups. Use this to prove that .
- (f)
-
Using Exercise 2, conclude that
.
We note without proof that is also isomorphic to the full symmetry group (rotations and reflexions) of the octahedron.
Answers
Proof. (a) Let defined by iff . In other notations, this is the restriction to of the homomorphism of part (b) of Lemma 14.2.8, thus is an homomorphism.
is surjective: Let be any permutation in .
If is even, . Let
preserves the block structure defined by , and , so that . Moreover , thus , and .
If is odd, then , and
Therefore is surjective.
Let . Then iff and .
Morerover, for all ,
Verification: . (b) Let be the number of -Sylow subgroups of . By the third Sylow Theorem,
Therefore or . (c) Let be a permutation of order 6. If is the decomposition of in disjoint cycles, then the order of is the lcm of the order of . Therefore is a -cycle or a product of a -cycle by a -cycle. In both cases is odd. Therefore has no element of order . (d) Reasoning by contradiction, suppose that has only one -Sylow subgroup . Then, for all , is a -Sylow, thus , and is a normal subgroup of .
Moreover is normal in , and has order 4. Therefore .
The usual characterization of direct products (see Ex. 14.3.7) shows that, for all , all , , and is a normal subgroup of isomorphic to .
Take an element of order in and and element of order 2 in . Since , the order of is 6, which is impossible by part (c).
Therefore has exactly four -Sylow subgroups. (e) Write the set of -Sylow subgroups of , and the set of permutations of . Then , and defines a left action of on , so that
is a group homomorphism.
It is not obvious that is bijective. We prove first that is surjective (onto). We give explicitly the -Sylow subgroups. Let
4 Then have order , and are distinct, thus they are the four -Sylow of .
Now take
(We give a geometrical explanation of this choice in the final note.)
Then
thus , and since , . Moreover
thus , and since is a permutation, .
Therefore is the permutation , which corresponds to the transposition . Similarly,
thus , and since is a permutation, . Therefore corresponds to the -cycle .
Since is a set of generators of , is generated by , so that , and is surjective. Moreover, , thus is a bijection, and a group isomorphism:
(f) To conclude, using Exercise 2, we obtain
Note: We have proved in Exercise 7.5.10 that the symmetry group of the cube (or octahedron), is isomorphic to . By composition with the indirect isometry , which commutes with all elements in the group, we obtain the full symmetry group, isomorphic to .
We have a geometrical description of by regrouping the opposite faces of a cube in blocs: stick on a face of a dice, on the opposite face, and so on (I stuck labels on my Rubik’s cube). Then the rotations of the cube send opposite faces on opposite faces, so that the bloc structure is preserved by rotations.
We have proved in Exercise 7.5.10 that acts on the 4 long diagonals of the cube, so that . Each of the four -Sylow of is generated by the rotation with angle around such a long diagonal. They correspond to the -Sylow of : this was useful for the above description of the . Each -Sylow corresponds to a long diagonal, so that is equivalent to , where corresponds to . It remains to find a rotation which acts on these diagonals as some given permutation in , such that or . The corresponding permutations are given in the text. □