Leandro Junes

Dihedral Group Explorer

Explore rotations, reflections, compositions, and the symmetry groups of regular polygons.

Polygon and group

—

Right to left. A product AB = A ∘ B means: apply B first, then A. Here r is the rotation by one step counterclockwise and s is the reflection in the axis through v₀.

The polygon

—

The selected symmetry

—

Where the vertices go

verteximage

About dihedral groups

Notation. Here Dₙ = ⟨r, s | rⁿ = e, s² = e, srs = r⁻¹⟩ is the group of the 2n symmetries of a regular n-gon, for n ≥ 3. Some textbooks name the same group after its order and write D₂ₙ. Every element is written in exactly one way as rⁱsʲ with 0 ≤ i < n and j ∈ {0, 1}, and (rⁱsʲ)(rᵏsˡ) = r^(i + (−1)ʲk) s^(j + l), the exponent of r taken modulo n and that of s modulo 2.

What a dihedral group is

A symmetry of a regular polygon is a rigid motion of the plane that puts the polygon back onto itself. Doing one symmetry after another is again a symmetry, doing nothing is a symmetry, and every symmetry can be undone: the symmetries form a group under composition. That group is the dihedral group.

Why there are 2n elements

A symmetry is known once you know where it sends the vertex v₀ and its neighbour v₁. There are n places for v₀, and then v₁ must go to one of the two neighbours of that place: n · 2 = 2n symmetries, the n rotations (the neighbour stays on the counterclockwise side) and the n reflections (it changes sides).

How the group acts on the vertices

The vertices are v₀, …, vₙ₋₁, counterclockwise, with v₀ at the top. The generators act by r(vₖ) = vₖ₊₁ and s(vₖ) = v₋ₖ, so (rⁱsʲ)(vₖ) = v_(i + (−1)ʲk), indices modulo n. Every table of vertices on this page comes from that formula, and every product from the multiplication rule above; the tests of this page check that the two always agree.

Rotations and reflections

The rotation rᵏ turns the polygon by 360k/n degrees counterclockwise about its centre and has order n / gcd(n, k). The reflection rᵏs turns the polygon over about an axis through the centre: the axis of s turned counterclockwise by 180k/n degrees. For odd n every axis joins a vertex to the midpoint of the opposite edge. For even n the axes with even k join two opposite vertices and those with odd k join the midpoints of two opposite edges.

Why a reflection reverses orientation

Walk round the polygon counterclockwise: v₀, v₁, v₂, … After a rotation the images still run counterclockwise. After a reflection they run clockwise, because k ↦ i − k counts backwards. No motion that stays inside the plane can do that: the polygon has to be lifted and turned over. That is why the page shows a reflection as a flip through the third dimension, and why the shapes in between are not symmetries.

Why reflections have order 2

Turning the polygon over twice about the same axis puts every vertex back. In symbols, (rᵏs)(rᵏs) = rᵏ(srᵏ)s = rᵏr⁻ᵏss = e.

Why r and s do not commute, and the relation srs = r⁻¹

Reflect, rotate one step counterclockwise, reflect back: seen from the other side, the counterclockwise step was a clockwise one. So srs = r⁻¹, or sr = r⁻¹s: an s may move past an r, but the r becomes r⁻¹. Since r⁻¹ ≠ r for n ≥ 3, sr ≠ rs, and the group is not abelian.

Why the product of two reflections is a rotation

Two flips bring the same face up again, so the result preserves orientation: it is a rotation. Precisely, (rⁱs)(rᵏs) = r^(i − k). The two axes meet at the angle 180(i − k)/n degrees, and the product turns by twice that angle, from the axis of the reflection applied first towards the other.

Why the center depends on the parity of n

A rotation rᵏ commutes with s exactly when rᵏ = r⁻ᵏ, that is when 2k is a multiple of n. For odd n only k = 0 does it; for even n so does the half turn r^(n/2). No reflection commutes with r. Hence Z(Dₙ) = {e} for odd n and {e, r^(n/2)} for even n.

How the subgroups are classified

A subgroup either has no reflection or has as many reflections as rotations. Its rotations form a subgroup of ⟨r⟩, so they are ⟨rᵈ⟩ for a divisor d of n. That gives the rotation subgroups H_d = ⟨rᵈ⟩, of order n/d, and the subgroups K_(d,k) = ⟨rᵈ, rᵏs⟩ with 0 ≤ k < d, of order 2n/d: one for each divisor, and d more for each divisor, τ(n) + σ(n) in all. Every H_d is normal; K_(d,k) is normal exactly when d divides 2.

Limits. Everything is computed in your browser, for 3 ≤ n ≤ 1000. The polygon is drawn with every vertex labelled for n ≤ 24, without individual labels for n ≤ 60, and described in symbols beyond that. The subgroup lattice is drawn for up to 60 subgroups and the Cayley graph for groups of at most 48 elements. Long lists are shortened and say so; no result is left out because a picture is not drawn.