dihedral group properties
1 Properties of Dihedral Groups
A group generated by two involutions is a dihedral group. Whenthe group is finite it is possible to show that the group hasorder for some and takes the presentation
Remark 1.
Contemporary group theorists prefer over as the notation for thedihedral group of order . Although this notation is overly explicit, it does help to resolve the ambiguity with the Lie type which corresponds to the orthogonal group . However, introductory texts in algebra
still make use of the more appropriate notation to emphasize the connection to the symmetries
of a regular
-gon (-sided polygon
).
, are the two abelian examples of dihedral groups. They can be considered as dihedral groups of the respective order because they satisfy the relations
, though the geometric interpretations
are slightly modified. Often can be termed the symmetries of a line segment
, and the the symmetries of a non-square rectangle
, as the symmetry groups of each of these object is isomorphic
to and respectively. These exceptions cause problems for most theorems on dihedral groups so it is convenient to insist that for theorems.
Proposition 2.
is a irredundant list of the elements of . Moreover the conjugacyclasses of are for all and
- •
, and
- •
, .
Consequently when the center of is when and when .Furthermore is a characteristic subgroup of ,provided .
Proof.
The conjugation relation allows us to place every elementin the normal form . If then. Yet so and . Thus we have andirredundant list as required.
For the conjugacy classes note that sothat these conjugacy classes are established. Next
for all . When we have so is invertible modulo . We let for any and we see that is conjugate to any . However, when we have a parity constraint thatso far creates the two classes. We need to also verify conjugation by does not fuse the two classes. Indeed
thus we retain two conjugacy classes amongst the reflections.
Finally, the order of the elements is 2 – a fact used already.Thus the only cyclic subgroup of order , when , is andthus by its uniqueness it is characteristic.∎
Proposition 3.
The maximal subgroups of are dihedral or cyclic. In particular,the unique maximal cyclic group is and themaximal dihedral groups are those of the form for primes dividing .
We will prove this with a more general claim. First we pause to note that as a corollary to these two propositions we can determine the entire lattice
of normal and characteristic subgroups of a dihedral group.
Corollary 4.
A proper subgroup of is normal in if and only if or , and is one the following two maximal subgroupsof index 2:
The proper characteristic subgroups of are all the subgroups of .
Proof.
If is normal and contains an element of the form , then it containsthe entire conjugacy class of . If is odd then all reflections areconjugate to so contains all reflections of and so is as the relfections generate .
If instead is even then is forced only to contain one of the two conjugacy classes of reflections. If is even then contains and so it contains . If is odd then contains and so it contains (note as and ).
The two maximal subgroups of index which can exist when is even can be interchanged by an outer automorphism which maps and so these two are not characterisitic. The subgroups of a characterisitic cyclic group are necessarily characteristic.∎
Proposition 5.
Quotient groups of dihedral groups are dihedral, and subgroups of dihedralgroups are dihedral or cyclic.
Proof.
The homomorphic image of a dihedral group has two generators
and which satisfy the conditions and and , therefore the image is a dihedral group.
For subgroups we proceed by induction. When the result is clear.Now suppose that has some proper subgroup that is not dihedralor cyclic. is contained in some maximal subgroup of . Howeverthe maximal subgroups of are cyclic or dihedral so falls tothe induction step for – together with the fact that subgroups ofcyclic groups are cyclic. Thus must actually be dihedral or cyclicto avoid contradictions
.∎
Proposition 6.
is nilpotent if and only if for some .
Proposition 7.
is solvable for all .
Proof.
When , which is nilpotent and so also solvable.Now let . Then and . Both and are nilpotent and so they are both solvable.As extensions of solvable groups are solvable, is solvable for all .∎
1.1 Automorphisms of
Theorem 8.
Let .The automorphism group of is isomorphic to, with the canonical action of.Explicitly,
with defined as
Proof.
We apply the needle-in-the-haystack heuristic and search first toexplain why these are the only possible forms for the automorphisms.We will then prove all such are indeed automorphisms.
Given , we know is characteristicin so for some . But is invertibleso indeed so that . Next as cannot be sent to .
Now we claim .
and
Now we must show all are indeed homomorphisms when and . First we note that is well-defined as we have an irredundant listing of the elements. Next we verify the homomorphism cases.
So indeed is a homomorphism.
Finally, we show the composition of two such maps both to identifythe automorphism group and to show that each is invertible.
Hence, . This agrees on ’s as well.This reveals the isomorphism desired: by where we see the multiplications agree as
In fact this demonstrates that the inverse of is simply and the identity map
is .∎