Burnside's lemma¶
The orbit-counting result that the number of orbits of a finite group action equals the average number of elements fixed by a group element.
Core Idea¶
For finite G acting on finite X, double-counting pairs in which g fixes x proves that the orbit count is |G| inverse times the sum of fixed-point counts, enabling enumeration up to symmetry. The stabilizer-orbit relation counts each object once for every group element fixing it; summing first by objects and then by transformations equates total stabilizer size with group size times orbit count. The abstraction is therefore identified by a declared carrier, a transformation or constraint over that carrier, and an invariant that tells an analyst whether the named structure is genuinely present.
Scope of Application¶
Burnside's lemma belongs to group actions and is useful where the analyst can specify the typed group actions carrier, including its objects, relations, parameters, conventions, evidence, boundary cases, and comparison targets, then evaluate the finite group and finite acted-on set, action law, orbit equivalence, fixed-point set for each group element, averaging denominator, finiteness assumptions and resulting orbit count are explicit. The scope is broad within that domain but bounded by the need for the finite group and finite acted-on set, action law, orbit equivalence, fixed-point set for each group element, averaging denominator, finiteness assumptions and resulting orbit count are explicit. The entry records a descriptive analytical identity; practical use requires the governing domain's evidence, standards, and safety obligations.
Clarity¶
The abstraction clarifies a crowded vocabulary by making the finite group and finite acted-on set, action law, orbit equivalence, fixed-point set for each group element, averaging denominator, finiteness assumptions and resulting orbit count are explicit the center of the account. A claim should name the carrier, the governing operation or relation, the applicable assumptions, and the recognition test. A bare label is insufficient because the name Burnside's lemma can be used for a formal identity, an implementation, or a neighboring result unless carrier and convention are stated.
Manages Complexity¶
Without the abstraction, an analyst must reason directly over many local details: the carrier roles, admissibility assumptions, competing conventions, derived invariants, boundary cases, and proof or validation obligations specific to Burnside's lemma. Burnside's lemma compresses them into the roles in the structural signature. That compression permits comparison across instances without erasing the variables that determine validity. It also exposes which details may be varied safely and which are constitutive.
Abstract Reasoning¶
- Identify the carrier. State what the elements, states, objects, or observations are: the typed group actions carrier, including its objects, relations, parameters, conventions, evidence, boundary cases, and comparison targets. Reject examples whose alleged carrier belongs to a different problem. 2. Lock the constitutive rule. Express the finite group and finite acted-on set, action law, orbit equivalence, fixed-point set for each group element, averaging denominator, finiteness assumptions and resulting orbit count are explicit independently of one notation or implementation.
Knowledge Transfer¶
Knowledge transfers strongly among subfields of group actions because they reuse the typed group actions carrier, including its objects, relations, parameters, conventions, evidence, boundary cases, and comparison targets, The stabilizer-orbit relation counts each object once for every group element fixing it; summing first by objects and then by transformations equates total stabilizer size with group size times orbit count., and type the carrier, state every parameter and convention in the definition, test that the finite group and finite acted-on set, action law, orbit equivalence, fixed-point set for each group element, averaging denominator, finiteness assumptions and resulting orbit count are explicit, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.
Relationships to Other Abstractions¶
Current abstraction Burnside's lemma Domain-specific
Parents (1) — more general patterns this builds on
-
Burnside's lemma is a kind of Symmetry Prime
The proposed strict upward parent is
prime:symmetry.
Hierarchy path (1) — routes to 1 parentless root
- Burnside's lemma → Symmetry
Neighborhood in Abstraction Space¶
Burnside's lemma sits in a crowded region of the domain-specific corpus (33rd percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.
Family — Group Actions & Quotient Geometry (14 abstractions)
Nearest neighbors
- Fundamental domain — 0.92
- Action groupoid — 0.91
- Conjugacy class — 0.91
- Permutation group — 0.91
- Real element — 0.89
Computed from structural-signature embeddings · 2026-09-08