Finite Group Databasebeta

Group action

A group action is a group acting as symmetries of a set. Many deep results in group theory — Sylow's theorems, the class equation, Cayley's theorem — are corollaries of a single counting principle called the orbit-stabilizer theorem.

Definition

An action of a group G on a set X is a map G × X → X, written (g, x) ↦ g · x, satisfying

  1. e · x = x for all x ∈ X,
  2. (gh) · x = g · (h · x) for all g, h ∈ G, x ∈ X.

Equivalently: an action is a homomorphism G → Sym(X) to the symmetric group on X.

For x ∈ X:

The action is transitive if there is a single orbit, faithful if the homomorphism G → Sym(X) is injective (equivalently, ⋂ₓ Gₓ = {e}).

Orbit-stabilizer

For a finite group G acting on X, and any x ∈ X:

|G · x|  =  [G : Gₓ]     and hence     |G|  =  |G·x| · |Gₓ|.

Proof sketch. The map gGₓ ↦ g·x is a well-defined bijection from cosets of Gₓ to the orbit of x. ∎

Burnside's lemma

If G acts on a finite set X, the number of orbits is the average number of fixed points:

|X / G|  =  (1/|G|)  Σg ∈ G  |Fix(g)|,

where Fix(g) = {x ∈ X : g·x = x}. Useful for counting colorings, necklaces, and symmetry classes.

Note on naming. This is Burnside's lemma (orbit counting). The distinct Burnside theorem (groups of order pᵃqᵇ are solvable) lives on its own page — see Burnside's theorem.

Canonical actions

Examples

Applications

See also