Group Actions and the Orbit-Stabilizer Theorem

April 11, 2026 · Luciano Muratore

1. Group Actions: Definition and Examples

A group action is a function that describes how a group GG interacts with a set XX. It is defined as a map :G×XX\cdot:G\times X\rightarrow X where (g,x)gx(g,x)\mapsto g\cdot x.

Axioms

To be a valid group action, the map must satisfy two conditions:

  • Identity: 1Gx=x1_{G}\cdot x=x for all xXx\in X.
  • Compatibility: (gh)x=g(hx)(gh)\cdot x=g\cdot(h\cdot x) for all g,hGg, h \in G and xXx \in X.

Examples

  • Permutations: The symmetric group SnS_n acts on the set {1,2,,n}\{1, 2, \dots, n\} by permutation.
  • Linear Algebra: GLn(R)GL_n(\mathbb{R}) acts on Rn\mathbb{R}^n via matrix multiplication.
  • Conjugation: Any group can act on itself where gx=gxg1g\cdot x=gxg^{-1}.

2. Orbits and Stabilizers

Group actions allow us to break down a set XX into manageable pieces based on the movement of elements.

  • Orbit (O(x)\mathcal{O}(x)): The set of all points in XX that xx can reach under the action of GG.Orbits form a partition of the set XX.
  • Stabilizer (GxG_x): The set of elements in GG that fix a specific element xx (gx=xg \cdot x = x). The stabilizer is always a subgroup of GG.
  • Transitive Action: An action is transitive if it results in exactly one orbit.

3. The Orbit-Stabilizer Theorem

This theorem is a fundamental counting tool that relates the size of a group to its orbits and stabilizers.

Theorem: For a finite group GG acting on a set XX, and any xXx\in X: G=O(x)Gx|G|=|\mathcal{O}(x)|\cdot|G_{x}|

  • Proof Concept: There is a bijection between the orbit O(x)\mathcal{O}(x) and the set of left cosets G/GxG/G_x.
  • Transitive Case: If GG acts transitively, then X=GGx|X| = \frac{|G|}{|G_x|}.

4. Conjugation, Centers, and Normalizers

Specific actions on the group itself reveal its internal algebraic structure.

Conjugation Action

In this action, orbits are called conjugacy classes (C(x)\mathcal{C}(x)) and stabilizers are called centralizers (CG(x)C_G(x)).

  • Centralizer of a Subset: CG(S)={gGgs=sg for all sS}C_G(S) = \{g \in G \mid gs = sg \text{ for all } s \in S\}.

The Center Z(G)Z(G)

The center consists of elements that commute with everything in the group.

  • Z(G)Z(G) is the intersection of all centralizers: Z(G)=xGCG(x)Z(G) = \bigcap_{x \in G} C_G(x).
  • It is a normal subgroup of GG.

Normalizers

When GG acts on its set of subgroups by conjugation (gH=gHg1g \cdot H = gHg^{-1}), the stabilizer is called the normalizer, NG(H)N_G(H).

  • NG(H)N_G(H) is the largest subgroup of GG in which HH is a normal subgroup.

5. Geometric Applications: Symmetries

Symmetries of a Cube

The proper rotation group of a cube has order 24. Using the Orbit-Stabilizer Theorem on the 8 vertices:

  • Orbit Size: 8 (any vertex can be rotated to any other).
  • Stabilizer Size: 3 (rotations fixing a vertex permute the 3 incident edges).
  • Total Rotations: 8×3=248 \times 3 = 24.

Triangular Prism

The symmetry group of a right regular triangular prism includes base symmetries (D3D_3) and vertical reflections.

  • Total isometries: 6×2=126 \times 2 = 12.
  • The group is isomorphic to D6D_6 (the dihedral group of order 12) or D3×Z2D_3 \times \mathbb{Z}_2.

6. Applications and Summary

Group actions translate algebraic structure into geometric intuition.

  • Counting: Useful for solving complex counting problems in combinatorics.
  • Classification: Essential for the classification of finite simple groups.
  • Puzzles: Provides the mathematical foundation for understanding the Rubik’s Cube.