TheoremBase

The Orbit–Stabilizer Theorem

For a group acting on a set, stabilizers are subgroups, the orbits partition the set, the left cosets of a stabilizer correspond bijectively to the points of the orbit, and for a finite group the order is the size of the orbit times the order of the stabilizer.

Statement

In the setting of Groups: Standing Notation, let GG be a group, let XX be a set, let (g,y)↦g⋅y(g,y)\mapsto g\cdot y be an action of GG on XX, and let x∈Xx\in X.

Stabilizers are subgroups. GxG_{x} is a subgroup of GG.

Each point lies in its orbit. y∈Gyy\in Gy for every y∈Xy\in X.

Equal orbits. For all y,z∈Xy,z\in X, z∈Gyz\in Gy if and only if Gz=GyGz=Gy.

Distinct orbits are disjoint. For all y,z∈Xy,z\in X with Gy≠GzGy\neq Gz, Gy∩Gz=∅Gy\cap Gz=\emptyset.

Orbit and cosets of the stabilizer. Let G/GxG/G_{x} be the set of left cosets of GxG_{x}, a subgroup by (i). There is exactly one function φ\varphi from G/GxG/G_{x} to GxGx with

φ(gGx)=g⋅xfor every g∈G,\varphi(gG_{x})=g\cdot x\qquad\text{for every }g\in G,

and φ\varphi is a bijection.

Counting. If GG is finite, then GxGx is finite and, with #\# the number of elements and ∣Gx∣|G_{x}| the order of the subgroup GxG_{x} of (i),

∣G∣=#(Gx)⋅∣Gx∣;|G|=\#(Gx)\cdot|G_{x}|;

in particular #(Gx)∣∣G∣\#(Gx)\mid|G|, with ∣\mid as in Divisibility of Integers (i).

Proofs

Log in to submit a proof.

Loading...

Citations

Loading…

Dependencies

Loading…

Related

0 relations

Curated associations between results. These are editable and subjective — they do not replace the dependency graph, which is derived from the references in the text.

No relations recorded yet.

Comments

Log in to comment.

Loading…