Burnside's Lemma is the habit of counting objects up to symmetry by averaging the fixed points of group actions. In contest math, that habit turns a crowded setup into a relation the student can test, bound, count, or compute. MathGrit teaches it as a recognizable signal, a deliberate move, and a final translation back to the original question.
When a finite group $G$ acts on a finite set $X$, the number of orbits (distinct objects up to the symmetry) equals the average, over all group elements $g$, of how many objects $g$ fixes.
Why It Works
1
Let $X^g = \{x \in X : g\cdot x = x\}$ be the fixed points of $g$, and count the pairs $(g,x)$ with $g\cdot x = x$ in two ways (double counting).
2
Summing over $g$ first gives $\sum_{g\in G} |X^g|$.
3
Summing over $x$ first gives $\sum_{x\in X} |G_x|$, where $G_x$ is the stabilizer of $x$; by the Orbit–Stabilizer theorem $|G_x| = |G|/|\,Gx\,|$ for the orbit $Gx$.
4
Each orbit of size $m$ contributes $m$ points, each with stabilizer of size $|G|/m$, totaling $|G|$ per orbit; so $\sum_x |G_x| = |G|\cdot(\text{number of orbits})$. Equating the two counts and dividing by $|G|$ gives the formula.
Worked Examples
Example 1
How many distinct ways can the $4$ corners of a square be colored with $3$ colors, counting rotations of the square as the same coloring?
1
The group is the cyclic rotation group $G=\{e, r, r^2, r^3\}$ of order $4$; $X$ is the $3^4 = 81$ colorings.
2
Count fixed colorings $|X^g|$ for each rotation. Identity $e$ fixes all $81$.
3
Rotation $r$ (by $90^\circ$) and $r^3$ each force all four corners equal — one $4$-cycle — giving $3$ fixed colorings apiece. Rotation $r^2$ (by $180^\circ$) pairs the corners into two $2$-cycles, giving $3^2 = 9$.
How many distinct necklaces of $6$ beads using $2$ colors are there, where two necklaces are the same if one is a rotation OR a reflection of the other (the dihedral group $D_6$ of order $12$)?
1
Rotations (cyclic part): identity fixes $2^6 = 64$; the two rotations by $60^\circ,300^\circ$ are single $6$-cycles, fixing $2^1 = 2$ each; the two by $120^\circ,240^\circ$ are two $3$-cycles, fixing $2^2 = 4$ each; the $180^\circ$ rotation is three $2$-cycles, fixing $2^3 = 8$.
2
Reflections: the $3$ axes through opposite beads each fix $2$ beads and swap the other $2$ pairs, giving $2^{2+2} = 16$ each; the $3$ axes through opposite edge-midpoints split all $6$ beads into $3$ swapped pairs, giving $2^3 = 8$ each.
How many distinct ways can the $6$ faces of a cube be colored with $3$ colors, where rotations of the cube are considered the same? (The rotation group has order $24$.)
1
Classify the $24$ rotations by cycle structure on the $6$ faces. Identity: $1$ element, $6$ fixed-face cycles, $3^6 = 729$ colorings.
2
Face-axis rotations: $\pm 90^\circ$ about the $3$ face-axes ($6$ elements) fix $2$ faces and form one $4$-cycle of the other $4$, giving $3^{2+1} = 27$ each; $180^\circ$ about face-axes ($3$ elements) fix $2$ faces and two $2$-cycles, giving $3^{2+2} = 81$ each.
3
Vertex-axis rotations: $\pm 120^\circ$ about the $4$ space diagonals ($8$ elements) form two $3$-cycles of faces, giving $3^2 = 9$ each. Edge-axis rotations: $180^\circ$ about the $6$ edge-axes ($6$ elements) form three $2$-cycles, giving $3^3 = 27$ each.
Burnside is the orbit-count corollary of the orbit–stabilizer theorem; its refinement, Pólya enumeration, tracks colors with a generating-function 'cycle index' so you can count colorings with a prescribed color-multiset, not just totals.
It is the standard tool for AIME/olympiad 'count up to symmetry' problems — necklaces, bracelets, colored polyhedra, and equivalence under a group action.
Pitfall: you must use the EXACT symmetry group the problem intends. Necklaces that may be flipped use the dihedral group ($2n$ elements), not just rotations ($n$); colored cubes use the $24$ rotations, but if mirror images count as identical you need the full $48$-element group. Wrong group, wrong answer.
Spot the Signal
Look for problems where the key step is counting objects up to symmetry by averaging the fixed points of group actions.
You can describe the hard part as counting objects up to symmetry by averaging the fixed points of group actions, but a direct attack starts producing clutter.
The problem rewards preserving structure instead of expanding, listing, or guessing too early.
Learn the Move
Start by identify the olympiad structure that calls for burnside's lemma, then rewrite the givens around it.
Name the relation that makes Burnside's Lemma legal before doing computation.
Use the new relation to replace the messiest part of the problem with a cleaner one.
Translate the result back to the quantity the problem actually asks for.
Avoid These Traps
Do not use Burnside's Lemma just because the surface looks familiar; verify the required condition first.
Applying Burnside's Lemma because it sounds relevant, without checking the trigger first.
Stopping after spotting the technique instead of finishing the calculation or proof.
MathGrit Coach Note
Let burnside's lemma reveal the structural theorem; then compute only what remains.
Try it on:
Practice a contest problem where the key step is counting objects up to symmetry by averaging the fixed points of group actions.