Dihedral group
This snowflake has the dihedral symmetry of a regular hexagon.

In mathematics, a dihedral group is the group of symmetries of a regular polygon, including both rotations and reflections.[1] Dihedral groups are among the simplest examples of finite groups, and they play an important role in group theory, geometry, and chemistry.

See also: Dihedral symmetry in three dimensions.



There are two competing notations for the dihedral group associated to a polygon with n sides. In geometry the group is denoted Dn, while in algebra the same group is denoted by D2n to indicate the number of elements.

In this article, Dn (and sometimes Dihn) refers to the symmetries of a regular polygon with n sides.



The six reflection symmetries of a regular hexagon

A regular polygon with n sides has 2n different symmetries: n rotational symmetries and n reflection symmetries. The associated rotations and reflections make up the dihedral group Dn. If n is odd each axis of symmetry connects the mid-point of one side to the opposite vertex. If n is even there are n/2 axes of symmetry connecting the mid-points of opposite sides and n/2 axes of symmetry connecting opposite vertices. In either case, there are n axes of symmetry altogether and 2n elements in the symmetry group. Reflecting in one axis of symmetry followed by reflecting in another axis of symmetry produces a rotation through twice the angle between the axes. The following picture shows the effect of the sixteen elements of D8 on a stop sign:


The first row shows the effect of the eight rotations, and the second row shows the effect of the eight reflections.

Group structure

As with any geometric object, the composition of two symmetries of a regular polygon is again a symmetry. This operation gives the symmetries of a polygon the algebraic structure of a finite group.

Labeled Triangle Reflections.svg
The composition of these two reflections is a rotation.

The following Cayley table shows the effect of composition in the group D3 (the symmetries of an equilateral triangle). R0 denotes the identity; R1 and R2 denote counterclockwise rotations by 120 and 240 degrees; and S0, S1, and S2 denote reflections across the three lines shown in the picture to the right.

R0 R1 R2 S0 S1 S2
R0 R0 R1 R2 S0 S1 S2
R1 R1 R2 R0 S1 S2 S0
R2 R2 R0 R1 S2 S0 S1
S0 S0 S2 S1 R0 R2 R1
S1 S1 S0 S2 R1 R0 R2
S2 S2 S1 S0 R2 R1 R0

For example, S2S1 = R1 because the reflection S1 followed by the reflection S2 results in a 120-degree rotation. (This is the normal backwards order for composition.) Note that the composition operation is not commutative.

In general, the group Dn has elements R0,...,Rn−1 and S0,...,Sn−1, with composition given by the following formulae:

R_i\,R_j = R_{i+j},\;\;\;\;R_i\,S_j = S_{i+j},\;\;\;\;S_i\,R_j = S_{i-j},\;\;\;\;S_i\,S_j = R_{i-j}.

In all cases, addition and subtraction of subscripts should be performed using modular arithmetic with modulus n.

Matrix representation

The symmetries of this pentagon are linear transformations.

If we center the regular polygon at the origin, then elements of the dihedral group act as linear transformations of the plane. This lets us represent elements of Dn as matrices, with composition being matrix multiplication. This is an example of a (2-dimensional) group representation.

For example, the elements of the group D4 can be represented by the following eight matrices:

R_0=\bigl(\begin{smallmatrix}1&0\\[0.2em]0&1\end{smallmatrix}\bigr), &
R_1=\bigl(\begin{smallmatrix}0&-1\\[0.2em]1&0\end{smallmatrix}\bigr), &
R_2=\bigl(\begin{smallmatrix}-1&0\\[0.2em]0&-1\end{smallmatrix}\bigr), &
R_3=\bigl(\begin{smallmatrix}0&1\\[0.2em]-1&0\end{smallmatrix}\bigr), \\[1em]
S_0=\bigl(\begin{smallmatrix}1&0\\[0.2em]0&-1\end{smallmatrix}\bigr), &
S_1=\bigl(\begin{smallmatrix}0&1\\[0.2em]1&0\end{smallmatrix}\bigr), &
S_2=\bigl(\begin{smallmatrix}-1&0\\[0.2em]0&1\end{smallmatrix}\bigr), &

In general, the matrices for elements of Dn have the following form:

           R_k & = \begin{pmatrix}
                       \cos \frac{2\pi k}{n} & -\sin \frac{2\pi k}{n} \\
                       \sin \frac{2\pi k}{n} & \cos \frac{2\pi k}{n}                   \end{pmatrix}
                   \ \ \text{and} \\
           S_k & =  \begin{pmatrix}
                       \cos \frac{2\pi k}{n}  & \sin \frac{2\pi k}{n} \\
                       \sin \frac{2\pi k}{n} & -\cos \frac{2\pi k}{n}                    \end{pmatrix}

Rk is a rotation matrix, expressing a counterclockwise rotation through an angle of 2πkn. Sk is a reflection across a line that makes an angle of πkn with the x-axis.

