The Real Number System: Completeness and Archimedean Property

⚡ Key Takeaways

The real number system $\mathbb{R}$ is the unique (up to isomorphism) complete ordered field. Completeness states every nonempty set bounded above has a least upper bound (supremum); the Archimedean property states no real number is infinitely large — for any reals $x, y > 0$ there is a natural number $n$ with $nx > y$ . Together they distinguish $\mathbb{R}$ from $\mathbb{Q}$ and underpin all of real analysis. Formalized in the 1870s by Dedekind, Cantor, and Weierstrass.

💡 The Core Insight

$\mathbb{Q}$ has holes: the set $\{x \in \mathbb{Q} : x^2 < 2\}$ is bounded above but has no rational least upper bound, since $\sqrt 2 \notin \mathbb{Q}$ . Completeness fills exactly these holes by axiom — it declares that the supremum always exists. The Archimedean property is then the negative statement that we did not accidentally add anything too big: there are no quantities larger than every natural number. The entire edifice of analysis rests on these two facts working together.

DefinitionOrdered Field

A field $(F, +, \cdot)$ is a set with two operations satisfying the usual axioms (associativity, commutativity, distributivity, identities $0 \ne 1$ , additive inverses, multiplicative inverses for nonzero elements). An ordered field also carries a total order $\le$ compatible with the operations:

1

\quad a \le b \implies a + c \le b + c, \qquad (0 \le a \ \wedge\ 0 \le b) \implies 0 \le ab.

Derivation hint: these are the order axioms; everything about inequalities (e.g. squares are nonnegative, $a<b \wedge c>0 \Rightarrow ac<bc$ ) follows from them. Here $a,b,c \in F$ . Both $\mathbb{Q}$ and $\mathbb{R}$ are ordered fields.

DefinitionUpper Bound, Supremum

Let $S \subseteq \mathbb{R}$ be nonempty. A number $M$ is an upper bound of $S$ if $s \le M$ for all $s \in S$ . The supremum (least upper bound) $\sup S$ is an upper bound $L$ such that every upper bound $M$ satisfies $L \le M$ . Symbolically:

2

\quad L = \sup S \iff \big(\forall s \in S,\ s \le L\big) \ \wedge\ \big(\forall \varepsilon > 0,\ \exists s \in S,\ s > L - \varepsilon\big).

Derivation hint: the first clause says $L$ is an upper bound; the second says nothing smaller than $L$ is one — i.e. $L$ is least, since otherwise $L-\varepsilon$ would bound $S$ . Dually, $\inf S$ is the infimum (greatest lower bound). Here $\varepsilon \in \mathbb{R}$ , $\varepsilon > 0$ .

TheoremCompleteness Axiom (Least Upper Bound Property)

Every nonempty subset $S \subseteq \mathbb{R}$ that is bounded above has a supremum $\sup S \in \mathbb{R}$ .

3

\quad \big(S \ne \varnothing \ \wedge\ \exists M\,\forall s\in S,\ s \le M\big) \implies \exists L \in \mathbb{R},\ L = \sup S.

Derivation hint: this is taken as an axiom for $\mathbb{R}$ ; alternatively it is a theorem once $\mathbb{R}$ is constructed via Dedekind cuts, where $\sup S$ is literally the union of the cuts.

TheoremArchimedean Property

For every real $x$ there exists a natural number $n$ with $n > x$ . Equivalently, for all reals $a > 0$ and $b > 0$ there is $n \in \mathbb{N}$ with $na > b$ .

4

\quad \forall x \in \mathbb{R}\ \exists n \in \mathbb{N},\ n > x \quad\Longleftrightarrow\quad \forall \varepsilon > 0\ \exists n \in \mathbb{N},\ \tfrac{1}{n} < \varepsilon.

Derivation hint: the two forms are equivalent by taking $\varepsilon = 1/x$ (for $x>0$ ); the $1/n \to 0$ form is the one most used in analysis.

TheoremUniqueness of

\mathbb{R}

Any two complete ordered fields are isomorphic as ordered fields. Hence $\mathbb{R}$ is the complete ordered field, justifying the definite article.

ProofCompleteness implies the Archimedean Property

We show $\mathbb{N}$ is unbounded in $\mathbb{R}$ , which is the Archimedean property. 1. Suppose for contradiction $\mathbb{N}$ is bounded above in $\mathbb{R}$ . Since $\mathbb{N} \ne \varnothing$ , the Completeness Axiom [3] gives $L = \sup \mathbb{N} \in \mathbb{R}$ . 2. By the supremum characterization [2] with $\varepsilon = 1$ : there exists $n \in \mathbb{N}$ with

5

\quad n > L - 1.

Derivation hint: $L-1 < L = \sup\mathbb N$ , so $L-1$ is not an upper bound, hence some element of $\mathbb N$ exceeds it. 3. Then $n + 1 \in \mathbb{N}$ and

