Evanalysis
3.5Estimated reading time: 20 min

3.5 Gaps in Q and why sqrt(2) is not rational

Use the set of rationals below sqrt(2) to see why density is not enough to make Q complete.

Course contents

This note is where the construction story of the number systems starts to change direction. Up to now, you have been building NN, ZZ, and QQ and checking that their operations are well-defined. Here the question is different:

Does QQ already contain every number you need for order and limit arguments?

The answer is no. The standard example comes from 2\sqrt{2}.

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 QQ 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:

1+12+14+⋯+12n1+\frac12+\frac14+\cdots+\frac{1}{2^n}

has rational partial sums, and those partial sums approach 22. Each finite sum is still below 22, but the boundary is read from the whole infinite process, not from one finite partial sum.

This example is not a proof that 2\sqrt{2} is missing from QQ. 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 XX be a subset of an ordered set.

  • An upper bound of XX is a number uu such that x≤ux \le u for every x∈Xx \in X.
  • A supremum of XX, written sup⁡(X)\sup(X), is the least upper bound of XX.

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 QQ.

The set that exposes the gap

Theorem

The square root of two is not rational

There is no rational number ss with s2=2s^2=2.

The classic set is

S={q∈Q∣q2<2}.S = \{q \in Q \mid q^2 \lt 2\}.

This set collects all rational numbers whose square is still less than 22.

At first glance, it feels as if this set ought to have a rational boundary. After all, numbers such as 11, 1.41.4, and 1.411.41 belong to it, while numbers such as 22 or 3/23/2 sit above it.

The problem is that the "correct" boundary is 2\sqrt{2}, and that number is not in QQ.

Why SS is bounded above in QQ

Before proving that SS has no supremum in QQ, you should first check that SS really is a bounded-above set.

Worked example

Finding an upper bound for SS

Take u=2u = 2.

Since 22=4>22^2 = 4 > 2, the number 22 does not belong to SS. More importantly, every rational qq with q>2q > 2 also satisfies q2>2q^2 > 2, so such a qq lies above every element of SS.

That means 22 is an upper bound for SS.

More generally, any rational number uu with u>0u>0 and u2>2u^2>2 is an upper bound for SS. The positivity condition is essential: a negative number can have square greater than 22 without lying above the positive elements of SS.

So the issue is not that SS has no upper bounds. The issue is that among its rational upper bounds, there is no least one.

Why 2\sqrt{2} is not rational

First recall the standard contradiction proof.

Proof that 2\sqrt{2} does not belong to QQ

Assume, for contradiction, that 2\sqrt{2} is rational.

Then there exist integers pp and qq with q≠0q \ne 0 such that

2=pq\sqrt{2} = \frac{p}{q}

and the fraction is already in lowest terms.

Squaring both sides gives

p2=2q2.p^2 = 2q^2.

So p2p^2 is even, which forces pp itself to be even. Write p=2kp = 2k.

Substituting back gives

4k2=2q2,4k^2 = 2q^2,

so

q2=2k2.q^2 = 2k^2.

Therefore q2q^2 is even, and qq is even as well.

Now both pp and qq are even, which contradicts the assumption that p/qp/q was already in lowest terms.

Therefore 2\sqrt{2} is not rational.

This matters because if 2\sqrt{2} were rational, it would be the obvious candidate for sup⁡(S)\sup(S) in QQ. The contradiction tells you that the obvious candidate is missing from the rational number system.

The formal gap statement

Theorem

The set S={q∈Q∣q2<2}S = \{q \in Q \mid q^2\lt2\} has no supremum in QQ

The set SS is bounded above in QQ, 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 s∈Qs\in Q.

If s<1s<1, then 1∈S1\in S and 1>s1>s, so ss is not an upper bound. It remains to consider s≥1s\ge1, separating the three possibilities for s2s^2.

Case 1: the candidate lies below the boundary. Suppose s2<2s^2<2. Put M=2−s2>0M=2-s^2>0 and choose a positive rational ε\varepsilon with

