The Archimedean Property

However small a step, repeating it eventually passes any target. That is the Archimedean property.

The reals contain no infinitely small numbers. However tiny a positive number, adding it to itself enough times outgrows any given large number. Without this fact, ε\varepsilon-NN arguments could never pick a "large enough NN". The proof uses the least-upper-bound axiom.

For example, one step of an 🐜 ant is tiny. But an ant that never stops crosses a soccer field, and eventually circles the Earth. It is the count of steps, not their size, that wins.

∀a>0, ∀b∈R, ∃n∈N: na>b\forall a > 0, \ \forall b \in \mathbb{R}, \ \exists n \in \mathbb{N}: \ na > b
∀ε>0, ∃n∈N: 1n<ε\forall \varepsilon > 0, \ \exists n \in \mathbb{N}: \ \frac{1}{n} < \varepsilon

Examples & Exercises

Prove the Archimedean property completely from the least-upper-bound axiom: for every a>0a > 0 and real bb there is a natural nn with na>bna > b.

∀a>0, ∀b∈R, ∃n∈N: na>b\forall a > 0, \ \forall b \in \mathbb{R}, \ \exists n \in \mathbb{N}: \ na > b
Step 0.5, target 5 — 11 steps get past.
Show proof
  1. Assume the contrary: na≤bna \le b for every natural nn. Then the set S={na:n∈N}S = \{na : n \in \mathbb{N}\} is non-empty and bounded above by bb.

  2. By the least-upper-bound axiom, s=sup⁡Ss = \sup S exists. Since a>0a > 0, s−a<ss - a < s, and s−as - a, being below the supremum, is not an upper bound for SS. So for some mm, ma>s−ama > s - a.

  3. Adding aa to both sides gives (m+1)a>s(m + 1)a > s. But (m+1)a∈S(m + 1)a \in S, contradicting that ss is an upper bound for SS. So the assumption fails, and some nn has na>bna > b.

Prove completely, from the Archimedean property, that for every ε>0\varepsilon > 0 there is a natural nn with 1n<ε\frac{1}{n} < \varepsilon.

∀ε>0, ∃n∈N: 1n<ε\forall \varepsilon > 0, \ \exists n \in \mathbb{N}: \ \frac{1}{n} < \varepsilon
Step 0.25, target 1 — 5 steps get past, matching 15<0.25\frac{1}{5} < 0.25.
Show proof
  1. Apply the Archimedean property with step ε>0\varepsilon > 0 and target b=1b = 1: there is a natural nn with nε>1n\varepsilon > 1.

  2. Both nn and ε\varepsilon are positive, so dividing nε>1n\varepsilon > 1 by nn gives ε>1n\varepsilon > \frac{1}{n}. The proof is complete.

Prove completely that if x≥0x \ge 0 and x<1nx < \frac{1}{n} for every natural nn, then x=0x = 0.

x≥0, (∀n) x<1n ⟹ x=0x \ge 0, \ (\forall n) \ x < \frac{1}{n} \ \Longrightarrow \ x = 0
However small the step, the march still passes the target — no positive number fits in between.
Show proof
  1. Suppose for contradiction that x>0x > 0. Applying the corollary of the previous problem with ε=x\varepsilon = x gives a natural nn with 1n<x\frac{1}{n} < x.

  2. But the hypothesis gives x<1nx < \frac{1}{n} for the same nn. A number cannot satisfy both 1n<x\frac{1}{n} < x and x<1nx < \frac{1}{n}. The contradiction shows x>0x > 0 is false, and with x≥0x \ge 0 this forces x=0x = 0.

2. Number Systems