Homepage › Solution manuals › David S. Dummit › Abstract Algebra › Exercise 2.5.11 (Quasi Dihedral Group $QD_{16}$)
Exercise 2.5.11 (Quasi Dihedral Group $QD_{16}$)
Consider the group of order with the following presentation:
(called the quasidihedral or semidihedral group of order ). This group has three subgroups of order : , and and every proper subgroup is contained in one of these three subgroups. Fill in the missing subgroups in the lattice of all subgroups of the quasidihedral group on the following page, exhibiting each subgroup with at most two generators. (This is another example of a nonplanar lattice.)
Answers
Proof. We can complete the lattice without any other knowledge about than the data given in the statement, i.e.,
and every proper subgroup is contained in one of the subgroups , which we assume in the first part.
For this purpose, we use the three sublattices of these subgroups of order . Later, in the second part, we will study the group , and prove (1). (From a logical point of view, part (2°) precedes part (1°).)
Note: Since
we obtain
It is preferable to consider the subgroup which is in the lattice, rather than which is in the statement.
- (1°)
-
We assume (1) in this first part.
- (a)
-
Lattice of the subgroups of
.
Note first that the relations defining imply , thus .
We name two generators of . Since and , by van Dyck’s Theorem (see the note in Ex. 2.4.7) there is a surjective homomorphism such that and . Moreover, by (1), , therefore is an isomorphism. Hence it it sufficient to replace by and by in the lattice of subgroups of to obtain the corresponding lattice of the subgroups of (cf. Example 4, slightly modified).
This gives the left unknown subgroups of the lattice: , , and .
- (b)
-
Lattice of the subgroups of
.
Since and (by (1)), we obtain . Starting from the lattice of given in Example 1, we obtain the lattice of subgroups of , by the isomorphism which maps on .
This gives the unknown subgroup .
- (c)
-
Lattice of the subgroups of
.
We recall the presentation of given by
(cf. Ex. 6.3.7, or Ex. 1.5.3).
Consider the elements , (and ). Then, using the relations of the presentation of ,
Since and , using anew the van Dyck’s Theorem, there is a surjective homomorphism such that . Since , is an isomorphism. Using , we obtain the sublattice of the subgroups of (cf. Example 5).
This gives the two remaining unknown subgroups: and .
Since , by Lagrange’s Theorem, these three subgroups are maximal. Putting all sublattices together, we obtain the complete lattice of subgroups of .
- (2°)
-
Now we explain why
(this is not obvious: it may happen some collapsing, as in Ex. 1.2.18) and
.
- (a)
-
By definition of
,
By the relations (2), every element of is of the form , so has at most elements. We search how to multiply two such elements.
We show by induction that . This is true for . If we assume that for some integer , then
The induction is done, which shows that for every ,
Then , so (3) remains true for all .
Moreover, multiplying (3) by both left and right, we obtain
If , then
and if , then
In both cases, we obtain for all integers ,
Consider now the group with the law
(This makes sense because in ).
Those who know semi-direct products (see Chapter 5) recognize the group , where
is a homomorphism, which maps on and on , because and in .
(The others may verify the axioms of groups for the law (4), and in particular the associativity.)
Put and and . Then , and using (4)
Since and , there exists by van Dyck’s Theorem a homomorphim such that . Therefore , where , so , and is an isomorphism. In conclusion
and in particular .
- (b)
-
By part (a),
(because , where ),
and the elements are distinct.
- Since , , so we obtain .
-
Now
thus .
Since and , by van Dyck’s Theorem, there is a surjective homomorphism such that and . Therefore , so
-
Finally
thus
Put , . Since and , by van Dyck’s Theorem, there is a surjective homomorphism such that . Therefore , so
This shows (1), and (1) being assumed, we have proved in the first part that the three maximal groups satisfy
- (c)
-
Finally, we prove that every proper subgroup of
is contained in one of the subgroups , where
We compute first the center of . Let , . Then if and only if for all integers , , that is (see equality (5) and above). Therefore
If , then for all . For and , this gives , thus , where , therefore or .
In both cases, since is always even, for all integers . In particular, for , , where , thus . This gives .
Conversely, , and since , and , where are generators of , this shows that . Hence
Since , every cyclic subgroup satisfies or or , where are subgroups, so , or or .
Now let be any proper subgroup of . Then has order or .
- If , then is cyclic, so or or by the preceding argument.
-
We suppose now that , i.e., or .
We prove first that , so that .
If , since , we know that don’t belong to . Put . Then
Since , the map defined by is bijective. Therefore . This is impossible, because , so has at most elements. This contradiction shows that , and since
is a normal subgroup of , so there is a surjective homomorphism . Moreover, the classes and are generators of which satisfy
Since , there is a surjective homomorphism such that and . Moreover, , therefore is an isomorphism, so
By Theorem 20 (The Fourth or Lattice Isomorphism Theorem), there is a bijection from the set of subgroups which contain onto the set of subgroups of . There are exactly proper subgroups of (see Example 4), therefore there are exactly proper subgroups of which contain . We know already such subgroups (see the lattices of subgroups of in the first part), i.e.,
and all are subgroups of , or (Note that the lattice of the subgroups of and the lattice of intermediate groups between and are isomorphic.)
In conclusion, every subgroup of of order or contains and is contained in , or . There are no other subgroups besides those of the lattice of part (a), which is complete.