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, ε-N arguments could never pick a "large enough N". 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
∀ε>0,∃n∈N:n1<ε
Examples & Exercises
Prove the Archimedean property completely from the least-upper-bound axiom: for every a>0 and real b there is a natural n with na>b.
∀a>0,∀b∈R,∃n∈N:na>b
Step 0.5, target 5 — 11 steps get past.Show proof
Assume the contrary: na≤b for every natural n. Then the set S={na:n∈N} is non-empty and bounded above by b.
By the least-upper-bound axiom, s=supS exists. Since a>0, s−a<s, and s−a, being below the supremum, is not an upper bound for S. So for some m, ma>s−a.
Adding a to both sides gives (m+1)a>s. But (m+1)a∈S, contradicting that s is an upper bound for S. So the assumption fails, and some n has na>b.
Prove completely, from the Archimedean property, that for every ε>0 there is a natural n with n1<ε.
Apply the Archimedean property with step ε>0 and target b=1: there is a natural n with nε>1.
Both n and ε are positive, so dividing nε>1 by n gives ε>n1. The proof is complete.
Prove completely that if x≥0 and x<n1 for every natural n, then x=0.
x≥0,(∀n)x<n1⟹x=0
However small the step, the march still passes the target — no positive number fits in between.Show proof
Suppose for contradiction that x>0. Applying the corollary of the previous problem with ε=x gives a natural n with n1<x.
But the hypothesis gives x<n1 for the same n. A number cannot satisfy both n1<x and x<n1. The contradiction shows x>0 is false, and with x≥0 this forces x=0.