{
  "id": "dihedral-group",
  "title": "Dihedral Group",
  "lang": "en",
  "source_lang": "en",
  "summary": "A dihedral group is the group of rotations and reflections of a regular polygon, providing a fundamental family of finite noncommutative groups.",
  "category": "mathematics",
  "subcategory": "algebra",
  "type": "concept",
  "aliases": [
    "Dihedral symmetry group",
    "Polygon symmetry group"
  ],
  "generated_at": "2026-11-05",
  "model": "pro/gpt-6.1-sol",
  "url": "https://aiwiki.page/en/dihedral-group/",
  "translations": {
    "zh-Hans": {
      "url": "https://aiwiki.page/zh/dihedral-group/",
      "json": "https://aiwiki.page/zh/dihedral-group.json"
    }
  },
  "sections": [
    {
      "heading": "",
      "text": "A dihedral group is the group of all symmetries of a regular polygon, including both rotations and reflections. For a regular polygon with \\(n\\) sides, where \\(n\\geq 3\\), it has \\(2n\\) elements: \\(n\\) rotations and \\(n\\) 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."
    },
    {
      "heading": "Notation and geometric definition",
      "text": "Two incompatible notation conventions are common. Some authors write \\(D_n\\) for the symmetry group of a regular \\(n\\)-gon; others write \\(D_{2n}\\), with the subscript giving the number of group elements. Here, \\(D_n\\) denotes the group of order \\(2n\\).\n\nPlace a regular \\(n\\)-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.\n\nEvery symmetry is either:\n\n- a rotation about the polygon’s center through an angle \\(2\\pi k/n\\);\n- a reflection in one of its \\(n\\) symmetry axes.\n\nWhen \\(n\\) is odd, each reflection axis passes through a vertex and the midpoint of the opposite edge. When \\(n\\) is even, half the axes pass through pairs of opposite vertices and half pass through midpoints of opposite edges.\n\nA symmetry is determined by the image of a chosen vertex and the choice of which adjacent vertex follows it. There are \\(n\\) choices for the first image and two for the second, giving \\(2n\\) symmetries."
    },
    {
      "heading": "Generators, relations, and multiplication",
      "text": "Let \\(r\\) be rotation through \\(2\\pi/n\\), and let \\(s\\) be a reflection. Then \\(D_n\\) has the presentation\n\n\\[D_n=\\langle r,s\\mid r^n=e,\\ s^2=e,\\ srs=r^{-1}\\rangle,\\]\n\nwhere \\(e\\) is the identity.\n\nThe relation \\(srs=r^{-1}\\) expresses a geometric fact: conjugating a rotation by a reflection reverses its direction. Equivalently,\n\n\\[sr=r^{-1}s.\\]\n\nEvery element has a unique expression\n\n\\[r^a s^\\varepsilon, \\qquad 0\\leq a<n,\\quad \\varepsilon\\in\\{0,1\\}.\\]\n\nThe elements \\(r^a\\) are rotations, while the elements \\(r^a s\\) are reflections. Multiplication is given by\n\n\\[(r^a s^\\varepsilon)(r^b s^\\delta) = r^{a+(-1)^\\varepsilon b} s^{\\varepsilon+\\delta},\\]\n\nwhere the exponent of \\(r\\) is reduced modulo \\(n\\), and that of \\(s\\) modulo \\(2\\). Thus the calculations reduce to modular arithmetic together with a sign change.\n\nIn particular,\n\n\\[(r^a s)(r^b s)=r^{a-b}.\\]\n\nThe product of two reflections is therefore a rotation. Every reflection has order two, while the order of \\(r^a\\) is\n\n\\[\\frac{n}{\\gcd(n,a)}.\\]\n\nFor \\(n\\geq 3\\), the group is not an abelian group: \\(sr\\neq rs\\), since \\(r\\neq r^{-1}\\)."
    },
    {
      "heading": "Small examples",
      "text": "Triangle\n\nThe group \\(D_3\\) contains three rotations and three reflections. Its action on the three vertices realizes every permutation of those vertices, giving an isomorphism\n\n\\[D_3\\cong S_3,\\]\n\nwhere \\(S_3\\) is the symmetric group on three objects.\n\nSquare\n\nThe group \\(D_4\\) has eight elements:\n\n\\[e,r,r^2,r^3,s,rs,r^2s,r^3s.\\]\n\nIts rotations are through \\(0^\\circ\\), \\(90^\\circ\\), \\(180^\\circ\\), and \\(270^\\circ\\). Its four reflections are across the two diagonals and the two lines through midpoints of opposite edges.\n\nAlthough its action on vertices embeds \\(D_4\\) into \\(S_4\\), it does not realize every permutation of the four vertices: a square symmetry must preserve adjacency.\n\nLow-parameter conventions\n\nThe same presentation can be used for \\(n=1\\) and \\(n=2\\), even though ordinary nondegenerate regular polygons require at least three sides. It gives\n\n\\[D_1\\cong C_2, \\qquad D_2\\cong C_2\\times C_2,\\]\n\nwhere \\(C_m\\) denotes a cyclic group of order \\(m\\). These two groups are abelian. Some treatments exclude them from the term “dihedral group.”"
    },
    {
      "heading": "Algebraic structure",
      "text": "Rotations and the semidirect product\n\nThe rotations form a cyclic normal subgroup\n\n\\[\\langle r\\rangle\\cong C_n\\]\n\nof index two. Recording whether a symmetry preserves or reverses orientation defines a surjective homomorphism from \\(D_n\\) to \\(C_2\\), whose kernel is the rotation subgroup. Consequently, the quotient group is\n\n\\[D_n/\\langle r\\rangle\\cong C_2.\\]\n\nMore precisely,\n\n\\[D_n\\cong C_n\\rtimes C_2.\\]\n\nThis is a semidirect product in which the nonidentity element of \\(C_2\\) acts on \\(C_n\\) by inversion. For \\(n\\geq3\\), this action is nontrivial, so this construction is not the corresponding direct product.\n\nCenter\n\nThe center consists of elements commuting with every group element. For \\(n\\geq3\\),\n\n\\[Z(D_n)= \\begin{cases} \\{e\\}, & n\\text{ odd},\\\\[4pt] \\{e,r^{n/2}\\}, & n\\text{ even}. \\end{cases}\\]\n\nA rotation \\(r^a\\) commutes with a reflection precisely when \\(r^a=r^{-a}\\), or \\(2a\\equiv0\\pmod n\\). When \\(n\\) is even, the additional central element is the half-turn.\n\nCommutators and abelianization\n\nThe subgroup generated by all commutators is\n\n\\[[D_n,D_n]=\\langle r^2\\rangle.\\]\n\nIf \\(n\\) is odd, \\(r^2\\) generates the whole rotation subgroup. If \\(n\\) is even, it generates a subgroup of order \\(n/2\\). Therefore,\n\n\\[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}\\]\n\nSince the commutator subgroup is cyclic, and hence abelian, every finite dihedral group is solvable."
    },
    {
      "heading": "Subgroups and conjugacy",
      "text": "Every subgroup of \\(D_n\\) is either entirely rotational or generated by a rotation together with a reflection.\n\nThe rotational subgroups are\n\n\\[\\langle r^d\\rangle, \\qquad d\\mid n,\\]\n\nand have order \\(n/d\\). Every subgroup containing a reflection has the form\n\n\\[\\langle r^d,r^k s\\rangle, \\qquad d\\mid n,\\quad 0\\leq k<d,\\]\n\nand has order \\(2n/d\\). The cases \\(d=n\\) are the two-element reflection subgroups.\n\nConjugation of rotations satisfies\n\n\\[sr^a s=r^{-a}.\\]\n\nThus each rotational conjugacy class is \\(\\{r^a,r^{-a}\\}\\), except when these elements coincide.\n\nFor reflections,\n\n\\[r^k(r^a s)r^{-k}=r^{a+2k}s.\\]\n\nIt follows that:\n\n- when \\(n\\) is odd, all reflections belong to one conjugacy class;\n- when \\(n\\) is even, the reflections split into two conjugacy classes, distinguished by the parity of \\(a\\).\n\nGeometrically, the two classes in the even case correspond to axes through opposite vertices and axes through opposite edge midpoints."
    },
    {
      "heading": "Matrix and permutation realizations",
      "text": "Set \\(\\theta=2\\pi/n\\). The matrices\n\n\\[R= \\begin{pmatrix} \\cos\\theta&-\\sin\\theta\\\\ \\sin\\theta&\\cos\\theta \\end{pmatrix}, \\qquad S= \\begin{pmatrix} 1&0\\\\ 0&-1 \\end{pmatrix}\\]\n\nsatisfy\n\n\\[R^n=I,\\qquad S^2=I,\\qquad SRS=R^{-1}.\\]\n\nThey therefore give a faithful two-dimensional representation of \\(D_n\\). Both are orthogonal matrices. Their determinants distinguish rotations from reflections: rotations have determinant \\(1\\), and reflections have determinant \\(-1\\).\n\nThere is also a faithful group action on the vertices. Labeling the vertices by integers modulo \\(n\\), suitable generators act as\n\n\\[r(j)=j+1,\\qquad s(j)=-j.\\]\n\nThis identifies \\(D_n\\) with a subgroup of \\(S_n\\). For \\(n\\geq3\\), it is also the full automorphism group of the cycle graph with \\(n\\) vertices.\n\nIn complex representation theory, all irreducible representations of \\(D_n\\) have dimension one or two. For odd \\(n\\), there are two one-dimensional representations and \\((n-1)/2\\) two-dimensional representations. For even \\(n\\), there are four one-dimensional representations and \\(n/2-1\\) two-dimensional representations."
    },
    {
      "heading": "Infinite and generalized dihedral groups",
      "text": "The infinite dihedral group has presentation\n\n\\[D_\\infty=\\langle r,s\\mid s^2=e,\\ srs=r^{-1}\\rangle,\\]\n\nwith \\(r\\) of infinite order. It is isomorphic to\n\n\\[\\mathbb Z\\rtimes C_2,\\]\n\nwhere \\(C_2\\) acts on the integers by negation. A concrete realization consists of the isometries of the real line\n\n\\[x\\longmapsto x+k, \\qquad x\\longmapsto -x+k, \\qquad k\\in\\mathbb Z.\\]\n\nIt can also be presented as a group generated by two involutions with no further relations, namely the free product \\(C_2*C_2\\).\n\nMore generally, for any abelian group \\(A\\), its generalized dihedral group is\n\n\\[\\operatorname{Dih}(A)=A\\rtimes C_2,\\]\n\nwhere the nonidentity element of \\(C_2\\) sends each \\(a\\in A\\) to \\(a^{-1}\\). Ordinary finite dihedral groups arise when \\(A=C_n\\)."
    },
    {
      "heading": "Applications and related symmetry conventions",
      "text": "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 \\(2n\\) generally gives an incorrect answer. Burnside’s lemma supplies the appropriate orbit-counting formula.\n\nThey also provide standard examples in the study of graph symmetries, polynomial symmetries in Galois theory, and finite reflection groups. In the latter setting, \\(D_n\\) is the rank-two reflection group usually denoted \\(I_2(n)\\).\n\nA distinction is necessary when comparing planar geometry with molecular or crystallographic notation. In three-dimensional point-group notation, \\(D_n\\) commonly denotes a group of proper rotations: an \\(n\\)-fold rotation axis together with \\(n\\) 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."
    }
  ],
  "links": [
    "polygon",
    "group-theory",
    "isometry",
    "modular-arithmetic",
    "abelian-group",
    "isomorphism",
    "symmetric-group",
    "cyclic-group",
    "normal-subgroup",
    "homomorphism",
    "orthogonal-matrix",
    "determinant",
    "group-action",
    "representation-theory",
    "burnsides-lemma",
    "galois-theory"
  ],
  "sources": [],
  "license": "https://creativecommons.org/licenses/by/4.0/"
}