Conjugation Action

lean4-proofgroup-theoryvisualization
cg(h)=ghg1,conj:GAut(G)c_g(h) = g h g^{-1},\quad \mathrm{conj} : G \to \mathrm{Aut}(G)

Statement

For a group GG, conjugation by gg is the map cg:GGc_g : G \to G defined by

cg(h)=ghg1.c_g(h) = g h g^{-1}.

Each cgc_g is a group automorphism of GG. The assignment gcgg \mapsto c_g defines a group homomorphism

conj:GAut(G),ker(conj)=Z(G).\mathrm{conj} : G \to \mathrm{Aut}(G), \quad \ker(\mathrm{conj}) = Z(G).

The conjugacy class of hh is the orbit {ghg1:gG}\{g h g^{-1} : g \in G\} under this action. Normal subgroups are exactly those that are unions of conjugacy classes.

Visualization

In S3={e,(12),(13),(23),(123),(132)}S_3 = \{e, (12), (13), (23), (123), (132)\}, conjugate elements have the same cycle type:

Conjugacy classElementsSize
{e}\{e\}identity1
{(12),(13),(23)}\{(12), (13), (23)\}transpositions3
{(123),(132)}\{(123), (132)\}3-cycles2

Verify: (23)(12)(23)1=(23)(12)(23)=(13)(23)(12)(23)^{-1} = (23)(12)(23) = (13). So (12)(12) and (13)(13) are conjugate via (23)(23).

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 conj\mathrm{conj} is Z(S3)={e}Z(S_3) = \{e\} (since no nontrivial element of S3S_3 commutes with all others), so conj\mathrm{conj} is injective — this gives the embedding S3Aut(S3)S_3 \hookrightarrow \mathrm{Aut}(S_3).

Proof Sketch

  1. cgc_g is a bijection with inverse cg1c_{g^{-1}} (since cgcg1=idc_g \circ c_{g^{-1}} = \mathrm{id}).
  2. cgc_g is a homomorphism: cg(h1h2)=gh1h2g1=(gh1g1)(gh2g1)=cg(h1)cg(h2)c_g(h_1 h_2) = g h_1 h_2 g^{-1} = (g h_1 g^{-1})(g h_2 g^{-1}) = c_g(h_1) c_g(h_2).
  3. The map gcgg \mapsto c_g is a homomorphism: cg1g2(h)=g1g2hg21g11=cg1(cg2(h))c_{g_1 g_2}(h) = g_1 g_2 h g_2^{-1} g_1^{-1} = c_{g_1}(c_{g_2}(h)).
  4. gker(conj)cg=idghg1=hg \in \ker(\mathrm{conj}) \Leftrightarrow c_g = \mathrm{id} \Leftrightarrow g h g^{-1} = h for all hgZ(G)h \Leftrightarrow g \in Z(G).

Connections

Conjugation is the key ingredient in the Sylow TheoremsSylow TheoremspkG    HG,  H=pkp^k \mid |G| \implies \exists H \leq G,\; |H| = p^kPrime-power subgroups always exist, are conjugate, and their count is constrainedRead more →: Sylow subgroups are conjugate to each other, and the number of Sylow pp-subgroups is G:NG(P)|G : N_G(P)| — counted by the orbit-stabilizer theorem applied to the conjugation action. The Class EquationClass EquationG=Z(G)+non-centralcl(g)|G| = |Z(G)| + \sum_{\text{non-central}} |\mathrm{cl}(g)|The order of a finite group equals the size of its center plus the sum of sizes of nontrivial conjugacy classes.Read more → G=Z(G)+[G:CG(xi)]|G| = |Z(G)| + \sum [G : C_G(x_i)] also comes from decomposing GG into conjugacy classes. The First Isomorphism TheoremFirst Isomorphism TheoremG/ker(f)im(f)G / \ker(f) \cong \operatorname{im}(f)The image of a homomorphism is isomorphic to the domain modulo the kernelRead more → applies to conj\mathrm{conj} to give G/Z(G)Inn(G)G/Z(G) \cong \mathrm{Inn}(G).

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.conj