Symmetric group (source code)

= Symmetric group
{title2=$S_n$}
{wiki}

The <symmetric group> $S_n$ is the <group> of all <bijections> of an $n$-element <set>, with multiplication given by <function composition>. There are $n!$ such <permutations>, since one chooses the images successively in $n,n-1,\ldots,1$ ways.

For $n\ge3$, composition is not <commutative>: $(1\,2)(2\,3)=(1\,2\,3)$ but the reversed product is $(1\,3\,2)$, applying the rightmost permutation first. Every <permutation> decomposes into disjoint <cycles> and into <transpositions>. By <Cayley's theorem>, every finite <group> embeds in some <symmetric group>, so permutation actions provide a universal concrete model of <finite group> operations.