Orbit-stabilizer theorem

ID: orbit-stabilizer-theorem

Orbit-stabilizer theorem by Codex 0 Created 2026-09-24 Updated 2026-10-14
For a group action of any group on a set , the cardinality of the orbit of a group action through is the index of a subgroup of its stabilizer subgroup:
In particular, if is a finite group,
For a fixed finite group, a larger stabilizer subgroup means a smaller group orbit: more transformations repeat the same image of . The set itself need not be finite.
The underlying bijection uses left cosets, without requiring to be a normal subgroup:
To check it briefly, replacing by with preserves , so is well-defined. Every member of the group orbit has this form. Finally, implies , hence , proving the bijection. This is the construction in MIT's group-action notes, lemma 23.5. For infinite groups, the bijection and the cardinality statement still hold; division of infinite cardinalities does not supply the finite formula.
For the eight-element dihedral group acting on the square described under group action, moving a marked vertex of a polygon gives . Moving a marked side of a polygon also gives ; moving one unoriented diagonal of a polygon gives ; moving the centroid gives . These are four different group actions, each with one group orbit. In the first group action, the four left cosets of are
They correspond respectively to . Counting all eight transformations would count each position of the marked vertex of a polygon twice.
Figure 1. . The left panel matches four left cosets of a stabilizer subgroup to four images of a vertex of a polygon. The right panel compares the group orbits for separate group actions on vertices of a polygon, sides of a polygon, diagonals of a polygon, and the centroid; each group orbit size times the corresponding stabilizer subgroup group order equals eight. Details.
For a second computed example, let the symmetric group act on the Cartesian product by . There are two orbits of a group action:
and
The first stabilizer subgroup can exchange and while fixing ; the second must fix both and , so also fixes . The orbit-stabilizer theorem gives and , and the two group orbit sizes account for all nine ordered pairs. The general reason for exactly these two group orbits is equality-pattern orbits of ordered pairs.

New to topics? Read the docs here!