Group Actions and the Class Equation

⚡ Key Takeaways

A group action is a homomorphism from a group $G$ into the symmetric group of a set $X$ , describing how $G$ "permutes" $X$ . The Class Equation partitions a finite group into conjugacy classes, yielding $|G| = |Z(G)| + \sum [G : C_G(x_i)]$ , a counting identity whose terms are all divisors of $|G|$ . This applies throughout finite group theory, combinatorics, and geometry. Foundational work by Cauchy, Sylow, and Burnside (19th century).

💡 The Core Insight

Counting an action three ways — by orbits, by stabilizers, and by fixed points — converts abstract symmetry into arithmetic. The Orbit–Stabilizer Theorem ties orbit size to subgroup index ( $|\text{Orbit}| = [G : \text{Stab}]$ ), so every orbit size divides $|G|$ . The Class Equation is just this principle applied to conjugation: it splits $|G|$ into the central part (orbits of size 1) and the non-central part (orbits of size $> 1$ , each a proper divisor of $|G|$ ). Divisibility then does the heavy lifting.

DefinitionGroup Action

Let $G$ be a group and $X$ a nonempty set. A (left) action of $G$ on $X$ is a map $\cdot : G \times X \to X$ , written $(g,x) \mapsto g\cdot x$ , satisfying:

1

\quad e \cdot x = x \quad \text{for all } x \in X,

Derivation hint: This is the identity axiom; it ensures the identity element acts trivially, a requirement for the action to be a homomorphism into $\mathrm{Sym}(X)$ .

2

\quad g \cdot (h \cdot x) = (gh) \cdot x \quad \text{for all } g,h \in G,\ x \in X.

Derivation hint: This compatibility axiom is precisely the statement that $g \mapsto (x \mapsto g\cdot x)$ respects group multiplication. Here $e$ is the identity of $G$ . Equivalently, an action is a group homomorphism $\rho : G \to \mathrm{Sym}(X)$ , the permutation representation, given by $\rho(g)(x) = g \cdot x$ .

DefinitionOrbit, Stabilizer, Fixed Points

For an action of $G$ on $X$ and a point $x \in X$ :

The orbit of $x$ is $\mathcal{O}_x = \{\, g \cdot x : g \in G \,\} \subseteq X$ .
The stabilizer of $x$ is $G_x = \{\, g \in G : g \cdot x = x \,\} \leq G$ , a subgroup.
The set of fixed points of $g \in G$ is $X^g = \{\, x \in X : g\cdot x = x \,\}$ .
$X^G = \{\, x \in X : g\cdot x = x \text{ for all } g \in G\,\}$ is the set of global fixed points.

The orbits partition $X$ : distinct orbits are disjoint and their union is $X$ , because "lies in the same orbit as" is an equivalence relation.

TheoremOrbit–Stabilizer Theorem

Let $G$ act on $X$ and let $x \in X$ . There is a bijection between the orbit $\mathcal{O}_x$ and the set of left cosets $G / G_x$ . Consequently, if $G$ is finite,

3

\quad |\mathcal{O}_x| = [G : G_x] = \frac{|G|}{|G_x|}.

Derivation hint: Map $g\cdot x \mapsto gG_x$ ; check it is well-defined and injective using $g\cdot x = h\cdot x \iff h^{-1}g \in G_x \iff gG_x = hG_x$ , then apply Lagrange's Theorem.

DefinitionConjugation Action and Conjugacy Classes

Let $G$ act on itself ( $X = G$ ) by conjugation:

4

\quad g \cdot x = g x g^{-1}.

Derivation hint: Verify the axioms — $e x e^{-1} = x$ and $g(hxh^{-1})g^{-1} = (gh)x(gh)^{-1}$ — confirming this is a genuine action. The orbit of $x$ under conjugation is its conjugacy class $\mathrm{Cl}(x) = \{\, gxg^{-1} : g \in G \,\}$ . The stabilizer of $x$ is its centralizer

5

\quad C_G(x) = \{\, g \in G : gxg^{-1} = x \,\} = \{\, g \in G : gx = xg \,\}.

