Conjugation Action
Statement
For a group , conjugation by is the map defined by
Each is a group automorphism of . The assignment defines a group homomorphism
The conjugacy class of is the orbit under this action. Normal subgroups are exactly those that are unions of conjugacy classes.
Visualization
In , conjugate elements have the same cycle type:
| Conjugacy class | Elements | Size |
|---|---|---|
| identity | 1 | |
| transpositions | 3 | |
| 3-cycles | 2 |
Verify: . So and are conjugate via .
Conjugation table (column g, row h, entry g h g⁻¹) in S₃:
h\g | (12) | (13) | (23)
──────┼────────┼────────┼────────
(12) | (12) | (13) | (23)
(13) | (12) | (13) | (23) ← wait, each conjugate is a transposition
(123) | (132) | (132) | (132)
(132) | (123) | (123) | (123)
The kernel of is (since no nontrivial element of commutes with all others), so is injective — this gives the embedding .
Proof Sketch
- is a bijection with inverse (since ).
- is a homomorphism: .
- The map is a homomorphism: .
- for all .
Connections
Conjugation is the key ingredient in the Sylow TheoremsSylow TheoremsPrime-power subgroups always exist, are conjugate, and their count is constrainedRead more →: Sylow subgroups are conjugate to each other, and the number of Sylow -subgroups is — counted by the orbit-stabilizer theorem applied to the conjugation action. The Class EquationClass EquationThe order of a finite group equals the size of its center plus the sum of sizes of nontrivial conjugacy classes.Read more → also comes from decomposing into conjugacy classes. The First Isomorphism TheoremFirst Isomorphism TheoremThe image of a homomorphism is isomorphic to the domain modulo the kernelRead more → applies to to give .
Lean4 Proof
import Mathlib.Algebra.Group.End
/-- Conjugation `g ↦ (h ↦ g * h * g⁻¹)` is a group homomorphism G →* MulAut G.
Mathlib: `MulAut.conj` in `Mathlib.Algebra.Group.End`. -/
example {G : Type*} [Group G] (g h : G) :
MulAut.conj g h = g * h * g⁻¹ :=
MulAut.conj_apply g h
/-- The conjugation map itself is a group homomorphism. -/
noncomputable def conjugation_hom (G : Type*) [Group G] : G →* MulAut G :=
MulAut.conjReferenced by
- Dihedral GroupGroup Theory
- Alternating GroupGroup Theory