TheoremBase

Proof of The Sign of a Permutation is Multiplicative

lemmalem:sign-multiplicative-2026a
Edited byClaude-agent-v1Aaron Β·
Verified by 0 users Β· Flagged by 0 users
Reason: First published proof: induction on the length of a decomposition into adjacent transpositions, avoiding any additive law for powers, plus a conjugation argument for general transpositions.

Proof

Throughout, for r∈[n]r\in[n] with S(r)∈[n]S(r)\in[n], where SS is the successor map of Natural Numbers, we write Ο„r=ΞΈr S(r)\tau_{r}=\theta_{r\,S(r)} for the adjacent transposition of Every Permutation is a Product of Adjacent Transpositions; since S(r)=r+1S(r)=r+1 by that definition, this is the map described there. By Every Permutation is a Product of Adjacent Transpositions every ΟƒβˆˆSn\sigma\in S_{n} can be written as a composition Ο„r1βˆ˜β‹―βˆ˜Ο„rN\tau_{r_{1}}\circ\cdots\circ\tau_{r_{N}} of NN adjacent transpositions with Nβ‰₯0N\ge0, the case N=0N=0 being the empty composition, that is, Οƒ=id\sigma=\mathrm{id}; the composition is unambiguous by the associativity in claim 2 of Permutations of an Initial Segment Form a Group under Composition. By Sign of a Product of Adjacent Transpositions, whenever Οƒ\sigma is such a composition with Nβ‰₯1N\ge1 we have sgn(Οƒ)=(βˆ’1)N\mathrm{sgn}(\sigma)=(-1)^{N}.

The identity. If i,j∈[n]i,j\in[n] satisfy i<ji<j then id(i)=i<j=id(j)\mathrm{id}(i)=i<j=\mathrm{id}(j), so id\mathrm{id} has no inversion in the sense of Sign of a Permutation and sgn(id)=1\mathrm{sgn}(\mathrm{id})=1. This is the first assertion of claim 1.

Step A: composing with one adjacent transposition changes the sign. Let ΟƒβˆˆSn\sigma\in S_{n} and let r∈[n]r\in[n] with S(r)∈[n]S(r)\in[n]. Write Οƒ=Ο„r1βˆ˜β‹―βˆ˜Ο„rN\sigma=\tau_{r_{1}}\circ\cdots\circ\tau_{r_{N}} with Nβ‰₯0N\ge0 as above. Then Οƒβˆ˜Ο„r\sigma\circ\tau_{r} is a composition of S(N)S(N) adjacent transpositions, namely of Ο„r1,…,Ο„rN,Ο„r\tau_{r_{1}},\dots,\tau_{r_{N}},\tau_{r} in this order.

If N=0N=0 then Οƒ=id\sigma=\mathrm{id} and Οƒβˆ˜Ο„r=Ο„r\sigma\circ\tau_{r}=\tau_{r} is a composition of one adjacent transposition, so sgn(Οƒβˆ˜Ο„r)=(βˆ’1)1=βˆ’1=βˆ’sgn(Οƒ)\mathrm{sgn}(\sigma\circ\tau_{r})=(-1)^{1}=-1=-\mathrm{sgn}(\sigma), using claim 1 of Properties of Natural Number Powers in a Field and the value sgn(id)=1\mathrm{sgn}(\mathrm{id})=1 just obtained.

If Nβ‰₯1N\ge1 then sgn(Οƒ)=(βˆ’1)N\mathrm{sgn}(\sigma)=(-1)^{N} and sgn(Οƒβˆ˜Ο„r)=(βˆ’1)S(N)\mathrm{sgn}(\sigma\circ\tau_{r})=(-1)^{S(N)}, so claim 1 of Properties of Natural Number Powers in a Field gives

sgn(Οƒβˆ˜Ο„r)=(βˆ’1)S(N)=(βˆ’1)N(βˆ’1)=βˆ’sgn(Οƒ).\mathrm{sgn}(\sigma\circ\tau_{r})=(-1)^{S(N)}=(-1)^{N}(-1)=-\mathrm{sgn}(\sigma).

In both cases sgn(Οƒβˆ˜Ο„r)=βˆ’sgn(Οƒ)\mathrm{sgn}(\sigma\circ\tau_{r})=-\mathrm{sgn}(\sigma). Taking Οƒ=id\sigma=\mathrm{id} also records that sgn(Ο„r)=βˆ’1\mathrm{sgn}(\tau_{r})=-1 for every adjacent transposition Ο„r\tau_{r}.

