11.6.1 Semidirect and Direct Products
If is a normal subgroup of , we have an exact sequence (Definition 3.5.1). This does not make isomorphic to , and need not even contain a subgroup isomorphic to : in , the group has no nonzero element of finite order, so no subgroup isomorphic to .
Suppose now that is a subgroup that contains exactly one element of each coset of . Then every can be written uniquely as with and , so is a bijection . It need not be a homomorphism, but since is normal, So the multiplication of is determined by , , and the action of on by conjugation. This leads to the following construction.
Definition 11.6.1 (Semidirect product). Let and be groups and a homomorphism, that is, an action of on by automorphisms. The semidirect product is the set with the multiplication
This is a group. The element is an identity, and is an inverse of on both sides. For associativity, using that is a homomorphism and , The map is a homomorphism onto with kernel , so is normal; is a subgroup isomorphic to ; and , so inside the action becomes conjugation. When is trivial ( for all ), the semidirect product is the direct product .
Proposition 11.6.2 (Recognizing semidirect products). Let with normal, and suppose every element of can be written uniquely as with and . Then , where .
Proof. Conjugation by maps the normal subgroup to itself, so is a homomorphism. The map , , is a bijection by hypothesis, and it is a homomorphism, since ∎
Lemma 11.6.3 (Unique factorization). Let with . Then the products with , are pairwise distinct. So if is finite and , every element of can be written uniquely as . The condition holds whenever and are coprime, because the order of divides both.
Proof. If , then , so and . If , the distinct products fill . ∎
Corollary 11.6.4 (Direct product criterion). Let be a finite group with normal subgroups and such that and . Then .
Proof. By Lemma 11.6.3 and Proposition 11.6.2, with . For and , the element lies in (as ) and in (as ), so it is , and . So is trivial and . ∎
Example 11.6.5 (Dihedral groups as semidirect products). In , take with , and with . Then is normal, and , so , where the generator of acts by , that is, by inversion. In the same way , with the subgroup of rotations and for a reflection , since . For these groups are not abelian, so they are not direct products of the abelian groups and .
11.6.2 Groups of Order 15 and 21
Example 11.6.6 (Groups of order 15). Let . By Sylow’s third theorem, and , so ; and and , so . So the Sylow 3-subgroup and the Sylow 5-subgroup are normal. Their orders are coprime and , so by Corollary 11.6.4, and because has order 15. Every group of order 15 is cyclic.
Example 11.6.7 (Groups of order 21). Let . Sylow gives and , so , and the Sylow 7-subgroup is normal. Also and , so . Let be a Sylow 3-subgroup.
If , then is normal too, and as for order 15.
If , then by Lemma 11.6.3 and Proposition 11.6.2, where is conjugation by on . An automorphism of sends to another generator, so for some . Since , , so , and . If , then and commute, is abelian, and every subgroup is normal, contradicting . If , replace the generator of by : then . So we may take , and where every element is uniquely (, ) and these relations determine all products. Conversely, the semidirect product , in which acts on by multiplication by 2 (an automorphism of order 3, since ), is a non-abelian group of order 21. So there are exactly two groups of order 21 up to isomorphism: and .
11.6.3 Groups of Order 12
Proposition 11.6.8 (Groups of order 12). Up to isomorphism there are exactly five groups of order 12: where in the last group the generator of acts on by inversion.
Proof. Let . By Sylow’s theorems, the number of Sylow 2-subgroups (of order 4) divides 3 and is odd, so ; and the number of Sylow 3-subgroups (of order 3) divides 4 and is , so . Let be a Sylow 2-subgroup and a Sylow 3-subgroup. By Corollary 11.2.5, or . Since and are coprime and , every element of is uniquely a product with , (Lemma 11.6.3).
At least one of , is normal. Suppose , with Sylow 3-subgroups . For , is a proper subgroup of a group of prime order, so , and the contain elements of order 3. A Sylow 2-subgroup contains no element of order 3, so it lies in the set of the remaining elements, and therefore equals it. Hence .
Both normal. Then by Corollary 11.6.4. With this is , and with it is .
not normal (). Let act by conjugation on the set of Sylow 3-subgroups, giving a homomorphism . By Proposition 11.5.7, , so . Let generate . Then fixes , and fixes no with , since would put in . As , is a 3-cycle fixing , and is the other 3-cycle fixing . So the image of contains all eight 3-cycles, hence contains by Lemma 11.4.8. Since , is injective with image , and .
normal, not normal (, ). Write . By Proposition 11.6.2, , where is conjugation. The group , where , has order 2, and is nontrivial: otherwise would commute with , and would be abelian, so would be normal.
- If , then , so , and with the generator of acting by inversion.
- If , then has order 2; let generate it and let . Then and Every element of is uniquely (; ), and these relations determine all products. In , the symmetry group of the regular hexagon with rotation by and a reflection , the elements , and satisfy the same relations ( commutes with as both are rotations, and ), and they generate , since . So .
These five groups are pairwise non-isomorphic. The first two are abelian, and only has an element of order 12. Among the non-abelian ones, has an element of order 4 while and do not, and has an element of order 6 while does not. Finally all five exist: the semidirect product is defined for any homomorphism , and it is non-abelian when the generator acts by inversion. ∎
Note. The group is also isomorphic to . In , the subgroup of order 6 is isomorphic to and normal (it has index 2), the subgroup is normal because commutes with every element, the two meet only in , and ; so Corollary 11.6.4 applies. Likewise , with permuting the three non-identity elements of cyclically by conjugation.
Exercise 11.6.9 (Group actions, conjugacy, and the Sylow theorems).
- Let be a group of order , where are primes and . Prove that is cyclic.
- Compute the class equation of . Use it to determine all normal subgroups of .
- Use Burnside’s lemma to count the necklaces made from 6 beads in 2 colors, where two necklaces are the same if one can be rotated to obtain the other.
- Let be a finite group acting on a finite set , and let be the number of orbits. Prove that .
- Compute the class equation of , and use it to prove that is simple.
Show solution
(1) The number of Sylow -subgroups divides and is ; since , . The number divides and is , so ; and is impossible, since . So , and the Sylow subgroups and are both normal. Their orders are coprime with product , so by Corollary 11.6.4, and this group is cyclic, generated by , which has order .
(2) The conjugacy classes of correspond to the partitions of 5. Counting each cycle type: the identity (1); transpositions, ; products of two disjoint transpositions, (choose the fixed point, then pair up the other four); 3-cycles, ; products of a 3-cycle and a disjoint transposition, ; 4-cycles, ; 5-cycles, . The class equation is A normal subgroup is a union of classes containing whose size divides 120. The proper divisors of 120 are at most 60, and the only sums with a sum of distinct terms of that are divisors of 120 other than 1 and 120 are where in the second the 20 can be either the 3-cycles or the products of a 3-cycle and a transposition. Each of these three unions contains the 5-cycle and the element , and composing from right to left, a 3-cycle. So the union of size 40 and the union of size 60 that uses the products of a 3-cycle and a transposition are not closed under multiplication. The remaining union, of the identity, the products of two transpositions, the 3-cycles and the 5-cycles, is the set of even permutations, . So the normal subgroups of are , and , as Corollary 11.4.10 also shows.
(3) The rotation group is , acting on the set of 2-colorings of the 6 positions, . The rotation by positions permutes the positions in cycles, and a coloring is fixed if and only if it is constant on each cycle, so it has fixed points. For this gives . By Burnside’s lemma the number of necklaces is .
(4) This is the double count in the proof of Burnside’s lemma: and both count the pairs with , and the second sum is by Burnside’s lemma.
(5) The even cycle types in , counting fixed points as 1-cycles, and the sizes of their classes in are: the identity (1); two disjoint transpositions, ; 3-cycles, ; two disjoint 3-cycles, ; a 4-cycle and a disjoint transposition, ; 5-cycles, . These add up to . By Proposition 11.4.4, only the class of 5-cycles (cycle lengths ) splits in , into two classes of 72. The class equation of is A normal subgroup of has , with a nonzero sum of distinct terms of , and divides 360. Since , , and the divisors of 360 between 41 and 359 are ; so if , then . The number 44 is not such a sum, since no term equals 44 and any two terms add up to at least 80. The others are odd, so they would have to use the only odd term 45, leaving as sums of distinct terms of ; but the sums of one or two of these terms are , and sums of three or more are at least 152. So no such exists, , and is simple.