6 - Symmetric groups

Symmetric group

Let S be a set, then the set of all bijection on S, with function composition as the operator, is a group, called the symmetric group on S, denoted by Sym(S).

Here, the identity map id:SS acts as the group identity, with any fSym(S) id f=f id=f.

The inverse function f1 acts as the inverse element of each fSym(S).

Associativity and closure follow as properties of composition of bijections.


Set cardinalities categorize symmetric groups

Let S and T be sets, such that the cardinalities of S and T are equal. Then Sym(S) is isomorphic to Sym(T)

Commutative Diagram

![[diagram-20240712 (5).svg#invert_B]]

\begin{proof}

Let S, T be sets with equal cardinality, and ϕ:ST be a bijection. Moreover, let fS denote a bijection on S, and fT denote a bijection on T.

By observing the commutative diagram above, we see that for every fTSYM(T) there exists an fS such that fS=ϕ1fTϕ . Note that this indeed a bijection on S, because the composition of bijections is a bijection.

Hence we claim that the map fTϕ1fTϕ is an isomorphism from SYM(T) to SYM(S).

Homomorphicity: FT1 FT2ϕ FT1 FT2 ϕ1=(ϕ1 fT1 fT2 ϕ) (ϕ1 fT1 fT2 ϕ)

Surjectivity:
Let fS be an arbitrary element of SYM(S), then we have fT=ϕfSϕ1SYM(T) That maps to fS.

Injectivity:
let ϕ1fT1ϕ=ϕ1fT2ϕ Then due to the properties of bijections, fT1=fT2 .

\end{proof}


All groups are isomorphic to a subgroup of a symmetric group.

Let G be a group, then G is isomorphic to a subgroup of symmetric group on the set G, Sym(G).

\begin{proof}
Because left coset maps of a group are bijective They are a subset of Sym(G). Because left coset maps on a group are isomorphic to the group itself, G is isomorphic to a subgroup of Sym(G).

\end{proof}