LESSWRONG
LW

28
Wikitags

The sign of a permutation is well-defined

Edited by Patrick Stevens last updated 17th Jun 2016
Requires: Group homomorphism, Symmetric group

The symmetric group Sn contains elements which are made up from transpositions (proof). It is a fact that if σ∈Sn 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.

Proof

Let c(σ) be the number of cycles in the disjoint cycle decomposition of σ∈Sn, including singletons. For example, c applied to the identity yields n, while c((12))=n−1 because (12) is shorthand for (12)(3)(4)…(n−1)(n). We claim that multiplying σ by a transposition either increases c(σ) by 1, or decreases it by 1.

Indeed, let τ=(kl). Either k,l lie in the same cycle in σ, or they lie in different ones.

  • If they lie in the same cycle, then σ=α(ka1a2…arlas…at)β where α,β are disjoint from the central cycle (and hence commute with (kl)). Then σ(kl)=α(kas…at)(la1…ar)β, so we have broken one cycle into two.
  • If they lie in different cycles, then σ=α(ka1a2…ar)(lb1…bs)β where again α,β are disjoint from (kl). Then σ(kl)=α(kb1b2…bsla1…ar)β, so we have joined two cycles into one.

Therefore c takes even values if there are evenly many transpositions in σ, and odd values if there are odd-many transpositions in σ.

More formally, let σ=α1…αa=β1…βb, where αi,βj are transpositions.

Then c(σ) flips odd-to-even or even-to-odd for each integer 1,2,…,a; it also flips odd-to-even or even-to-odd for each integer 1,2,…,b. Therefore a and b must be of the same parity.

Parents:
Symmetric group
Discussion
1
Discussion
1