Proof of the Orbit-Stabilizer Theorem
The orbit-stabilizer theorem is a fundamental result connecting the size of a group to the orbit and stabilizer of an element under a group action. It is the key ingredient in proving Burnside's lemma.
Statement
Let be a finite group acting on a set . For any :
Proof
Define the map by .
Well-defined: If , then , so , giving .
Injective: If , then , so , and .
Surjective: For any , there exists with , and .
Therefore is a bijection, so by Lagrange's theorem.
Applications
The rotation group of the regular tetrahedron has order 12. A face of the tetrahedron has stabilizer of order 3 (the three rotations fixing that face). By the orbit-stabilizer theorem, the face orbit has size , confirming that all 4 faces form a single orbit. Similarly, an edge has stabilizer of order 2 (identity and the rotation flipping the edge), so the edge orbit has size , matching the 6 edges.
The orbit-stabilizer theorem generalizes in several directions:
- Burnside's lemma follows by summing over all .
- For continuous groups, the theorem becomes .
- In the context of categories, it generalizes to the groupoid cardinality formula.
A group acts on itself by conjugation: . The orbits are the conjugacy classes, and , the centralizer of . By the orbit-stabilizer theorem: This is the basis of the class equation: , summing over representatives of non-central conjugacy classes.
The orbit-stabilizer theorem leads to the weighted Burnside lemma: if each element has weight constant on orbits, the total weight of orbits is: This is the foundation for the PΓ³lya Enumeration Theorem.