The orbit–stabilizer theorem
ProvedFamousTheorems.orbit_stabilizerThe orbit–stabilizer theorem.
For a group acting on a set and a point , there is a bijection
between the orbit of and the coset space of its stabilizer.
For finite this gives the counting form : the orbit size always divides the group order. That single corollary drives a large part of finite group theory — the class equation (acting by conjugation), Burnside's lemma, Cauchy's theorem, and the Sylow theorems all come from applying it to a well-chosen action.
The bijection itself is canonical and requires no finiteness: is well defined precisely because is the set of elements fixing , and injective for the same reason. It is a -equivariant bijection, which is why every transitive -set is isomorphic to a coset space.
Formalization note. MulAction.orbit G b and MulAction.stabilizer G b are the orbit
and the stabilizer subgroup; G ⧸ H here is the quotient by a not-necessarily-normal
subgroup, so the target is a set rather than a group, and the equivalence is data wrapped in
Nonempty. The result is Mathlib's MulAction.orbitEquivQuotientStabilizer.
import Mathlib
namespace FamousTheorems
open Filter Set Topology
theorem orbit_stabilizer {G : Type*} [Group G] {X : Type*} [MulAction G X] (b : X) :
Nonempty (MulAction.orbit G b ≃ G ⧸ MulAction.stabilizer G b) := by sorry
end FamousTheorems