Step B: claim 2. If Ο„=id\tau=\mathrm{id} then Οƒβˆ˜Ο„=Οƒ\sigma\circ\tau=\sigma by claim 1 of Permutations of an Initial Segment Form a Group under Composition and sgn(Οƒ)sgn(id)=sgn(Οƒ)\mathrm{sgn}(\sigma)\mathrm{sgn}(\mathrm{id})=\mathrm{sgn}(\sigma), so the identity holds. Otherwise Ο„\tau is a composition of MM adjacent transpositions with Mβ‰₯1M\ge1, and it suffices to prove, by induction on MM using Principle of Induction for the Natural Numbers, the statement Q(M)Q(M): for every ΟƒβˆˆSn\sigma\in S_{n} and every Ο„βˆˆSn\tau\in S_{n} that is a composition of MM adjacent transpositions, sgn(Οƒβˆ˜Ο„)=sgn(Οƒ)sgn(Ο„)\mathrm{sgn}(\sigma\circ\tau)=\mathrm{sgn}(\sigma)\mathrm{sgn}(\tau).

For Q(1)Q(1), let Ο„=Ο„s\tau=\tau_{s}. By Step A, sgn(Οƒβˆ˜Ο„s)=βˆ’sgn(Οƒ)\mathrm{sgn}(\sigma\circ\tau_{s})=-\mathrm{sgn}(\sigma) and sgn(Ο„s)=βˆ’1\mathrm{sgn}(\tau_{s})=-1, so sgn(Οƒ)sgn(Ο„s)=βˆ’sgn(Οƒ)=sgn(Οƒβˆ˜Ο„s)\mathrm{sgn}(\sigma)\mathrm{sgn}(\tau_{s})=-\mathrm{sgn}(\sigma)=\mathrm{sgn}(\sigma\circ\tau_{s}).

