This sheet is concerned with proving that the continuum R is an ordered field. Addition and multiplication on R are defined in terms of addition and multiplication on Q, so we will use ⊕ and ⊗ for addition and multiplication of real numbers, to make sure that there is no confusion with + and ⋅ on Q.
8A. Construction of the real numbers via cuts, Addition and Order#
Definition 8.1. A subset A of Q is said to be a cut (or Dedekind cut) if it satisfies the following:
(a) A=∅ and A=Q
(b) If r∈A and s∈Q satisfies s<r, then s∈A
(c) If r∈A then there is some s∈Q with s>r and s∈A
We denote the collection of all cuts by R.
Definition 8.2. We define ⊕ on R as follows. Let A,B∈R be Dedekind cuts. Define
A⊕B={a+b∣a∈A,b∈B}.
Exercise 8.3. (a) Prove that A⊕B, 0, and 1 are all Dedekind cuts.
(b) Prove that {x∈Q∣x≤0} is not a Dedekind cut.
(c) Prove that {x∈Q∣x<0}∪{x∈Q∣x2<2} is a Dedekind cut.
Hint: In Exercise 4.20 last quarter we showed that if x∈Q, x≥0, and x2<2, then there is some δ∈Q, δ>0 such that (x+δ)2<2.
Exercise 8.4. (Homework) Prove that if A∈R then A=0⊕A.
Definition 8.5. If A,B∈R, we say that A<B if A is a proper subset of B, i.e. A⊂B but A=B.
(a) (Trichotomy) If A,B∈R then exactly one of the following holds: A<B, A=B, B<A.
(b) (Transitivity) If A,B,C∈R with A<B and B<C then A<C.
(c) (Additivity) If A,B,C∈R with A<B then A⊕C<B⊕C.
Note: to prove part (c) you may assume Theorem 8.11 and associativity of addition.
Exercise 8.7. (Homework) Show that if A∈R and 0<A, then 0∈A.
For every rational number q∈Q, define the corresponding real number as the Dedekind cut
i(q)={x∈Q∣x<q}.
For example, 0=i(0). This gives a well-defined injective function i:Q⟶R. We identify Q with its image i(Q)⊂R so that the rational numbers Q are a subset of the real numbers R. (Hence N and Z are also subsets of R.) Note that in this case, this is the same map i that you identified in Theorem 7.27, so that in fact Q is a subfield of R.
8D. The continuum is isomorphic to the real numbers#
Axiom 5. The continuum contains a countable dense subset.
Exercise 8.32. Let K⊂C be a countable dense subset of C. Construct an order-preserving bijection f:Q⟶K.
(A map f:Q⟶K is order-preserving if r<s in Q implies f(r)<Cf(s) in K.)
Exercise 8.33. Let f:Q⟶K be an order-preserving bijection, as found in the previous exercise. Let A∈R. Then A⊂Q and so f(A)⊂K⊂C. Define F:R⟶C by
F(A)=supf(A).
Show:
supf(A) exists, so F is well-defined.
F is injective and order-preserving.
Theorem 8.34. Suppose that C is a continuum satisfying Axioms 1–5. Then C is isomorphic to the real numbers R. That is, if we let < be the order on R and <C be the order on C, then there is a bijection F:R⟶C such that, for all A,B∈R,
A<B⟹F(A)<CF(B).
Axioms 1–5 completely characterize the continuum in the sense that there is only one model for them, namely the real numbers. The main consequence for us is that we will no longer refer to C as anything but R.
In addition, now that we have constructed R and proved the fundamental facts about it, we will forget about Dedekind cuts and think of elements of R as numbers. From now on, we will agree to use lower-case letters like x for real numbers and to write + and ⋅ for ⊕ and ⊗ like people usually do.