Derivation hint: $gxg^{-1}=x$ multiply both sides on the right by $g$ to get the commuting condition. A point $x$ is a global fixed point iff $\mathrm{Cl}(x) = \{x\}$ iff $x \in Z(G)$ , the center of $G$ , where $Z(G) = \{\, z \in G : zg = gz \text{ for all } g \,\}$ .

TheoremThe Class Equation

Let $G$ be a finite group. Choose representatives $x_1, \dots, x_r$ , one from each conjugacy class of size strictly greater than $1$ . Then

6

\quad |G| = |Z(G)| + \sum_{i=1}^{r} [G : C_G(x_i)].

Derivation hint: Partition $G$ into conjugacy classes; singleton classes are exactly the elements of $Z(G)$ , contributing $|Z(G)|$ ; apply Orbit–Stabilizer to each larger class. Each summand $[G : C_G(x_i)] = |G| / |C_G(x_i)|$ is an integer $> 1$ dividing $|G|$ .

ProofProof of the Class Equation

Step 1 — Conjugacy is an equivalence relation. Define $x \sim y$ iff $y = gxg^{-1}$ for some $g \in G$ . Reflexivity uses $e$ ; symmetry uses $g^{-1}$ ; transitivity uses products. Hence the conjugacy classes partition $G$ :

7

\quad G = \bigsqcup_{j} \mathrm{Cl}(y_j),

Derivation hint: A partition of a set into equivalence classes; disjointness follows because any two classes that share an element coincide. where $y_j$ ranges over one representative per class.

Step 2 — Counting by class sizes. Taking cardinalities of the disjoint union,

8

\quad |G| = \sum_{j} |\mathrm{Cl}(y_j)|.

Derivation hint: Cardinality is additive over disjoint sets.

Step 3 — Identify singletons with the center. $|\mathrm{Cl}(x)| = 1 \iff gxg^{-1} = x$ for all $g \iff x \in Z(G)$ . So the singleton classes are exactly the $|Z(G)|$ elements of the center, each contributing $1$ to the sum.

Step 4 — Apply Orbit–Stabilizer to the rest. For a class of size $> 1$ with representative $x_i$ , Equation [3] (with stabilizer $C_G(x_i)$ ) gives $|\mathrm{Cl}(x_i)| = [G : C_G(x_i)]$ . Splitting the sum in [8] into singletons plus larger classes yields

9

\quad |G| = \underbrace{\sum_{x \in Z(G)} 1}_{=|Z(G)|} + \sum_{i=1}^{r} [G : C_G(x_i)],

Derivation hint: Separate the index set of [8] into those $j$ with $|\mathrm{Cl}(y_j)|=1$ and those with $|\mathrm{Cl}(y_j)|>1$ . which is exactly [6]. Each $[G:C_G(x_i)] > 1$ since the class is nontrivial, and divides $|G|$ by Lagrange. $\blacksquare$

∎

TheoremBurnside's Lemma / Cauchy–Frobenius

A companion counting result for general actions. If a finite group $G$ acts on a finite set $X$ , the number of orbits equals the average number of fixed points:

10

\quad |X/G| = \frac{1}{|G|} \sum_{g \in G} |X^g|.

Derivation hint: Count the set $\{(g,x) : g\cdot x = x\}$ two ways — by summing $|X^g|$ over $g$ , and by summing $|G_x|$ over $x$ , then group $x$ by orbits and apply Orbit–Stabilizer so each orbit contributes $|G|$ .

mathematician · William Burnside | 1852–1927

A central figure in the systematic study of finite groups, Burnside's 1897 Theory of Groups of Finite Order was the first comprehensive English-language treatise on the subject. He championed the use of group actions and character theory to extract structural information, proving the famous $p^a q^b$ theorem (every group whose order has only two prime divisors is solvable) using representation theory. The orbit-counting formula bears his name through his textbook, though it was known earlier to Cauchy and Frobenius — a historical accident now often called "Burnside's lemma that is not Burnside's." His work made the Class Equation and conjugacy-class arithmetic standard tools.

