Orbit–Stabilizer Theorem. Let GG be a acting on a set XX via a . For xXx \in X, let Orb(x)\operatorname{Orb}(x) be the of xx and let Stab(x)\operatorname{Stab}(x) be the of xx. Then the map

G/Stab(x)Orb(x),gStab(x)gx,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)]andG=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.