---
tag: 0151VYVX27
kind: statement
role: theorem
name: Cayley's theorem
msc: [20B30]
uses: [0K5TWJAGPD, 0RJMNEN3BJ, 0B0WE1GKTK, 085PND4KNT]
sources:
  - url: https://en.wikipedia.org/wiki/Cayley's_theorem
    locator: lead section
  - url: https://en.wikipedia.org/wiki/Cayley's_theorem
    locator: History
same_as:
  wikidata: Q179208
  wikipedia: Cayley's theorem
---

## Statement

Let $G$ be a [[group|G5S1M9]].
Then $G$ is [[isomorphic|08MG7H8JW5]] to a [[subgroup|0X1JXT47GA]] of the [[symmetric group|0515A6D2Y1]] $\operatorname{Sym}(G)$.
Explicitly, the map $g \mapsto \ell_g$, where $\ell_g(x) = gx$, is an injective [[group homomorphism|0JYTG5K9Y4]] from $G$ to $\operatorname{Sym}(G)$.

## Remarks

The map comes from the [[action by left multiplication|0K5TWJAGPD]], and it is injective because $\ell_g(e) = g$.
If $|G| = n$ is finite, then $G$ is isomorphic to a subgroup of $S_n$.
Often a smaller symmetric group is enough, for example $S_3$ is isomorphic to a subgroup of $S_3$ and not only of $S_6$.

## History

Arthur Cayley introduced abstract groups in 1854.
At that time, groups were usually groups of permutations, and the theorem shows that the abstract notion gives nothing more, up to isomorphism.

## Explanations

### L1 human

Each element of a group shuffles the elements of the group when you multiply on the left.
Different elements give different shuffles, and the product of elements gives the composition of shuffles.
So each group is a group of permutations, up to isomorphism.