6

\quad n + 1 > (L-1) + 1 = L.

Derivation hint: add $1$ to both sides of [5]; closure of $\mathbb N$ under $+1$ gives a natural number above $L$ . 4. But $n+1 \in \mathbb{N}$ and $n+1 > L = \sup \mathbb{N}$ contradicts $L$ being an upper bound of $\mathbb{N}$ . 5. Therefore $\mathbb{N}$ is unbounded: for any $x \in \mathbb{R}$ some $n \in \mathbb{N}$ has $n > x$ . $\blacksquare$

∎

Proof

\mathbb{Q}

has a hole — completeness fails in the rationals

Let $S = \{ q \in \mathbb{Q} : q > 0,\ q^2 < 2\}$ . 1. $S$ is nonempty ( $1 \in S$ ) and bounded above in $\mathbb{Q}$ (e.g. by $2$ , since $q\ge 2 \Rightarrow q^2 \ge 4 > 2$ ). 2. Suppose $L = \sup S$ existed in $\mathbb{Q}$ . Trichotomy gives $L^2 < 2$ , $L^2 = 2$ , or $L^2 > 2$ . 3. $L^2 = 2$ is impossible: $\sqrt 2$ is irrational (if $L = p/q$ in lowest terms, $p^2 = 2q^2$ forces both $p,q$ even, contradiction). 4. If $L^2 < 2$ , choosing $h = \frac{2 - L^2}{2L+1}$ (with $0<h<1$ ) gives $(L+h)^2 < L^2 + h(2L+1) = 2$ , so $L+h \in S$ and $L+h > L$ — $L$ is not an upper bound. 5. If $L^2 > 2$ , a symmetric choice produces a smaller rational upper bound, so $L$ is not least. 6. All cases fail, so no rational supremum exists. $\mathbb{Q}$ violates [3]. $\blacksquare$

∎

🧠 Intuition

Picture the number line. Completeness says: wherever you slice the line into a "left part" and "right part," the cut falls exactly on a number — there is never a microscopic gap where the knife passes through emptiness. In $\mathbb{Q}$ , the slice at $\sqrt 2$ falls into a void. The Archimedean property says the number line has no "edge of infinity": start at $0$ and march by steps of length $a$ ; you will eventually pass any target $b$ , no matter how small $a$ or how large $b$ . A non-Archimedean line would have points so far out that no finite number of unit steps reaches them, and points so close to $0$ that they are positive yet smaller than $1/n$ for every $n$ — true infinitesimals.

Figure

The supremum of

S=\{q:q^2<2\}

fills the gap that

\mathbb{Q}

leaves at

\sqrt{2}

mathematician · Richard Dedekind | 1831–1916

Dedekind gave the first rigorous construction of $\mathbb{R}$ in Stetigkeit und irrationale Zahlen (1872) using Dedekind cuts: a real number is identified with a partition of $\mathbb{Q}$ into two nonempty sets $(A, B)$ where every element of $A$ is below every element of $B$ and $A$ has no greatest element. The cut is the number — $\sqrt 2$ is precisely the cut whose lower set is $\{q : q < 0 \text{ or } q^2 < 2\}$ . Completeness becomes a theorem: the supremum of a bounded family of cuts is just the union of their lower sets, which is again a cut. Dedekind's insight reduced the mysterious "continuity of the line" to pure set theory over $\mathbb{Q}$ , divorcing analysis from geometric intuition once and for all.

ExampleComputing a supremum from the definition

Given: $S = \left\{ 1 - \dfrac{1}{n} : n \in \mathbb{N},\ n \ge 1 \right\} = \{0,\ \tfrac12,\ \tfrac23,\ \tfrac34,\dots\}$ . Find $\sup S$ and prove it.

Steps: 1. Guess: terms increase toward $1$ but never reach it, so candidate $L = 1$ . 2. Upper bound: $1 - \frac1n < 1$ for all $n$ , so $1$ bounds $S$ . ✓ 3. Least: take any $\varepsilon > 0$ . By the Archimedean property [4] choose $n$ with $\frac1n < \varepsilon$ . Then

7

\quad 1 - \tfrac1n > 1 - \varepsilon,

Derivation hint: subtract the inequality $\frac1n<\varepsilon$ from $1$ , flipping direction. so an element of $S$ exceeds $1-\varepsilon$ . By [2], no number below $1$ is an upper bound. 4. Note $1 \notin S$ : the supremum need not be attained.

Answer: $\boxed{\sup S = 1}$ (and $1 \notin S$ , so there is no maximum).

ExampleUsing the Archimedean property numerically

Given: Show there is a natural number $n$ with $\dfrac{1}{n} < 10^{-6}$ , and find the smallest such $n$ .

