Number

The square that cannot shrink

The usual proof that the square root of two is irrational is about even and odd numbers. There is a proof about squares instead, in which a supposed solution is folded into a smaller one — and the folding is a drawing.

Worth reading first: The oldest algorithm, drawn as a tiling.

If 2\sqrt2 were a fraction a/ba/b, then a2=2b2a^2 = 2b^2: a square exactly twice another square. The proof that no such pair exists is usually done with parity, and there is a proof that is done with squares.

Two squares of side 12 inside one of side 17Two overlapping squares laid into opposite corners of a larger one, with the overlap and the two uncovered corners marked.755the overlap is 7² = 49; the two corners are 2 × 5² = 50they differ by 1, which is exactly 17² − 2 × 12² = 1and 7, 5 is a smaller pair with the same discrepancy, the other way round
Fig. 1 A square of side 1717 with two squares of side 1212 laid into opposite corners. They overlap in a square of side 2×1217=72 \times 12 - 17 = 7, and leave two uncovered corners of side 1712=517 - 12 = 5 each. The generator checks that the areas reconstruct the large square exactly, and that the descent identity holds in whole numbers.

Two squares of side 1212 have total area 288288. The large square has area 289289. So the two nearly cover it and overlap slightly — and the amount they overlap and the amount they miss differ by exactly one, which is 1722×12217^2 - 2 \times 12^2.

That near-miss is the interesting quantity, and it is worth saying what the figure is doing with it before the argument starts. If a pair with a2=2b2a^2 = 2b^2 existed, the two small squares would cover the large one exactly: no area double-counted, none left out. So the overlap and the two corners would have equal area, and the picture would be a statement of equality between a square and two squares — the same equation again, at smaller scale. The whole proof is the observation that this cannot keep happening.

The picture as an argument

Suppose a2=2b2a^2 = 2b^2 with aa and bb whole and b<a<2bb < a < 2b. Lay two squares of side bb into opposite corners of a square of side aa. Since their combined area equals the large square exactly, the area they overlap must equal the area they miss.

The overlap is a square of side 2ba2b - a. The missed region is two squares of side aba - b. So

(2ba)2=2(ab)2,(2b - a)^2 = 2(a - b)^2,

which is the same equation with a smaller pair. And it is genuinely smaller: b<a<2bb < a < 2b gives 0<2ba<b0 < 2b - a < b and 0<ab<b0 < a - b < b.

Repeating produces an infinite strictly decreasing sequence of positive whole numbers, which cannot exist. So no such pair does, and 2\sqrt2 is not a fraction.

That is Tennenbaum’s proof, from the 1950s, and every step of it is a statement about areas of squares that can be pointed at.

The honest version of the picture

There is a problem with drawing that argument, and this collection cannot ignore it: the squares in the proof do not exist. The proof supposes a solution, and there is none, so any drawing of “the” configuration is a drawing of something that is not there.

What the figures here do instead is draw a real pair — 1717 and 1212, whose ratio is a good approximation to 2\sqrt2 — and carry along the amount by which it fails. Call d=a22b2d = a^2 - 2b^2 the discrepancy. For (17,12)(17, 12) it is +1+1: the overlap square exceeds the two corner squares by exactly one unit of area.

Now the identity does the work. Expanding,

(2ba)22(ab)2=(a22b2)=d,(2b - a)^2 - 2(a - b)^2 = -(a^2 - 2b^2) = -d,

so the descent flips the sign of the discrepancy and leaves its size alone.

