# Prove that a permutation is even iff it can be decomposed into an even number of transpositions

For a symmetric group $S_n$. Is the decomposition starting from the permutation $(1,2,3,...,n)$? Also, how could I prove it if this is the case?

For a permutation $\sigma \in S_n$, it is even if $$\mathrm{sgn}(\sigma) = \prod_{1\leq i < j \leq n} \frac{\sigma(j)-\sigma(i)}{j-i} = 1$$

For example, $S_2$ would be the set of the following permutations

$$\begin{pmatrix} 1 & 2 \\ 1 & 2\end{pmatrix}, \begin{pmatrix} 1 & 2 \\ 2 & 1\end{pmatrix}$$

Where these are not matrices. the top row represents the domain and the bottom row represents the image of $\sigma$

• Usually this is taken to be the definition of an even permutation. In your case, could you clarify what your definition is? – Misha Lavrov Apr 9 '17 at 16:46
• I updated it with a few more things. Is the decomposition starting from the permutation $(1,2,...,n)$? – The Bosco Apr 9 '17 at 17:38
• Yes, assuming that by this you mean the identity permutation. – Misha Lavrov Apr 9 '17 at 17:42

An $r$-cycle $(i_1\ i_2\ldots i_r)$ can be decomposed into a product of transpositions $(i_1\ i_r)\ldots(i_1\ i_3)(i_1\ i_2)$, every permutation $\sigma \in S_n$ can be decomposed into a product of cycles and transpositions are odd.