ε<2sandε<M4s.\varepsilon\lt2s \qquad\text{and}\qquad \varepsilon\lt\frac{M}{4s}.

Then

(s+ε)2=s2+ε(2s+ε)<s2+ε(4s)<s2+M=2.(s+\varepsilon)^2=s^2+\varepsilon(2s+\varepsilon) \lt s^2+\varepsilon(4s)\lt s^2+M=2.

Thus s+ε∈Ss+\varepsilon\in S, so ss cannot be an upper bound.

Case 2: the candidate lies above the boundary. Suppose s2>2s^2>2, still with s≥1s\ge1. Put M=s2−2M=s^2-2 and choose a positive rational ε\varepsilon with

ε<sandε<M4s.\varepsilon\lt s \qquad\text{and}\qquad \varepsilon\lt\frac{M}{4s}.

Set r=s−εr=s-\varepsilon. Then r>0r>0 and

r2=s2−ε(2s−ε)>s2−2sε>2.r^2=s^2-\varepsilon(2s-\varepsilon)\gt s^2-2s\varepsilon\gt2.

If x∈Sx\in S and x≤0x\le0, then xx is less than rr. If x>0x>0 and x>rx>r, then x2>r2>2x^2>r^2>2, contradicting x∈Sx\in S. Hence every x∈Sx\in S satisfies x≤rx\le r. So rr is an upper bound smaller than ss, and ss is not the least upper bound.

Case 3: the candidate lies on the boundary. The remaining possibility s2=2s^2=2 would make ss a rational solution of x2=2x^2=2, which the parity proof ruled out. Thus every rational candidate fails.

Worked example

A rational sequence can have a rational supremum

Consider the sequence

f(n)=1+12+122+⋯+12n.f(n)=1+\frac12+\frac1{2^2}+\cdots+\frac1{2^n}.

The finite geometric-sum identity gives

f(n)=2−12n.f(n)=2-\frac1{2^n}.

Every f(n)f(n) is below 22, so 22 is an upper bound in QQ. Given any rational number uu less than 22, write 2−u=A/B2-u=A/B with positive integers A,BA,B. Choose a positive integer n>B/An>B/A; for example, n=B+1n=B+1 works since A≥1A\ge1. Induction gives 2n>n2^n>n for every positive integer: 2>12>1, and 2n+1>2n≥n+12^{n+1}>2n\ge n+1 completes the step. Hence 1/2n<A/B=2−u1/2^n<A/B=2-u, so f(n)>uf(n)>u. Thus no smaller rational is an upper bound, and

sup⁡f(N)=2.\sup f(N)=2.

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 2\sqrt{2}.

Checkpoint

In the case where s2s^2 is greater than 22, why must the smaller candidate r=s−εr=s-\varepsilon remain positive?

Use the sign condition needed when comparing squares.

Solution · Answer

The comparison of squares is order-preserving for nonnegative numbers. Choosing ε\varepsilon less than ss ensures r>0r>0, so from a positive x>rx>r we may infer x2>r2x^2>r^2. 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 22 in QQ, and the set SS has supremum 2\sqrt{2} when regarded as a subset of RR. But when the ambient set is restricted to QQ, 2\sqrt{2} is not an admissible candidate.

Worked example

An infimum need not be a minimum

For Y=Q>0Y=Q_{>0}, zero is a lower bound in QQ, and every positive rational is larger than zero. If q>0q>0, then q/2q/2 is another positive rational smaller than qq, so YY has no minimum. Nevertheless, 0=inf⁡(Y)0=\inf(Y) in the ambient ordered set QQ, even though 0∉Y0\notin Y. This is the same distinction used for the supremum of SS: 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 a,b∈Qa,b\in Q with a<ba<b, and define

P={q∈Q∣0<q and q2<2},X={a+b−a2q∣q∈P}.P=\{q\in Q\mid 0<q\text{ and }q^2\lt2\}, \qquad X=\left\{a+\frac{b-a}{2}q\mathrel{\Big|}q\in P\right\}.

For q∈Pq\in P, we have 0<q<20<q<2, so a<a+(b−a)q/2<ba<a+(b-a)q/2<b; hence X⊂(a,b)X\subset(a,b).

