This note is where the construction story of the number systems starts to change direction. Up to now, you have been building , , and and checking that their operations are well-defined. Here the question is different:
Does already contain every number you need for order and limit arguments?
The answer is no. The standard example comes from .
Intuition first: dense is not the same as complete
A common first reaction is:
"But there are so many rational numbers. Surely there is no gap."
That reaction mixes up two different ideas.
- Dense means that between two different rational numbers, you can always find another rational.
- Complete means that certain bounded sets really do have least upper bounds inside the number system you are working in.
The set shows that density does not guarantee completeness. Rationals can be packed closely together and still miss an important boundary point.
A warning from geometric series
Infinite processes can have rational partial information while pointing toward a boundary that is not captured by any finite stage. A simple geometric series already shows the pattern:
has rational partial sums, and those partial sums approach . Each finite sum is still below , but the boundary is read from the whole infinite process, not from one finite partial sum.
This example is not a proof that is missing from . It prepares the right habit: distinguish a sequence of better rational approximations from the limit or least upper bound that those approximations are trying to reach.
The key order-language
Definition
Upper bound and supremum
Let be a subset of an ordered set.
- An upper bound of is a number such that for every .
- A supremum of , written , is the least upper bound of .
The word "least" is crucial. A supremum is not just any upper bound. It is the smallest number that still stays above the whole set.
Definition
Irrational number
An irrational number is a real number that does not belong to .
The set that exposes the gap
Theorem
The square root of two is not rational
There is no rational number with .
The classic set is
This set collects all rational numbers whose square is still less than .
At first glance, it feels as if this set ought to have a rational boundary. After all, numbers such as , , and belong to it, while numbers such as or sit above it.
The problem is that the "correct" boundary is , and that number is not in .
Why is bounded above in
Before proving that has no supremum in , you should first check that really is a bounded-above set.
Worked example
Finding an upper bound for
Take .
Since , the number does not belong to . More importantly, every rational with also satisfies , so such a lies above every element of .
That means is an upper bound for .
More generally, any rational number with and is an upper bound for . The positivity condition is essential: a negative number can have square greater than without lying above the positive elements of .
So the issue is not that has no upper bounds. The issue is that among its rational upper bounds, there is no least one.
Why is not rational
First recall the standard contradiction proof.
Proof that does not belong to
Assume, for contradiction, that is rational.
Then there exist integers and with such that
and the fraction is already in lowest terms.
Squaring both sides gives
So is even, which forces itself to be even. Write .
Substituting back gives
so
Therefore is even, and is even as well.
Now both and are even, which contradicts the assumption that was already in lowest terms.
Therefore is not rational.
This matters because if were rational, it would be the obvious candidate for in . The contradiction tells you that the obvious candidate is missing from the rational number system.
The formal gap statement
Theorem
The set has no supremum in
The set is bounded above in , but there is no rational number that serves as its least upper bound.
The epsilon argument behind the gap
The phrase “move a little” needs a quantitative proof. The following argument uses only rational arithmetic and the fact that every positive rational has a smaller positive rational.
Proof that no rational candidate can be the supremum
Let .
If , then and , so is not an upper bound. It remains to consider , separating the three possibilities for .
Case 1: the candidate lies below the boundary. Suppose . Put and choose a positive rational with
Then
Thus , so cannot be an upper bound.
Case 2: the candidate lies above the boundary. Suppose , still with . Put and choose a positive rational with
Set . Then and
If and , then is less than . If and , then , contradicting . Hence every satisfies . So is an upper bound smaller than , and is not the least upper bound.
Case 3: the candidate lies on the boundary. The remaining possibility would make a rational solution of , which the parity proof ruled out. Thus every rational candidate fails.
Worked example
A rational sequence can have a rational supremum
Consider the sequence
The finite geometric-sum identity gives
Every is below , so is an upper bound in . Given any rational number less than , write with positive integers . Choose a positive integer ; for example, works since . Induction gives for every positive integer: , and completes the step. Hence , so . Thus no smaller rational is an upper bound, and
This is a useful contrast: rational partial sums do not automatically create a gap. The gap appears when the boundary required by the set is the irrational number .
Checkpoint
In the case where is greater than , why must the smaller candidate remain positive?
Use the sign condition needed when comparing squares.
Solution · Answer
The comparison of squares is order-preserving for nonnegative numbers. Choosing less than ensures , so from a positive we may infer . Without that sign check, comparing squares would not control the original order.
Supremum language must name the ambient set
The same subset can have a supremum in one ordered set and fail to have one in another. For example, the geometric sequence above has supremum in , and the set has supremum when regarded as a subset of . But when the ambient set is restricted to , is not an admissible candidate.
Worked example
An infimum need not be a minimum
For , zero is a lower bound in , and every positive rational is larger than zero. If , then is another positive rational smaller than , so has no minimum. Nevertheless, in the ambient ordered set , even though . This is the same distinction used for the supremum of : least or greatest refers to bounds in the ambient order, not membership in the subset.
A gap inside every rational interval
The same obstruction can be placed inside any nonempty rational open interval. Let with , and define
For , we have , so ; hence .
The set has no supremum in : a candidate is defeated by ; if and , the right-perturbation proof above supplies a larger element of (with handling ); if , the left-perturbation proof supplies a smaller upper bound; and equality is impossible by the irrationality proof.
If had a rational supremum , put . For every , the upper-bound inequality implies , because . Thus bounds .
Conversely, if bounds , then bounds . The leastness of gives , hence . Therefore would be a rational supremum of , a contradiction. This constructs a rational subset of every such interval whose supremum does not exist in .
Worked applications: parity, gcd, and suprema
The following worked applications use three different methods: parity detects impossible rational squares, common divisors constrain integer equations, and leastness identifies a supremum.
Worked example: no rational square equals
If satisfied , choose integers with and . Then , so is even; writing gives , which forces to be even. This contradicts . The parity fact used here is elementary: an odd integer has odd square, so an even square has an even root.
Worked example: the gcd forced by
Let and . Any positive common divisor of and divides , so ; therefore .
Worked example: reduce a quadratic to the irrationality proof
Completing the square gives . If were rational, then would be rational, contradicting the proof that no rational square is .
Worked example: a repeating-decimal supremum in
Let : each element has finitely many digits after the initial . Writing for , we have
Thus is an upper bound. If is rational, write with positive integers and take . Then , , and , so . Hence . Therefore .
Common mistake
Common mistake
Dense does not mean complete
It is true that between any two rational numbers there is another rational. But that fact only talks about what happens between two existing rationals. It does not say that every bounded set of rationals has a rational supremum.
Another common mistake is to think that a supremum must belong to the set itself. That is false. A supremum only has to be the least upper bound in the ambient ordered set.
Quick checks
Checkpoint
Why is a rational number whose is less than not an upper bound for ?
Use the idea that you can move a little to the right and still keep the square below .
Solution · Answer
Because such an is still too small. There exists a rational with less than , so also belongs to . That means cannot be above the whole set.
Checkpoint
Does the supremum of a set have to belong to the set?
Answer in one sentence.
Solution · Answer
No. A supremum only has to be the least upper bound. It may lie outside the set itself.
Exercise
Checkpoint
Why do infinitely many rationals near still fail to fix the gap in ?
Use the difference between density and completeness.
Solution · Guided solution
Having many rationals near only shows that is dense. It tells you that you can approximate the missing boundary very well. But approximation is not the same as possession. The boundary point that should play the role of the least upper bound is , and that point is not rational. So the set can have arbitrarily close rational approximations and still have no supremum in .
Optional continuations
The missing supremum point is registered by a cut of rational numbers.
Where this leads
Dedekind cuts register the missing boundary
The missing supremum point is registered by a cut of rational numbers.
The set shows exactly which property lacks: a bounded-above rational set need not have a rational least upper bound. Later constructions of the real numbers register the missing boundary as a Dedekind cut: a lower set of rationals with no greatest element, together with its upper side. This is the order-theoretic construction that records the boundary; it is not a metric completion argument.
Published · Dedekind cuts and the embedding of the rationals
Read this first
If you want the construction of first, read 3.4 Rationals and well-defined operations.