Construction of real numbers

From Wikipedia, the free encyclopedia

In mathematics, there are a number of 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

[edit] Synthetic approach

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, resp.), a binary relation ≤ on R, satisfying the following properties.

1. (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⁻¹ in R, such that x * x⁻¹ = 1. (existence of multiplicative inverses)

2. (R, ≤) forms a totally ordered set. In other words,

For all x in R, x ≤ x. (reflexivity)
For all x and y in R, if x ≤ y and y ≤ x, then x = y. (antisymmetry)
For all x, y, and z in R, if x ≤ y and y ≤ z, then x ≤ z. (transitivity)
For all x and y in R, x ≤ y or y ≤ x. (totalness)

3. 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)

4. 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 final axiom, defining the order as Dedekind-complete, is most crucial. Without this axiom, we simply have the axioms which define a totally ordered field, and there are many non-isomorphic models which satisfy these axioms. This axiom implies that the Archimedean property applies for this field. Therefore, when the completeness axiom is added, it can be proved that any two models must be isomorphic, and so in this sense, 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, 0_R, 1_R, +_R, *_R, ≤_R) and (S, 0_S, 1_S, +_S, *_S, ≤_S), there is a bijection f : R → S preserving both the field operations and the order. Explicitly,

f is both 1-1 and onto.
f(0_R) = 0_S and f(1_R) = 1_S.
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).

[edit] 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.

[edit] Construction from Cauchy sequences

If we have a space where Cauchy sequences are meaningful (such as a metric space, i.e., a space where distance is defined, or more generally a uniform space), a standard procedure to force all Cauchy sequences to converge is adding new points to the space (a process called completion). By starting with rational numbers and the metric d(x,y) = |x − y|, we can construct the real numbers, as will be detailed below. (A different metric on the rationals could result in the p-adic numbers instead.)

Let R be the set of Cauchy sequences of rational numbers. Cauchy sequences (x) and (y) can be added, multiplied and compared as follows:

(x_n) + (y_n) = (x_n + y_n)

(x_n) × (y_n) = (x_n × y_n)

(x_n) ≥ (y_n) if and only if for every rational ε > 0, there exists an integer N such that x_n ≥ y_n - ε for all n > N.

Two Cauchy sequences are called equivalent if the sequence (x_n - y_n) has limit 0. This does indeed define an equivalence relation, it is compatible with the operations defined above, and the set R of all equivalence classes can be shown to satisfy all the usual axioms of the real numbers. We can embed the rational numbers into the reals by identifying the rational number r with the equivalence class of the sequence (r,r,r, …).

The only real number axiom that does not follow easily from the definitions is the completeness of ≤. 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, there is a rational number L such that L < s for some s in S. Now define sequences of rationals (u_n) and (l_n) as follows:

Set u₀ = U and l₀ = L.

For each n consider the number:

m_n = (u_n + l_n)/2

If m_n is an upper bound for S set:

u_n+1 = m_n and l_n+1 = l_n

Otherwise set:

l_n+1 = m_n and u_n+1 = u_n

This obviously defines two Cauchy sequences of rationals, and so we have real numbers l=(l_n) and u=(u_n). It is easy to prove, by induction on n that:

u_n is an upper bound for S for all n

and:

l_n 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 (u_n - l_n) is 0, and so l=u. Now suppose b < u = l. Since (l_n) is monotonic increasing it is easy to see that b < l_n for some n. But l_n is not an upper bound for S and so neither is b. Hence u is a least upper bound for S and ≤ is complete.

A practical and concrete representative for an equivalence class representing a real number is provided by the representation to base b -- in practice, b is usually 2 (binary), 8 (octal), 10 (decimal) or 16 (hexadecimal). For example, the number π = 3.14159... corresponds to the Cauchy sequence (3,3.1,3.14,3.141,3.1415,...). Notice that the sequence (0,0.9,0.99,0.999,0.9999,...) is equivalent to the sequence (1,1.0,1.00,1.000,1.0000,...); this shows that 0.999... = 1.

[edit] 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. In detail, one can make the following definitions. (These are of value in extending some definitions to combinatorial game theory.)

When using Dedekind cuts to construct the real numbers, we can embed the rational numbers into the reals by identifying the rational number r with the Dedekind cut $(\{x: x < r\}, \{x: r \leq x\}).$ This embedding preserves the meaning of the comparison operators and the arithmetic operations as defined below on Dedekind cuts.

Certain arithmetic operations and set-theoretic notions which apply to the real numbers can be defined correspondingly for Dedekind cuts as follows:

1. Comparison. Two Dedekind cuts, (A_x, B_x) and (A_y, B_y) are equal:

$(A_x, B_x) = (A_y, B_y) \Leftrightarrow A_x = A_y \and B_x = B_y$

and (A_x, B_x) is less than, or equal to, (A_y, B_y):

$(A_x, B_x) \leq (A_y, B_y) \Leftrightarrow A_x \subseteq A_y \and B_y \subseteq B_x.$

2. Addition. The sum of two Dedekind cuts:

