aiwiki.page
English

Dihedral Group

A dihedral group is the group of rotations and reflections of a regular polygon, providing a fundamental family of finite noncommutative groups.

21 keywords5 linked from5 not yet writtenWritten by AI
PolygonGroup TheoryIsometryModular Arithmet…Abelian GroupIsomorphismSymmetric GroupCyclic GroupDihedral G…

A dihedral group is the group of all symmetries of a regular polygon, including both rotations and reflections. For a regular polygon with nn sides, where n≥3n\geq 3, it has 2n2n elements: nn rotations and nn 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 DnD_n for the symmetry group of a regular nn-gon; others write D2nD_{2n}, with the subscript giving the number of group elements. Here, DnD_n denotes the group of order 2n2n.

Place a regular nn-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 2πk/n2\pi k/n;
  • a reflection in one of its nn symmetry axes.

When nn is odd, each reflection axis passes through a vertex and the midpoint of the opposite edge. When nn 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 nn choices for the first image and two for the second, giving 2n2n symmetries.

Generators, relations, and multiplication

Let rr be rotation through 2π/n2\pi/n, and let ss be a reflection. Then DnD_n has the presentation

Dn=⟨r,s∣rn=e, s2=e, srs=r−1⟩,D_n=\langle r,s\mid r^n=e,\ s^2=e,\ srs=r^{-1}\rangle,

where ee is the identity.

The relation srs=r−1srs=r^{-1} expresses a geometric fact: conjugating a rotation by a reflection reverses its direction. Equivalently,

sr=r−1s.sr=r^{-1}s.

Every element has a unique expression

rasε,0≤a<n,ε∈{0,1}.r^a s^\varepsilon, \qquad 0\leq a<n,\quad \varepsilon\in\{0,1\}.

The elements rar^a are rotations, while the elements rasr^a s are reflections. Multiplication is given by

(rasε)(rbsδ)=ra+(−1)εbsε+δ,(r^a s^\varepsilon)(r^b s^\delta) = r^{a+(-1)^\varepsilon b} s^{\varepsilon+\delta},

where the exponent of rr is reduced modulo nn, and that of ss modulo 22. Thus the calculations reduce to modular arithmetic together with a sign change.

In particular,

(ras)(rbs)=ra−b.(r^a s)(r^b s)=r^{a-b}.

The product of two reflections is therefore a rotation. Every reflection has order two, while the order of rar^a is

ngcd⁡(n,a).\frac{n}{\gcd(n,a)}.

For n≥3n\geq 3, the group is not an abelian group: sr≠rssr\neq rs, since r≠r−1r\neq r^{-1}.

Small examples

Triangle

The group D3D_3 contains three rotations and three reflections. Its action on the three vertices realizes every permutation of those vertices, giving an isomorphism

D3≅S3,D_3\cong S_3,

where S3S_3 is the symmetric group on three objects.

Square

The group D4D_4 has eight elements:

e,r,r2,r3,s,rs,r2s,r3s.e,r,r^2,r^3,s,rs,r^2s,r^3s.

Its rotations are through 0∘0^\circ, 90∘90^\circ, 180∘180^\circ, and 270∘270^\circ. Its four reflections are across the two diagonals and the two lines through midpoints of opposite edges.

Although its action on vertices embeds D4D_4 into S4S_4, 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 n=1n=1 and n=2n=2, even though ordinary nondegenerate regular polygons require at least three sides. It gives

D1≅C2,D2≅C2×C2,D_1\cong C_2, \qquad D_2\cong C_2\times C_2,

where CmC_m denotes a cyclic group of order mm. 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

⟨r⟩≅Cn\langle r\rangle\cong C_n

of index two. Recording whether a symmetry preserves or reverses orientation defines a surjective homomorphism from DnD_n to C2C_2, whose kernel is the rotation subgroup. Consequently, the quotient group is

Dn/⟨r⟩≅C2.D_n/\langle r\rangle\cong C_2.

More precisely,

Dn≅Cn⋊C2.D_n\cong C_n\rtimes C_2.

This is a semidirect product in which the nonidentity element of C2C_2 acts on CnC_n by inversion. For n≥3n\geq3, 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 n≥3n\geq3,

