Skip to content

Group Actions

A group action of GG on a set XX is a map G×X→XG \times X \to XWritten (g,x)↦g⋅x(g, x) \mapsto g \cdot x Satisfying:

  1. e⋅x=xe \cdot x = x for all x∈Xx \in X.
  2. g⋅(h⋅x)=(gh)⋅xg \cdot (h \cdot x) = (gh) \cdot x for all g,h∈Gg, h \in G and x∈Xx \in X.

The orbit of x∈Xx \in X is Orb(x)={g⋅x:g∈G}\mathrm{Orb}(x) = \{g \cdot x : g \in G\}.

The stabilizer of x∈Xx \in X is Stab(x)={g∈G:g⋅x=x}\mathrm{Stab}(x) = \{g \in G : g \cdot x = x\}.

Proposition 6.1. Stab(x)\mathrm{Stab}(x) is a subgroup of GG.

Theorem 6.2 (Orbit-Stabilizer Theorem). For any x∈Xx \in X

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

Proof. Define ϕ:G→Orb(x)\phi : G \to \mathrm{Orb}(x) by ϕ(g)=g⋅x\phi(g) = g \cdot x. Then gg and hh have the same Image iff g⋅x=h⋅xg \cdot x = h \cdot x iff h−1g⋅x=xh^{-1}g \cdot x = x iff h−1g∈Stab(x)h^{-1}g \in \mathrm{Stab}(x) Iff g∈h Stab(x)g \in h\,\mathrm{Stab}(x). So the fibers of ϕ\phi are precisely the cosets of Stab(x)\mathrm{Stab}(x) And there are [G:Stab(x)][G : \mathrm{Stab}(x)] of them, each mapping to a distinct element of Orb(x)\mathrm{Orb}(x). ■\blacksquare

Theorem 6.3 (Burnside’s Lemma). If a finite group GG acts on a finite set XXThen the number Of orbits is

1∣G∣∑g∈G∣Fix(g)∣\frac{1}{|G|} \sum_{g \in G} |\mathrm{Fix}(g)|

Where Fix(g)={x∈X:g⋅x=x}\mathrm{Fix}(g) = \{x \in X : g \cdot x = x\}.

Proof. Count the set S={(g,x)∈G×X:g⋅x=x}S = \{(g, x) \in G \times X : g \cdot x = x\} in two ways. Grouping by gg: ∣S∣=∑g∈G∣Fix(g)∣|S| = \sum_{g \in G} |\mathrm{Fix}(g)|. Grouping by xx: ∣S∣=∑x∈X∣Stab(x)∣|S| = \sum_{x \in X} |\mathrm{Stab}(x)|. For xx in orbit OO, ∣Stab(x)∣=∣G∣/∣O∣|\mathrm{Stab}(x)| = |G|/|O|. So ∑x∈O∣Stab(x)∣=∣O∣⋅∣G∣/∣O∣=∣G∣\sum_{x \in O} |\mathrm{Stab}(x)| = |O| \cdot |G|/|O| = |G|. Summing over all orbits: ∣S∣=∣G∣⋅(number of orbits)|S| = |G| \cdot (\mathrm{number\ of\ orbits}). ■\blacksquare

6.4 Conjugation Action and the Class Equation

Section titled “6.4 Conjugation Action and the Class Equation”

GG acts on itself by conjugation: g⋅x=gxg−1g \cdot x = gxg^{-1}.

The orbits are called conjugacy classes. The stabilizer of xx is the centralizer CG(x)={g∈G:gx=xg}C_G(x) = \{g \in G : gx = xg\}.

Theorem 6.4 (Class Equation). For a finite group GG

∣G∣=∣Z(G)∣+∑i[G:CG(xi)]|G| = |Z(G)| + \sum_{i} [G : C_G(x_i)]

Where the sum is over representatives xix_i of the non-central conjugacy classes.

Proof. The conjugacy classes partition GG. Central elements form singleton classes. For a non-central element xx, ∣Orb(x)∣=[G:CG(x)]|\mathrm{Orb}(x)| = [G : C_G(x)] by the orbit-stabilizer theorem. Summing gives the result. ■\blacksquare

Problem. The rotational symmetry group of a cube has 2424 elements. Use the orbit-stabilizer theorem To verify the sizes of the orbits of vertices, edges, and faces under this action.

Solution

Solution. Let GG be the rotation group of a cube, with ∣G∣=24|G| = 24.

Vertices. The cube has 88 vertices. The action on vertices is transitive (any vertex can be rotated To any other), so ∣Orb(v)∣=8|\mathrm{Orb}(v)| = 8. By orbit-stabilizer, ∣Stab(v)∣=24/8=3|\mathrm{Stab}(v)| = 24/8 = 3. Indeed, the stabilizer of a vertex consists of rotations about the space diagonal through that vertex And its opposite: the identity, 120°120° rotation, and 240°240° rotation.