$(A_x, B_x) + (A_y, B_y) = (A_\mathrm{sum}, B_\mathrm{sum}) := \,\!$

$(\{x + y: x \in A_x \and y \in A_y\}, \{x + y: x \in B_x \and y \in B_y\}).$

3. Subtraction is defined analogously to addition.

4. Multiplication. The product of two Dedekind cuts, in case

${\mathbf \forall b_x \in B_x : 0 \leq b_x \and \forall b_y \in B_y : 0 \leq b_y }$

${\mathbf (A_x, B_x) \times (A_y, B_y) = (A_\mathrm{prod}, B_\mathrm{prod}) := }$

${ (\{ a_\mathrm{prod} \in \textbf{Q} : a_\mathrm{prod} \, {\not \in} \, \{ b_\mathrm{prod} \in \textbf{Q} : b_\mathrm{prod} = b_x \times b_y \and b_x \in B_x \and b_y \in B_y \} \},}$

${ \{ b_\mathrm{prod} \in \textbf{Q} : b_\mathrm{prod} = b_x \times b_y \and b_x \in B_x \and b_y \in B_y \})}.$

5. Division. The quotient of two Dedekind cuts, in case ${\mathbf \forall b_x \in B_x : 0 \leq b_x \and \exists q \in A_y : 0 < q }$

${\mathbf (A_x, B_x) / (A_y, B_y) = (A_\mathrm{quot}, B_\mathrm{quot}) := }$

${ (\{ a_\mathrm{quot} \in \textbf{Q} : a_\mathrm{quot} \, {\not \in} \, \{ b_\mathrm{quot} \in \textbf{Q} : b_\mathrm{quot} = b_x / q \and b_x \in B_x \and q \in A_y \and 0 < q \} \},}$

${ \{ b_\mathrm{quot} \in \textbf{Q} : b_\mathrm{quot} = b_x / q \and b_x \in B_x \and q \in A_y \and 0 < q \} )}.$

6. Completeness. The supremum of a set of Dedekind cuts which is bounded above:

${\mathbf \sup( \{ (A_n, B_n) \} ) = (A_\mathrm{sup}, B_\mathrm{sup}) := }$

${ (\{ a_\mathrm{sup} \in \textbf{Q} : a_\mathrm{sup} \, \in \, \bigcup_n A_n \}, }$

${ \{ b_{\sup} \in \textbf{Q} : b_{\sup} \, {\not \in} \, \{ a_{\sup} \in \textbf{Q} : a_\mathrm{sup} \, \in \, \bigcup_n A_n \} \} )}$

and the infimum of a set of Dedekind cuts which is bounded below:

${\mathbf \inf( \{ (A_n, B_n) \} ) = (A_{\inf}, B_{\inf}) := }$

${ (\{ a_{\inf} \in \textbf{Q} : a_{\inf} \, {\not \in} \, \{ b_{\inf} \in \textbf{Q} : b_{\inf} \, \in \, \bigcup_n B_n \} \},}$

${ \{ b_{\inf} \in \textbf{Q} : b_{\inf} \, \in \, \bigcup_n B_n \} ). }$

[edit] Construction by decimal expansions

We can take the infinite decimal expansion to be the definition of a real number, considering expansions like 0.9999... and 1.0000... to be equivalent, and define the arithmetical operations formally. Similarly another radix can be used. This is a special case of the construction by Cauchy sequences.

[edit] Construction from ultrafilters

As in the hyperreal numbers, construct ^*Q from the rational numbers using an ultrafilter. Take the ring of all elements in ^*Q whose absolute value is less than some nonzero natural number (it doesn't matter which). This ring has a unique maximal ideal, the infinitesimal numbers. Factoring a ring by a maximal ideal gives a field, in this case the field of reals. It turns out that the maximal ideal respects the order on ^*Q, so the field we get is an ordered field. Completeness can be proved in a similar way to the construction from the Cauchy sequences.

[edit] Construction from surreal numbers

Every ordered field can be embedded in the surreal numbers. The real numbers form the largest subfield that is Archimedean (meaning that no real number is infinitely large).

[edit] Construction from the group of integers

A relatively less known construction allows to define real numbers using only the additive group of integers. Different versions of this construction are described in [1], [2] and [3]. The construction has been formally verified by the IsarMathLib project [4].

Let an almost homomorphism be a map $f:\mathbb{Z}\to\mathbb{Z}$ such that the set $\{f(n+m)-f(m)-f(n): n,m\in\mathbb{Z}\}$ is finite. We say that two almost homomorphisms $f, g$ are almost equal if the set $\{f(n)-g(n): n\in \mathbb{Z}\}$ is finite. This defines an equivalence relation on the set of almost homomorphisms. Real numbers are defined as the equivalence classes of this relation. To add real numbers defined this way we add the almost homomorphisms that represent them. Multiplication of real numbers corresponds to composition of almost homomorphisms. If $[f]$ denotes the real number represented by an almost homomorphism $f$ we say that $0\leq [f]$ if $f$ is bounded or $f$ takes an infinite number of positive values on $\mathbb{Z}^+$ . This defines the linear order relation on the set of real numbers constructed this way.