Canonical: https://knowlpedia.com/algebra-groups/cayleys-theorem/

# Cayley's Theorem

Every group embeds into a permutation group via the left regular action

**Cayley's Theorem.**
Let \(G\) be a [group](https://knowlpedia.com/algebra-groups/group/). Let \(\operatorname{Sym}(G)\) denote the group of all bijections \(\sigma: G \to G\) under composition. For each \(g \in G\), define the left translation map \(L_g: G \to G\) by \(L_g(x)=gx\). Then the map
\[
\lambda: G \to \operatorname{Sym}(G), \qquad \lambda(g)=L_g,
\]

is an injective [homomorphism](https://knowlpedia.com/algebra-groups/group-homomorphism/) (i.e. a [monomorphism](https://knowlpedia.com/algebra-groups/group-monomorphism/)). Equivalently, \(G\) is isomorphic to a subgroup of \(\operatorname{Sym}(G)\).

## Remarks

Cayley's theorem says every abstract group can be realized concretely as a group of permutations. The construction comes from the [left multiplication action](https://knowlpedia.com/algebra-groups/left-multiplication-action/) of \(G\) on itself, which is [faithful](https://knowlpedia.com/algebra-groups/faithful-action/) and hence yields a [permutation representation](https://knowlpedia.com/algebra-groups/permutation-representation/).