Small dihedral groups

For n = 1 we have Dih1. This notation is rarely used except in the framework of the series, because it is equal to Z2. For n = 2 we have Dih2, the Klein four-group. Both are exceptional within the series:

  • They are abelian; for all other values of n the group Dihn is not abelian.
  • They are not subgroups of the symmetric group Sn, corresponding to the fact that 2n > n ! for these n.

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.

Dih1 Dih2 Dih3 Dih4 Dih5 Dih6 Dih7

The dihedral group as symmetry group in 2D and rotation group in 3D

An example of abstract group Dihn, and a common way to visualize it, is the group Dn of Euclidean plane isometries which keep the origin fixed. These groups form one of the two series of discrete point groups in two dimensions. Dn consists of n 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. This 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).

Dihedral group Dn is generated by a rotation r of order n and a reflection s of order 2 such that

srs = r^{-1} \,

In geometric terms: in the mirror a rotation looks like an inverse rotation.

In terms of complex numbers: multiplication by e^{2\pi i \over n} and complex conjugation.

In matrix form, by setting

r_1 = \begin{bmatrix}\cos{2\pi \over n} & -\sin{2\pi \over n} \\[8pt] \sin{2\pi \over n} & \cos{2\pi \over n}\end{bmatrix} \qquad s_0 = \begin{bmatrix}1 & 0 \\ 0 & -1\end{bmatrix}

and defining r_j = r_1^j and s_j = r_j \, s_0 for j \in \{1,\ldots,n-1\} we can write the product rules for  Dn as

r_j \, r_k = r_{(j+k) \text{ mod }n}
r_j \, s_k = s_{(j+k) \text{ mod }n}
s_j \, r_k =s_{(j-k) \text{ mod }n}
s_j \, s_k = r_{(j-k) \text{ mod }n}.

(Compare coordinate rotations and reflections.)

The dihedral group D2 is generated by the rotation r of 180 degrees, and the reflection s across the x-axis. The elements of D2 can then be represented as {ersrs}, where e is the identity or null transformation and rs is the reflection across the y-axis.

The four elements of D2 (x-axis is vertical here)

D2 is isomorphic to the Klein four-group.

For n>2 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.

D4 is nonabelian (x-axis is vertical here).

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, s, r s, r2 s, ..., rn−1 s. 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. However, notation Dn is also used for a subgroup of SO(3) which is also of abstract group type Dihn: 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).

Examples of 2D dihedral symmetry

Equivalent definitions

Further equivalent definitions of Dihn are:

  • The automorphism group of the graph consisting only of a cycle with n vertices (if n ≥ 3).
  • The group with presentation
D_n=\langle r, s \mid r^n = 1, s^2 = 1, s^{-1}rs = r^{-1} \rangle
D_n=\langle x, y \mid x^2 = y^2 = (xy)^n = 1 \rangle.

From the second presentation follows that Dihn belongs to the class of Coxeter groups.

\mathbb{Z}_n \rtimes_\varphi \mathbb{Z}_2 is isomorphic to Dihn if φ(0) is the identity and φ(1) is inversion.


If we consider Dihn (n ≥ 3) as the symmetry group of a regular n-gon and number the polygon's vertices, we see that Dihn is a subgroup of the symmetric group Sn via this permutation representation.

