{
  "id": "burnsides-lemma",
  "title": "Burnside's lemma",
  "lang": "en",
  "source_lang": "en",
  "summary": "Burnside's lemma counts symmetry classes of objects by averaging the number of objects fixed by each element of a finite group.",
  "category": "mathematics",
  "subcategory": "algebra",
  "type": "concept",
  "aliases": [
    "Burnside's counting lemma",
    "Cauchy–Frobenius lemma",
    "Orbit-counting lemma"
  ],
  "generated_at": "2026-11-05",
  "model": "pro/gpt-6.1-sol",
  "url": "https://aiwiki.page/en/burnsides-lemma/",
  "translations": {
    "zh-Hans": {
      "url": "https://aiwiki.page/zh/burnsides-lemma/",
      "json": "https://aiwiki.page/zh/burnsides-lemma.json"
    }
  },
  "sections": [
    {
      "heading": "",
      "text": "Burnside's lemma is a theorem in group theory and combinatorics that counts objects up to symmetry. It states that the number of orbits of a finite group acting on a finite set equals the average number of elements of the set fixed by a group element. The lemma replaces the potentially difficult task of identifying all symmetry classes with a collection of fixed-point counts."
    },
    {
      "heading": "Statement",
      "text": "Let a finite group \\(G\\) act on a finite set \\(X\\). For each \\(g\\in G\\), define its fixed-point set by\n\n\\[\\operatorname{Fix}_X(g)=\\{x\\in X:g\\cdot x=x\\}.\\]\n\nThe orbit of \\(x\\in X\\) is\n\n\\[G\\cdot x=\\{g\\cdot x:g\\in G\\}.\\]\n\nOrbits are the equivalence classes under the relation that two elements are equivalent when some group element carries one to the other. Write \\(X/G\\) for the set of orbits, and use vertical bars to denote the cardinality of a finite set.\n\nBurnside's lemma states that\n\n\\[\\boxed{ |X/G|=\\frac{1}{|G|}\\sum_{g\\in G}|\\operatorname{Fix}_X(g)| }.\\]\n\nThus, although individual fixed-point counts may vary considerably, their average is always a nonnegative integer.\n\nIn counting problems, \\(X\\) is usually a set of labeled configurations, while \\(G\\) consists of the symmetries that are to be ignored. An orbit then represents one configuration “up to symmetry.”"
    },
    {
      "heading": "Proof by double counting",
      "text": "Consider the set\n\n\\[S=\\{(g,x)\\in G\\times X:g\\cdot x=x\\}.\\]\n\nCounting these pairs first by their group coordinate gives\n\n\\[|S|=\\sum_{g\\in G}|\\operatorname{Fix}_X(g)|.\\]\n\nFor each \\(x\\in X\\), its stabilizer is the subgroup\n\n\\[G_x=\\{g\\in G:g\\cdot x=x\\}.\\]\n\nCounting the same pairs by their set coordinate gives\n\n\\[|S|=\\sum_{x\\in X}|G_x|.\\]\n\nThe orbit–stabilizer theorem states that\n\n\\[|G\\cdot x|\\,|G_x|=|G|.\\]\n\nConsequently, for any orbit \\(O\\), each \\(x\\in O\\) has stabilizer size \\(|G|/|O|\\), so\n\n\\[\\sum_{x\\in O}|G_x| = |O|\\frac{|G|}{|O|} = |G|.\\]\n\nEvery orbit therefore contributes exactly \\(|G|\\) to the sum. It follows that\n\n\\[\\sum_{g\\in G}|\\operatorname{Fix}_X(g)| = |G|\\,|X/G|,\\]\n\nwhich proves the formula.\n\nThis argument also explains why simply dividing \\(|X|\\) by \\(|G|\\) generally fails: objects with different amounts of symmetry have orbits of different sizes."
    },
    {
      "heading": "Example: coloring the vertices of a square",
      "text": "Suppose each vertex of a square is colored black or white. There are \\(2^4=16\\) colorings before identifying any symmetries.\n\nRotations only\n\nTake \\(G\\) to be the four rotations of the square.\n\nRotation | Condition for a coloring to be fixed | Fixed colorings\n\\(0^\\circ\\) | No restriction | \\(16\\)\n\\(90^\\circ\\) | All four vertices have the same color | \\(2\\)\n\\(180^\\circ\\) | Opposite vertices have the same color | \\(4\\)\n\\(270^\\circ\\) | All four vertices have the same color | \\(2\\)\n\nBurnside's lemma gives\n\n\\[\\frac{16+2+4+2}{4}=6\\]\n\ncolorings up to rotation.\n\nThe six classes are represented by an all-white square, an all-black square, one black vertex, one white vertex, two adjacent black vertices, and two opposite black vertices.\n\nRotations and reflections\n\nIf mirror images are also identified, the acting group is the dihedral group of the square, of order eight.\n\nThere are four additional symmetries:\n\n- Two reflections through opposite vertices. Each fixes two vertices and exchanges the other two, so each fixes \\(2^3=8\\) colorings.\n- Two reflections through midpoints of opposite edges. Each exchanges two pairs of vertices, so each fixes \\(2^2=4\\) colorings.\n\nThe number of classes becomes\n\n\\[\\frac{16+2+4+2+2(8)+2(4)}{8}=6.\\]\n\nThe equality with the rotation-only count is particular to this example: every reflected binary coloring of the square is already rotation-equivalent to the original. With three available colors, the corresponding counts are \\(24\\) under rotations and \\(21\\) under rotations and reflections."
    },
    {
      "heading": "Counting colorings through permutation cycles",
      "text": "A common application begins with a finite set \\(P\\) of positions on which \\(G\\) acts. A coloring with \\(q\\) distinguishable colors is a function\n\n\\[f:P\\longrightarrow \\{1,\\ldots,q\\}.\\]\n\nThe group acts on colorings by\n\n\\[(g\\cdot f)(p)=f(g^{-1}\\cdot p).\\]\n\nEach group element induces a permutation of \\(P\\). If this permutation has \\(c(g)\\) cycles, including cycles of length one, then a coloring is fixed precisely when it is constant on each cycle. Each cycle can independently receive any of the \\(q\\) colors, giving\n\n\\[|\\operatorname{Fix}(g)|=q^{c(g)}.\\]\n\nHence\n\n\\[\\text{number of coloring classes} = \\frac{1}{|G|}\\sum_{g\\in G}q^{c(g)}.\\]\n\nFor example, consider \\(n\\) positions arranged on a circle, identifying colorings under rotations but not reflections. Rotation by \\(k\\) positions has \\(\\gcd(n,k)\\) cycles, where \\(\\gcd\\) denotes the greatest common divisor. The number of such necklaces is therefore\n\n\\[N(n,q)=\\frac{1}{n}\\sum_{k=0}^{n-1}q^{\\gcd(n,k)},\\]\n\nwith \\(\\gcd(n,0)=n\\).\n\nThis counts all necklaces, including those whose color patterns repeat after fewer than \\(n\\) positions."
    },
    {
      "heading": "Relation to Pólya enumeration",
      "text": "Burnside's lemma underlies Pólya's enumeration theorem, which records more detailed information about colorings.\n\nIf \\(a_i(g)\\) is the number of cycles of length \\(i\\) in the permutation induced by \\(g\\), the cycle index of the action is the polynomial\n\n\\[Z_G(s_1,s_2,\\ldots) = \\frac{1}{|G|} \\sum_{g\\in G}\\prod_{i\\geq 1}s_i^{a_i(g)}.\\]\n\nOnly finitely many factors occur for a finite position set.\n\nSubstituting \\(s_i=q\\) for every \\(i\\) recovers the ordinary coloring count. More informative substitutions produce a generating function that records how many positions receive each color. For colors represented by variables \\(x_1,\\ldots,x_q\\), the substitution\n\n\\[s_i=x_1^i+\\cdots+x_q^i\\]\n\nyields coefficients counting symmetry classes with specified color multiplicities."
    },
    {
      "heading": "Probabilistic and linear-algebraic interpretations",
      "text": "If \\(g\\) is selected uniformly from \\(G\\), then Burnside's lemma can be written using expected value as\n\n\\[|X/G|=\\mathbb{E}\\!\\left[|\\operatorname{Fix}_X(g)|\\right].\\]\n\nThis averages over group elements, not over objects or orbits.\n\nThere is also an interpretation in representation theory. Form a real vector space with basis \\(\\{e_x:x\\in X\\}\\). Each group element acts by a permutation matrix \\(\\rho(g)\\), whose trace is\n\n\\[\\operatorname{tr}\\rho(g)=|\\operatorname{Fix}_X(g)|.\\]\n\nThe averaging operator\n\n\\[P=\\frac{1}{|G|}\\sum_{g\\in G}\\rho(g)\\]\n\nis a projection onto the subspace of invariant vectors. That subspace has one basis vector for each orbit, obtained by summing the basis elements belonging to that orbit. Thus its dimension, and therefore the trace of \\(P\\), is \\(|X/G|\\). Taking traces gives Burnside's formula."
    },
    {
      "heading": "Applications and limitations",
      "text": "The lemma is used to count necklaces, bracelets, arrangements on polygons and polyhedra, unlabeled structures, and other configurations whose descriptions contain redundant labels. In graph theory, for example, the symmetric group on a vertex set acts on labeled graphs by relabeling vertices; its orbits are graph isomorphism classes.\n\nCorrect application requires specifying both the objects and their allowed symmetries:\n\n- Rotations and reflections give different equivalence relations. Neither should be included unless the counting problem identifies configurations related by it.\n- Permuting positions does not automatically permute colors. Identifying color names requires an additional action.\n- Constraints must be preserved by the action. If only configurations satisfying a restriction are allowed, the chosen group must map valid configurations to valid configurations.\n- Fixed-point counts remain the main computational task. Averaging is simple, but determining which objects a symmetry fixes can be difficult.\n\nIf the action is free, meaning that only the identity fixes any element, the formula reduces to\n\n\\[|X/G|=\\frac{|X|}{|G|}.\\]\n\nThe general lemma accounts for the nontrivial stabilizers that prevent this division rule from working in other cases.\n\nThe standard numerical formula assumes that both \\(G\\) and \\(X\\) are finite. Infinite actions require additional hypotheses or different formulations; ordinary finite averaging cannot simply be applied unchanged."
    },
    {
      "heading": "Historical attribution",
      "text": "The lemma is named after William Burnside, who included it in his 1897 book Theory of Groups of Finite Order. The result predates that publication: it appeared in work of Augustin-Louis Cauchy and Ferdinand Georg Frobenius. The alternative name Cauchy–Frobenius lemma reflects that earlier history, while orbit-counting lemma describes its mathematical content."
    }
  ],
  "links": [
    "group-theory",
    "combinatorics",
    "group-action",
    "equivalence-class",
    "cardinality",
    "integer",
    "dihedral-group",
    "permutation",
    "greatest-common-divisor",
    "polynomial",
    "generating-function",
    "expected-value",
    "representation-theory",
    "vector-space",
    "matrix-trace",
    "graph-theory",
    "symmetric-group",
    "augustin-louis-cauchy"
  ],
  "sources": [],
  "license": "https://creativecommons.org/licenses/by/4.0/"
}