Construction of the real numbers
In mathematics, there are several ways of defining the real number system as an ordered field. The synthetic approach gives a list of axioms for the real numbers as a complete ordered field. Under the usual axioms of set theory, one can show that these axioms are categorical, in the sense that there is a model for the axioms, and any two such models are isomorphic. Any one of these models must be explicitly constructed, and most of these models are built using the basic properties of the rational number system as an ordered field.
- 1 Synthetic approach
- 2 Explicit constructions of models
- 3 See also
- 4 References
The synthetic approach axiomatically defines the real number system as a complete ordered field. Precisely, this means the following. A model for the real number system consists of a set R, two distinct elements 0 and 1 of R, two binary operations + and × on R (called addition and multiplication, respectively), and a binary relation ≤ on R, satisfying the following properties.
- (R, +, ×) forms a field. In other words,
- For all x, y, and z in R, x + (y + z) = (x + y) + z and x × (y × z) = (x × y) × z. (associativity of addition and multiplication)
- For all x and y in R, x + y = y + x and x × y = y × x. (commutativity of addition and multiplication)
- For all x, y, and z in R, x × (y + z) = (x × y) + (x × z). (distributivity of multiplication over addition)
- For all x in R, x + 0 = x. (existence of additive identity)
- 0 is not equal to 1, and for all x in R, x × 1 = x. (existence of multiplicative identity)
- For every x in R, there exists an element −x in R, such that x + (−x) = 0. (existence of additive inverses)
- For every x ≠ 0 in R, there exists an element x−1 in R, such that x × x−1 = 1. (existence of multiplicative inverses)
- (R, ≤) forms a totally ordered set. In other words,
- The field operations + and × on R are compatible with the order ≤. In other words,
- For all x, y and z in R, if x ≤ y, then x + z ≤ y + z. (preservation of order under addition)
- For all x and y in R, if 0 ≤ x and 0 ≤ y, then 0 ≤ x × y (preservation of order under multiplication)
- The order ≤ is complete in the following sense: every non-empty subset of R bounded above has a least upper bound. In other words,
- If A is a non-empty subset of R, and if A has an upper bound, then A has a least upper bound u, such that for every upper bound v of A, u ≤ v.
The rational numbers Q satisfy the first three axioms (i.e. Q is totally ordered field) but Q does not satisfy axiom 4. So axiom 4, which requires the order to be Dedekind-complete, is crucial. Axiom 4 implies the Archimedean property. Several models for axioms 1-4 are given below. Any two models for axioms 1-4 are isomorphic, and so up to isomorphism, there is only one complete ordered Archimedean field.
When we say that any two models of the above axioms are isomorphic, we mean that for any two models (R, 0R, 1R, +R, ×R, ≤R) and (S, 0S, 1S, +S, ×S, ≤S), there is a bijection f : R → S preserving both the field operations and the order. Explicitly,
- f is both injective and surjective.
- f(0R) = 0S and f(1R) = 1S.
- For all x and y in R, f(x +R y) = f(x) +S f(y) and f(x ×R y) = f(x) ×S f(y).
- For all x and y in R, x ≤R y if and only if f(x) ≤S f(y).
Tarski's axiomatization of the reals
An alternative synthetic axiomatization of the real numbers and their arithmetic was given by Alfred Tarski, consisting of only the 8 axioms shown below and a mere four primitive notions: a set called the real numbers, denoted R, a binary relation over R called order, denoted by infix <, a binary operation over R called addition, denoted by infix +, and the constant 1.
Axioms of order (primitives: R, <):
Axiom 1. If x < y, then not y < x. That is, "<" is an asymmetric relation.
Axiom 2. If x < z, there exists a y such that x < y and y < z. In other words, "<" is dense in R.
Axiom 3. "<" is Dedekind-complete. More formally, for all X, Y ⊆ R, if for all x ∈ X and y ∈ Y, x < y, then there exists a z such that for all x ∈ X and y ∈ Y, if z ≠ x and z ≠ y, then x < z and z < y.
To clarify the above statement somewhat, let X ⊆ R and Y ⊆ R. We now define two common English verbs in a particular way that suits our purpose:
- X precedes Y if and only if for every x ∈ X and every y ∈ Y, x < y.
- The real number z separates X and Y if and only if for every x ∈ X with x ≠ z and every y ∈ Y with y ≠ z, x < z and z < y.
Axiom 3 can then be stated as:
- "If a set of reals precedes another set of reals, then there exists at least one real number separating the two sets."
Axioms of addition (primitives: R, <, +):
Axiom 4. x + (y + z) = (x + z) + y.
Axiom 5. For all x, y, there exists a z such that x + z = y.
Axiom 6. If x + y < z + w, then x < z or y < w.
Axioms for one (primitives: R, <, +, 1):
Axiom 7. 1 ∈ R.
Axiom 8. 1 < 1 + 1.
Explicit constructions of models
We shall not prove that any models of the axioms are isomorphic. Such a proof can be found in any number of modern analysis or set theory textbooks. We will sketch the basic definitions and properties of a number of constructions, however, because each of these is important for both mathematical and historical reasons. The first three, due to Georg Cantor/Charles Méray, Richard Dedekind and Karl Weierstrass all occurred within a few years of each other. Each has advantages and disadvantages. A major motivation in all three cases was the instruction of mathematics students.
Construction from Cauchy sequences
R is defined as the completion of Q with respect to the metric |x-y|, as will be detailed below (for completions of Q with respect to other metrics, see p-adic numbers.)
Let R be the set of Cauchy sequences of rational numbers. That is, sequences
- x1, x2, x3,...
of rational numbers such that for every rational ε > 0, there exists an integer N such that for all natural numbers m,n > N, |xm − xn| < ε. Here the vertical bars denote the absolute value.
Cauchy sequences (xn) and (yn) can be added and multiplied as follows:
- (xn) + (yn) = (xn + yn)
- (xn) × (yn) = (xn × yn).
Two Cauchy sequences are called equivalent if and only if the difference between them tends to zero. This defines an equivalence relation that is compatible with the operations defined above, and the set R of all equivalence classes can be shown to satisfy all axioms of the real numbers. We can embed Q into R by identifying the rational number r with the equivalence class of the sequence (r,r,r, …).
Comparison between real numbers is obtained by defining the following comparison between Cauchy sequences: (xn) ≥ (yn) if and only if x is equivalent to y or there exists an integer N such that xn ≥ yn for all n > N.
By construction, every real number x is represented by a Cauchy sequence of rational numbers. This representation is far from unique; every rational sequence that converges to x is a representation of x. This reflects the observation that one can often use different sequences to approximate the same real number.
The only real number axiom that does not follow easily from the definitions is the completeness of ≤, i.e. the least upper bound property. It can be proved as follows: Let S be a non-empty subset of R and U be an upper bound for S. Substituting a larger value if necessary, we may assume U is rational. Since S is non-empty, we can choose a rational number L such that L < s for some s in S. Now define sequences of rationals (un) and (ln) as follows:
- Set u0 = U and l0 = L.
For each n consider the number:
- mn = (un + ln)/2
If mn is an upper bound for S set:
- un+1 = mn and ln+1 = ln
- ln+1 = mn and un+1 = un
This defines two Cauchy sequences of rationals, and so we have real numbers l = (ln) and u = (un). It is easy to prove, by induction on n that:
- un is an upper bound for S for all n
- ln is never an upper bound for S for any n
Thus u is an upper bound for S. To see that it is a least upper bound, notice that the limit of (un − ln) is 0, and so l = u. Now suppose b < u = l is a smaller upper bound for S. Since (ln) is monotonic increasing it is easy to see that b < ln for some n. But ln is not an upper bound for S and so neither is b. Hence u is a least upper bound for S and ≤ is complete.
The usual decimal notation can be translated to Cauchy sequences in a natural way. For example, the notation π = 3.1415... means that π is the equivalence class of the Cauchy sequence (3, 3.1, 3.14, 3.141, 3.1415, ...). The equation 0.999... = 1 states that the sequences (0, 0.9, 0.99, 0.999,...) and (1, 1, 1, 1,...) are equivalent, i.e., their difference converges to 0.
An advantage of constructing R as the completion of Q is that this construction is not specific to one example; it is used for other metric spaces as well.
Construction by Dedekind cuts
A Dedekind cut in an ordered field is a partition of it, (A, B), such that A is nonempty and closed downwards, B is nonempty and closed upwards, and A contains no greatest element. Real numbers can be constructed as Dedekind cuts of rational numbers.
For convenience we may take the lower set as the representative of any given Dedekind cut , since completely determines . By doing this we may think intuitively of a real number as being represented by the set of all smaller rational numbers. In more detail, a real number is any subset of the set of rational numbers that fulfills the following conditions:
- is not empty
- is closed downwards. In other words, for all such that , if then
- contains no greatest element. In other words, there is no such that for all ,
- We form the set of real numbers as the set of all Dedekind cuts of , and define a total ordering on the real numbers as follows:
- We embed the rational numbers into the reals by identifying the rational number with the set of all smaller rational numbers . Since the rational numbers are dense, such a set can have no greatest element and thus fulfills the conditions for being a real number laid out above.
- Addition. 
- Subtraction. where denotes the relative complement of in ,
- Negation is a special case of subtraction:
- Defining multiplication is less straightforward.
- if then
- if either or is negative, we use the identities to convert and/or to positive numbers and then apply the definition above.
- We define division in a similar manner:
- if then
- if either or is negative, we use the identities to convert to a non-negative number and/or to a positive number and then apply the definition above.
- Supremum. If a nonempty set of real numbers has any upper bound in , then it has a least upper bound in that is equal to .
As an example of a Dedekind cut representing an irrational number, we may take the positive square root of 2. This can be defined by the set . It can be seen from the definitions above that is a real number, and that . However, neither claim is immediate. Showing that is real requires showing that has no greatest element, i.e. that for any positive rational with , there is a rational with and The choice works. Then but to show equality requires showing that if is any rational number less than 2, then there is positive in with .
An advantage of this construction is that each real number corresponds to a unique cut.
Construction using hyperreal numbers
As in the hyperreal numbers, one constructs the hyperrationals *Q from the rational numbers by means of an ultrafilter. Here a hyperrational is by definition a ratio of two hyperintegers. Consider the ring B of all limited (i.e. finite) elements in *Q. Then B has a unique maximal ideal I, the infinitesimal numbers. The quotient ring B/I gives the field R of real numbers. Note that B is not an internal set in *Q. Note that this construction uses a non-principal ultrafilter over the set of natural numbers, the existence of which is guaranteed by the axiom of choice.
It turns out that the maximal ideal respects the order on *Q. Hence the resulting field is an ordered field. Completeness can be proved in a similar way to the construction from the Cauchy sequences.
Construction from surreal numbers
Every ordered field can be embedded in the surreal numbers. The real numbers form a maximal subfield that is Archimedean (meaning that no real number is infinitely large). This embedding is not unique, though it can be chosen in a canonical way.
Construction from Z (Eudoxus reals)
A relatively less known construction allows to define real numbers using only the additive group of integers with different versions. The construction has been formally verified by the IsarMathLib project. Shenitzer and Arthan refer to this construction as the Eudoxus reals.
Let an almost homomorphism be a map such that the set is finite. (Note that is an almost homomorphism for every .) Almost homomorphisms form an abelian group under pointwise addition. We say that two almost homomorphisms are almost equal if the set is finite. This defines an equivalence relation on the set of almost homomorphisms. Real numbers are defined as the equivalence classes of this relation. Alternatively, the almost homomorphisms taking only finitely many values form a subgroup, and the underlying additive group of the real number is the quotient group. To add real numbers defined this way we add the almost homomorphisms that represent them. Multiplication of real numbers corresponds to functional composition of almost homomorphisms. If denotes the real number represented by an almost homomorphism we say that if is bounded or takes an infinite number of positive values on . This defines the linear order relation on the set of real numbers constructed this way.
|“||Few mathematical structures have undergone as many revisions or have been presented in as many guises as the real numbers. Every generation reexamines the reals in the light of its values and mathematical objectives.||”|
A number of other constructions have been given, by:
As a reviewer of one noted: "The details are all included, but as usual they are tedious and not too instructive."
- Pugh, Charles Chapman (2002). Real Mathematical Analysis. New York: Springer. pp. 11–15. ISBN 978-0-387-95297-0.
- Hersh, Reuben (1997). What is Mathematics, Really?. New York: Oxford University Press US. p. 274. ISBN 978-0-19-513087-4.
- R.D. Arthan (2004). "The Eudoxus Real Numbers". arXiv:math/0405454.
- Norbert A'Campo (2003). "A natural construction for the real numbers". arXiv:math/0301015.
- Ross Street (September 2003). "Update on the efficient reals" (PDF). Retrieved 2010-10-23.
- Shenitzer, A (1987). "A topics course in mathematics". The Mathematical Intelligencer. 9 (3): 44–52. doi:10.1007/bf03023955.
- F. Faltin, N. Metropolis, B. Ross and G.-C. Rota. The real numbers as a wreath product Advances in Mathematics, 16(1975), 278–304.
- N. G. de Bruijn. Construction of the system of real numbers. (Dutch) Nederl. Akad. Wetensch. Verslag Afd. Natuurk. 86 (1977), no. 9, 121–125.
- G. J. Rieger. A new approach to the real numbers (motivated by continued fractions). Abh. Braunschweig. Wiss. Ges. 33 (1982), 205–217
- N. G. de Bruijn. Defining reals without the use of rationals. Nederl. Akad. Wetensch. Proc. Ser. A 79 = Indag. Math. 38 (1976), no. 2, 100–108
- Arnold Knopfmacher, John Knopfmacher. A new construction of the real numbers (via infinite products). Nieuw Arch. Wisk. (4) 5 (1987), no. 1, 19–31.
- Arnold Knopfmacher, John Knopfmacher. Two concrete new constructions of the real numbers. Rocky Mountain J. Math. 18 (1988), no. 4, 813–824.
- MR693180 (84j:26002) review of A new approach to the real numbers (motivated by continued fractions) by Rieger, G. J.