Abstract AlgebraGroup Actions and Counting

Conjugacy Classes and the Class Equation

Conjugacy classes are the orbits of G acting on itself by x ↦ gxg⁻¹; in Sₙ they are the cycle types, and |G| = |Z(G)| + the sum of [G : C(x)] over the classes with more than one element.

Not started Jump to practice

Let a group act on itself by conjugation, $g \cdot x = gxg^{-1}$. The orbits are called conjugacy classes, and counting them gives an equation with real consequences for groups of prime-power order.

Definitions. The conjugacy class of $x$ is $\{gxg^{-1} : g \in G\}$. The stabilizer of $x$ is its centralizer $C(x) = \{g : gx = xg\}$. The class of $x$ is $\{x\}$ alone exactly when $x$ commutes with everything, that is, when $x$ is in the center $Z(G)$.

Why it works

The class equation. The classes partition $G$. Collect the one-element classes (the center) and pick one $x_{i}$ from each larger class; by orbit–stabilizer each class has $[G : C(x_{i})]$ elements, so $$|G| = |Z(G)| + \sum_{i} [G : C(x_{i})],$$ and every term divides $|G|$.
Application. If $|G| = p^{n}$ with $p$ prime and $n \ge 1$, then $Z(G) \ne \{e\}$. Proof: each $[G : C(x_{i})]$ is a divisor of $p^{n}$ bigger than $1$, so a multiple of $p$. Then $|Z(G)| = |G| - \sum [G : C(x_{i})]$ is a multiple of $p$, and it is at least $1$ (it contains $e$), so it is at least $p$. $\square$

Classes in $S_{n}$. Conjugating relabels: $\sigma(a_{1}\;\dots\;a_{k})\sigma^{-1} = (\sigma(a_{1})\;\dots\;\sigma(a_{k}))$. So two permutations are conjugate exactly when they have the same cycle type, and the classes of $S_{n}$ match the partitions of $n$.

Class equations of small groups; the 1s are the elements of the center.
GroupClass equation
$S_{3}$$6 = 1 + 2 + 3$
$D_{4}$$8 = 1 + 1 + 2 + 2 + 2$
$Q_{8}$$8 = 1 + 1 + 2 + 2 + 2$
$S_{4}$$24 = 1 + 3 + 6 + 6 + 8$
$A_{4}$$12 = 1 + 3 + 4 + 4$

Worked example: The class equation of $D_{4}$

Find the conjugacy classes of $D_{4}$.
  1. $Z(D_{4}) = \{e, r^{2}\}$: the half turn commutes with everything.
  2. $srs^{-1} = r^{-1} = r^{3}$, so $\{r, r^{3}\}$ is a class.
  3. $rsr^{-1} = r^{2}s$, so $\{s, r^{2}s\}$ is a class, and likewise $\{rs, r^{3}s\}$.
  4. $8 = 1 + 1 + 2 + 2 + 2$.

Answer: Five classes.

Worked example: A class in $S_{4}$

How many elements are conjugate to $(1\;2)(3\;4)$ in $S_{4}$?
  1. All permutations of the same cycle type: two disjoint transpositions.
  2. Pair up $\{1, 2, 3, 4\}$: $(1\;2)(3\;4)$, $(1\;3)(2\;4)$, $(1\;4)(2\;3)$.

Answer: $3$.

Common mistake

Counting the central elements twice: they appear as the term $|Z(G)|$, so the sum runs only over classes with more than one element. A quick check on any class equation: every term divides $|G|$, and the terms add up to $|G|$. For $D_{4}$, $1 + 1 + 2 + 2 + 2 = 8$.
One more step: groups of order $p^{2}$ are abelian. Suppose $|G| = p^{2}$ and $Z(G) \ne G$. Then $|Z(G)| = p$. Pick $x \notin Z(G)$: its centralizer $C(x)$ contains all of $Z(G)$ and also $x$, so $|C(x)| \gt p$, and by Lagrange $C(x) = G$. That says $x$ commutes with everything, so $x \in Z(G)$, a contradiction. $\square$

Key idea

Conjugacy classes are the orbits of conjugation; the class of $x$ has $[G : C(x)]$ elements. $|G| = |Z(G)| + \sum [G : C(x_{i})]$. In $S_{n}$ the classes are the cycle types; groups of order $p^{n}$ have a nontrivial center.

Practice

Pass with 3 right answers, the last 2 in a row. Each right answer earns 3 XP.

Loading practice…

Builds on

Leads to

Sources and further reading

  • Thomas W. Judson, Abstract Algebra: Theory and Applications (open textbook), chapter 14, Group Actions (section 14.2, The Class Equation)
  • MIT OpenCourseWare 18.701 Algebra I (Fall 2010), lecture notes on the class equation
  • John A. Beachy and William D. Blair, Abstract Algebra, online study guide (Northern Illinois University), section 7.2, Conjugacy
@teddyrookbook GitHub