TheoremComplete

Group Actions and Sylow Theorems - Main Theorem

The orbit-stabilizer theorem is the fundamental counting principle for group actions, relating orbits and stabilizers through a beautiful equation.

TheoremOrbit-Stabilizer Theorem

Let GG be a finite group acting on a set XX, and let x∈Xx \in X. Then: ∣G∣=∣Orb(x)βˆ£β‹…βˆ£Stab(x)∣|G| = |\text{Orb}(x)| \cdot |\text{Stab}(x)|

Equivalently, the size of the orbit of xx equals the index of its stabilizer: ∣Orb(x)∣=[G:Stab(x)]=∣G∣∣Stab(x)∣|\text{Orb}(x)| = [G : \text{Stab}(x)] = \frac{|G|}{|\text{Stab}(x)|}

This theorem generalizes Lagrange's theorem. The orbit measures how many distinct positions xx can be moved to, while the stabilizer measures the symmetry fixing xx. Their product always equals ∣G∣|G|.

ProofProof Sketch

Define a map Ο•:G/Stab(x)β†’Orb(x)\phi: G/\text{Stab}(x) \to \text{Orb}(x) by Ο•(gβ‹…Stab(x))=gβ‹…x\phi(g \cdot \text{Stab}(x)) = g \cdot x. One can verify:

  1. Well-defined: If g1β‹…Stab(x)=g2β‹…Stab(x)g_1 \cdot \text{Stab}(x) = g_2 \cdot \text{Stab}(x), then g1βˆ’1g2∈Stab(x)g_1^{-1}g_2 \in \text{Stab}(x), so g1β‹…x=g2β‹…xg_1 \cdot x = g_2 \cdot x
  2. Injective: If g1β‹…x=g2β‹…xg_1 \cdot x = g_2 \cdot x, then g1βˆ’1g2β‹…x=xg_1^{-1}g_2 \cdot x = x, so g1βˆ’1g2∈Stab(x)g_1^{-1}g_2 \in \text{Stab}(x)
  3. Surjective: Every element of Orb(x)\text{Orb}(x) has form gβ‹…xg \cdot x for some g∈Gg \in G

Thus Ο•\phi is a bijection, giving ∣G/Stab(x)∣=∣Orb(x)∣|G/\text{Stab}(x)| = |\text{Orb}(x)|.

β– 
ExampleRotation Groups

Consider the rotation group SO(3)SO(3) acting on the unit sphere S2S^2. For any point p∈S2p \in S^2:

  • Orb(p)=S2\text{Orb}(p) = S^2 (the full sphereβ€”we can rotate pp to any other point)
  • Stab(p)β‰…SO(2)\text{Stab}(p) \cong SO(2) (rotations fixing pp are rotations about the axis through pp)

The orbit-stabilizer theorem gives: ∣SO(3)∣=∣S2βˆ£β‹…βˆ£SO(2)∣|SO(3)| = |S^2| \cdot |SO(2)| (informally, relating the "sizes" of these continuous groups).

TheoremCauchy's Theorem

If GG is a finite group and pp is a prime dividing ∣G∣|G|, then GG contains an element of order pp.

This follows from group actions: consider GG acting on GpG^p by cyclic permutation. Counting fixed points modulo pp yields the result.

Remark

The orbit-stabilizer theorem underpins most counting arguments in group theory. It appears in the class equation, Burnside's lemma, and the proof of the Sylow theorems. Understanding this single theorem unlocks a vast array of applications.

The interplay between orbits (global structure) and stabilizers (local symmetry) reveals deep connections between group theory and geometry.