Two squares of side 5 inside one of side 7Two overlapping squares laid into opposite corners of a larger one, with the overlap and the two uncovered corners marked.322the overlap is 3² = 9; the two corners are 2 × 2² = 8they differ by 1, which is exactly 7² − 2 × 5² = -1and 3, 2 is a smaller pair with the same discrepancy, the other way round
Fig. 2 One step down: 17,1217, 12 becomes 7,57, 5. The squares are smaller and the discrepancy is still one, now with the opposite sign — the two corners exceed the overlap instead. Nothing has been lost and nothing has been gained.
Two squares of side 2 inside one of side 3Two overlapping squares laid into opposite corners of a larger one, with the overlap and the two uncovered corners marked.111the overlap is 1² = 1; the two corners are 2 × 1² = 2they differ by 1, which is exactly 3² − 2 × 2² = 1and 1, 1 is a smaller pair with the same discrepancy, the other way round
Fig. 3 One step further: 7,57, 5 becomes 3,23, 2. The overlap is a single unit square and the corners are two unit squares, differing by one again. The next step gives 1,11, 1, which is where the drawing runs out — and the discrepancy is still one.

So the contradiction is visible rather than assumed. A solution would be a pair with discrepancy zero; the descent preserves the discrepancy’s size while the squares shrink; and by the time the squares have shrunk to nothing the discrepancy is still whatever it was at the start. A discrepancy of zero would have had to be zero at every step and at the bottom, where the squares have side one and the discrepancy is ±1\pm 1.

The descent from 99 and 70Each step of the descent as a pair of squares, shrinking, with the discrepancy beside it.aa² − 2b²99, 70+141, 29-117, 12+17, 5-13, 2+11, 1-16 steps, each pair strictly smaller than the lastand the discrepancy is 1 at every one of them — so it can never have been zero
Fig. 4 The whole descent from 99,7099, 70 to the bottom, one row per step. The pairs shrink by a factor of about 5.85.8 each time and the discrepancy in the right-hand column never changes size. The generator checks the strict decrease and the constant discrepancy at every step.

What descent is

Fermat named the method and used it constantly: assume a solution in positive whole numbers, construct a strictly smaller one, and conclude there is none.

It is induction turned upside down, and the property it relies on is that the positive whole numbers are well-ordered — every non-empty set of them has a least element. A construction that always produces something smaller cannot be applied to a least element, so there is no least element, so the set is empty.

The method proves negatives, which is what makes it valuable and what limits it. It shows that 2\sqrt2 is not a ratio, that no Pythagorean triangle has square area, that x4+y4=z4x^4 + y^4 = z^4 has no solutions. Each conclusion is an absence, and none of the proofs produces anything.

It has one further use that is not negative at all, and it is the one that made Fermat’s reputation: descent can prove that something does exist, by descending on the size of a counterexample to its existence. Every prime one more than a multiple of four is a sum of two squares, and Euler’s proof takes a multiple of such a prime that is a sum of two squares, manufactures a smaller multiple with the same property, and continues until the multiplier is one. The descent terminates in the answer rather than in a contradiction.

So the method is really about the well-ordering and not about negation. A construction that always produces something smaller either runs out — proving nothing was there — or arrives at a bottom that has to be examined. Which of the two happens depends on the problem, and the arithmetic of the descent step is identical either way.

The same shape without the negation is how Euclid’s argument about primes works: build an object that must contain something new, and conclude the list was incomplete. Descent builds an object that must be smaller and concludes the set was empty. Both are constructions used to rule something out.

The proof everybody meets first

The standard argument is different and shorter. Assume a/ba/b is in lowest terms with a2=2b2a^2 = 2b^2. Then a2a^2 is even, so aa is even, so a=2ca = 2c and 4c2=2b24c^2 = 2b^2, giving b2=2c2b^2 = 2c^2 — so bb is even too, contradicting lowest terms.

Both proofs are correct and they emphasise different things. The parity proof turns on unique factorisation, in the step “a2a^2 even implies aa even”, which is Euclid’s lemma for the prime 22; and it generalises immediately to n\sqrt{n} for any non-square nn by counting the exponent of a prime.

The geometric proof needs no factorisation at all. What it needs is the ordering of the whole numbers and the ability to lay squares on top of each other. That makes it the argument that would have been available to a Greek geometer, and it is much closer to what the Greeks are thought to have had — incommensurability was a statement about lengths having no common measure, which is the never-terminating square-peel rather than a statement about fractions.