The set PP has no supremum in QQ: a candidate t≤0t\le0 is defeated by 1∈P1\in P; if t>0t>0 and t2<2t^2\lt2, the right-perturbation proof above supplies a larger element of PP (with 1∈P1\in P handling t<1t<1); if t2>2t^2>2, the left-perturbation proof supplies a smaller upper bound; and equality is impossible by the irrationality proof.

If XX had a rational supremum uu, put v=2(u−a)/(b−a)∈Qv=2(u-a)/(b-a)\in Q. For every q∈Pq\in P, the upper-bound inequality a+(b−a)q/2≤ua+(b-a)q/2\le u implies q≤vq\le v, because b−a>0b-a>0. Thus vv bounds PP.

Conversely, if w∈Qw\in Q bounds PP, then a+(b−a)w/2a+(b-a)w/2 bounds XX. The leastness of uu gives u≤a+(b−a)w/2u\le a+(b-a)w/2, hence v≤wv\le w. Therefore vv would be a rational supremum of PP, a contradiction. This constructs a rational subset of every such interval whose supremum does not exist in QQ.

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 20262026

If x=p/q∈Qx=p/q\in Q satisfied x2=2026x^2=2026, choose integers p,qp,q with q≠0q\ne0 and gcd⁡(p,q)=1\gcd(p,q)=1. Then p2=2026q2p^2=2026q^2, so pp is even; writing p=2kp=2k gives 2k2=1013q22k^2=1013q^2, which forces qq to be even. This contradicts gcd⁡(p,q)=1\gcd(p,q)=1. 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 5x+7y=15x+7y=1

Let x,y∈Zx,y\in Z and 5x+7y=15x+7y=1. Any positive common divisor dd of xx and yy divides 5x+7y=15x+7y=1, so d=1d=1; therefore gcd⁡(x,y)=1\gcd(x,y)=1.

Worked example: reduce a quadratic to the irrationality proof

Completing the square gives (x+1)2=2(x+1)^2=2. If xx were rational, then x+1x+1 would be rational, contradicting the proof that no rational square is 22.

Worked example: a repeating-decimal supremum in QQ

Let X={1.23,1.233,1.2333,…}X=\{1.23,1.233,1.2333,\ldots\}: each element has finitely many digits 33 after the initial 1.21.2. Writing xn=1.2+∑k=2n3/10kx_n=1.2+\sum_{k=2}^{n}3/10^k for n≥2n\ge2, we have

xn=3730−13⋅10n,3730=1.23333…∈Q.x_n=\frac{37}{30}-\frac{1}{3\cdot10^n}, \qquad \frac{37}{30}=1.23333\ldots\in Q.

Thus 37/3037/30 is an upper bound. If u<37/30u<37/30 is rational, write 37/30−u=A/B37/30-u=A/B with positive integers A,BA,B and take n=B+2n=B+2. Then n≥2n\ge2, n>B/An>B/A, and 10n≥2n>n10^n\ge2^n>n, so 1/(3⋅10n)<A/B=37/30−u1/(3\cdot10^n)<A/B=37/30-u. Hence xn>ux_n>u. Therefore sup⁡Q(X)=37/30\sup_Q(X)=37/30.

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 s2s^2 is less than 22 not an upper bound for SS?

Use the idea that you can move a little to the right and still keep the square below 22.

Solution · Answer

Because such an ss is still too small. There exists a rational r>sr > s with r2r^2 less than 22, so rr also belongs to SS. That means ss 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 2\sqrt{2} still fail to fix the gap in QQ?

Use the difference between density and completeness.

Solution · Guided solution

Having many rationals near 2\sqrt{2} only shows that QQ 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 2\sqrt{2}, and that point is not rational. So the set can have arbitrarily close rational approximations and still have no supremum in QQ.

Optional continuations

Read this first

If you want the construction of QQ first, read 3.4 Rationals and well-defined operations.

Practice

Work out your answer, then check it. You can revise and try again.

Loading…

Key terms in this unit