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 and has elements, where is the number of sides of the polygon.
The dihedral group (for ) is the group of isometries of the Euclidean plane that map a regular -gon to itself. It is generated by a rotation of order and a reflection of order , subject to the relation , giving the presentation .
Key Formula
Where:
- = The dihedral group of order 2n (symmetries of a regular n-gon)
- = Number of sides of the regular polygon (n ≥ 3)
- = The number of elements (order) of the group
How It Works
Every element of can be written uniquely as or for . The elements of the form are rotations (including the identity ), and the elements of the form are reflections. To compose two symmetries, you use the key relation (equivalently ) to rewrite any product into one of these standard forms. For example, in the product can be simplified by moving past powers of using the relation repeatedly.
Worked Example
Problem: List all elements of the dihedral group (symmetries of an equilateral triangle) and determine whether is abelian.
Step 1: Count the elements. Since , the group has elements.
Step 2: Write out all elements using the generators (rotation by ) and (a reflection).
Step 3: Check commutativity by computing and . The relation gives , so .
Answer: has 6 elements: . Since , the group is non-abelian. (In fact, is isomorphic to the symmetric group .)
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 for elements while others use for the same group.
Correction: Always check which convention your textbook uses. If the symmetry group of a square is called , it has 8 elements; if it is called , it still has 8 elements — same group, different labeling.