Where the numbers in the figures come from

The pairs used above are not arbitrary. (3,2)(3,2), (7,5)(7,5), (17,12)(17,12), (41,29)(41,29), (99,70)(99,70) are the numerators and denominators of the convergents of 2\sqrt2, and their discrepancies alternate +1,1,+1,1+1, -1, +1, -1.

That is not a coincidence: they are precisely the solutions of a22b2=±1a^2 - 2b^2 = \pm 1, the Pell equation. The descent above is the map that takes one solution to the previous one, and running it backwards — (a,b)(a+2b,a+b)(a, b) \mapsto (a + 2b, a + b) — generates them all from (1,1)(1,1).

Square-peeling on a 1 by √2 rectangleThe same construction as Euclid's algorithm, run on a rectangle whose sides have no common measure. It never terminates.1 square2 squares2 squares2 squares2 squares2 squares2 squares2 squares…and so on, forever1 : √2
Fig. 5 The same numbers from the other side: a rectangle of sides 11 and 2\sqrt2, peeled into squares. One comes off, then two, then two, forever, because the leftover strip is always similar to the strip before it. The counts are the continued fraction, and the fractions they build are the pairs the descent above walks down.

So the three constructions in this corner of the collection are one construction. Peeling squares off a rectangle gives the continued fraction [1;2,2,2,][1; 2, 2, 2, \ldots]; its convergents are the Pell solutions; and folding those squares into smaller ones is the descent. The reason 2\sqrt2’s approximations are so regular and the reason the descent is so clean are the same reason, which is that the leftover strip at each stage is similar to the strip before it.

The convergents of √2Each convergent marked on a number line, alternating above and below the value it approaches.√2 = 1.4142143/27/517/1241/2999/70239/169577/4087 convergents, each one closer than the last and on the other sidethe last of them, 577/408, is wrong by 2.1e-6
Fig. 6 The convergents closing in, alternating above and below. The alternation is the sign of the discrepancy: a convergent above 2\sqrt2 has a22b2=+1a^2 - 2b^2 = +1 and one below has 1-1, which is why the descent flips the sign at every step.

Run the descent backwards and it becomes a generator. From (a,b)(a, b) the map (a+2b, a+b)(a + 2b,\ a + b) produces the next solution, so (1,1)(3,2)(7,5)(17,12)(41,29)(1,1) \to (3,2) \to (7,5) \to (17,12) \to (41,29), and every solution of the Pell equation arises this way. The Greeks knew these as the side and diagonal numbers and used them exactly as approximations to 2\sqrt2; Theon of Smyrna describes the recurrence in the second century, with no equation and no proof, as a rule for generating better and better pairs.

That is worth noticing for what it says about the proof. The same recurrence, read downwards, shows that no exact solution exists; read upwards, it produces the best possible approximations to the thing that does not exist. A construction and an impossibility proof are the same map traversed in opposite directions.

What the picture cannot show

Every figure here is a single step of an argument that needs infinitely many, and the infinity is where the contradiction lives.

More precisely: the drawings show that the discrepancy is preserved and the squares shrink. What they cannot show is the well-ordering principle, which is the fact doing the actual refuting. No picture rules out an infinite descending sequence of positive whole numbers; that is an axiom about the integers, not an observation about squares, and it is the only part of the proof that is not visible.

There is a second thing missing, and it is more interesting. The figures show 2\sqrt2, and the argument does not obviously say anything about 3\sqrt3 or 5\sqrt5. Tennenbaum’s construction does adapt — the 3\sqrt3 version uses triangles and the 5\sqrt5 version uses a pentagon-like arrangement — but each needs its own drawing, and there is no single picture covering every non-square nn. The parity proof covers all of them in one line. That is the standing trade: a picture explains one case completely and a formula covers every case opaquely.

Other roots, other pictures

