ProofComplete

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

Theorem8.3Orbit-Stabilizer Theorem

Let GG be a finite group acting on a set XX. For any x∈Xx \in X: ∣G∣=∣Orb⁑(x)βˆ£β‹…βˆ£Stab⁑(x)∣.|G| = |\operatorname{Orb}(x)| \cdot |\operatorname{Stab}(x)|.


Proof

Proof

Define the map Ο•:G/Stab⁑(x)β†’Orb⁑(x)\phi: G/\operatorname{Stab}(x) \to \operatorname{Orb}(x) by Ο•(gβ‹…Stab⁑(x))=gβ‹…x\phi(g \cdot \operatorname{Stab}(x)) = g \cdot x.

Well-defined: If g1Stab⁑(x)=g2Stab⁑(x)g_1 \operatorname{Stab}(x) = g_2 \operatorname{Stab}(x), then g2βˆ’1g1∈Stab⁑(x)g_2^{-1}g_1 \in \operatorname{Stab}(x), so g2βˆ’1g1β‹…x=xg_2^{-1}g_1 \cdot x = x, giving g1β‹…x=g2β‹…xg_1 \cdot x = g_2 \cdot x.

Injective: If g1β‹…x=g2β‹…xg_1 \cdot x = g_2 \cdot x, then g2βˆ’1g1β‹…x=xg_2^{-1}g_1 \cdot x = x, so g2βˆ’1g1∈Stab⁑(x)g_2^{-1}g_1 \in \operatorname{Stab}(x), and g1Stab⁑(x)=g2Stab⁑(x)g_1 \operatorname{Stab}(x) = g_2 \operatorname{Stab}(x).

Surjective: For any y∈Orb⁑(x)y \in \operatorname{Orb}(x), there exists g∈Gg \in G with gβ‹…x=yg \cdot x = y, and Ο•(gStab⁑(x))=y\phi(g \operatorname{Stab}(x)) = y.

Therefore Ο•\phi is a bijection, so ∣Orb⁑(x)∣=∣G/Stab⁑(x)∣=∣G∣/∣Stab⁑(x)∣|\operatorname{Orb}(x)| = |G/\operatorname{Stab}(x)| = |G|/|\operatorname{Stab}(x)| by Lagrange's theorem. β–‘\square

β– 

Applications

ExampleRotations of the Tetrahedron

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 12/3=412/3 = 4, 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 12/2=612/2 = 6, matching the 6 edges.

RemarkGeneralizations

The orbit-stabilizer theorem generalizes in several directions:

  1. Burnside's lemma follows by summing 1/∣Orb⁑(x)∣1/|\operatorname{Orb}(x)| over all xx.
  2. For continuous groups, the theorem becomes dim⁑G=dim⁑(orbit)+dim⁑(stabilizer)\dim G = \dim(\text{orbit}) + \dim(\text{stabilizer}).
  3. In the context of categories, it generalizes to the groupoid cardinality formula.
ExampleConjugacy Classes as Orbits

A group GG acts on itself by conjugation: gβ‹…x=gxgβˆ’1g \cdot x = gxg^{-1}. The orbits are the conjugacy classes, and Stab⁑(x)=CG(x)\operatorname{Stab}(x) = C_G(x), the centralizer of xx. By the orbit-stabilizer theorem: ∣conjugacyΒ classΒ ofΒ x∣=∣G∣∣CG(x)∣=[G:CG(x)].|\text{conjugacy class of } x| = \frac{|G|}{|C_G(x)|} = [G : C_G(x)]. This is the basis of the class equation: ∣G∣=∣Z(G)∣+βˆ‘i[G:CG(xi)]|G| = |Z(G)| + \sum_{i} [G : C_G(x_i)], summing over representatives of non-central conjugacy classes.

RemarkCounting Orbits with Weights

The orbit-stabilizer theorem leads to the weighted Burnside lemma: if each element x∈Xx \in X has weight w(x)w(x) constant on orbits, the total weight of orbits is: βˆ‘orbitsw=1∣Gβˆ£βˆ‘g∈Gβˆ‘x∈Xgβ‹…x=xw(x).\sum_{\text{orbits}} w = \frac{1}{|G|} \sum_{g \in G} \sum_{\substack{x \in X \\ g \cdot x = x}} w(x). This is the foundation for the PΓ³lya Enumeration Theorem.