---
tag: 0Z47M1B2VS
kind: statement
role: theorem
name: Burnside's lemma
aliases: [orbit-counting-theorem, cauchy-frobenius-lemma]
msc: [20B05, "05E18"]
uses: [08JF1K4DW1, 00F2JFA41J, 0S19CWFZM2]
sources:
  - url: https://en.wikipedia.org/wiki/Burnside's_lemma
    locator: Statement
  - url: https://en.wikipedia.org/wiki/Burnside's_lemma
    locator: 'History: the lemma that is not Burnside''s'
same_as:
  wikidata: Q1330377
  wikipedia: Burnside's lemma
---

## Statement

Let a finite [[group|G5S1M9]] $G$ [[act|0WCY42EV9V]] on a finite set $X$.
For $g \in G$, let $X^g = \{x \in X : g \cdot x = x\}$.
Then the number of [[orbits|0YQPZB5Q1G]] is $|X/G| = \frac{1}{|G|} \sum_{g \in G} |X^g|$.

## Remarks

The proof counts the pairs $(g, x)$ with $g \cdot x = x$ in two ways, and uses $|G_x| = |G| / |G \cdot x|$.
For example, the rotation group $\mathbb{Z}/4\mathbb{Z}$ of a square acts on the $2^4 = 16$ colourings of the corners with two colours.
The fixed colourings number $16$, $2$, $4$ and $2$, so there are $(16 + 2 + 4 + 2)/4 = 6$ colourings up to rotation.

## History

William Burnside stated and proved the lemma in his 1897 book on finite groups, and he attributed it to Frobenius, 1887.
Cauchy already knew the formula in 1845.
For this reason, the lemma is sometimes called "the lemma that is not Burnside's".

## Explanations

### L1 human

The number of orbits is the average number of points that a group element fixes.
This lets you count objects up to symmetry without listing them.
You count the fixed objects for each symmetry, add, and divide by the number of symmetries.