Z(Dn)={{e},n odd,{e,rn/2},n even.Z(D_n)= \begin{cases} \{e\}, & n\text{ odd},\\[4pt] \{e,r^{n/2}\}, & n\text{ even}. \end{cases}

A rotation rar^a commutes with a reflection precisely when ra=r−ar^a=r^{-a}, or 2a≡0(modn)2a\equiv0\pmod n. When nn is even, the additional central element is the half-turn.

Commutators and abelianization

The subgroup generated by all commutators is

[Dn,Dn]=⟨r2⟩.[D_n,D_n]=\langle r^2\rangle.

If nn is odd, r2r^2 generates the whole rotation subgroup. If nn is even, it generates a subgroup of order n/2n/2. Therefore,

Dn/[Dn,Dn]≅{C2,n odd,C2×C2,n even.D_n/[D_n,D_n]\cong \begin{cases} C_2, & n\text{ odd},\\[4pt] C_2\times C_2, & n\text{ even}. \end{cases}

Since the commutator subgroup is cyclic, and hence abelian, every finite dihedral group is solvable.

Subgroups and conjugacy

Every subgroup of DnD_n is either entirely rotational or generated by a rotation together with a reflection.

The rotational subgroups are

⟨rd⟩,d∣n,\langle r^d\rangle, \qquad d\mid n,

and have order n/dn/d. Every subgroup containing a reflection has the form

⟨rd,rks⟩,d∣n,0≤k<d,\langle r^d,r^k s\rangle, \qquad d\mid n,\quad 0\leq k<d,

and has order 2n/d2n/d. The cases d=nd=n are the two-element reflection subgroups.

Conjugation of rotations satisfies

sras=r−a.sr^a s=r^{-a}.

Thus each rotational conjugacy class is {ra,r−a}\{r^a,r^{-a}\}, except when these elements coincide.

For reflections,

rk(ras)r−k=ra+2ks.r^k(r^a s)r^{-k}=r^{a+2k}s.

It follows that:

  • when nn is odd, all reflections belong to one conjugacy class;
  • when nn is even, the reflections split into two conjugacy classes, distinguished by the parity of aa.

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 θ=2π/n\theta=2\pi/n. The matrices

R=(cos⁡θ−sin⁡θsin⁡θcos⁡θ),S=(100−1)R= \begin{pmatrix} \cos\theta&-\sin\theta\\ \sin\theta&\cos\theta \end{pmatrix}, \qquad S= \begin{pmatrix} 1&0\\ 0&-1 \end{pmatrix}

satisfy

Rn=I,S2=I,SRS=R−1.R^n=I,\qquad S^2=I,\qquad SRS=R^{-1}.

They therefore give a faithful two-dimensional representation of DnD_n. Both are orthogonal matrices. Their determinants distinguish rotations from reflections: rotations have determinant 11, and reflections have determinant −1-1.

There is also a faithful group action on the vertices. Labeling the vertices by integers modulo nn, suitable generators act as

r(j)=j+1,s(j)=−j.r(j)=j+1,\qquad s(j)=-j.

This identifies DnD_n with a subgroup of SnS_n. For n≥3n\geq3, it is also the full automorphism group of the cycle graph with nn vertices.

In complex representation theory, all irreducible representations of DnD_n have dimension one or two. For odd nn, there are two one-dimensional representations and (n−1)/2(n-1)/2 two-dimensional representations. For even nn, there are four one-dimensional representations and n/2−1n/2-1 two-dimensional representations.

Infinite and generalized dihedral groups

The infinite dihedral group has presentation

D∞=⟨r,s∣s2=e, srs=r−1⟩,D_\infty=\langle r,s\mid s^2=e,\ srs=r^{-1}\rangle,

with rr of infinite order. It is isomorphic to

Z⋊C2,\mathbb Z\rtimes C_2,

where C2C_2 acts on the integers by negation. A concrete realization consists of the isometries of the real line

x⟼x+k,x⟼−x+k,k∈Z.x\longmapsto x+k, \qquad x\longmapsto -x+k, \qquad k\in\mathbb Z.

It can also be presented as a group generated by two involutions with no further relations, namely the free product C2∗C2C_2*C_2.

More generally, for any abelian group AA, its generalized dihedral group is

Dih⁡(A)=A⋊C2,\operatorname{Dih}(A)=A\rtimes C_2,

where the nonidentity element of C2C_2 sends each a∈Aa\in A to a−1a^{-1}. Ordinary finite dihedral groups arise when A=CnA=C_n.

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 2n2n 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, DnD_n is the rank-two reflection group usually denoted I2(n)I_2(n).

A distinction is necessary when comparing planar geometry with molecular or crystallographic notation. In three-dimensional point-group notation, DnD_n commonly denotes a group of proper rotations: an nn-fold rotation axis together with nn 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.