TheoremBase

Properties of the Canonical Map from the Natural Numbers to an Ordered Field

The canonical map from the natural numbers to an ordered field sends 1 to 1 and successors to successors, is additive, multiplicative, at least 1, positive, strictly increasing and injective.

Statement

Let FF be an ordered field, with the addition, multiplication, additive identity 00, multiplicative identity 11 and multiplicative inverses a−1a^{-1} of the underlying field, and with its order ≤\le; for a,b∈Fa,b\in F write a<ba<b to mean a≤ba\le b and a≠ba\ne b. Let N\mathbb{N} be the set of natural numbers, with addition and multiplication as in that definition and with the order ≤\le, and let ιF:N→F\iota_{F}:\mathbb{N}\to F be the canonical map of FF.

Then the following hold for all m,n∈Nm,n\in\mathbb{N}.

1. (Base and step) ιF(1)=1\iota_{F}(1)=1 and ιF(n+1)=ιF(n)+1\iota_{F}(n+1)=\iota_{F}(n)+1.

2. (The unit is a lower bound) 1≤ιF(n)1\le\iota_{F}(n).

3. (Positivity) 0<ιF(n)0<\iota_{F}(n); consequently ιF(n)≠0\iota_{F}(n)\ne 0, the inverse ιF(n)−1\iota_{F}(n)^{-1} exists, and 0<ιF(n)−10<\iota_{F}(n)^{-1}.

4. (Additivity) ιF(m+n)=ιF(m)+ιF(n)\iota_{F}(m+n)=\iota_{F}(m)+\iota_{F}(n).

5. (Multiplicativity) ιF(mn)=ιF(m) ιF(n)\iota_{F}(mn)=\iota_{F}(m)\,\iota_{F}(n).

6. (Strict monotonicity) If m<nm<n in N\mathbb{N}, then ιF(m)<ιF(n)\iota_{F}(m)<\iota_{F}(n) in FF.

7. (Injectivity) If ιF(m)=ιF(n)\iota_{F}(m)=\iota_{F}(n), then m=nm=n.

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…