The Real Numbers and Completeness
This is the first page of the analysis spine. Everything in calculus — limits, derivatives, integrals, and ultimately the integral theorems of vector calculus — rests on one structural fact that distinguishes from : completeness. This page states the field and order axioms, isolates the least-upper-bound axiom as the load-bearing assumption, and derives the consequences (Archimedean property, density, nested intervals) that the rest of the spine uses without comment.
References: Rudin, Principles of Mathematical Analysis, ch. 1; Tao, Analysis I.
1. Ordered Fields
A field is a set with two operations and satisfying the usual axioms: is an abelian group with identity ; is an abelian group with identity ; and multiplication distributes over addition. and are fields; is not (no multiplicative inverses).
An ordered field is a field with a total order compatible with the operations:
- (O1) for all ;
- (O2) and .
Both and are ordered fields. The order lets us define the absolute value , which satisfies the triangle inequality and .
Why is not enough. The equation has no solution in , yet the set is bounded above and "should" have a least upper bound. has holes. Completeness is the axiom that fills them.
2. Suprema, Infima, and the Completeness Axiom
Let be nonempty. An element is an upper bound of if for all ; is bounded above if it has one. An upper bound is a least upper bound or supremum, written , if for every upper bound . Lower bounds and the infimum are defined dually.
Characterization of the supremum. iff (i) for all , and (ii) for every there exists with . Condition (ii) says nothing smaller than is an upper bound.
Completeness Axiom (least-upper-bound property). Every nonempty subset of that is bounded above has a supremum in .
This single axiom — false in — is what makes the right setting for analysis. Taking shows the dual statement (every nonempty set bounded below has an infimum) is equivalent.
is the unique complete ordered field. Up to a unique order-preserving field isomorphism, is the only ordered field satisfying the least-upper-bound property. This is why we may speak of "the" real numbers.
3. Constructing
The completeness axiom is consistent: one can build a complete ordered field from . Two standard routes:
- Dedekind cuts. A real number is a partition of into a downward-closed set with no greatest element and its complement . The cut for is . The supremum of a bounded family of cuts is obtained by unioning their lower sets — completeness is almost immediate by construction.
- Cauchy completion. A real number is an equivalence class of Cauchy sequences of rationals, where iff . This is the same metric-space completion construction used in general (see metric-spaces.md).
Both yield isomorphic structures, so the choice is a matter of taste. The analysis spine only ever uses the least-upper-bound property, never the internal details of the construction.
4. Consequences of Completeness
These corollaries are used constantly in later pages, usually silently.
4.1 The Archimedean property
Theorem (Archimedean). For every there is an with . Equivalently, for every there is with .
Proof. If were bounded above it would have a supremum by completeness. Then is not an upper bound, so for some , giving — contradicting that bounds .
The Archimedean property fails in some ordered fields (e.g. fields with infinitesimals); completeness rules them out. It is the bridge that lets us control real quantities by integers, the engine behind every "choose large enough" argument in sequences-series.md.
4.2 Density of the rationals
Theorem. Between any two reals there is a rational with (and an irrational too).
Proof sketch. By Archimedes pick with , then take for the least integer with ; one checks .
Density is why continuous functions are determined by their values on , and why decimal/rational approximation is legitimate.
4.3 Existence of roots
For every and integer there is a unique with , namely . The supremum exists by completeness; this is the prototype for "completeness produces the limit you expect to be there."
4.4 Nested interval theorem
Theorem (Nested intervals). If are closed bounded intervals , then . If moreover , the intersection is a single point.
Proof. The are increasing and bounded above by , so exists. For all , (each is an upper bound of the ), hence . If the point is unique.
This is the standard tool for "bisection" arguments and underlies the Bolzano–Weierstrass theorem and the proof of the Heine–Borel theorem in metric-spaces.md.
5. The Extended Reals
It is convenient to adjoin , forming with the conventions and , when is unbounded above. With these conventions every subset has a supremum and infimum in , which streamlines statements about / in sequences-series.md. Arithmetic with is only partially defined ( is indeterminate).
6. Where this page is used
- Completeness convergence: monotone convergence and Bolzano–Weierstrass in sequences-series.md.
- Archimedean property: every – and – argument in continuity.md and beyond.
- Suprema/infima: the definition of the Riemann integral via upper/lower (Darboux) sums in riemann-integral.md.
- Completeness of : the metric-space generalization in metric-spaces.md, which feeds the contraction-mapping proof of the inverse function theorem.
Next: Sequences and Series — convergence, Cauchy sequences, and the first payoffs of completeness.