Motivation
An abstract theorem is easier to use once we can see where each hypothesis enters. The symmetries of a regular polygon provide a small noncommutative group in which cosets, subgroup intersections, conjugation and quotients can all be calculated.
Definitions
Definition 1.5.1
(The dihedral group and its normal forms)
Let , and let be the symmetry group of a regular -gon. Let rotate it through and let be a reflection. We compose maps from right to left. There are exactly symmetries: each is uniquely or , with . Their relations are
For uniqueness, a symmetry is determined by the image of one vertex and which of its two neighbors is the image of a chosen adjacent vertex. The displayed maps give all these choices. The relation follows by induction and also holds for negative .
Calculating with the normal forms
The expressions and record both the type of a symmetry and its exponent. The exponent is taken modulo ; the two types are never identified. From we obtain all four multiplication rules:
For example, the last equality follows by moving the middle to the left: . In particular every reflection squares to . The order of a product still matters: reversing the two reflections replaces by its inverse .
Common mistake
(Reflection exponents do not add)
It is tempting to simplify to , as though commuted with . The conjugation relation forbids moving past without inverting it. In , for example, , whereas the incorrect rule would give . The correct exponent is always .
These rules also explain why the rotation subgroup is useful in the classification. Multiplication keeps track of whether the number of reflection factors is even or odd. Thus the map sending rotations to and reflections to is a homomorphism to , with kernel . Its kernel separates the two types before we ask which rotations a smaller subgroup contains.
Classifying subgroups
Theorem 1.5.2
(Every subgroup of a dihedral group)
Every subgroup has exactly one of the forms
where is a positive divisor of and, in the second form, . Their respective orders are and .
Proof sketch or proof idea
Proof
(Rotations first, then one reflection coset)
Put . Every subgroup of the cyclic group is for a unique positive divisor of ; gives the trivial subgroup. If has no reflection then , giving the first form.
Otherwise choose . The product of two reflections is a rotation, so any reflection differs from by an element of : indeed . Conversely for every integer . Thus
The two pieces are disjoint and have elements each. Replacing by its remainder modulo gives . The intersection with recovers , and the reflection coset recovers modulo , so this description is unique. Conversely the displayed union is a subgroup: the product of two of its reflections is in , and multiplying a reflection by a rotation from that subgroup stays in the reflection coset. This proves both existence and completeness.
Proof X-ray
Why one reflection determines all the others
The proof uses one known classification and one new move. The known input is the list of subgroups of the cyclic group ; it supplies through , even before we know anything about reflections in . The new move is the identity : once a single reflection lies in , every other reflection of is times a rotation of , so the reflections of form exactly one coset of . This is why whenever contains a reflection. Uniqueness needs the two invariants to be read back from : the rotation part gives , and the reflection coset gives only modulo , because lies in the same coset. Listing a few generators is therefore not a classification; the intersection with rotations is what proves that no other subgroup can occur.
Worked examples
Worked example 1.5.3
(The subgroups of )
Take . Applying the theorem for yields precisely ten subgroups:
| Order | Subgroups |
|---|---|
| 1 | |
| 2 | , and for |
| 4 | , , |
| 8 |
For instance , a Klein four group. It is not cyclic: each of its three nonidentity elements has square . The other mixed subgroup of order four is also Klein four. In contrast, has an element of order four. Groups of equal order need not be isomorphic.
The trivial subgroup, the whole group and are normal: commutes with both generators . Each order-four subgroup has index two and is normal. None of the four reflection subgroups is normal, since
and in . Thus conjugation takes the nonidentity element outside its reflection subgroup. Normality is a statement about every conjugate, not just about subgroup order.
A quotient calculation and a warning
The quotient has four elements. The images are distinct nonidentity elements of order two, and . Hence the quotient is the Klein four group. By contrast, has order two and is cyclic.
The order-two subgroup works because it is normal. A reflection subgroup of the same order behaves quite differently.
Counterexample mode
Cosets of a non-normal subgroup do not multiply
Claim: for any subgroup , the rule defines a group structure on the left cosets. Take in , and multiply the coset by the coset . The representatives and both name the coset , since . With representative the rule gives . With representative it gives . These cosets are different: lies in the first and not in the second. So the proposed product depends on the representative, and no quotient group is defined. The repaired statement requires to be normal, which is not, since .
Counting and a second complete classification
The theorem counts subgroups as well as describing them. Write for the number of positive divisors of and . There is one rotation subgroup for each divisor , and exactly distinct subgroups containing reflections for that same . Hence the total is
The extra matters: counts only the subgroups containing reflections, not all subgroups. For , the answer is , as in the table above.
Worked example 1.5.4
(The subgroups of )
Now take , so . Write . The complete list is:
- Rotation subgroups: , of respective orders .
- Reflection-containing subgroups: of order ; of order ; of order ; and for , each of order .
Thus there are subgroups. The ranges of are essential: for example , since already belongs to ; counting both would duplicate one subgroup.
Three index-two kernels
The three order-six subgroups of are normal because each has index two. Their quotient maps can be seen explicitly. For define
This is a homomorphism to : the relations and are respected, since and modulo two. With the kernel is . With it is ; with it is . Each map is onto, so the first isomorphism theorem gives quotient in all three cases.
Common mistakes
Common mistake
(Order alone does not decide normality)
An order-four subgroup need not be normal: contains , but lies outside it. Its index is three, and the index-two argument cannot be used. In fact and are both proper subgroups of , but the latter is normal because conjugation by inverts ; being a subgroup alone says nothing about normality.
The same caution applies to inclusion, treated below: one subgroup's order may divide another's without the first being contained in the second.
Normality beyond index two
Theorem 1.5.5
(Normal reflection-containing subgroups)
Let be a positive divisor of and . Then is normal in if and only if . Every rotation subgroup is normal.
Proof
(Conjugating the two generators)
Conjugation by fixes and sends to , so it sends to . Conjugation by sends to and to , hence sends to . The classification shows that two such subgroups with the same agree exactly when their reflection exponents agree modulo .
If is normal, the first conjugation gives , so . Conversely, if , then both and . Thus both generators preserve by conjugation; so does every element of the group. The rotation subgroup is also preserved by conjugation by both generators.
Because must also divide , odd permits only in the reflection-containing normal case, namely the whole group. Even permits and ; the latter gives the two index-two subgroups and .
Worked example 1.5.6
(Normal subgroups of and )
For , the divisors of are . Its normal subgroups are , , and the whole group; a reflection subgroup has and fails the test. For , the divisors of are . Its normal subgroups are the four rotation subgroups listed above, the whole group, and : seven in total. In particular fails because does not divide .
Finding a subgroup from two reflections
Suppose that we are given and , rather than the divisor appearing in the classification. Their product supplies the rotation . Conversely , so
Here the greatest common divisor is positive, and . To justify the second equality, write by Bézout's identity. Then because , while gives the opposite inclusion between the cyclic subgroups. Reducing modulo now puts the answer into its unique classified form. The generated group has order .
This calculation handles identical reflections too: gives , leaving the original order-two subgroup. For different reflections, their product may have order much smaller than . Two reflections generate the whole dihedral group exactly when .
Worked example 1.5.7
(Two reflections in )
Let and take and . Their product is , and , so the generated subgroup is
It has order six, although the ambient group has order twenty-four. Inside it, has order three and is an involution that inverts , so it has the structure of the symmetry group of a triangle. In contrast, and generate all of , since their product is .
Inclusion is more than comparing orders
For divisors of , the classification also gives the useful test
Indeed, inclusion forces to belong to the rotation part , which is equivalent to . It also forces the reflection to lie in , which is equivalent to the displayed congruence. Conversely these two conditions put both generators of in , proving inclusion.
The divisibility direction can initially seem backwards. A larger step in the exponents produces fewer rotations, so when . In we therefore have . But is not contained in : its reflection exponents are odd, whereas those of are even. Although both possible containing subgroups have order twelve, only one contains the chosen six-element subgroup. Lagrange's divisibility condition alone cannot detect the reflection coset.
Identifying every quotient by a rotation subgroup
Knowing that a quotient has order does not determine its isomorphism type. We must also understand its multiplication. Fix , put , and write and . The quotient is defined because is normal. Its elements have the distinct forms
For rotations, precisely when , or . The same criterion applies to two reflection cosets, by canceling the common factor on the left. A rotation coset cannot equal a reflection coset: cancellation would put a reflection in the rotation subgroup . This proves distinctness as well as completeness; it also proves that has order exactly , rather than merely an order dividing .
The four multiplication rules above now hold with exponents reduced modulo . When , let be rotation through and let be any reflection of a regular -gon. The assignment
is a bijection between the two sets of normal forms. The four rules show that it preserves every possible product, so it is an isomorphism. Hence
The small divisors need separate names, since we defined polygon symmetry groups only for at least three vertices. If , the quotient is the cyclic group of order two. If , it is the Klein four group: and are distinct nonidentity involutions, and makes them commute. This recovers the earlier calculation without inventing a two-sided polygon.
Concept lensStructural
A reflection subgroup of a smaller quotient
Each contains , so the correspondence between subgroups of containing and subgroups of applies, and it matches normal subgroups with normal subgroups. Since , its image is the order-two subgroup , and is the full preimage of that subgroup. For the quotient is abelian, so the image is normal. For the quotient is , and conjugates to the different reflection . This is the criterion again.
Worked example 1.5.8
(Kernel size and quotient rotation order)
In , choose . This kernel has order four, but the image of has order three: three turns by reach , and neither one nor two turns do. The quotient has six elements and is . With instead, the kernel has order three and the quotient is . Keeping the divisor separate from prevents exchanging the kernel order with the quotient's rotation order.
Summary
The classification reduces every subgroup to its rotations and, if present, one reflection coset. The normality criterion then reduces conjugation to a divisibility test; neither the order nor an arbitrary choice of coset representatives can replace that test.
Exercises
Quick check
(List all subgroups of and their orders.)
Solution · Answer
Here , so or . The subgroups are , of order three, of order two, and of order six. The classification proves the list complete.
Quick check
(Find the normal subgroups of .)
Solution · Answer
The trivial and whole groups are normal, as is by index two. Conjugation by sends to , a different reflection modulo three, so no reflection subgroup is normal.
Quick check
(In , determine and .)
Solution · Answer
The two order-two subgroups have different nonidentity elements, so their intersection is . Their generators have product ; hence they generate .
Quick check
(In , show that is normal whenever . Determine the order of the quotient.)
Solution · Answer
Conjugation by fixes , and conjugation by sends it to . Since generate the group, they preserve the subgroup under every conjugation. Its order is , so Lagrange gives quotient order .
Quick check
(In , find , its order, and whether it is normal.)
Solution · Answer
Here and . The answer is , of order six. It is not normal because ; explicitly, conjugation by sends to , which is outside the listed subgroup.
Quick check
(In , let . Identify and the subgroup . Is the latter normal in the quotient?)
Solution · Answer
The quotient is , with rotation of order four. Since , its image is the order-two subgroup . It is not normal: conjugation by sends to , a different reflection. This also agrees with the failure of to be normal in .