Group actions: when algebra meets geometry

A group in isolation is a static catalog of symbols and rules. Let it act on a set, and it comes to life as a family of concrete motions. Through orbits, stabilizers, and Burnside's lemma, we see how group actions transform abstract algebra into a powerful counting tool.

Folio Official

March 1, 2026

Throughout this series we have studied groups as self-contained algebraic objects: sets equipped with a multiplication satisfying three axioms. That perspective is clean and powerful, but it overlooks something fundamental. Groups were created to describe symmetry, and symmetry is always the symmetry of something. A rotation is a rotation of a specific figure; a permutation is a rearrangement of a specific list. The group, standing alone, is an abstract catalog of elements and multiplication rules. It only acquires concrete meaning when you let it act.

A group action is the formalization of this idea: take a group $G$ and a set $X$ , and let the elements of $G$ move the elements of $X$ around. The payoff is that abstract algebra suddenly makes contact with geometry, combinatorics, and physics – and, as we shall see, it becomes a remarkably efficient machine for counting.

1 The definition

Definition 1.

A (left) group action of a group

G

on a set

X

is a map

G \times X \to X

, written

(g, x) \mapsto g \cdot x

, satisfying two conditions:

$e \cdot x = x$ for all $x \in X$ (the identity element does nothing),
$(g h) \cdot x = g \cdot (h \cdot x)$ for all $g, h \in G$ and $x \in X$ (acting in succession is the same as acting by the product).

The second axiom is the heart of the definition. It says that first applying $h$ and then applying $g$ produces the same result as applying the single element $g h$ . In other words, the group multiplication faithfully encodes the composition of motions.

Remark 2.

There is an equivalent and illuminating reformulation. For each

g \in G

, the rule

x \mapsto g \cdot x

defines a bijection

ρ (g) : X \to X

. The two action axioms say precisely that the assignment

g \mapsto ρ (g)

is a group homomorphism

from

G

into the group of all bijections of

X

. In other words, a group action is nothing more than a homomorphism from $G$ to a symmetric group.

This observation is the mechanism behind Cayley's theorem. Let

G

act on itself by left multiplication (

g \cdot x = gx

for

x \in G

). The corresponding homomorphism

ρ : G \to S_{∣ G ∣}

is injective, so every group embeds into a symmetric group. Every group is, secretly, a group of permutations.

2 Three fundamental examples

Example 1: The dihedral group acting on vertices.

The dihedral group $D_{4}$ acts naturally on the vertex set $X = {1, 2, 3, 4}$ of a square. The $90°$ rotation $r$ sends $1 \mapsto 2 \mapsto 3 \mapsto 4 \mapsto 1$ ; each reflection swaps certain pairs of vertices. Every element of $D_{4}$ defines a bijection on four points, and the action axioms hold because composing symmetries is the same as multiplying in $D_{4}$ .

Example 2: Conjugation.

Every group $G$ acts on itself by conjugation: $g \cdot x = gx g^{- 1}$ . Checking the axioms:

$e \cdot x = e x e^{- 1} = x$ ✓
$(g h) \cdot x = (g h) x (g h)^{- 1} = g (h x h^{- 1}) g^{- 1} = g \cdot (h \cdot x)$ ✓

This action is a cornerstone of the structural theory of groups. The orbits under conjugation are the conjugacy classes, and the stabilizer of an element is its centralizer. The class equation, Sylow's theorems, and much of the internal structure theory of finite groups rest on this single action.

Example 3: Left multiplication on cosets.

Given a subgroup $H \leq G$ (not necessarily normal), the group $G$ acts on the set of left cosets $G / H = {a H ∣ a \in G}$ by left multiplication: $g \cdot (a H) = (g a) H$ . Note that this requires no assumption of normality – we are treating $G / H$ merely as a set, not as a group. This action is the engine behind many counting arguments involving subgroups.

3 Orbits and stabilizers

When a group acts on a set, two natural objects attach themselves to each point.

Definition 3.

Let

G

act on

X

. For

x \in X

Orb (x) Stab (x) = {g \cdot x ∣ g \in G} (the orbit of x) = {g \in G ∣ g \cdot x = x} (the stabilizer of x)

The orbit is the set of all positions that $x$ can reach under the action of $G$ – it tells you where $x$ can go. The stabilizer is the set of group elements that leave $x$ fixed – it tells you what holds $x$ in place.

Theorem 4.

The stabilizer

Stab (x)

is a subgroup of

G

Proof.

Let

g, h \in Stab (x)

. Then

(g h^{- 1}) \cdot x = g \cdot (h^{- 1} \cdot x) = g \cdot x = x

, so

g h^{- 1} \in Stab (x)

. □

4 The Orbit–Stabilizer Theorem

There is an elegant quantitative relationship between orbits and stabilizers.

Theorem 5 (Orbit–Stabilizer Theorem).

∣ Orb (x) ∣ = [G : Stab (x)] = \frac{∣ G ∣}{∣ Stab ( x ) ∣}

In words: the number of places $x$ can be sent equals the index of its stabilizer in $G$ . The more symmetries fix $x$ , the fewer distinct positions $x$ can occupy.

The theorem rests on a natural bijection:

Proof.

Define

f : G / Stab (x) \to Orb (x)

f (g Stab (x)) = g \cdot x

Well-defined. If

