Plotting the rationals p/q with denominator at most N on [1,2] leaves a hole at 2≈1.4142 — no N ever fills it. Proposition 4.4.4: no rational squares to 2.
(qp)2=2∀qp∈Q
1217−2≈0.00245>0
Examples & Exercises
Prove completely that no rational number p/q squares to 2 — the equation x2=2 has no rational solution (Tao, Proposition 4.4.4).
(qp)2=2 has no solution qp∈Q
N=5: among rationals with denominator at most 5, the closest to 2 is 7/5≈1.4 at distance about 0.0142 — but the proof below shows this distance can never be 0.Show proof
Suppose a positive rational p/q with (qp)2=2 exists. By problem 2 below, we may take p/q in lowest terms, i.e. gcd(p,q)=1.
Clearing denominators gives p2=2q2, so p2 is even. If p were odd then p2 would be odd (odd × odd = odd), so p must be even: p=2k for a positive integer k.
Substituting gives 4k2=2q2, i.e. q2=2k2, so q2 is even too — and the same argument makes q even. But p and q both even means gcd(p,q)≥2, contradicting the lowest-terms assumption.
Hence no rational squares to 2. However close a square gets to 2 — like 57 or 1217 (problem 3) — no fraction lands exactly on 2: the rational line has a hole where 2 should be.
Prove completely, by the well-ordering principle, that every positive rational has a lowest-terms representation.
∀r>0rational,∃p,q∈N:r=qp,gcd(p,q)=1
N=5: every dot is drawn in lowest terms (e.g. 3/2, never 6/4) — of all fractions naming the same value, the one with the smallest denominator is chosen as the representative.Show proof
Fix a positive rational r. Let S={n∈N:r=m/n for some m∈N}; since r=a/b for positive integers a,b, we have b∈S — so S is a nonempty subset of N. (Here N={1,2,3,…}.)
By the well-ordering principle, S has a least element q0. Pick p0∈N with r=p0/q0. We now show gcd(p0,q0)=1.
If d=gcd(p0,q0)>1, then r=q0/dp0/d with q0/d<q0, so q0/d∈S — contradicting the minimality of q0. Hence d=1, and r=p0/q0 is in lowest terms.
This justifies the "we may take lowest terms" step in problem 1: if some rational squared to 2, we could look at one with the smallest denominator — and it is exactly that minimal-denominator fraction that falls into the even/even contradiction.
Verify by direct computation that (57)2=2549<2<144289=(1217)2, and show the two fractions differ by 601<0.06 — numerical evidence that rationals get arbitrarily close to the 2 slot.
(57)2=2549<2<144289=(1217)2
1217−57=601≈0.0167<0.06
N=12: the closest rational to 2 is 17/12≈1.41667 (distance about 0.00245), and 7/5≈1.4 is drawn too — the two fractions squeeze 2 from both sides.Show proof
Compute directly: (57)2=2549=1.96<2 and (1217)2=144289=2.0069…>2 (verified exactly by integer comparison: 49<50=2×25 gives 2549<2, and 289>288=2×144 gives 144289>2).
The fractions differ by 1217−57=6085−84=601≈0.0167<0.06. Their squares differ by 144289−2549=36007225−7056=3600169<0.05 — both squares sit inside an interval of width under 0.05 straddling 2.
By problem 1, no rational in this interval squares to exactly 2. Yet rationals squeezing 2 from both sides, like 57 and 1217, are easy to find (in the model the shortest distance shrinks 0.0142→0.00245→⋯ as N grows) — the rationals get as close as one likes to the 2 slot, but never touch it. The number filling this hole is the 2 whose existence the least-upper-bound axiom guarantees (the n-th root scene).