Loading…
A rationally defined bounded set shows why ordered-field arithmetic does not imply completeness.
An ordered field can support arithmetic and comparison while a nonempty subset bounded above has no least upper bound. Completeness rules out precisely this failure. The rational set defined by will show that does not satisfy that stronger requirement.
Definition 4.3.1
(Complete ordered set)
An ordered set is complete if:
So completeness is not about having many elements. It is about never losing the least upper bound or greatest lower bound when those bounds ought to be there.
Worked example 4.3.2
(Finite totally ordered sets are complete)
If is a finite totally ordered set, every nonempty subset already has a largest and smallest element. Those elements automatically serve as supremum and infimum.
So finite totally ordered sets are complete for a simple reason: the relevant extremes are already attained inside the set.
The interesting question is what happens for infinite totally ordered sets such as and .
The standard counterexample is
This set is not empty, because . It is also bounded above in ; for instance is an upper bound.
What would happen if were complete? Then would have a rational supremum. The whole argument below shows that no rational number can play that role.
Theorem 4.3.3
(Q is not complete)
The ordered set is not complete.
Any upper bound must satisfy , since . In particular, cannot be an upper bound. We may therefore restrict the candidate supremum to positive rational numbers before comparing squares.
Suppose and . If , let and choose
This is an explicit rational choice. Since and ,
Thus and , so is not an upper bound.
If , let and choose
Now , and
Every satisfies : otherwise would imply . Consequently is an upper bound smaller than , contradicting leastness. Positivity of is essential; a negative rational whose square exceeds is not an upper bound of .
Finally, is impossible for rational by the earlier parity proof. These cases exhaust the positive candidates, so has no supremum in . All quantities used here are rational; no real square root or completeness principle was assumed.
The word “maximum” describes membership, whereas completeness describes an existence principle for bounds. A maximum is an element of the subset; a supremum may be an endpoint in the ambient set that the subset never reaches. Conversely, a supremum can exist for a set even when the ambient ordered set is not complete. Completeness requires a supremum for every nonempty subset bounded above in the ambient order, and an infimum for every nonempty subset bounded below.
Worked example 4.3.4
(An explicit finite total-order calculation)
Let with its usual order and let . In the ambient set , the only upper bound of is , so ; the only lower bound is , so . Both are attained because they belong to . If instead , then its upper bounds in are again , while its lower bounds are . The ambient set controls the list of bounds, but the maximum and minimum are still determined by membership in the subset.
Worked example 4.3.5
(An infimum without a minimum)
The positive rational set has no minimum: for every , the rational is positive and smaller. Nevertheless is its infimum in . Indeed, is a lower bound, while a lower bound would have to satisfy , which is impossible. This proves , even though the minimum does not exist. It is the same membership distinction that separates a bound in the ambient set from an element of the subset.
For rational , the midpoint is rational and lies strictly between them. Repeating this gives more rationals in every rational interval. This density property compares points already in ; completeness asks whether every nonempty set bounded above has a least upper bound in . The set satisfies the boundedness hypotheses but has no such rational bound.
Common mistake
(Approximation does not establish a boundary object)
Rational brackets for the equation can be made progressively narrower. That process alone neither supplies a rational supremum of nor defines a new number. A construction must specify an object and prove that it has the required order properties.
The two perturbations attack different clauses of the supremum definition: disproves the upper-bound claim, while the smaller upper bound disproves leastness. Both comparisons require positive candidates, since squaring is not increasing on all of . Neither test names an already existing irrational boundary.
Worked example 4.3.6
(A bounded rational set whose endpoint is present)
Let . The element belongs to and is an upper bound, so it is immediately the maximum and therefore . The element is a lower bound. If were a larger lower-bound candidate, then would be positive; when , it lies in and is smaller than , contradicting the lower-bound condition. If , then already contradicts . Thus , and has no minimum. This example is deliberately close to the set : the same language of bounds is used, but the endpoint is rational and present, so no completeness failure occurs.
For , the bound exists in ; for , no rational candidate survives. Thus the existence of a supremum for one set does not imply completeness of the ambient order. The axiom quantifies over every nonempty subset bounded above, with the dual requirement for subsets bounded below.
After a complete ordered field containing has been constructed, will have a supremum there. The notations and make different existence claims: the first fails, while the second will follow from the construction. Keeping the ambient set visible distinguishes a missing bound from a failure of density between existing rational points.
Quick check
(Why is 2 an upper bound of ?)
If x>2, what happens to x^2?
If , then , so such an cannot belong to . Therefore every member of lies at most , so is an upper bound.
Quick check
(Why does the density of Q not imply completeness of Q?)
Answer in one careful sentence.
Density says that between any two distinct rationals there is another rational. Completeness requires a least upper bound for every nonempty subset bounded above in the ambient order; the set has arbitrarily good rational approximations to its boundary but no rational supremum.
Quick check
(Explain why every finite totally ordered set is complete.)
Use the fact that nonempty finite subsets always attain their largest and smallest elements.
Take any nonempty subset of a finite totally ordered set . Because is finite, one can compare its elements and find a largest and smallest element. Those are respectively the maximum and minimum of , so they also serve as supremum and infimum. Hence every finite totally ordered set is complete.
Quick check
(Suppose Q were complete. What would that force for the set , and why is that impossible?)
Connect the definition of completeness directly to the counterexample.
If were complete, then every nonempty subset of with an upper bound would have a supremum in . The set is nonempty and bounded above, so it would have some with . But the three-case argument shows no rational can do that. So completeness of is impossible.
Read this after 3.5 Gaps in Q and sqrt(2) and 4.2 Upper bounds, supremum, and infimum. Then continue to 4.4 Axioms for the reals and first approximations.
Work out your answer, then check it. You can revise and try again.
Loading…