A dihedral group is the group of all symmetries of a regular polygon, including both rotations and reflections. For a regular polygon with sides, where , it has elements: rotations and reflections. Dihedral groups are basic examples in group theory because their geometric interpretation makes abstract concepts such as generators, normal subgroups, and noncommutative multiplication explicit.
Notation and geometric definition
Two incompatible notation conventions are common. Some authors write for the symmetry group of a regular -gon; others write , with the subscript giving the number of group elements. Here, denotes the group of order .
Place a regular -gon in the Euclidean plane. Its symmetries are the isometries that map the polygon onto itself. The group operation is composition of transformations, with the rightmost transformation applied first.
Every symmetry is either:
- a rotation about the polygon’s center through an angle ;
- a reflection in one of its symmetry axes.
When is odd, each reflection axis passes through a vertex and the midpoint of the opposite edge. When is even, half the axes pass through pairs of opposite vertices and half pass through midpoints of opposite edges.
A symmetry is determined by the image of a chosen vertex and the choice of which adjacent vertex follows it. There are choices for the first image and two for the second, giving symmetries.
Generators, relations, and multiplication
Let be rotation through , and let be a reflection. Then has the presentation
where is the identity.
The relation expresses a geometric fact: conjugating a rotation by a reflection reverses its direction. Equivalently,
Every element has a unique expression
The elements are rotations, while the elements are reflections. Multiplication is given by
where the exponent of is reduced modulo , and that of modulo . Thus the calculations reduce to modular arithmetic together with a sign change.
In particular,
The product of two reflections is therefore a rotation. Every reflection has order two, while the order of is
For , the group is not an abelian group: , since .
Small examples
Triangle
The group contains three rotations and three reflections. Its action on the three vertices realizes every permutation of those vertices, giving an isomorphism
where is the symmetric group on three objects.
Square
The group has eight elements:
Its rotations are through , , , and . Its four reflections are across the two diagonals and the two lines through midpoints of opposite edges.
Although its action on vertices embeds into , it does not realize every permutation of the four vertices: a square symmetry must preserve adjacency.
Low-parameter conventions
The same presentation can be used for and , even though ordinary nondegenerate regular polygons require at least three sides. It gives
where denotes a cyclic group of order . These two groups are abelian. Some treatments exclude them from the term “dihedral group.”
Algebraic structure
Rotations and the semidirect product
The rotations form a cyclic normal subgroup
of index two. Recording whether a symmetry preserves or reverses orientation defines a surjective homomorphism from to , whose kernel is the rotation subgroup. Consequently, the quotient group is
More precisely,
This is a semidirect product in which the nonidentity element of acts on by inversion. For , this action is nontrivial, so this construction is not the corresponding direct product.
Center
The center consists of elements commuting with every group element. For ,
A rotation commutes with a reflection precisely when , or . When is even, the additional central element is the half-turn.
Commutators and abelianization
The subgroup generated by all commutators is
If is odd, generates the whole rotation subgroup. If is even, it generates a subgroup of order . Therefore,
Since the commutator subgroup is cyclic, and hence abelian, every finite dihedral group is solvable.
Subgroups and conjugacy
Every subgroup of is either entirely rotational or generated by a rotation together with a reflection.
The rotational subgroups are
and have order . Every subgroup containing a reflection has the form
and has order . The cases are the two-element reflection subgroups.
Conjugation of rotations satisfies
Thus each rotational conjugacy class is , except when these elements coincide.
For reflections,
It follows that:
- when is odd, all reflections belong to one conjugacy class;
- when is even, the reflections split into two conjugacy classes, distinguished by the parity of .
Geometrically, the two classes in the even case correspond to axes through opposite vertices and axes through opposite edge midpoints.
Matrix and permutation realizations
Set . The matrices
satisfy
They therefore give a faithful two-dimensional representation of . Both are orthogonal matrices. Their determinants distinguish rotations from reflections: rotations have determinant , and reflections have determinant .
There is also a faithful group action on the vertices. Labeling the vertices by integers modulo , suitable generators act as
This identifies with a subgroup of . For , it is also the full automorphism group of the cycle graph with vertices.
In complex representation theory, all irreducible representations of have dimension one or two. For odd , there are two one-dimensional representations and two-dimensional representations. For even , there are four one-dimensional representations and two-dimensional representations.
Infinite and generalized dihedral groups
The infinite dihedral group has presentation
with of infinite order. It is isomorphic to
where acts on the integers by negation. A concrete realization consists of the isometries of the real line
It can also be presented as a group generated by two involutions with no further relations, namely the free product .
More generally, for any abelian group , its generalized dihedral group is
where the nonidentity element of sends each to . Ordinary finite dihedral groups arise when .
Applications and related symmetry conventions
Dihedral groups describe cyclic arrangements when rotations and reversal are both regarded as symmetries. Examples include colorings of polygon vertices, circular patterns, and combinatorial bracelets. Counting distinct configurations requires accounting for configurations fixed by nonidentity symmetries; simply dividing the total number by generally gives an incorrect answer. Burnside’s lemma supplies the appropriate orbit-counting formula.
They also provide standard examples in the study of graph symmetries, polynomial symmetries in Galois theory, and finite reflection groups. In the latter setting, is the rank-two reflection group usually denoted .
A distinction is necessary when comparing planar geometry with molecular or crystallographic notation. In three-dimensional point-group notation, commonly denotes a group of proper rotations: an -fold rotation axis together with perpendicular twofold axes. This group is abstractly isomorphic to the planar dihedral group, but its order-two generators are spatial half-turns rather than plane reflections. Abstract group structure therefore does not by itself determine the geometric type of its transformations.