🧠 Intuition

Think of an action as a labeling consistency game. Each group element relabels the set $X$ , and the axioms ensure relabelings compose correctly. An orbit is the set of all positions a single point can be moved to — its full "reachable set." The stabilizer is the subgroup of symmetries that pin that point in place. Orbit–Stabilizer says: the more symmetries fix you, the fewer places you can go, and the trade-off is exact — orbit size times stabilizer size equals $|G|$ . For conjugation, "moving $x$ " means viewing $x$ from a different element's frame ( $gxg^{-1}$ ). Elements that look the same from every frame are central — they commute with everything and form singleton orbits. So the Class Equation reads: (total) = (elements that commute with all) + (everyone else, bundled into divisor-sized clumps). The power comes when $|G| = p^n$ : every clump in the sum is divisible by $p$ , and so is $|G|$ , forcing $|Z(G)|$ to be divisible by $p$ — hence nontrivial.

Figure

Conjugation action on

S_3

: three conjugacy classes partition the six elements

ExampleThe Symmetric Group

S_3

Given: $G = S_3$ , $|G| = 6$ . Find the conjugacy classes and verify the Class Equation.

Step 1 — Recall conjugacy in $S_n$ . Two permutations are conjugate iff they have the same cycle type. The cycle types in $S_3$ are: identity (one element), transpositions (cycle type $2+1$ ), and 3-cycles (cycle type $3$ ).

Step 2 — Class sizes.

Identity $e$ : class $\{e\}$ , size $1$ . This is $Z(S_3)$ , so $|Z(S_3)| = 1$ .
Transpositions $(12), (13), (23)$ : size $3$ . Centralizer $C_G((12)) = \{e, (12)\}$ , order $2$ , so $[G:C] = 6/2 = 3$ . ✓
3-cycles $(123), (132)$ : size $2$ . Centralizer is $\langle (123)\rangle$ , order $3$ , so $[G:C] = 6/3 = 2$ . ✓

Step 3 — Assemble the Class Equation.

6 = \underbrace{1}_{Z(G)} + \underbrace{2}_{3\text{-cycles}} + \underbrace{3}_{\text{transpositions}}.

\boxed{|S_3| = 6 = 1 + 2 + 3}

ExampleCenter of a

p

-Group:

|G| = p^2

Given: $G$ a group with $|G| = p^2$ for a prime $p$ . Show $G$ is abelian.

Step 1 — Center is nontrivial. The Class Equation gives $p^2 = |Z(G)| + \sum_i [G : C_G(x_i)]$ . Each non-central term $[G:C_G(x_i)]$ divides $p^2$ and is $> 1$ , so it equals $p$ or $p^2$ ; in all cases $p \mid [G:C_G(x_i)]$ . Since $p \mid p^2$ , we get $p \mid |Z(G)|$ , so $|Z(G)| \in \{p, p^2\}$ .

Step 2 — Rule out $|Z(G)| = p$ . Suppose $|Z(G)| = p$ . Then the quotient $G/Z(G)$ has order $p^2/p = p$ , which is cyclic. A standard lemma states: if $G/Z(G)$ is cyclic, then $G$ is abelian, forcing $Z(G) = G$ — contradicting $|Z(G)| = p < p^2$ .

Step 3 — Conclude. Therefore $|Z(G)| = p^2 = |G|$ , i.e. $Z(G) = G$ .

\boxed{\text{Every group of order } p^2 \text{ is abelian.}}

(With more work, such a group is isomorphic to $\mathbb{Z}_{p^2}$ or $\mathbb{Z}_p \times \mathbb{Z}_p$ .)

⚠️ Common mistake

The orbit, not the stabilizer, equals the index. Orbit–Stabilizer says $|\mathcal{O}_x| = [G : G_x]$ , not $|G_x| = [G:G_x]$ . The orbit corresponds to cosets of the stabilizer; large stabilizers produce small orbits.

The Class Equation does not say all classes have equal size. The non-central classes can have wildly different sizes; only their sum with $|Z(G)|$ equals $|G|$ .