The properties of the dihedral groups Dihn with n ≥ 3 depend on whether n is even or odd. For example, the center of Dihn consists only of the identity if n is odd, but if n is even the center has two elements, namely the identity and the element rn / 2 (with Dn as a subgroup of O(2), 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 Dih2n is isomorphic with the direct product of Dihn and Z2.

In the case of 2D isometries, this corresponds to adding inversion, giving rotations and mirrors in between the existing ones.

If m divides n, then Dihn has n / m subgroups of type Dihm, and one subgroup Zm. Therefore the total number of subgroups of Dihn (n ≥ 1), 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. See list of small groups for the cases n ≤ 8.

Conjugacy classes of reflections

All the reflections are conjugate to each other in case n is odd, but they fall into two conjugacy classes if n is even. If we think of the isometries of a regular n-gon: for odd n there are rotations in the group between every pair of mirrors, while for even n only half of the mirrors can be reached from one by these rotations. Geometrically, in an odd polygon every axis of symmetry passes through a vertex and a side, while in an even polygon half the axes pass through two vertices, and half pass through two sides.

Algebraically, this is an instance of the conjugate Sylow theorem (for n odd): for n odd, each reflection, together with the identity, form a subgroup of order 2, which is a Sylow 2-subgroup (2 = 21 is the maximum power of 2 dividing 2n = 2(2k + 1)), while for n even, these order 2 subgroups are not Sylow subgroups because 4 (a higher power of 2) divides the order of the group.

For n even there is instead an outer automorphism interchanging the two types of reflections (properly, a class of outer automorphisms, which are all conjugate by an inner automorphism).

Automorphism group

The automorphism group of Dihn is isomorphic to the affine group Aff(Z/nZ) =\{ax + b \mid (a,n) = 1\} and has order nϕ(n), where ϕ is Euler's totient function, the number of k in 1,\dots,n-1 coprime to n.

It can be understood in terms of the generators of a reflection and an elementary rotation (rotation by k(2π / n), for k coprime to n); which automorphisms are inner and outer depends on the parity of n.

  • For n odd, the dihedral group is centerless, so any element defines a non-trivial inner automorphism; for n even, the rotation by 180° (reflection through the origin) is the non-trivial element of the center.
  • Thus for n odd, the inner automorphism group has order 2n, and for n even the inner automorphism group has order n.
  • For n odd, all reflections are conjugate; for n even, they fall into two classes (those through two vertices and those through two faces), related by an outer automorphism, which can be represented by rotation by π / n (half the minimal rotation).
  • The rotations are a normal subgroup; conjugation by a reflection changes the sign (direction) of the rotation, but otherwise leaves them unchanged. Thus automorphisms that multiply angles by k (coprime to n) are outer unless k=\pm 1.

Examples of automorphism groups

Dih9 has 18 inner automorphisms. As 2D isometry group D9, the group has mirrors at 20° intervals. The 18 inner automorphisms provide rotation of the mirrors by multiples of 20°, and reflections. As isometry group these are all automorphisms. As abstract group there are in addition to these, 36 outer automorphisms, e.g. multiplying angles of rotation by 2.

Dih10 has 10 inner automorphisms. As 2D isometry group D10, the group has mirrors at 18° intervals. The 10 inner automorphisms provide rotation of the mirrors by multiples of 36°, and reflections. As isometry group there are 10 more automorphisms; they are conjugates by isometries outside the group, rotating the mirrors 18° with respect to the inner automorphisms. As abstract group there are in addition to these 10 inner and 10 outer automorphisms, 20 more outer automorphisms, e.g. multiplying rotations by 3.

Compare the values 6 and 4 for Euler's totient function, the multiplicative group of integers modulo n for n = 9 and 10, respectively. This triples and doubles the number of automorphisms compared with the two automorphisms as isometries (keeping the order of the rotations the same or reversing the order).


There are several important generalizations of the dihedral groups:

  • The infinite dihedral group is an infinite group with algebraic structure similar to the finite dihedral groups. It can be viewed as the group of symmetries of the integers.
  • The orthogonal group O(2), i.e. the symmetry group of the circle, also has similar properties to the dihedral groups.
  • The family of generalized dihedral groups includes both of the examples above, as well as many other groups.
  • The quasidihedral groups are family of finite groups with similar properties to the dihedral groups.

See also


  1. ^ Dummit, David S.; Foote, Richard M. (2004). Abstract Algebra (3rd ed.). John Wiley & Sons. ISBN 0-471-43334-9. 

External links

Wikimedia Foundation. 2010.

Look at other dictionaries:

  • Dihedral group of order 6 — The smallest non abelian group has 6 elements. It is a dihedral group with notation D3 (or D6, both are used) and the symmetric group of degree 3, with notation S3. This page illustrates many group concepts using this group as example. Contents 1 …   Wikipedia

  • Dihedral — or polyhedral may refer to: Dihedral angle, the angle between two mathematical planes Dihedral (aircraft), the upward angle of a fixed wing aircraft s wings where they meet at the fuselage, dihedral effect of an aircraft, longitudinal dihedral… …   Wikipedia

  • Dihedral (disambiguation) — Dihedral may refer to: *Dihedral the angle of a fixed wing aircraft s wings *Dihedral angle, is the angle between two planes, in geometry *Dihedral group, is the group of symmetries of the n sided polygon in abstract algebra **Also Dihedral… …   Wikipedia

  • Group (mathematics) — This article covers basic notions. For advanced topics, see Group theory. The possible manipulations of this Rubik s Cube form a group. In mathematics, a group is an algebraic structure consisting of a set together with an operation that combines …   Wikipedia

  • Dihedral symmetry in three dimensions — This article deals with three infinite sequences of point groups in three dimensions which have a symmetry group that as abstract group is a dihedral group Dihn ( n ≥ 2 ). See also point groups in two dimensions. Chiral: Dn (22n) of… …   Wikipedia

  • Group isomorphism — In abstract algebra, a group isomorphism is a function between two groups that sets up a one to one correspondence between the elements of the groups in a way that respects the given group operations. If there exists an isomorphism between two… …   Wikipedia

  • Orthogonal group — Group theory Group theory …   Wikipedia

  • Cyclic group — Group theory Group theory …   Wikipedia

  • General linear group — Group theory Group theory …   Wikipedia

  • Lorentz group — Group theory Group theory …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”