This sheet introduces group actions—a powerful way of viewing groups as acting on sets—and proves Cayley's theorem, which shows that every group is isomorphic to a group of permutations. It also develops the orbit-stabilizer theorem and Cauchy's theorem.

Commentary. Group actions are one of the most versatile tools in group theory. By letting a group act on a set, we can study the group's structure through the orbits and stabilizers of the action. The orbit-stabilizer theorem is a counting tool that generalizes Lagrange's theorem. Cayley's theorem shows that every abstract group can be realized as a concrete group of permutations. Cauchy's theorem, which follows from group actions, provides the first partial converse to Lagrange's theorem.


Group Actions#

Definition 5.1. Let GG be a group and XX a nonempty set. A (left) group action of GG on XX is a function⋅:G×X→X,(g,x)↦g⋅x\cdot: G \times X \to X, \qquad (g, x) \mapsto g \cdot xsuch that for all g,h∈Gg, h \in G and x∈Xx \in X:

  1. (gh)⋅x=g⋅(h⋅x)(gh) \cdot x = g \cdot (h \cdot x).
  2. e⋅x=xe \cdot x = x.

When such an action exists, we say that GG acts on XX, and XX is called a GG-set.

【新增 5.1.1】 Theorem 5.1.1. Let GG act on XX. Then the mapρ:G→Sym⁡(X),ρ(g)(x)=g⋅x\rho: G \to \operatorname{Sym}(X), \qquad \rho(g)(x) = g \cdot xis a group homomorphism. Conversely, any group homomorphism ρ:G→Sym⁡(X)\rho: G \to \operatorname{Sym}(X) defines a group action by g⋅x=ρ(g)(x)g \cdot x = \rho(g)(x).

Corollary 5.1.2. A group action is faithful iff ρ\rho is injective.

Example 5.2. The symmetric group SnS_n acts on X={1,2,…,n}X = \{1, 2, \ldots, n\} by σ⋅i=σ(i)\sigma \cdot i = \sigma(i).

Example 5.3. Any group GG acts on itself by left multiplication: g⋅x=gxg \cdot x = gx.

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

Example 5.5. The dihedral group DnD_n acts on the vertices of a regular nn-gon.

Example 5.6. GLn(R)\mathrm{GL}_n(\mathbb{R}) acts on Rn\mathbb{R}^n by matrix multiplication: A⋅v=AvA \cdot v = Av.

Exercise 5.7. Verify that left multiplication g⋅x=gxg \cdot x = gx is indeed a group action.

Exercise 5.8. Verify that conjugation g⋅x=gxg−1g \cdot x = gxg^{-1} is indeed a group action.

Exercise 5.9. Let GG act on XX. Prove that for each g∈Gg \in G, the map σg:X→X\sigma_g: X \to X defined by σg(x)=g⋅x\sigma_g(x) = g \cdot x is a bijection.


Orbits and Stabilizers#

Definition 5.10. Let GG act on XX. For x∈Xx \in X, the orbit of xx is:Gx={g⋅x∣g∈G}.Gx = \{g \cdot x \mid g \in G\}.

Definition 5.11. For x∈Xx \in X, the stabilizer of xx is:Gx={g∈G∣g⋅x=x}.G_x = \{g \in G \mid g \cdot x = x\}.

Theorem 5.12. The orbits of a group action partition XX.

Theorem 5.13. For each x∈Xx \in X, the stabilizer GxG_x is a subgroup of GG.

Theorem 5.14 (Orbit-Stabilizer Theorem). If GG acts on XX and x∈Xx \in X, then:∣Gx∣=(G:Gx).|Gx| = (G : G_x).In particular, if GG is finite, then ∣Gx∣|Gx| divides ∣G∣|G|.

Example 5.15. Let S3S_3 act on X={1,2,3}X = \{1, 2, 3\}. The stabilizer of 11 is G1={ι,(23)}G_1 = \{\iota, (23)\}, which has order 22. The orbit of 11 is {1,2,3}\{1, 2, 3\}, and indeed 3=6/23 = 6/2.

Exercise 5.16. Let D4D_4 act on the vertices of a square. Find the orbit and stabilizer of vertex 11.

Exercise 5.17. Let GG act on XX. Prove that for x,y∈Xx, y \in X, Gx=GyGx = Gy iff y=gxy = gx for some g∈Gg \in G.


Fixed Points and the Class Equation#

【新增 5.18.1】 Theorem 5.18.1 (Conjugation Action). Let GG act on itself by conjugation. Then:

  1. The orbit of gg is its conjugacy class Cl(g)={xgx−1∣x∈G}Cl(g) = \{xgx^{-1} \mid x \in G\}.
  2. The stabilizer of gg is its centralizer CG(g)={x∈G∣xg=gx}C_G(g) = \{x \in G \mid xg = gx\}.
  3. ∣Cl(g)∣=(G:CG(g)).|Cl(g)| = (G : C_G(g)).
  4. g∈Z(G)g \in Z(G) iff ∣Cl(g)∣=1|Cl(g)| = 1.

Definition 5.19. Let GG act on XX. The set of fixed points of the action is:XG={x∈X∣g⋅x=x for all g∈G}.X^G = \{x \in X \mid g \cdot x = x \text{ for all } g \in G\}.

