[Math] The Cayley Representation Theorem.

finite-groupsgroup-theorypermutationssymmetric-groups

This theorem states that "Any group is isomorphic to a subgroup of a group permutations."
I only ask if someone could provide a simple example so that i can fully understand this theorem.

Best Answer

You ask for a simple example, so here is one: Consider the group $\mathbb{Z} / n\mathbb{Z}$. This is a finite abelien group under addition of order $n$.

Let $$ \phi: \mathbb{Z} / n\mathbb{Z} \longrightarrow S_n $$ given by $$ \phi([1]) = (1\; 2\; 3\; \dots \; n ). $$ So $$ \phi([m]) = (1\; 2\; 3\; \dots \; n )^m. $$ Then $\phi$ is a injective. Note that $S_n$ is a multiplicative group.

Note that all you had to do here was to find an element of order $n$ in $S_n$. In fact, the above example is easily extended to embedding any cyclic group in some permutation group (since any cyclic group is isomorphic to a $\mathbb{Z} / n\mathbb{Z}$ for some $n$).

Related Question