Edges. The cube has 1212 edges. The action is transitive, so ∣Orb(e)∣=12|\mathrm{Orb}(e)| = 12 and ∣Stab(e)∣=24/12=2|\mathrm{Stab}(e)| = 24/12 = 2. The stabilizer of an edge is {id,r}\{\mathrm{id}, r\} where rr is the 180°180° rotation about the axis through the midpoints of that edge and its opposite.

Faces. The cube has 66 faces. The action is transitive, so ∣Orb(f)∣=6|\mathrm{Orb}(f)| = 6 and ∣Stab(f)∣=24/6=4|\mathrm{Stab}(f)| = 24/6 = 4. The stabilizer of a face consists of rotations about the axis Through the center of that face and its opposite: {0°,90°,180°,270°}≅Z/4Z\{0°, 90°, 180°, 270°\} \cong \mathbb{Z}/4\mathbb{Z}.

This verifies: 24=8⋅3=12⋅2=6⋅424 = 8 \cdot 3 = 12 \cdot 2 = 6 \cdot 4. ■\blacksquare

Theorem 6.5. If GG is a non-trivial finite pp-group (i.e., ∣G∣=pn|G| = p^n for some prime pp and n≥1n \geq 1), then Z(G)Z(G) is non-trivial: ∣Z(G)∣≥p|Z(G)| \geq p.

Proof. By the class equation:

∣G∣=∣Z(G)∣+∑i=1r[G:CG(xi)]|G| = |Z(G)| + \sum_{i=1}^{r} [G : C_G(x_i)]

Where x1,…,xrx_1, \ldots, x_r are representatives of the non-central conjugacy classes. For each ii xix_i is non-central, so CG(xi)≠GC_G(x_i) \neq G. Thus [G:CG(xi)][G : C_G(x_i)] is a divisor of ∣G∣=pn|G| = p^n That is strictly greater than 11Hence pp divides [G:CG(xi)][G : C_G(x_i)]. Since pp also divides ∣G∣|G| We have:

∣Z(G)∣=∣G∣−∑i=1r[G:CG(xi)]≡0−0≡0(modp)|Z(G)| = |G| - \sum_{i=1}^{r} [G : C_G(x_i)] \equiv 0 - 0 \equiv 0 \pmod{p}

Since e∈Z(G)e \in Z(G)We have ∣Z(G)∣≥1|Z(G)| \geq 1. Therefore ∣Z(G)∣≥p|Z(G)| \geq p. ■\blacksquare

Corollary 6.6. Every group of order p2p^2 (where pp is prime) is abelian.

Proof. By Theorem 6.5, ∣Z(G)∣≥p|Z(G)| \geq p. Since Z(G)≤GZ(G) \leq G, ∣Z(G)∣|Z(G)| divides p2p^2So ∣Z(G)∣=p|Z(G)| = p or ∣Z(G)∣=p2|Z(G)| = p^2. If ∣Z(G)∣=p2|Z(G)| = p^2Then G=Z(G)G = Z(G) is abelian. If ∣Z(G)∣=p|Z(G)| = p Then G/Z(G)G/Z(G) has order pp and is therefore cyclic, say G/Z(G)=⟨gZ(G)⟩G/Z(G) = \langle gZ(G) \rangle. Then every element of GG has the form gkzg^k z for some k∈Zk \in \mathbb{Z} and z∈Z(G)z \in Z(G). For any two such elements (gk1z1)(gk2z2)=gk1+k2z1z2=gk2+k1z2z1=(gk2z2)(gk1z1)(g^{k_1}z_1)(g^{k_2}z_2) = g^{k_1+k_2}z_1z_2 = g^{k_2+k_1}z_2z_1 = (g^{k_2}z_2)(g^{k_1}z_1) So GG is abelian, contradicting ∣Z(G)∣=p|Z(G)| = p. Thus ∣Z(G)∣=p2|Z(G)| = p^2 and GG is abelian. ■\blacksquare

  • Forgetting that the stabilizer is always a subgroup (it inherits identity and closure from the group axioms).
  • Confusing the orbit of xx with the orbit of GG: the orbit is a subset of XX, not of GG.
  • Assuming that the number of orbits equals ∣X∣/∣G∣|X|/|G|; this is only true when the action is free.
  • Misapplying Burnside’s lemma by using the wrong group action (e.g., using conjugation when the problem specifies a different action).
  • Assuming that two elements in the same conjugacy class have the same centralizer; they have conjugate centralizers, but the sizes are equal.
  • Confusing [G:CG(x)][G : C_G(x)] (the index of the centralizer) with ∣G∣/∣Z(G)∣|G|/|Z(G)| (the size of the quotient by the centre).