The dihedral group of order 2n, usually written Dn, is the group of symmetries of a regular polygon with n sides, consisting of n rotations, including the identity, together with n reflections, so that combining any two of these symmetries by first performing one and then the other always yields another symmetry in the same group. It is one of the simplest and most commonly used examples in the teaching of group theory, since its elements and the multiplication rules between them can be visualized directly by physically rotating and flipping a paper polygon, making it a standard first example of a non-abelian group, a group in which the order of combining two elements matters. Dihedral groups appear throughout mathematics, physics, and chemistry wherever an object with polygonal symmetry needs to be described, including in crystallography, where the symmetry groups of many crystal structures are dihedral, and in the study of frieze and wallpaper patterns. The infinite dihedral group, an analogous but unbounded structure describing the symmetries of an infinite strip of repeating pattern, extends the same idea beyond any single finite polygon.
Facts
Classification
Object KindStructure or Algebraic Object 1 Connections
Is Kind Of Object
Entity-backed identity for the object-kind enum value this mathematical object already carries, resolved to a mathematics concept by an explicit value-to-entity map (phase 3 bucket conversion, docs\design_entity_backed_browse_buckets_20260928.md). The object-kind fact itself stays on the object unchanged.
Sources
1. Wikipedia: Dihedral group
Lead paragraphQuote, Lead paragraph
In mathematics, a dihedral group is the group of symmetries of a regular polygon, which includes rotations and reflections.
View the Source Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.