$Z(G)$ is a single contribution, not one term per central element written separately. All $|Z(G)|$ singleton classes are collected into the single number $|Z(G)|$ at the front. Forgetting them entirely is a frequent error — the equation then fails to add up.

Stabilizers of conjugate points are conjugate, not equal. If $y = g\cdot x$ , then $G_y = g G_x g^{-1}$ . They are isomorphic but generally distinct subgroups.

Counterexample

Nontrivial center does not imply the group is abelian. From the Class Equation, any $p$ -group has $Z(G) \neq \{e\}$ . But the dihedral group $D_4$ (order $8 = 2^3$ ) has center $Z(D_4) = \{e, r^2\}$ of order $2$ , while $D_4$ is non-abelian. Here the Class Equation reads

8 = 2 + 2 + 2 + 2,

with $|Z| = 2$ and three non-central classes each of size $2$ . So " $p$ -groups have nontrivial center" is strictly weaker than " $p$ -groups are abelian," which is false for $p^3$ .

connection

The conjugation action and Class Equation are the engine behind the Sylow Theorems: counting Sylow $p$ -subgroups via the action of $G$ by conjugation on the set of such subgroups gives the congruence $n_p \equiv 1 \pmod p$ . The Orbit–Stabilizer Theorem generalizes Lagrange's Theorem (the case of $G$ acting on coset spaces) and underlies Cauchy's Theorem (existence of order- $p$ elements). Burnside's lemma [10] is the foundation of Pólya Enumeration Theory for counting colorings up to symmetry. The permutation representation $\rho : G \to \mathrm{Sym}(X)$ is the set-theoretic shadow of Group Representation Theory, where $X$ is replaced by a vector space and conjugacy classes index the irreducible characters. The notions of orbit and stabilizer recur in Quotient Groups and Homomorphisms via the orbit space $X/G$ .

🔬 Where this appears

⏳ History

- 1815–1830 — Cauchy initiates the systematic study of permutations, defines cycle structure, and proves results that imply conjugacy is governed by cycle type in symmetric groups.

- 1845 — Cauchy publishes his theorem: a finite group whose order is divisible by a prime

p

contains an element of order

p

— an early triumph of counting arguments.

- 1854 — Cayley gives the abstract definition of a group and the regular representation (action on itself by left multiplication), formalizing group actions.

- 1872 — Sylow proves the Sylow theorems using conjugation actions and counting, the deepest early application of class-equation-style reasoning.

- 1887 — Frobenius and others develop the orbit-counting (Cauchy–Frobenius) formula in the context of permutation groups.

- 1897 — Burnside publishes Theory of Groups of Finite Order, systematizing actions, conjugacy classes, and the orbit-counting lemma; the second edition (1911) adds character theory.

- 1900s–1920s — Burnside's $p^aq^b$ theorem uses representation theory built on conjugacy-class data to prove solvability.

- 1937 — Pólya publishes his enumeration theorem, generalizing Burnside's lemma into a powerful combinatorial tool with generating functions.

- 20th century onward — The Class Equation becomes a standard step in the classification of finite simple groups and in nearly every undergraduate algebra curriculum.

open-problem

The Class Equation is a finite phenomenon: for infinite groups, conjugacy classes need not be finite and the sum is meaningless without convergence considerations, though analogues exist (e.g., FC-groups, where every conjugacy class is finite, are an active study area). A deep direction is the inverse problem: which multisets of divisors of $n$ can occur as the conjugacy class sizes of a group of order $n$ ? The relationship between class sizes and group structure — e.g., Thompson's theorem that a group with a conjugacy class size that is a prime power is non-simple, and conjectures on character degrees (the dual data) such as the still-deep parts of the McKay conjecture (a 2023 proof was announced, building on the classification of finite simple groups) — show that the arithmetic of [6] encodes far more structure than is yet fully understood. Even counting how class-size data determines a group up to isomorphism remains subtle.

Formal Statement

Why It Holds / Derivation

Building Intuition

Worked Examples

Common Misconceptions

Connections

Real-World Applications

Historical Development

Subtleties & Limits

See Also