Cayley's Theorem

Every group embeds into a permutation group via the left regular action
Cayley's Theorem

Cayley’s Theorem. Let GG be a . Let Sym(G)\operatorname{Sym}(G) denote the group of all bijections σ:GG\sigma: G \to G under composition. For each gGg \in G, define the left translation map Lg:GGL_g: G \to G by Lg(x)=gxL_g(x)=gx. Then the map

λ:GSym(G),λ(g)=Lg, \lambda: G \to \operatorname{Sym}(G), \qquad \lambda(g)=L_g,

is an injective (i.e. a ). Equivalently, GG is isomorphic to a subgroup of Sym(G)\operatorname{Sym}(G).

Cayley’s theorem says every abstract group can be realized concretely as a group of permutations. The construction comes from the of GG on itself, which is and hence yields a .

Proof sketch. The rule gLgg \mapsto L_g respects multiplication because Lgh=LgLhL_{gh} = L_g \circ L_h. Injectivity follows from Lg=idL_g = \mathrm{id} implying g=Lg(e)=eg = L_g(e)=e.