I want to show that if there is a surjective homomorphism $\phi: S_n \rightarrow \{1,-1\}$ for $n\geqslant 2$, then that homomorphism is $\text{sign}$, where $$\text{sign}\ \sigma = (-1)^{\text{no. of transpositions composed to produce} \ \sigma}.$$
My idea is this: as $\phi$ is a surjective function, then there is a $\sigma \in S_n$ such that $\phi (\sigma) = -1$. Now suppose $\sigma$ can be represented as a product of transpositions $t_1, t_2, …, t_k$, so have $\phi(t_1)\phi(t_2)…\phi(t_k)=-1$, so at least one of $\phi(t_i)$ is $-1$.
My aim is to show that every transposition maps to $-1$, and then the result follows as any permutation can be represented as a product of transpositions. But so far, I only have that there must be a single transposition that maps to $-1$, any hints on where to go from here?
Best Answer
Hint Any two transpositions are conjugate in $S_n$, that is, for any transpositions $t, t' \in S_n$, there is a permutation $g \in S_n$ such that $$t' = g t g^{-1} .$$ What happens if you apply a homomorphism $\phi : S_n \to \{\pm 1\}$ to both sides of this equation?