Dihedral group
In mathematics, the dihedral group of order 2n is a certain group for which here the notation Dn is used, but elsewhere the notation D2n is also used. For n=1 and n=2 it is abelian, but for all other values of n it is not.
The cycle graphs of dihedral groups consist of an n-element cycle and n 2-element cycles. The dark vertex in the cycle graphs below of various dihedral groups stand for the identity element, and the other vertices are the other elements of the group. A cycle consists of successive powers of either of the elements connected to the identity element.
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
---|---|---|---|---|---|---|
D1 | D2 | D3 | D4 | D5 | D6 | D7 |
The dihedral group as symmetry group in 2D and rotation group in 3D
It is usually thought of as a group of Euclidean plane isometries consisting of rotations of multiples of 360°/n about the origin, and reflections (across n lines through the origin, making angles of multiples of 180°/n with each other). As such it is the symmetry group of a regular polygon with n sides (for n ≥3, and also for the degenerate case n = 2, where we have a line segment in the plane).
Depending on context, either this symmetry group is meant (specific up to isometry conjugacy), or just the group as algebraic structure (i.e. specific up to isomorphism).
Specifically the dihedral group Dn is generated by a rotation r of order n and a reflection f of order 2 such that
One specific matrix representation is given by
(in terms of complex numbers: multiplication by and complex conjugation).
By setting
and defining and for we can write the product rules for as
The dihedral group D2 is generated by the rotation r of 180 degrees, and the reflection f across the x-axis. The elements of D2 can then be represented as {e, r, f, rf}, where e is the identity or null transformation and rf is the reflection across the y-axis.

D2 is isomorphic to the Klein four-group.
If the order of Dn is greater than 4, the operations of rotation and reflection in general do not commute and Dn is not abelian; for example, in D4, a rotation of 90 degrees followed by a reflection yields a different result from a reflection followed by a rotation of 90 degrees:

Thus, beyond their obvious application to problems of symmetry in the plane, these groups are among the simplest examples of non-abelian groups, and as such arise frequently as easy counterexamples to theorems which are restricted to abelian groups.
The 2n elements of Dn can be written as e, r, r2,...,rn−1, f, fr, fr2,...,frn−1. The first n listed elements are rotations and the remaining n elements are axis-reflections (all of which have order 2). The product of two rotations or two reflections is a rotation; the product of a rotation and a reflection is a reflection.
So far, we have considered Dn to be a subgroup of O(2), i.e. the group of rotations (about the origin) and reflections (across axes through the origin) of the plane. One can also think of Dn as a subgroup of SO(3), i.e. the group of rotations (about the origin) of the three-dimensional space. From this point of view, Dn is the proper symmetry group of a regular polygon embedded in three-dimensional space (if n ≥ 3). Such a figure may be considered as a degenerate regular solid with its face counted twice. Therefore it is also called a dihedron (Greek: solid with two faces), which explains the name dihedral group (in analogy to tetrahedral, octahedral and icosahedral group, referring to the proper symmetry groups of a regular tetrahedron, octahedron, and icosahedron respectively).
See also dihedral symmetry.
Equivalent definitions and properties
Further equivalent definitions of Dn are:
- The automorphism group of the graph consisting only of a cycle with n vertices (if n ≥ 3).
- The group with presentation
- or
- (Indeed the only finite groups that can be generated by two elements of order 2 are the dihedral groups and the cyclic groups)
- The semidirect product of cyclic groups Cn and C2, with C2 acting on Cn by inversion (thus, Dn always has a normal subgroup isomorphic to Cn):
Cn Xφ C2 is isomorphic to Dn if φ(0) is the identity and φ(1) is inversion.
If we consider Dn (n ≥ 3) as the symmetry group of a regular n-gon and number the polygon's vertices, we see that Dn is a subgroup of the symmetric group Sn.
The properties of the dihedral groups Dn with n ≥ 3 depend on whether n is even or odd. For example, the center of Dn consists only of the identity if n is odd, but contains the element rn/2 if n is even (with Dn as a subgroup of O(2) or SO(3), this is inversion; since it is scalar multiplication by −1, it is clear that it commutes with any linear transformation).
For odd n, abstract group D2n is isomorphic with the direct product of Dn and C2.
In the case of 2D isometries, this corresponds to adding inversion, giving rotations and mirrors in between the existing ones.
All the reflections are conjugate to each other in case n is odd, but they fall into two conjugacy classes if n is even. This corresponds to the geometrical fact that every symmetry axis of a regular n-gon passes through a vertex and an opposite side if n is odd, but half of them pass through opposite sides and half pass through opposite vertices if n is even. All the rotations are conjugate regardless of whether n is even of odd.
If m divides n, then Dm is a subgroup of Dn. The total number of subgroups of Dn (n ≥ 3), is equal to d(n) + σ(n), where d(n) is the number of positive divisors of n and σ(n) is the sum of the positive divisors of n.
Generalizations
In addition to the finite dihedral groups, there is the infinite dihedral group D∞. Every dihedral group is generated by a rotation r and a reflection; if the rotation is a rational multiple of a full rotation, then there is some integer n such that rn is the identity, and we have a finite dihedral group. If the rotation is not a rational multiple of a full rotation, then there is no such n and the resulting group has infinitely many elements and is called D∞. It has presentations
and is isomorphic to a semidirect product of Z and C2, and to the free product C2 * C2. It can also be visualized as the automorphism group of the graph consisting of a path infinite to both sides, and is isomorphic to one of the (classes of) discrete symmetry groups in one dimension: that of repetitive patterns which also have mirror image symmetry.
Finally, if H is any abelian group, we can speak of the generalized dihedral group of H (sometimes written Dih(H)). This group is a semidirect product of H and C2, with C2 acting on H by inverting elements. Dih(H) has a normal subgroup of index 2 isomorphic to H, and contains in addition an element f of order 2 such that, for all x in H, x f = f x −1.
We get:
- (h1, 0) * (h2, t2) = (h1 + h2, t2)
- (h1, 1) * (h2, t2) = (h1 - h2, 1 + t2)
for all h1, h2 in H and t2 in C2.
Note that (h, 0) * (0,1) = (h,1), i.e. first the inversion and then the operation in H. Also (0, 1) * (h, t) = (- h, 1 + t); indeed (0,1) inverts h, and toggles t between "normal" (0) and "inverted" (1) (this combined operation is its own inverse).
Clearly, we have Dn = Dih(Cn) and D∞ = Dih(Z). The symmetry group of a straight line is isomorphic to Dih(R).
The symmetry group of a circle is Dih(S1) (where S1 denotes the circle group: the multiplicative group of complex numbers of absolute value 1), also called the orthogonal group O(2,R), or O(2) for short.
Dihedral symmetry groups in 3D
Dn is the rotation group of the n-sided prism with regular base, and n-sided bipyramid with regular base, and also of a regular, n-sided antiprism and of a regular, n-sided trapezohedron. The group is also the full symmetry group of such objects after making them chiral by e.g. an identical chiral marking on every face, or some modification in the shape.
There are two more infinite series of symmetry groups algebraically of type Dn:
- Cnv of order 2n, the symmetry group of a regular, n-sided prism with one base colored differently, and also of a regular n-sided pyramid
- Dnd of order 4n, the symmetry group of a regular, n-sided antiprism
Thus we have, with bolding of the 11 crystallographic point groups, for which the crystallographic restriction applies:
- order 4: D2, C2v, D1d
- order 6: D3, C3v
- order 8: D4, C4v, D2d
- order 10: D5, C5v
- order 12: D6, C6v, D3d
- order 14: D7, C7v
- order 16: D8, C8v, D4d
etc.