Orbit–Stabilizer Theorem. Let GG be a acting on a set XX. For x∈Xx\in X, let Orb⁡(x)\operatorname{Orb}(x) be its and Stab⁡(x)\operatorname{Stab}(x) its . Then the map

G/Stab⁡(x)→Orb⁡(x),g Stab⁡(x)↦g⋅x,G/\operatorname{Stab}(x) \to \operatorname{Orb}(x), \qquad g\,\operatorname{Stab}(x) \mapsto g\cdot x,

is a bijection. In particular, if GG is finite then

∣Orb⁡(x)∣=[G:Stab⁡(x)]and∣G∣=∣Orb⁡(x)∣⋅∣Stab⁡(x)∣.|\operatorname{Orb}(x)| = [G:\operatorname{Stab}(x)] \quad \text{and} \quad |G| = |\operatorname{Orb}(x)|\cdot |\operatorname{Stab}(x)|.
Remarks

This theorem converts problems about orbits into problems about and . It is the main input for the and many counting arguments.