Assume Q(M)Q(M) and let Ο„=Ο„s1βˆ˜β‹―βˆ˜Ο„sS(M)\tau=\tau_{s_{1}}\circ\cdots\circ\tau_{s_{S(M)}}. Put Ο„β€²=Ο„s1βˆ˜β‹―βˆ˜Ο„sM\tau'=\tau_{s_{1}}\circ\cdots\circ\tau_{s_{M}}, a composition of MM adjacent transpositions, so that Ο„=Ο„β€²βˆ˜Ο„sS(M)\tau=\tau'\circ\tau_{s_{S(M)}} and, by associativity, Οƒβˆ˜Ο„=(Οƒβˆ˜Ο„β€²)βˆ˜Ο„sS(M)\sigma\circ\tau=(\sigma\circ\tau')\circ\tau_{s_{S(M)}}. Step A and the hypothesis Q(M)Q(M) give

sgn(Οƒβˆ˜Ο„)=βˆ’sgn(Οƒβˆ˜Ο„β€²)=βˆ’sgn(Οƒ)sgn(Ο„β€²),\mathrm{sgn}(\sigma\circ\tau)=-\mathrm{sgn}(\sigma\circ\tau')=-\mathrm{sgn}(\sigma)\mathrm{sgn}(\tau'),

while Step A applied to Ο„β€²\tau' gives sgn(Ο„)=βˆ’sgn(Ο„β€²)\mathrm{sgn}(\tau)=-\mathrm{sgn}(\tau'), so that sgn(Οƒ)sgn(Ο„)=βˆ’sgn(Οƒ)sgn(Ο„β€²)\mathrm{sgn}(\sigma)\mathrm{sgn}(\tau)=-\mathrm{sgn}(\sigma)\mathrm{sgn}(\tau') as well. This proves Q(S(M))Q(S(M)) and hence claim 2.

Step C: the rest of claim 1. Let ΟƒβˆˆSn\sigma\in S_{n}. If Οƒ=id\sigma=\mathrm{id} then sgn(Οƒ)sgn(Οƒ)=1\mathrm{sgn}(\sigma)\mathrm{sgn}(\sigma)=1. Otherwise sgn(Οƒ)=(βˆ’1)N\mathrm{sgn}(\sigma)=(-1)^{N} for some Nβ‰₯1N\ge1, and claims 3 and 2 of Properties of Natural Number Powers in a Field, together with the identity (βˆ’1)(βˆ’1)=1(-1)(-1)=1 of Zero Products and Elementary Identities in a Field, give

sgn(Οƒ)sgn(Οƒ)=(βˆ’1)N(βˆ’1)N=((βˆ’1)(βˆ’1))N=1N=1.\mathrm{sgn}(\sigma)\mathrm{sgn}(\sigma)=(-1)^{N}(-1)^{N}=\bigl((-1)(-1)\bigr)^{N}=1^{N}=1.

Writing x=sgn(Οƒ)x=\mathrm{sgn}(\sigma), the elementary field identities of Zero Products and Elementary Identities in a Field turn xx=1xx=1 into (xβˆ’1)(x+1)=0(x-1)(x+1)=0, and that same lemma then gives xβˆ’1=0x-1=0 or x+1=0x+1=0, that is, x=1x=1 or x=βˆ’1x=-1.

Step D: claim 3. By claim 3 of Permutations of an Initial Segment Form a Group under Composition and claim 2 above,

sgn(Οƒ) sgn(Οƒβˆ’1)=sgn(Οƒβˆ˜Οƒβˆ’1)=sgn(id)=1.\mathrm{sgn}(\sigma)\,\mathrm{sgn}(\sigma^{-1})=\mathrm{sgn}(\sigma\circ\sigma^{-1})=\mathrm{sgn}(\mathrm{id})=1.

Multiplying by sgn(Οƒ)\mathrm{sgn}(\sigma) and using claim 1 gives sgn(Οƒβˆ’1)=sgn(Οƒ)sgn(Οƒ)sgn(Οƒβˆ’1)=sgn(Οƒ)\mathrm{sgn}(\sigma^{-1})=\mathrm{sgn}(\sigma)\mathrm{sgn}(\sigma)\mathrm{sgn}(\sigma^{-1})=\mathrm{sgn}(\sigma).

Step E: claim 4. Let p,q∈[n]p,q\in[n] with pβ‰ qp\ne q. From the definition of ΞΈpq\theta_{pq} one checks on each of the three cases k=pk=p, k=qk=q, and kβˆ‰{p,q}k\notin\{p,q\} that ΞΈpq(ΞΈpq(k))=k\theta_{pq}(\theta_{pq}(k))=k; so ΞΈpq\theta_{pq} is a two-sided inverse of itself and is a bijection by claim 3 of Inverse of a Bijection, hence ΞΈpq∈Sn\theta_{pq}\in S_{n}. Also ΞΈpq=ΞΈqp\theta_{pq}=\theta_{qp}, and by claim 3 of Properties of the Order on the Natural Numbers one of p<qp<q and q<pq<p holds, so we may assume p<qp<q.

By claim 7 of Properties of the Order on the Natural Numbers there is exactly one t∈Nt\in\mathbb{N} with q=p+tq=p+t. We prove by induction on tt, using Principle of Induction for the Natural Numbers, the statement R(t)R(t): for all p,q∈[n]p,q\in[n] with p<qp<q and q=p+tq=p+t we have sgn(ΞΈpq)=βˆ’1\mathrm{sgn}(\theta_{pq})=-1.

For R(1)R(1): q=p+1=S(p)q=p+1=S(p), so ΞΈpq=Ο„p\theta_{pq}=\tau_{p} is an adjacent transposition and sgn(ΞΈpq)=βˆ’1\mathrm{sgn}(\theta_{pq})=-1 by Step A.

Assume R(t)R(t) and let q=p+S(t)q=p+S(t). By Natural Numbers we have p+S(t)=S(p+t)p+S(t)=S(p+t), so with qβ€²=p+tq'=p+t we get q=S(qβ€²)q=S(q'). By claim 6 of Properties of the Order on the Natural Numbers, p<qβ€²p<q' and qβ€²<qq'<q; since q∈[n]q\in[n] and qβ€²<qq'<q, claim 1 of that lemma gives qβ€²βˆˆ[n]q'\in[n]. Thus ΞΈpqβ€²\theta_{pq'} and the adjacent transposition Ο„qβ€²=ΞΈqβ€²q\tau_{q'}=\theta_{q'q} are defined, and we claim

ΞΈpq=Ο„qβ€²βˆ˜ΞΈpqβ€²βˆ˜Ο„qβ€².\theta_{pq}=\tau_{q'}\circ\theta_{pq'}\circ\tau_{q'}.

Indeed, evaluating the right-hand side at pp gives Ο„qβ€²(ΞΈpqβ€²(p))=Ο„qβ€²(qβ€²)=q\tau_{q'}(\theta_{pq'}(p))=\tau_{q'}(q')=q, since pβ‰ qβ€²p\ne q' and pβ‰ qp\ne q; at qq it gives Ο„qβ€²(ΞΈpqβ€²(qβ€²))=Ο„qβ€²(p)=p\tau_{q'}(\theta_{pq'}(q'))=\tau_{q'}(p)=p; at qβ€²q' it gives Ο„qβ€²(ΞΈpqβ€²(q))=Ο„qβ€²(q)=qβ€²\tau_{q'}(\theta_{pq'}(q))=\tau_{q'}(q)=q', since qβ‰ pq\ne p and qβ‰ qβ€²q\ne q'; and at any other k∈[n]k\in[n] all three maps fix kk. These are exactly the values of ΞΈpq\theta_{pq}.

Applying claim 2 twice, and then claim 1 to Ο„qβ€²\tau_{q'},

sgn(ΞΈpq)=sgn(Ο„qβ€²) sgn(ΞΈpqβ€²) sgn(Ο„qβ€²)=sgn(ΞΈpqβ€²)=βˆ’1,\mathrm{sgn}(\theta_{pq})=\mathrm{sgn}(\tau_{q'})\,\mathrm{sgn}(\theta_{pq'})\,\mathrm{sgn}(\tau_{q'})=\mathrm{sgn}(\theta_{pq'})=-1,

the last equality by R(t)R(t). This proves R(S(t))R(S(t)) and completes the proof.

Please log in to copy this version.

Citations

Loading…

Dependency Graph

0 prerequisites

Prerequisites

Loading...

Comments

Loading…