Mathwords logoMathwords

Dihedral Group — Definition, Formula & Examples

A dihedral group is the group of symmetries of a regular polygon, including both rotations and reflections. It is denoted DnD_n and has 2n2n elements, where nn is the number of sides of the polygon.

The dihedral group DnD_n (for n3n \geq 3) is the group of isometries of the Euclidean plane that map a regular nn-gon to itself. It is generated by a rotation rr of order nn and a reflection ss of order 22, subject to the relation srs=r1srs = r^{-1}, giving the presentation Dn=r,srn=s2=e,  srs=r1D_n = \langle r, s \mid r^n = s^2 = e,\; srs = r^{-1} \rangle.

Key Formula

Dn=2n|D_n| = 2n
Where:
  • DnD_n = The dihedral group of order 2n (symmetries of a regular n-gon)
  • nn = Number of sides of the regular polygon (n ≥ 3)
  • Dn|D_n| = The number of elements (order) of the group

How It Works

Every element of DnD_n can be written uniquely as rkr^k or srksr^k for 0kn10 \leq k \leq n-1. The nn elements of the form rkr^k are rotations (including the identity r0=er^0 = e), and the nn elements of the form srksr^k are reflections. To compose two symmetries, you use the key relation rs=sr1rs = sr^{-1} (equivalently srs=r1srs = r^{-1}) to rewrite any product into one of these standard forms. For example, in D4D_4 the product sr2sr3sr^2 \cdot sr^3 can be simplified by moving ss past powers of rr using the relation repeatedly.

Worked Example

Problem: List all elements of the dihedral group D3D_3 (symmetries of an equilateral triangle) and determine whether D3D_3 is abelian.
Step 1: Count the elements. Since n=3n = 3, the group has 2n=62n = 6 elements.
D3=2(3)=6|D_3| = 2(3) = 6
Step 2: Write out all elements using the generators rr (rotation by 120°120°) and ss (a reflection).
D3={e,  r,  r2,  s,  sr,  sr2}D_3 = \{e,\; r,\; r^2,\; s,\; sr,\; sr^2\}
Step 3: Check commutativity by computing rsrs and srsr. The relation srs=r1=r2srs = r^{-1} = r^2 gives sr=r2ssr = r^2 s, so rssrrs \neq sr.
rs=sr1=sr2srrs = sr^{-1} = sr^2 \neq sr
Answer: D3D_3 has 6 elements: {e,r,r2,s,sr,sr2}\{e, r, r^2, s, sr, sr^2\}. Since rssrrs \neq sr, the group is non-abelian. (In fact, D3D_3 is isomorphic to the symmetric group S3S_3.)

Why It Matters

Dihedral groups are among the first non-abelian groups students encounter and serve as a testing ground for concepts like normal subgroups, conjugacy classes, and group actions. They appear naturally in chemistry (molecular symmetry), crystallography, and computer graphics whenever rotational and reflective symmetry must be classified.

Common Mistakes

Mistake: Confusing the notation: some textbooks use DnD_n for 2n2n elements while others use D2nD_{2n} for the same group.
Correction: Always check which convention your textbook uses. If the symmetry group of a square is called D4D_4, it has 8 elements; if it is called D8D_8, it still has 8 elements — same group, different labeling.