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 be a group and a nonempty set. A (left) group action of on is a functionsuch that for all and :
- .
- .
When such an action exists, we say that acts on , and is called a -set.
【新增 5.1.1】 Theorem 5.1.1. Let act on . Then the mapis a group homomorphism. Conversely, any group homomorphism defines a group action by .
Corollary 5.1.2. A group action is faithful iff is injective.
Example 5.2. The symmetric group acts on by .
Example 5.3. Any group acts on itself by left multiplication: .
Example 5.4. Any group acts on itself by conjugation: .
Example 5.5. The dihedral group acts on the vertices of a regular -gon.
Example 5.6. acts on by matrix multiplication: .
Exercise 5.7. Verify that left multiplication is indeed a group action.
Exercise 5.8. Verify that conjugation is indeed a group action.
Exercise 5.9. Let act on . Prove that for each , the map defined by is a bijection.
Orbits and Stabilizers#
Definition 5.10. Let act on . For , the orbit of is:
Definition 5.11. For , the stabilizer of is:
Theorem 5.12. The orbits of a group action partition .
Theorem 5.13. For each , the stabilizer is a subgroup of .
Theorem 5.14 (Orbit-Stabilizer Theorem). If acts on and , then:In particular, if is finite, then divides .
Example 5.15. Let act on . The stabilizer of is , which has order . The orbit of is , and indeed .
Exercise 5.16. Let act on the vertices of a square. Find the orbit and stabilizer of vertex .
Exercise 5.17. Let act on . Prove that for , iff for some .
Fixed Points and the Class Equation#
【新增 5.18.1】 Theorem 5.18.1 (Conjugation Action). Let act on itself by conjugation. Then:
- The orbit of is its conjugacy class .
- The stabilizer of is its centralizer .
- iff .
Definition 5.19. Let act on . The set of fixed points of the action is:
Definition 5.20. Let act on itself by conjugation. The orbits are called conjugacy classes. The class equation is:where are the conjugacy classes with more than one element.
Example 5.21. In , the conjugacy classes are , , and . The class equation is .
Exercise 5.22. Find the conjugacy classes of and write the class equation.
Exercise 5.23. Prove that if acts on , then the kernel of the induced homomorphism is .
Cayley's Theorem#
Theorem 5.24 (Cayley's Theorem). Every group is isomorphic to a subgroup of the symmetric group .
Corollary 5.25. Every finite group of order is isomorphic to a subgroup of .
Example 5.26. The cyclic group is isomorphic to a subgroup of , namely .
Example 5.27. The Klein four-group is isomorphic to a subgroup of .
Exercise 5.28. Find the image of under the Cayley embedding into .
Transitive and Faithful Actions#
Definition 5.29. A group action is transitive if for all , there exists such that . Equivalently, consists of a single orbit.
Definition 5.30. A group action is faithful if the map is injective, i.e., if for all implies .
Theorem 5.31. If acts transitively on and , then:
Theorem 5.32. The action is faithful iff .
Corollary 5.33. The left regular action (action of on itself by left multiplication) is faithful.
Exercise 5.34. Let act on by conjugation. Describe the kernel of the induced homomorphism .
Exercise 5.35. Show that acts transitively on the vertices of a regular -gon. Find the stabilizer of a vertex.
Burnside's Lemma#
Definition 5.36. For , let .
Theorem 5.37 (Burnside's Lemma). If is finite and acts on a finite set , then the number of orbits is:
Example 5.38. How many inequivalent colorings of the vertices of a square are there using two colors? The dihedral group acts on the colorings. Burnside's Lemma gives:
- Identity: fixes
- Rotations by and : fix each
- Rotation by : fixes
- Reflections: fix each
Total orbits = .
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 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 be a finite group and let be a prime dividing . Then has an element of order .
Corollary 5.43. If divides , then has a subgroup of order .
Example 5.44. Every group of order has an element of order and an element of order .
Exercise 5.45. Use Cauchy's theorem to prove that every group of order (where is an odd prime) has a normal subgroup of order .
Exercise 5.46. Let be a finite group and let be a prime dividing . Prove that has a subgroup of order using Cauchy's theorem.
Summary#
We have introduced:
- Group actions: definition and examples
- Group actions as homomorphisms
- 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