The construction adapts, and how it adapts says something about why the picture is specific where the algebra is general.

For 3\sqrt3 the equation is a2=3b2a^2 = 3b^2 and the natural figure is an equilateral triangle of side aa with three triangles of side bb laid into its corners. They overlap in three smaller triangles and miss a central one, the areas balance in the same way, and a smaller solution falls out. For 5\sqrt5 the arrangement involves a pentagon and is genuinely harder to draw.

Each case is a separate construction with a separate drawing, and there is no picture that covers n\sqrt{n} in general. The parity argument covers every non-square nn in a line: if nn is not a perfect square, some prime divides nn to an odd power, and comparing that prime’s exponent on both sides of a2=nb2a^2 = nb^2 gives an odd number equal to an even one.

So the two proofs trade in opposite directions. The picture is complete about one case and silent about the rest; the algebra is complete about every case and explains none of them. This collection’s bias is towards the first, and the reason is worth restating: a reader who has followed the shrinking squares knows why no solution exists, in a way that the exponent count does not supply, and the general theorem is easier to accept once one case has been understood rather than merely verified.

There is one further generalisation that keeps the geometry. The same overlapping-squares figure with the two small squares of different sizes proves that n\sqrt{n} is irrational whenever nn lies strictly between two consecutive squares, which is every non-square nn — the construction is due to Conway and Guy, and it recovers the general theorem geometrically at the cost of a figure nobody would call clean.

What it did to Greek mathematics

The discovery that a square’s diagonal has no common measure with its side is usually dated to the Pythagoreans, and the anecdote about Hippasus being drowned for revealing it is a late invention. The mathematical consequence, however, is real and enormous.

Greek geometry treated ratios of magnitudes as fundamental, and a theory of ratio that assumed every two lengths have a common measure had just been shown to be wrong. Eudoxus’ theory of proportion, preserved in Book V of the Elements, is the repair: it defines equality of ratios by comparing multiples, without ever asserting that a common measure exists, and it works for incommensurable magnitudes.

That definition is essentially Dedekind’s construction of the real numbers, arrived at two thousand two hundred years earlier and then not built on. What the Greeks did not do was turn ratios into numbers; magnitudes stayed geometric, and arithmetic stayed a separate subject. The gap between the two was not closed until the nineteenth century, and closing it was the same work as making sense of limits.

The consequence for how Greek mathematics reads is direct. Book II of the Elements proves algebraic identities — what would now be written (a+b)2=a2+2ab+b2(a+b)^2 = a^2 + 2ab + b^2 — as statements about rectangles, and it does so because a rectangle is a legitimate object where a product of two incommensurable lengths is not. The dissection proof of Pythagoras has the same character. What looks like a stylistic preference for pictures is a foundational necessity: geometry was the only place where the quantities could be handled at all.

So the collection’s habit of drawing arguments has an ancestor with a much stronger motive. The Greeks drew their proofs because the alternative did not yet exist; this site draws them because the alternative exists and hides the reason.

Where the ladder goes next

The immediate continuation is the general statement: n\sqrt n is irrational for every non-square nn, and more strongly, a root of a monic polynomial with whole-number coefficients is either a whole number or irrational. That covers every square root, cube root and combination of them in one theorem, and its proof is the parity argument generalised.

The harder direction is transcendence — showing that a number satisfies no polynomial at all, which is what π\pi and ee do. Irrationality is a statement about degree one; transcendence is a statement about every degree; and the gap between them is measured by how well a number can be approximated by fractions, which is where Liouville found the first transcendental number by building one that was approximated too well to be algebraic.

What links here

Computed from the collection, not written here: the essays that point at this one.

Shares its objects with

Essays that name at least two of the same things, and that neither author linked.

Named objects

A dashed tag is an object no other essay names yet.

Continued fractionsCounting two waysIncommensurabilityInfinite descentIrrationalityParityPell equationProof by contradictionSquare numbers