Burnside's lemma, sometimes also called Burnside's counting theorem, the Cauchy–Frobenius lemma, or the orbit-counting theorem, is a result in group theory that is often useful in taking account of symmetry when counting mathematical objects. It was discovered by Augustin Louis Cauchy and Ferdinand Georg Frobenius, and became well-known after William Burnside quoted it. The result enumerates orbits of a symmetry group acting on some objects: that is, it counts distinct objects, considering objects symmetric to each other as the same; or counting distinct objects up to a symmetry equivalence relation; or counting only objects in canonical form. For example, in describing possible organic compounds of certain type, one considers them up to spatial rotation symmetry: different rotated drawings of a given molecule are chemically identical. (However a mirror reflection might give a different compound.)
Formally, let G be a finite group that acts on a set X. For each g in G, let Xg denote the set of elements in X that are fixed by g (left invariant by g): that is, Xg = . Burnside's lemma asserts the following formula for the number of orbits, denoted |X/G|:
Thus the number of orbits (a natural number or +∞) is equal to the average number of points fixed by an element of G. For an infinite group G, there is still a bijection:
There are 8 possible bit strings of length 3, but tying together the string ends gives only four distinct 2-colored necklaces of length 3, given by the canonical forms 000, 001, 011, 111: the other strings 100 and 010 are equivalent to 001 by rotation, while 110 and 101 are equivalent to 011. That is, rotation equivalence splits the set X of strings into four orbits:
The Burnside formula uses the number of rotations, which is 3 including the null rotation, and the number of bit strings left unchanged by each rotation. All 8 bit vectors are unchanged by the null rotation, and two (000 and 111) are unchanged by the other two rotations. Thus the number of orbits is:X=\{tt{000}\}\cup\{tt{001},tt{010},tt{100}\}\cup\{tt{011},tt{101},tt{110}\}\cup\{tt{111}\}.
For length 4, there are 16 possible bit strings; 4 rotations; the null rotation leaves all 16 strings unchanged; the 1-rotation and 3-rotation each leave two strings unchanged (0000 and 1111); the 2-rotation leaves 4 bit strings unchanged (0000, 0101, 1010, 1111). The number of distinct necklaces is thus:
6=\tfrac{1}{4}(16+2+4+2)
The general case of n bits and k colors is given by a necklace polynomial.
Burnside's lemma can compute the number of rotationally distinct colourings of the faces of a cube using three colours.
Let X be the set of 36 possible face color combinations that can be applied to a fixed cube, and let the rotation group G of the cube act on X by moving the colored faces: two colorings in X belong to the same orbit precisely when one is a rotation of the other. Rotationally distinct colorings correspond to group orbits, and can be found by counting the sizes of the fixed sets for the 24 elements of G, the colorings left unchanged by each rotation:
A detailed examination may be foundhere.
The average fixed-set size is thus:
|X/G|=
| 1 | |
| 24 |
\left(36+6 ⋅ 33+3 ⋅ 34+8 ⋅ 32+6 ⋅ 33\right)=57.
There are 57 rotationally distinct colourings of the faces of a cube in three colours. In general, the number of rotationally distinct colorings of the faces of a cube in n colors is:
| 1 | |
| 24 |
\left(n6+3n4+12n3+8n2\right).
In the proof of Burnside's lemma, the first step is to re-express the sum over the group elements g ∈ G as an equivalent sum over the set of elements x ∈ X:
\sumg|Xg|=\#\{(g,x)\inG x X\midg ⋅ x=x\}=\sumx|Gx|.
Here Xg = is the set of points of X fixed by g ∈ G, whereas Gx = is the stabilizer subgroup of G, symmetries that fix the point x ∈ X.)
The orbit-stabilizer theorem says that for each x ∈ X there is a natural bijection between the orbit G·x = and the set of left cosets G/Gx. Lagrange's theorem implies:
|G ⋅ x|=[G:Gx]=|G|/|Gx|.
The sum may therefore be rewritten as:
\sumx|Gx|=\sumx
| |G| | |
| |G ⋅ x| |
=|G|\sumx
| 1 | |
| |G ⋅ x| |
.
Writing X as the disjoint union of its orbits in X/G:
|G|\sumx
| 1 | |
| |G ⋅ x| |
= |G|\sumA\in\sumx\in
| 1 | |
| |A| |
= |G|\sumA\in1 = |G||X/G|.
Putting everything together gives the desired result:
\sumg|Xg|=|G| ⋅ |X/G|.
This is similar to the proof of the conjugacy class equation, which considers the conjugation action of G on itself: X = G and g.x = gxg−1, so that the stabilizer of x is centralizer: Gx = ZG(x).
Burnside's lemma counts distinct objects, but it does not construct them. In general, combinatorial generation with isomorph rejection considers the symmetries of g, on objects x. But instead of checking that g.x = x, it checks that g.x has not already been generated. One way to accomplish this is by checking that g.x is not lexicographically less than x, using the lexicographically least member of each equivalence class as the canonical form of the class.[1] Counting the objects generated with such a technique can verify that Burnside's lemma was correctly applied.
William Burnside stated and proved this lemma in his 1897 book on finite groups, attributing it to . But even prior to Frobenius, the formula was known to Cauchy in 1845. Consequently, this lemma is sometimes referred to as the lemma that is not Burnside's.[2] Misnaming scientific discoveries is referred to as Stigler's law of eponymy.