Definition 5.20. Let GG act on itself by conjugation. The orbits are called conjugacy classes. The class equation is:∣G∣=∣Z(G)∣+∑i=1k∣Ci∣,|G| = |Z(G)| + \sum_{i=1}^k |C_i|,where C1,…,CkC_1, \ldots, C_k are the conjugacy classes with more than one element.

Example 5.21. In S3S_3, the conjugacy classes are {ι}\{\iota\}, {(12),(13),(23)}\{(12), (13), (23)\}, and {(123),(132)}\{(123), (132)\}. The class equation is 6=1+3+26 = 1 + 3 + 2.

Exercise 5.22. Find the conjugacy classes of D4D_4 and write the class equation.

Exercise 5.23. Prove that if GG acts on XX, then the kernel of the induced homomorphism G→Sym⁡(X)G \to \operatorname{Sym}(X) is ⋂x∈XGx\bigcap_{x \in X} G_x.


Cayley's Theorem#

Theorem 5.24 (Cayley's Theorem). Every group GG is isomorphic to a subgroup of the symmetric group Sym⁡(G)\operatorname{Sym}(G).

Corollary 5.25. Every finite group of order nn is isomorphic to a subgroup of SnS_n.

Example 5.26. The cyclic group Z3\mathbb{Z}_3 is isomorphic to a subgroup of S3S_3, namely ⟨(123)⟩\langle (123) \rangle.

Example 5.27. The Klein four-group V4V_4 is isomorphic to a subgroup of S4S_4.

Exercise 5.28. Find the image of Z4\mathbb{Z}_4 under the Cayley embedding into S4S_4.


Transitive and Faithful Actions#

Definition 5.29. A group action is transitive if for all x,y∈Xx, y \in X, there exists g∈Gg \in G such that g⋅x=yg \cdot x = y. Equivalently, XX consists of a single orbit.

Definition 5.30. A group action is faithful if the map G→Sym⁡(X)G \to \operatorname{Sym}(X) is injective, i.e., if g⋅x=xg \cdot x = x for all x∈Xx \in X implies g=eg = e.

Theorem 5.31. If GG acts transitively on XX and x∈Xx \in X, then:∣X∣=(G:Gx).|X| = (G : G_x).

Theorem 5.32. The action is faithful iff ⋂x∈XGx={e}\bigcap_{x \in X} G_x = \{e\}.

Corollary 5.33. The left regular action (action of GG on itself by left multiplication) is faithful.

Exercise 5.34. Let GG act on XX by conjugation. Describe the kernel of the induced homomorphism G→Sym⁡(G)G \to \operatorname{Sym}(G).

Exercise 5.35. Show that DnD_n acts transitively on the vertices of a regular nn-gon. Find the stabilizer of a vertex.


Burnside's Lemma#

Definition 5.36. For g∈Gg \in G, let Fix⁡(g)={x∈X∣g⋅x=x}\operatorname{Fix}(g) = \{x \in X \mid g \cdot x = x\}.

Theorem 5.37 (Burnside's Lemma). If GG is finite and acts on a finite set XX, then the number of orbits is:1∣G∣∑g∈G∣Fix⁡(g)∣.\frac{1}{|G|} \sum_{g \in G} |\operatorname{Fix}(g)|.

Example 5.38. How many inequivalent colorings of the vertices of a square are there using two colors? The dihedral group D4D_4 acts on the 24=162^4 = 16 colorings. Burnside's Lemma gives:

  • Identity: fixes 1616
  • Rotations by 90∘90^\circ and 270∘270^\circ: fix 22 each
  • Rotation by 180∘180^\circ: fixes 44
  • Reflections: fix 44 each

Total orbits = (16+2+2+4+4+4+4+4)/8=40/8=5(16 + 2 + 2 + 4 + 4 + 4 + 4 + 4)/8 = 40/8 = 5.

Exercise 5.39. How many inequivalent ways are there to color the vertices of a triangle using three colors?

Exercise 5.40. Use Burnside's Lemma to count the number of distinct necklaces with 66 beads, each bead either black or white.

Exercise 5.41. How many inequivalent ways are there to color the edges of a square using two colors?


Cauchy's Theorem#

Theorem 5.42 (Cauchy's Theorem). Let GG be a finite group and let pp be a prime dividing ∣G∣|G|. Then GG has an element of order pp.

Corollary 5.43. If pp divides ∣G∣|G|, then GG has a subgroup of order pp.

Example 5.44. Every group of order 66 has an element of order 22 and an element of order 33.

Exercise 5.45. Use Cauchy's theorem to prove that every group of order 2p2p (where pp is an odd prime) has a normal subgroup of order pp.

Exercise 5.46. Let GG be a finite group and let pp be a prime dividing ∣G∣|G|. Prove that GG has a subgroup of order pp using Cauchy's theorem.


Summary#

We have introduced:

  • Group actions: definition and examples
  • Group actions as homomorphisms G→Sym⁡(X)G \to \operatorname{Sym}(X)
  • Orbits and stabilizers
  • Orbit-Stabilizer Theorem
  • Conjugation action: conjugacy classes and centralizers
  • Fixed points and the class equation
  • Cayley's Theorem: every group is a permutation group
  • Transitive and faithful actions
  • Burnside's Lemma for counting orbits
  • Cauchy's Theorem: existence of elements of prime order