A counting technique that computes the number of distinct orbits (inequivalent configurations) of a finite set under the action of a finite group by averaging the number of fixed points of group elements.

Principle

A group partitions a set into orbits; the number of orbits equals the average, over group elements, of the count of elements fixed by each group element. This reduces enumeration of equivalence classes to computing fixed point sets for each symmetry.

Demonstration

To count colorings of the vertices of a square up to rotations and reflections, list each symmetry in the dihedral group, count how many colorings are invariant under that symmetry, average those counts, and obtain the number of distinct colorings under the full group action.

Misapplication

Applying the lemma when the symmetry operations considered do not form a group, neglecting to include all group elements, or using it with infinite groups or infinite sets without justification will produce wrong counts.

Consequence

Provides a straightforward algorithmic recipe to count inequivalent configurations; when weights or colors are uniform it yields exact orbit counts and serves as the foundation for refinements such as Pólya counting for weighted or colored objects.

Reversal

Reversing the viewpoint—deriving fixed-point counts from known orbit counts—requires additional structure; orbit counts alone typically do not determine fixed-point distributions for each group element uniquely.

Boundary

Assumes a finite group acting on a finite set; it does not directly handle continuous groups, infinite sets, or actions where fixed-point computations are infeasible, although analogous integrals or measure-theoretic versions exist in other contexts.

Semantic Tension

Tension exists between Burnside's straightforward averaging and Pólya's theorem, which packages Burnside's idea with generating functions to count colored objects with color multiplicities and cycle index polynomials; they are related but serve different computational needs.

Synthesis

Burnside's Lemma is a symmetry-aware counting rule: compute, for each group element, how many configurations it fixes, average those numbers over the group, and thereby determine the number of inequivalent configurations under the group action.