TheoremBase

Inversions of a Permutation Form a Finite Set, and the Sign Map Exists

For a permutation of [n], the pairs i<j whose order it reverses form a finite set, and there is exactly one real-valued map on SnS_n sending each permutation to -1 raised to the number of these pairs.

Statement

In the setting of Metric Spaces: Balls, the Metric Topology, and the Real and Complex Numbers as Metric Spaces, let n∈Nn\in\mathbb{N}, with SnS_{n} as in Permutations of a Set and the Set of Permutations of [n] §permutations, the set Inv(σ)\mathrm{Inv}(\sigma) of inversions of σ∈Sn\sigma\in S_{n} as in Inversions of a Permutation of [n] §inversions, finite sets and the number of elements #A\#A of a finite set AA, and, for k∈N0k\in\mathbb{N}_{0}, the power (−1)k(-1)^{k} in R\mathbb{R} of the negative −1-1 of 11, as in Powers with Exponents in the Natural Numbers with Zero §power and Powers with Exponents in the Natural Numbers with Zero §zero.

For every σ∈Sn\sigma\in S_{n}, the set Inv(σ)\mathrm{Inv}(\sigma) is finite.

There is exactly one map s:Sn→Rs:S_{n}\to\mathbb{R} with s(σ)=(−1)#Inv(σ)s(\sigma)=(-1)^{\#\mathrm{Inv}(\sigma)} for every σ∈Sn\sigma\in S_{n}, where Inv(σ)\mathrm{Inv}(\sigma) is finite by clause inversions.

Proofs

Log in to submit a proof.

Loading...

Citations

Loading…

Dependencies

Loading…

Related

0 relations

Curated associations between results. These are editable and subjective — they do not replace the dependency graph, which is derived from the references in the text.

No relations recorded yet.

Comments

Log in to comment.

Loading…