Skip to content
Tutorials Center
My learning

Topics

Lesson 18 of 37 · Cosets and Lagrange

Group Actions, Orbits and Stabilizers

Learn how groups act on sets, prove the orbit-stabilizer theorem with cosets, and count necklaces with Burnside's lemma using Python.

A group does not only exist on its own: it acts on things. Rotations act on the corners of a square, permutations act on positions, matrices act on vectors. Cosets give a precise counting rule for such actions, the orbit-stabilizer theorem, and a close relative called Burnside's lemma counts objects "up to symmetry".

Group actions

A group action of G on a set X assigns to each g ∈ G and x ∈ X an element g·x ∈ X such that

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

Example: the rotation group of a square (cyclic of order 4) acts on the four corners {0, 1, 2, 3} by r·x = x + 1 mod 4.

For x ∈ X:

  • The orbit of x is Orb(x) = {g·x : g ∈ G}, all places x can be moved to.
  • The stabilizer of x is Stab(x) = {g ∈ G : g·x = x}, the group elements that leave x fixed. It is a subgroup of G (check with the one-step test).

Orbits partition X, since "being in the same orbit" is an equivalence relation.

The orbit-stabilizer theorem

Theorem. For finite G, |Orb(x)| · |Stab(x)| = |G|.

Why. The map gStab(x) ↦ g·x from left cosets of the stabilizer to the orbit is well defined and bijective: g·x = h·x ⟺ h⁻¹g ∈ Stab(x) ⟺ gStab(x) = hStab(x). So the orbit size equals the index [G : Stab(x)], and Lagrange finishes the job. ∎

Python Orbits and stabilizers for D₄ acting on a square's corners

Press Run (or Ctrl + Enter) to see the result here.

Program input · what you'd type while the program runs

Type the answers before you press Run, one per line. Each time the program reads a line (with input()), it gets the next line from this box.

All four corners lie in one orbit (the action is transitive), each corner's stabilizer has 2 elements (identity and the reflection through that corner), and 4 · 2 = 8 = |D₄|.

Burnside's lemma: counting up to symmetry

How many different necklaces can you make from 4 beads in 2 colors if rotating the necklace gives "the same" necklace? Burnside's lemma says the number of orbits is the average number of fixed points:

#orbits = (1 / |G|) · Σ over g ∈ G of |Fix(g)|, where Fix(g) = {x : g·x = x}.

Here G is the rotation group ℤ₄ acting on all 2⁴ = 16 colorings. The identity fixes all 16. A quarter-turn fixes only colorings where all beads match (2). A half-turn fixes colorings with opposite beads equal: 2² = 4. Three-quarter turn: 2. So the count is (16 + 2 + 4 + 2) / 4 = 6.

Python Count necklaces with Burnside's lemma

Press Run (or Ctrl + Enter) to see the result here.

Program input · what you'd type while the program runs

Type the answers before you press Run, one per line. Each time the program reads a line (with input()), it gets the next line from this box.

For 4 beads in 2 colors both methods give 6, and with 3 colors both give 24. The averaged fixed-point count agrees with the brute-force orbit count every time.

Burnside's lemma is also called the Cauchy-Frobenius lemma. It turns counting up to symmetry into counting what each symmetry leaves unchanged, which is usually much easier.

flowchart LR
    G["Group G"] -->|"acts on"| X["Set X"]
    X --> O["orbits<br/>partition X"]
    G --> S["stabilizer Stab(x)<br/>subgroup of G"]
    O --> T["|Orb| · |Stab| = |G|"]
    S --> T

Orbits split the set; stabilizers are subgroups; their sizes multiply to |G|.

Check your understanding

Quick check · 4 questions

of 4 answered You scored / 4 · perfect!

  1. 1. What is the stabilizer of an element x?

    Stab(x) is the set of group elements that fix x; it is a subgroup.
  2. 2. A group of order 12 acts on a set and x has a stabilizer of order 3. How large is the orbit of x?

    |Orb(x)| = |G| / |Stab(x)| = 12/3 = 4.
  3. 3. Burnside's lemma computes the number of orbits as:

    #orbits = (1/|G|) · Σ |Fix(g)|.
  4. 4. Which axiom must a group action satisfy?

    Acting by gh must equal acting by h first and then g.

Summary

  • A group action assigns permutations of a set to group elements, compatibly with the operation.
  • Orbits partition the set; stabilizers are subgroups.
  • Orbit-stabilizer: |Orb(x)| · |Stab(x)| = |G|, proved with cosets.
  • Burnside's lemma counts orbits (objects up to symmetry) as an average of fixed points.

Chapter 4 is complete; the next chapter introduces homomorphisms and quotient groups. Return to the track page: Abstract Algebra