g Stab (x) = g^{'} Stab (x)

, then

g^{- 1} g^{'} \in Stab (x)

, so

(g^{- 1} g^{'}) \cdot x = x

, and hence

g^{'} \cdot x = g \cdot x

Injective. If

g \cdot x = g^{'} \cdot x

, then

(g^{- 1} g^{'}) \cdot x = x

, so

g^{- 1} g^{'} \in Stab (x)

, and

g Stab (x) = g^{'} Stab (x)

Surjective. Every element of

Orb (x)

has the form

g \cdot x = f (g Stab (x))

by definition. □

Example 6.

Consider

D_{4}

acting on the vertices

{1, 2, 3, 4}

of a square. For vertex

1

$Orb (1) = {1, 2, 3, 4}$ – every vertex is reachable.
$Stab (1) = {e, s^{'}}$ – only the identity and the reflection through the diagonal passing through vertex $1$ fix it.
$∣ Orb (1) ∣ = 4 = 8/2 = ∣ D_{4} ∣/∣ Stab (1) ∣$ . ✓

5 Burnside's lemma

Among the most satisfying applications of group actions is a formula that counts the number of truly distinct configurations when symmetry is present. It is known as Burnside's lemma (though historically it is due to Cauchy and Frobenius).

Theorem 7 (Burnside's Lemma).

Let a finite group

G

act on a finite set

X

. The number of orbits is

∣ X / G ∣ = \frac{1}{∣ G ∣} g \in G \sum ∣ X^{g} ∣

where

X^{g} = {x \in X ∣ g \cdot x = x}

is the set of fixed points of

g

In plain language: the number of essentially distinct patterns equals the average number of fixed points, where the average is taken over all elements of the group.

Proof.

Consider the set

S = {(g, x) \in G \times X ∣ g \cdot x = x}

and count its elements in two ways.

Summing over

x

: each

x \in X

contributes

∣ Stab (x) ∣

pairs, so

∣ S ∣ = \sum_{x \in X} ∣ Stab (x) ∣

Summing over

g

: each

g \in G

contributes

∣ X^{g} ∣

pairs, so

∣ S ∣ = \sum_{g \in G} ∣ X^{g} ∣

By the Orbit–Stabilizer Theorem,

∣ Stab (x) ∣ = ∣ G ∣/∣ Orb (x) ∣

. Substituting into the first sum:

x \in X \sum ∣ Stab (x) ∣ = ∣ G ∣ x \in X \sum \frac{1}{∣ Orb ( x ) ∣}

Within each orbit

O

, there are

∣ O ∣

points, each contributing

1/∣ O ∣

to the inner sum, for a total contribution of

1

. So the inner sum equals the number of orbits

∣ X / G ∣

∣ G ∣ \cdot ∣ X / G ∣ = g \in G \sum ∣ X^{g} ∣

Dividing both sides by

∣ G ∣

completes the proof. □

6 Application: coloring the faces of a cube

Example 8.

Paint each of the six faces of a cube using one of three colors (red, blue, green). Two colorings are considered the same if one can be rotated into the other. How many essentially different colorings are there?

Let $X$ be the set of all colorings (there are $∣ X ∣ = 3^{6} = 729$ ), and let $G$ be the rotation group of the cube, which has order $24$ . We classify the $24$ rotations by type and compute the number of fixed colorings $∣ X^{g} ∣$ for each:

Identity (1 element): every coloring is fixed. $∣ X^{g} ∣ = 3^{6} = 729$ .
Face-axis rotations by $90°$ / $270°$ (6 elements): the four lateral faces must all share the same color. $∣ X^{g} ∣ = 3^{3} = 27$ .
Face-axis rotations by $180°$ (3 elements): opposite lateral faces must match. $∣ X^{g} ∣ = 3^{4} = 81$ .
Vertex-axis rotations by $120°$ / $240°$ (8 elements): the three faces meeting at each vertex must share a color. $∣ X^{g} ∣ = 3^{2} = 9$ .
Edge-axis rotations by $180°$ (6 elements): faces pair up in three swapped pairs. $∣ X^{g} ∣ = 3^{3} = 27$ .

Applying Burnside's lemma:

∣ X / G ∣ = \frac{1}{24} (1 \times 729 + 6 \times 27 + 3 \times 81 + 8 \times 9 + 6 \times 27) = \frac{1}{24} (729 + 162 + 243 + 72 + 162) = \frac{1368}{24} = 57

There are 57 essentially different colorings. Attempting to enumerate all $729$ colorings by hand and check each pair for rotational equivalence would be a formidable task. Burnside's lemma reduces the entire problem to a brief computation. This is the power of counting with group actions.

7 Takeaway

A group action is the mechanism by which abstract algebra engages with the concrete world. By letting a group act on a set, we translate multiplication rules into motions. The Orbit–Stabilizer Theorem forges a precise link between the algebra of the group and the geometry of the action, and Burnside's lemma turns that link into a practical tool for counting under symmetry. A group, considered in isolation, is a static object – a table of multiplication rules. It is only through its actions that it reveals its true nature: a group is, at its core, a machine for moving things.

Group Theory Algebra Between the Lines

Folio Official

Mathematics "between the lines" — exploring the intuition textbooks leave out, written in LaTeX on Folio.

1 フォロワー·105 記事

Group actions: when algebra meets geometry

1 The definition

2 Three fundamental examples

3 Orbits and stabilizers

4 The Orbit–Stabilizer Theorem

5 Burnside's lemma

6 Application: coloring the faces of a cube

7 Takeaway

あなたの専門知識を世界に発信しよう

Folio Officialの他の記事

Monetizing Your Articles — How to Earn Revenue Safely with Stripe Connect

Mastering Theorem Environments — theorem, definition, proof, and Friends

Combinatorial Designs and Latin Squares: Balanced Arrangements

Burnside's Lemma and P\'olya Enumeration: Counting Under Symmetry