The Real Number System — Completeness and Dedekind Cuts

⚡ Key Takeaways

The Real Number System — Completeness and Dedekind Cuts. The real numbers $\mathbb{R}$ are the unique (up to isomorphism) complete ordered field; completeness means every nonempty set bounded above has a least upper bound. Dedekind cuts construct $\mathbb{R}$ from $\mathbb{Q}$ by identifying each real number with a partition of the rationals into a "left" and "right" piece, filling the "gaps" (like $\sqrt2$ ) that the rationals leave. Applies wherever rigorous analysis, limits, or continuity are needed. Developed chiefly by Richard Dedekind (1872) and Georg Cantor (1872).

💡 The Core Insight

$\mathbb{Q}$ is "porous": its order has gaps where irrational numbers ought to live. A cut locates a gap by the place where it occurs in $\mathbb{Q}$ — the boundary between the rationals below it and the rationals above. Each real number IS that boundary. Completeness is the assertion that every boundary one can describe with a bounded set is actually occupied by a number. This turns the intuitive picture of the "number line as a continuum" into a precise algebraic-order-theoretic object.

DefinitionOrdered Field

An ordered field is a field $(F,+,\cdot)$ together with a total order $\le$ compatible with the operations:

1

\quad a \le b \implies a+c \le b+c \quad\text{for all } c\in F

Derivation hint: this is the additive compatibility axiom; combined with field axioms it lets you transpose terms across inequalities.

2

\quad 0 \le a \ \text{and}\ 0 \le b \implies 0 \le a\cdot b

Derivation hint: multiplicative compatibility; from it one derives that squares are nonnegative and $0<1$ . Here $F$ is the underlying set, $+$ and $\cdot$ are the binary operations, and $\le$ is the order relation. $\mathbb{Q}$ and $\mathbb{R}$ are ordered fields; $\mathbb{C}$ is not (it cannot be ordered compatibly).

DefinitionUpper Bound and Supremum

Let $S\subseteq F$ be nonempty. An element $u\in F$ is an upper bound of $S$ if $s\le u$ for all $s\in S$ . The supremum (least upper bound) of $S$ , written $\sup S$ , is an upper bound $u^\star$ such that every upper bound $u$ satisfies $u^\star \le u$ :

3

\quad u^\star = \sup S \iff \big(\forall s\in S:\ s\le u^\star\big)\ \wedge\ \big(\forall \varepsilon>0\ \exists s\in S:\ s > u^\star-\varepsilon\big)

Derivation hint: the second clause says no smaller number is an upper bound — equivalently $u^\star$ can be approached from within $S$ to arbitrary closeness. The infimum $\inf S$ is defined dually as the greatest lower bound.

DefinitionCompleteness Axiom — Least Upper Bound Property

An ordered field $F$ is complete if:

4

\quad \forall S\subseteq F\ \big(S\neq\varnothing \ \wedge\ S\ \text{bounded above}\big)\implies \sup S \in F

Derivation hint: this is an existence assertion about $\sup$ inside $F$ ; the rationals fail it, the reals satisfy it by construction. The real number system $\mathbb{R}$ is defined to be a complete ordered field. The deep facts are that such a field exists (e.g. via Dedekind cuts) and is unique up to order-isomorphism.

TheoremExistence and Uniqueness of

\mathbb{R}

There exists a complete ordered field, and any two complete ordered fields are isomorphic via a unique order-preserving field isomorphism. Thus "the" real number system is well-defined.

DefinitionDedekind Cut

A Dedekind cut is a subset $\alpha\subseteq\mathbb{Q}$ satisfying: 1. $\alpha \neq \varnothing$ and $\alpha \neq \mathbb{Q}$ (proper, nonempty); 2. $\alpha$ is downward closed: if $p\in\alpha$ and $q<p$ then $q\in\alpha$ ; 3. $\alpha$ has no greatest element: if $p\in\alpha$ then there is $r\in\alpha$ with $p<r$ .

5

\quad \alpha = \{\, q\in\mathbb{Q} : q < x \,\}\quad\text{(intuitively, the cut "is" the real number } x)

Derivation hint: property (2) makes $\alpha$ a "left ray"; property (3) excludes the degenerate cut $\{q : q\le x\}$ for rational $x$ , ensuring a unique representative. The set $\mathbb{R}$ is defined as the set of all Dedekind cuts, ordered by set inclusion $\alpha \le \beta \iff \alpha\subseteq\beta$ .

