Math 2.0

Group theory and generalizations Proof

Proof of Burnside's lemma

Proof

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:

∑g∈G∣Xg∣=#{(g,x)∈G×X∣g⋅x=x}=∑x∈X∣Gx∣.\sum_{g \in G}|X^g| = \#\{(g,x)\in G\times X \mid g \cdot x = x\} = \sum_{x \in X} |G_x|.

Here Xg={x∈X:g⋅x=x}X^g = \{ x \in X : g\cdot x = x\} is the set of points of XX fixed by the element gg of GG, whereas Gx={g∈G:g⋅x=x}G_x = \{ g \in G : g\cdot x = x\} is the stabilizer subgroup of GG, consisting of those symmetries that fix the point x∈Xx \in X.

The orbit-stabilizer theorem says that for each x∈Xx \in X there is a natural bijection between the orbit G⋅x={g⋅x:g∈G}G \cdot x = \{ g\cdot x : g \in G\} and the set of left cosets G/GxG / G_x. Lagrange's theorem implies that

∣G⋅x∣=[G:Gx]=∣G∣/∣Gx∣.|G \cdot x| = [G : G_x] = |G| / |G_x|.

The sum may therefore be rewritten as

∑x∈X∣Gx∣=∑x∈X∣G∣∣G⋅x∣=∣G∣∑x∈X1∣G⋅x∣.\sum_{x \in X} |G_x| = \sum_{x \in X} \frac{|G|}{|G \cdot x|} = |G| \sum_{x \in X}\frac{1}{|G \cdot x|}.

Writing XX as the disjoint union of its orbits in X/GX/G gives

∣G∣∑x∈X1∣G⋅x∣=∣G∣∑A∈X/G∑x∈A1∣A∣=∣G∣∑A∈X/G1=∣G∣⋅∣X/G∣.|G| \sum_{x \in X}\frac{1}{|G \cdot x|} = |G| \sum_{A\in X/G} \sum_{x\in A} \frac{1}{|A|} = |G| \sum_{A\in X/G} 1 = |G|\cdot|X/G|.

Putting everything together gives the desired result:

∑g∈G∣Xg∣=∣G∣⋅∣X/G∣.\sum_{g \in G}|X^g| = |G| \cdot |X/G|.

This is similar to the proof of the conjugacy class equation, which considers the conjugation action of GG on itself, that is, it is the case X=GX = G and g⋅x=gxg−1g \cdot x = gxg^{-1}, so that the stabilizer of xx is the centralizer Gx=ZG(x)G_x = Z_G(x).

Where this leads

1 page builds on this one.

Further reading

  1. Wikipedia, page 251900, revision 1374573038, Burnside's lemma, section Proof. adopted
About this page
Tag3G6P3T63XY
URIm2://3G6P3T63XY
Kindproof
WritingW0 stub
MSC20B05, 05E18
ProvesBurnside's lemma
Changed4 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • edge uses out: each node that the argument needs (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.