Prove that $A_n$ is normal in $S_n$ [duplicate]
Mia Lopez
How to prove that $A_n$ is normal in $S_n$?
Note that $A_n$ is a group of even permutations on a set of length $n$. $S_n$ is the group of all permutations on $n$ symbols.
Definition: A subgroup $H$ is normal in $G$ means: for all $g \in G$, $g^{-1}Hg\subseteq H$.
$\endgroup$ 33 Answers
$\begingroup$Subgroup of index $2$ is Normal.
$\endgroup$ 1 $\begingroup$Hint:
Based on the definitions you have provided you should try to show that if $g$ is any permutation (odd or even) then $g^{-1}$ will be the same. Now if $h$ is a permutation, then the parity of the number of transpositions required to represent $ghg^{-1}$ will be the same as that of $h$.
$\endgroup$ $\begingroup$Let $\epsilon: (S_n, \circ) \to (\{-1,1\}, \times)$ be the signature map; i.e.:
For a given $p \in S_n$, $\epsilon(p) = (-1)^{\large \# I_p}$, where $I_p:=\{(i,j), i < j \text{ and } p(i) > p(j) \}$.
We have that $\epsilon$ is a homomorphism; meaning that for any two permutations $p_1$ and $p_2$, $\epsilon(p_1 p_2) = \epsilon(p_1) \epsilon(p_2)$.
Observe that $\ker \epsilon = \{ p \in S_n, \epsilon(p) = 1 \} = A_n$. As the kernel of a homomorphism is a normal subgroup, it follows that $A_n \unlhd S_n$.
$\endgroup$