Figure

A Dedekind cut: the rationals split into a left set

\alpha

(gold) and its complement, with the gap located at

\sqrt2

ProofThe Set of Cuts is a Complete Ordered Field

We sketch the construction of $\mathbb{R}$ as cuts and prove completeness.

Step 1 — Order. Define $\alpha\le\beta \iff \alpha\subseteq\beta$ . This is a total order: given two cuts, if $\alpha\not\subseteq\beta$ pick $p\in\alpha\setminus\beta$ ; downward closure of $\beta$ forces every $q\in\beta$ to satisfy $q<p$ , hence $q\in\alpha$ , so $\beta\subseteq\alpha$ .

Step 2 — Addition. Define $\alpha+\beta = \{\, r+s : r\in\alpha,\ s\in\beta \,\}$ . One checks this is again a cut. The zero element is $0^\star=\{q\in\mathbb{Q}: q<0\}$ , and additive inverses exist (with mild care about "no greatest element").

Step 3 — Multiplication. Defined first for nonnegative cuts via products of positive elements, then extended by sign rules. Verifying distributivity and associativity is tedious but routine.

Step 4 — Completeness. Let $\mathcal{A}$ be a nonempty collection of cuts bounded above by some cut $\gamma$ . Define

6

\quad \sigma \;=\; \bigcup_{\alpha\in\mathcal{A}} \alpha

Derivation hint: the union of left-rays is a left-ray; this is the candidate supremum. Then $\sigma$ is a cut: it is nonempty (any $\alpha\in\mathcal{A}$ is nonempty); proper (since $\sigma\subseteq\gamma\neq\mathbb{Q}$ ); downward closed (a union of downward-closed sets); and has no greatest element (if $p\in\sigma$ then $p\in\alpha$ for some $\alpha$ , which has some $r>p$ also in $\alpha\subseteq\sigma$ ).

Step 5 — $\sigma$ is the least upper bound. For each $\alpha\in\mathcal{A}$ , $\alpha\subseteq\sigma$ , so $\sigma$ is an upper bound. If $\tau$ is any upper bound, then $\alpha\subseteq\tau$ for all $\alpha$ , hence $\sigma=\bigcup\alpha\subseteq\tau$ , i.e. $\sigma\le\tau$ . Therefore

7

\quad \sup \mathcal{A} = \bigcup_{\alpha\in\mathcal{A}} \alpha

Derivation hint: the supremum of cuts is literally their union — the cleanest payoff of the construction. This proves $\mathbb{R}$ (as cuts) satisfies the least-upper-bound property, completing the existence half of the existence/uniqueness theorem. $\blacksquare$

∎

TheoremEquivalence of Completeness Formulations

For an Archimedean ordered field $F$ , the following are equivalent: 1. Least Upper Bound property (every nonempty bounded-above set has a sup); 2. Cauchy completeness + Archimedean (every Cauchy sequence converges); 3. Monotone Convergence (every bounded monotone sequence converges); 4. Nested Interval property (a nested sequence of closed intervals with lengths $\to 0$ has nonempty intersection — a single point); 5. Bolzano–Weierstrass (every bounded sequence has a convergent subsequence). Without the Archimedean hypothesis, Cauchy completeness is strictly weaker than the LUB property.

ProofSketch: LUB

\Rightarrow

Monotone Convergence

Let $(a_n)$ be increasing and bounded above. Let $L=\sup\{a_n\}$ , which exists by LUB. Given $\varepsilon>0$ , by the supremum characterization [3] there is $N$ with $a_N>L-\varepsilon$ . By monotonicity, for $n\ge N$ :

8

\quad L-\varepsilon < a_N \le a_n \le L < L+\varepsilon \implies |a_n - L|<\varepsilon

Derivation hint: sandwich $a_n$ between $a_N$ and the sup using monotonicity; the approximation clause of [3] supplies $a_N$ . Hence $a_n\to L$ . $\blacksquare$

∎

mathematician · Richard Dedekind | 1831–1916