Steps: 1. The Archimedean property [4] guarantees existence: for $\varepsilon = 10^{-6}>0$ some $n$ works. 2. Solve $\frac1n < 10^{-6} \iff n > 10^{6}$ . 3. The smallest integer strictly greater than $10^6 = 1{,}000{,}000$ is

8

\quad n = 1{,}000{,}001.

Derivation hint: $n=10^6$ gives $1/n = 10^{-6}$ , not strictly less; the strict inequality forces the next integer.

Answer: $\boxed{n = 1{,}000{,}001}$ (dimensionless count). This concretely exhibits how Archimedean-ness lets $1/n$ be driven below any positive threshold.

⚠️ Common mistake

"The supremum is the maximum." False in general. $\sup$ exists for every bounded-above nonempty set, but the maximum (an element of $S$ equal to $\sup S$ ) need exist. In Example 1, $\sup S = 1 \notin S$ . The maximum exists iff $\sup S \in S$ .

⚠️ Common mistake

"Completeness means $\mathbb{R}$ has no gaps because it's uncountable." Cardinality and completeness are independent. The algebraic numbers are countable yet form a field; the computable reals are countable but not complete. Completeness is an order/topological property, not a counting one. Conversely, one can build non-Archimedean ordered fields of any large cardinality.

CounterexampleCompleteness fails without the least-upper-bound axiom

The field $\mathbb{R}(t)$ of rational functions in $t$ , ordered so that $t$ is larger than every real number (i.e. $t > n$ for all $n \in \mathbb{N}$ ), is an ordered field that is not Archimedean: $\mathbb{N}$ is bounded above by $t$ . Consequently it is not complete. This shows the Archimedean property is not automatic for ordered fields — it is special to $\mathbb{R}$ and a genuine consequence of completeness, as proved above. Here $1/t$ is a positive infinitesimal: $0 < 1/t < 1/n$ for every $n$ .

connection

Completeness is the hinge on which all of analysis turns. It is logically equivalent to: the Monotone Convergence Theorem (bounded monotone sequences converge), the Bolzano–Weierstrass Theorem (bounded sequences have convergent subsequences), the Nested Interval Property, Cauchy completeness plus the Archimedean property, and the Heine–Borel Theorem. Each can serve as the starting axiom; the others become theorems. Completeness also makes $\mathbb{R}$ connected as a topological space and guarantees the Intermediate Value Theorem and Extreme Value Theorem. The Archimedean property links $\mathbb{R}$ to the density of $\mathbb{Q}$ in $\mathbb{R}$ .

🔬 Where this appears

⏳ History

- c. 450 BCE — The Pythagoreans discover incommensurability (

\sqrt2

irrational), the first crack revealing that ratios of integers do not fill the line.

- c. 350 BCE — Eudoxus' theory of proportion (Euclid, Elements Book V) handles incommensurable magnitudes; his definition of equal ratios anticipates Dedekind cuts by two millennia.

- 287–212 BCE — Archimedes states the axiom now bearing his name (attributing it to Eudoxus) and uses it in his method of exhaustion.

- 1817 — Bolzano gives an early (largely unread) proof of the intermediate value theorem, implicitly invoking completeness.

- 1821 — Cauchy's Cours d'analyse introduces rigorous limits and "Cauchy sequences," but without a construction of

\mathbb{R}

the completeness gap remains.

- 1872 — Dedekind (cuts) and Cantor & Heine (Cauchy sequences of rationals) independently construct

\mathbb{R}

from

\mathbb{Q}

, giving completeness a firm foundation.

- 1872 — Weierstrass and his school formalize the

\varepsilon

–

\delta

method, relying on the least-upper-bound property.

- 1899 — Hilbert axiomatizes

\mathbb{R}

as a complete Archimedean ordered field (his "axiom of completeness").

- 1960 — Abraham Robinson founds non-standard analysis, constructing the non-Archimedean hyperreals and legitimizing infinitesimals.

open-problem

Completeness and Archimedean-ness are first-order-elusive: the least-upper-bound property is a second-order statement (it quantifies over all subsets), and by the Löwenheim–Skolem theorem no first-order theory pins $\mathbb{R}$ down uniquely — there exist non-isomorphic models of the first-order theory of real-closed fields, some non-Archimedean. This is the root of non-standard analysis. Open and ongoing themes include: (i) the precise logical strength of completeness in reverse mathematics, where many analysis theorems sit at the level $\mathsf{ACA}_0$ or $\mathsf{WKL}_0$ ; (ii) constructive real analysis, where the classical least-upper-bound principle fails and must be replaced by weaker located-supremum notions (Bishop's school); and (iii) whether physical spacetime is genuinely a real continuum or only approximated by one — an empirically open question at the Planck scale.

The Real Number System: Completeness and Archimedean Property

Formal Statement

Why It Holds / Derivation

Worked Examples

Common Misconceptions

Real-World Applications

Historical Development

Subtleties & Limits

See Also