Sections of the reals and Dedekind's theorem
Cutting the real numbers produces nothing new; every section of the reals has a real number at the join.
Why this matters
Sections of the rationals turned out to be a richer system than the rationals: they gave us , and every other real number. So it is natural to ask whether sections of the reals give something richer still, numbers beyond the real numbers. §17 answers no. Every section of the real numbers is “at” a real number. This property, completeness, is what the rationals lack and the reals possess, and it is the property every existence theorem of analysis (limits of monotone sequences, the intermediate value theorem, maxima of continuous functions) ultimately rests on.
The idea
A section of the reals is defined just like a section of the rationals: two properties, every real number has exactly one, both occur, and everything with the first is less than everything with the second. Among the rationals there were three possibilities at the join: the lower class has a greatest member, or the upper class has a least member, or neither (a gap). Among the reals Hardy shows that the third possibility, the gap, never happens.
Try this. Start with “x ≤ √2 | x > √2” among the rationals and zoom in on the join. Switch to the reals. Then try “x < √2 | x ≥ √2”, the cubic, and , each among the rationals and among the reals. Last, try “x < √2 | x > √2” among the reals.
- lower class L
- upper class R
- the join
What to notice
Among the rationals an irrational join is a hole: neither class has an end member, and the two √2 pairs give the same section. Among the reals the join is always a real number, which sits in exactly one class: L has a greatest member or R a least one. The last pair is not a section of the reals at all, because √2 has neither property, although it is a perfectly good section of the rationals.
Why should the reals behave better? Because the only candidates for a gap are positions on the line, and every position is already described by a section of the rationals, which is a real number. Hardy’s proof makes that precise: look at the rational members of the two classes. They form a section of the rationals, hence a real number , and must be the end member of whichever class it falls in.
Precise statements
A section of the real numbers is a division of all real numbers into two classes and such that (i) every real number belongs to exactly one class; (ii) both classes are non-empty; (iii) every member of is less than every member of .
If the real numbers are divided into two classes and satisfying (i), (ii) and (iii), then there is a real number such that every number less than belongs to and every number greater than belongs to . The number itself may belong to either class: it is either the greatest member of or the least member of .
The same holds for a section of the numbers of an interval , and then .
Proofs
First show that and cannot both have end members. Then restrict the classes to the rationals: the rational members form a section of the rationals, which by definition is a real number . Show that is an end member of or of .
Not both an end in and an end in
If were greatest in and least in , then and would be a real number greater than every member of and less than every member of , so in neither class. That contradicts (i).
The rational members form a section of the rationals
Let and be the rational members of and . Every rational is in exactly one of them, and every member of is below every member of . Both are non-empty: if , any rational cannot be in (by (iii) it would exceed ), so ; similarly any rational above a member of is in .
Case 1: has a greatest member
Then is also the greatest member of . Otherwise some has , and a rational with exists by density. Being less than the member of , is in (it cannot be in by (iii)), so and , a contradiction. So works.
Case 2: has no greatest member
Then is a section of the rationals whose lower class has no greatest member, that is, a real number (§8). The number belongs to or to .
is an end member of its class
Suppose but some exceeds it. Choose rationals with . Both are below , so they lie in , hence in . But every member of is less than (the lower class of the section consists of rationals below ), and : contradiction. So is the greatest member of . In the same way, if it is the least member of .
Conclude
In every case there is a real that is the greatest member of or the least member of . Say is greatest in . A number cannot be in , so it is in ; a number cannot be in , since it would then be smaller than the member of , against (iii); so it is in . The case where is least in is the same with the classes exchanged.
The proof uses the definition of real numbers in exactly one place, Case 2: the section of the rationals cut out by and is a real number by definition. That is where completeness comes from. For the rationals alone, Case 2 would leave us with a gap and nothing to fill it.
Sections of an interval
In applications one often cuts only the numbers of an interval . Such a section becomes a section of all reals by adding every number below to and every number above to ; the theorem then gives a number , and because (or is the least member of ) and (or is the greatest member of ). This is the form used for Weierstrass’s theorem in the last lesson of the chapter.
Worked examples and exercises
For each section of the reals, find and say whether it is the greatest member of or the least member of : (a) ; (b) ; (c) .
Hint
Solution
(a) , the greatest member of . (b) : since is not less than , , and it is the least member of . (c) , the real root of , which satisfies , so it is the greatest member of . (For the inequality holds exactly up to , by the monotonicity shown in §15.)
Show that the pair "", "" defines a section of the positive rationals but not of the positive reals.
Hint
Solution
No positive rational has , so every positive rational has exactly one of the properties; the other conditions were checked in §4. Among the positive reals, has and so has neither property: condition (i) fails. To get a section of the reals, must be put into one of the classes, and it then becomes its end member, as Dedekind’s theorem predicts.
Let be a non-empty set of real numbers with an upper bound (a number with for all ). Use Dedekind’s theorem to show that has a least upper bound.
Hint
Hint
Solution
Let be the set of upper bounds of and the rest. (i) holds by construction. (ii) ; and if then is not an upper bound, so . (iii) If and , then some has , while ; so . Dedekind’s theorem gives . If were in , some would exceed ; then is greater than and still not an upper bound, so it is in , contradicting that is greatest in . So is the least member of : the least upper bound. This is the form of completeness used in most modern books.
Show that the set of rationals with has rational upper bounds but no least rational upper bound.
Hint
Solution
is a rational upper bound. Let be any rational upper bound; then , and is impossible (then would be in the set, and the larger member would exceed it), while is impossible for rational . So . Then is rational, smaller than , and still has , so it is also an upper bound (anything with square below is below ). Hence no rational upper bound is least.
Check yourself
For a section of the real numbers, which situation is impossible?
That is exactly the “gap” case, which Dedekind’s theorem rules out for the reals (it is possible for the rationals). Both of the first two cases occur, and the join may well be irrational, as with ; it is then a real number in one of the classes.
Sections of the real numbers define a new, larger kind of number, just as sections of the rationals did.
False. That is the whole point of the theorem: every section of the reals corresponds to a real number at its join. Hardy expresses this by saying that the continuum is “closed”, or has a completeness the rationals lack.
Where in the proof of Dedekind’s theorem is the definition of a real number (as a section of the rationals) used?
When the rational members leave a “gap”, that gap is a real number by definition. For the rationals the same proof breaks down at exactly this step, and the theorem is false for them.
Hardy’s language
the continuum has a kind of completeness which the aggregate of the rational numbers lacked, a completeness which is expressed in technical language by saying that the continuum is closed.
Summary
- A section of the reals splits all real numbers into non-empty classes below .
- Dedekind’s theorem: there is a real number at the join, either the greatest member of or the least member of , never neither and never both.
- Proof: the rational members of and form a section of the rationals, which is a real number by definition, and it is the end member of its class.
- Equivalent form: every non-empty set of reals with an upper bound has a least upper bound. Both fail for the rationals.