Julius Wilhelm Richard Dedekind, a student of Gauss and Dirichlet at Göttingen, was driven to rigor while teaching calculus: he wanted to define continuity of the number line without appealing to geometric intuition. In his 1872 essay Stetigkeit und irrationale Zahlen ("Continuity and Irrational Numbers") he introduced the cut, locating the essence of continuity in the principle that every cut is produced by exactly one number. Dedekind also founded modern ideal theory and gave the first rigorous treatment of the natural numbers via the Peano–Dedekind axioms. His insistence that mathematical objects be defined by their structural properties — not by intuition or construction alone — makes him a founder of the modern axiomatic method.

🧠 Intuition

Picture the rational number line as a ruler with infinitely fine but invisible pinpricks missing — at $\sqrt2$ , at $\pi$ , at $e$ . You cannot point to a missing point because there is no rational there to point to. Dedekind's trick: instead of naming the missing point, name the place where it is missing — namely, the clean split of all rationals into "those to the left" and "those to the right." The split is itself a perfectly good mathematical object even when no rational sits at the boundary. A real number, then, is a location described by everything below it. Completeness simply asserts: every such location you can pin down with a bounded set really is a number. Equivalently — the number line has no gaps; you can never "fall through" between two reals.

ExampleThe Cut Defining

\sqrt2

Given. Define $\alpha = \{\, q\in\mathbb{Q} : q\le 0\,\} \cup \{\, q\in\mathbb{Q} : q>0 \text{ and } q^2<2 \,\}$ .

Show it is a cut and represents $\sqrt2$ . Step 1 — Nonempty, proper. $1\in\alpha$ (since $1^2=1<2$ ); $2\notin\alpha$ (since $4>2$ ). ✓ Step 2 — Downward closed. If $p\in\alpha$ and $q<p$ : if $q\le 0$ then $q\in\alpha$ ; if $0<q<p$ then $q^2<p^2<2$ , so $q\in\alpha$ . ✓ Step 3 — No greatest element. Suppose $p\in\alpha$ with $p>0$ , $p^2<2$ . Choose

9

\quad r = p + \frac{2-p^2}{p+2}, \qquad r^2 - 2 = \frac{(p^2-2)\big((p+2)^2-(p+2)(p+2)\big)}{(p+2)^2}<0

Derivation hint: this classic algebraic nudge gives a rational $r>p$ with $r^2<2$ ; compute $r^2-2 = \frac{2(p^2-2)}{(p+2)^2}<0$ . So a larger element exists; no maximum. ✓

Boxed answer. $\alpha$ is a valid Dedekind cut, and $\boxed{\alpha = \sqrt2}$ as a real number — the first concrete irrational realized purely from $\mathbb{Q}$ .

ExampleComputing a Supremum

Given. $S = \left\{ 1 - \dfrac{1}{n} : n\in\mathbb{N}_{\ge 1} \right\} = \{0,\ \tfrac12,\ \tfrac23,\ \tfrac34,\dots\}\subseteq\mathbb{R}$ .

Find $\sup S$ . Step 1 — Upper bound. For all $n$ , $1-\tfrac1n < 1$ . So $1$ is an upper bound. Step 2 — Least. Let $\varepsilon>0$ . Choose $n>\tfrac1\varepsilon$ , so $\tfrac1n<\varepsilon$ , giving

10

\quad 1-\tfrac1n > 1-\varepsilon

Derivation hint: this realizes the second clause of [3] — elements of $S$ get within $\varepsilon$ of $1$ — so no smaller number bounds $S$ . *Step 3 — Note.* $1\notin S$ : the supremum need not be attained.

Boxed answer. $\boxed{\sup S = 1}$ (not a maximum). This uses the Archimedean property to find the requisite $n$ .

⚠️ Common mistake

"Completeness means every Cauchy sequence converges, full stop." Cauchy completeness alone does not give the LUB property in a general ordered field — you also need the Archimedean property (no infinitely large or small elements). The field of formal Laurent series $\mathbb{R}((t))$ is Cauchy complete in a natural sense yet is non-Archimedean and lacks the LUB property. Over $\mathbb{R}$ the distinction is invisible because $\mathbb{R}$ is Archimedean — but the logical dependence matters.

"A cut is the boundary number plus the left set." A cut is only the left set $\alpha\subseteq\mathbb{Q}$ . The "no greatest element" clause is precisely what avoids double-counting rationals (otherwise $\{q:q<x\}$ and $\{q:q\le x\}$ would both compete to represent rational $x$ ).

Counterexample

\mathbb{Q}

