The symmetric group contains elements which are made up from transpositions (proof). It is a fact that if can be made by multiplying together an even number of transpositions, then it cannot be made by multiplying an odd number of transpositions, and vice versa.
Equivalently, there is a group homomorphism from to the cyclic group , taking the value on those permutations which are made from an even number of permutations and on those which are made from an odd number.
Let be the number of cycles in the disjoint cycle decomposition of , including singletons. For example, applied to the identity yields , while because is shorthand for . We claim that multiplying by a transposition either increases by , or decreases it by .
Indeed, let . Either lie in the same cycle in , or they lie in different ones.
Therefore takes even values if there are evenly many transpositions in , and odd values if there are odd-many transpositions in .
More formally, let , where are transpositions.
(The following paragraph is more succinctly expressed as: " and also , so .")
Then flips odd-to-even or even-to-odd for each integer ; it also flips odd-to-even or even-to-odd for each integer . Therefore and must be of the same parity.