A counting principle for a finite group action on a finite set that computes the number of distinct orbits as the average, over group elements, of the number of points fixed by each element.

Principle

Partitioning of the set into orbits under the group action and calculating orbit count by averaging fixed-point counts across the group.

Demonstration

Color the vertices of a square with two colours and let the dihedral group of order 8 act; Burnside's Lemma counts inequivalent colourings by averaging the number of colourings fixed by each symmetry (identity, rotations, reflections).

Misapplication

Using the lemma for infinite groups or infinite sets without ensuring finiteness, or averaging over a subset of group elements rather than the whole group, which yields incorrect orbit counts.

Consequence

Provides a straightforward route to count non-equivalent configurations under symmetry; it is the basic case from which Polya enumeration and character-theoretic counting generalizations arise.

Reversal

Instead of averaging fixed-point counts to get orbit number, one could sum orbit sizes to recover the total number of elements; this inversion emphasizes stabilizers rather than fixed points.

Boundary

Applies only when the acting group and the set are finite and the action is well-defined. It does not directly handle weighted colourings, infinite or continuous symmetry groups, or actions where fixed-point sets are not finite.

Semantic Tension

Tension arises with Polya's enumeration theorem and character-theoretic methods: Burnside gives a concrete averaging formula, while Polya frames similar counts using cycle indices and generating functions for labelled structures.

Synthesis

Burnside's Lemma is the finite-group action identity that ties together orbits and fixed points: by averaging fixed-point counts one obtains the invariant count of distinct orbits, a practical combinatorial tool and the starting point for broader symmetry-counting methods.