is Not Complete

Let $S=\{q\in\mathbb{Q}: q>0,\ q^2<2\}\subseteq\mathbb{Q}$ . $S$ is nonempty ( $1\in S$ ) and bounded above (by $2$ ). Yet $S$ has no supremum in $\mathbb{Q}$ : any rational upper bound $u$ has $u^2>2$ (it can't equal $2$ , as $\sqrt2\notin\mathbb{Q}$ ), but then a slightly smaller rational $u'$ with $u'^2>2$ is still an upper bound — contradicting leastness. The only candidate, $\sqrt2$ , is irrational. This single example is the failure of completeness in $\mathbb{Q}$ and the motivation for the entire construction.

connection

The completeness of $\mathbb{R}$ is the bedrock under nearly every theorem of Real Analysis. The Bolzano–Weierstrass theorem and the Heine–Borel theorem (compactness of closed bounded intervals) are equivalent reformulations. Completeness underlies the Intermediate Value Theorem and the Extreme Value Theorem — without it, continuous functions could "skip" values. It is the reason Cauchy Sequences converge, justifying the construction of $\mathbb{R}$ via Cauchy sequences (Cantor's alternative to cuts). The order-completeness of $\mathbb{R}$ also makes it the model for the abstract notion of a Complete Lattice / Dedekind-complete poset, and the cut idea generalizes to the Surreal Numbers of Conway. Topologically, completeness corresponds to $\mathbb{R}$ being a Complete Metric Space.

🔬 Where this appears

⏳ History

- c. 450 BCE — The Pythagoreans discover the incommensurability of the diagonal of a unit square (

\sqrt2

irrational), exposing gaps in rational measurement.

- c. 370 BCE — Eudoxus of Cnidus develops a theory of proportions (recorded in Euclid Book V) handling incommensurable ratios; his definition of equal ratios strikingly prefigures Dedekind cuts.

- 1817 — Bernard Bolzano gives an early rigorous proof of the intermediate value theorem and articulates a least-upper-bound idea, though his work goes largely unnoticed.

- 1821 — Augustin-Louis Cauchy introduces limits and Cauchy sequences in Cours d'analyse, sharpening the need for a rigorous real number system.

- 1858 — Dedekind, lecturing on calculus in Zurich, conceives the cut idea but does not publish it for years.

- 1872 — Two foundational papers appear: Dedekind's Stetigkeit und irrationale Zahlen (cuts) and Cantor's construction via fundamental (Cauchy) sequences — independently completing the rationals.

- 1872 — Heine and Méray also publish sequence-based constructions; the "arithmetization of analysis" (Weierstrass's program) reaches maturity.

- 1888 — Dedekind's Was sind und was sollen die Zahlen? axiomatizes the natural numbers, supplying the foundation beneath

\mathbb{Q}

and

\mathbb{R}

.

- 1900s — Hilbert axiomatizes

\mathbb{R}

as the complete Archimedean ordered field, framing completeness as a categorical axiom; later formalizations cement uniqueness up to isomorphism.

open-problem

While the classical theory of $\mathbb{R}$ is settled, foundational subtleties remain live:

Constructive mathematics. In intuitionistic/constructive frameworks, Dedekind reals and Cauchy reals are not provably isomorphic without choice principles. Which "reals" one means becomes a genuine choice, with consequences for computability.
The continuum. Cantor's continuum hypothesis — that $|\mathbb{R}| = \aleph_1$ , with no cardinality strictly between $\aleph_0$ and $|\mathbb{R}|=2^{\aleph_0}$ — is independent of ZFC (Gödel 1940, Cohen 1963). The "size" of the completed line is undecidable by standard axioms.
Non-Archimedean alternatives. Hyperreal numbers ( $^\ast\mathbb{R}$ , non-standard analysis) and the surreal numbers extend $\mathbb{R}$ with infinitesimals; they are complete in different senses, raising the question of which continuum best models physical or computational reality.
Computable reals. Only countably many reals are computable, yet $\mathbb{R}$ is uncountable — so "almost every" real number can never be specified by any algorithm, a tension at the heart of constructive analysis.

The Real Number System — Completeness and Dedekind Cuts

Formal Statement

Why It Holds / Derivation

Building Intuition

Worked Examples

Common Misconceptions

Connections

Real-World Applications

Historical Development

Subtleties & Limits

See Also