TheoremBase

The Index Map Skipping One Element of [n]

For n at least 2 and i in [n], there is exactly one map from [n-1] to [n] fixing the numbers below i and shifting the others up by one; it is strictly increasing and a bijection onto [n] without i.

Statement

In the setting of Routine Facts Used Without Citation: Arithmetic, Maps, Predicativity and Indices, let n∈Nn\in\mathbb{N} with 2≤n2\le n and let i∈[n]i\in[n], with [n][n] and [n−1][n-1] as in Intervals of Natural Numbers §segment, where n−1∈N0n-1\in\mathbb{N}_{0} is the difference, which is defined as 1≤n1\le n.

n−1∈Nn-1\in\mathbb{N} and (n−1)+1=n(n-1)+1=n.

There is exactly one map s:[n−1]→[n]s:[n-1]\to[n] with s(k)=ks(k)=k for every k∈[n−1]k\in[n-1] with k<ik<i and s(k)=k+1s(k)=k+1 for every k∈[n−1]k\in[n-1] with i≤ki\le k.

For the map ss of clause map and all k,l∈[n−1]k,l\in[n-1]: k<lk<l if and only if s(k)<s(l)s(k)<s(l).

For the map ss of clause map: s(k)∈[n]∖{i}s(k)\in[n]\setminus\{i\} for every k∈[n−1]k\in[n-1], and ss, as a map s:[n−1]→[n]∖{i}s:[n-1]\to[n]\setminus\{i\}, is a bijection.

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…