Let be a set, then the set of all bijection on , with function composition as the operator, is a group, called the symmetric group on , denoted by .
Here, the identity map acts as the group identity, with any .
The inverse function acts as the inverse element of each .
Associativity and closure follow as properties of composition of bijections.
Set cardinalities categorize symmetric groups
Let and be sets, such that the cardinalities of and are equal. Then is isomorphic to
Commutative Diagram
![[diagram-20240712 (5).svg#invert_B]]
\begin{proof}
Let , be sets with equal cardinality, and be a bijection. Moreover, let denote a bijection on , and denote a bijection on .
By observing the commutative diagram above, we see that for every there exists an such that . Note that this indeed a bijection on , because the composition of bijections is a bijection.
Hence we claim that the map is an isomorphism from to .
Homomorphicity:
Surjectivity:
Let be an arbitrary element of , then we have That maps to .
Injectivity:
let Then due to the properties of bijections, .
\end{proof}
All groups are isomorphic to a subgroup of a symmetric group.
Let be a group, then is isomorphic to a subgroup of symmetric group on the set, .