Computation

The circle that will not square

The other three impossibilities are a number having the wrong degree. This one is a number having no degree at all — and that is a claim no finite search can establish, which makes it the one place in this field where the picture has to admit what it is not doing.

Worth reading first: Which polygons can be drawn.

The first three classical problems close by finding a number of degree three. The fourth closes by finding a number of no degree whatsoever, and the difference in kind is the whole subject of this essay.

Looking for a polynomial with π as a rootA table of the closest an integer polynomial of each degree comes to vanishing at the number, over a bounded search.π = 3.141592654…coefficients from −5 to 5degreeclosest missvalue there1−x + 30.142110 tried2−2x² + 5x + 40.03121,210 tried3−x³ + 2x² + 2x + 50.016113,310 tried4−2x⁴ + 5x³ + 5x² − 4x + 30.00515146,410 tried161,040 integer polynomials of degree ≤ 4 with coefficients in [−5, 5], evaluated at π —none is zerothe same search finds x² − 2 for √2, so its silence about π is a report and not a proof
Fig. 1 Every integer polynomial of degree up to 4 with coefficients between −5 and 5, evaluated at π. The closest any of the 161,040 of them comes to zero is 0.00515, and the same search finds x² − 2 for √2 — so the silence here is a report about π.

The problem

A circle of radius 11 has area π\pi. A square of the same area has side π\sqrt\pi. Squaring the circle means constructing that side from the radius, with the two instruments, in finitely many steps.

Since the constructible numbers are closed under square roots, and closed under squaring too, π\sqrt\pi is constructible exactly when π\pi is. So the problem is: is π\pi a constructible number?

By the degree theorem it is enough to show that π\pi is not. But the previous three essays all did that by finding the degree and observing it was odd. Here there is nothing to find.

Two kinds of number

Every number this ladder has met so far satisfies some polynomial equation with whole-number coefficients. 2\sqrt2 satisfies x22=0x^2-2=0. 23\sqrt[3]2 satisfies x32=0x^3-2=0. 2cos2π72\cos\frac{2\pi}{7} satisfies x3+x22x1=0x^3+x^2-2x-1=0. Such numbers are called algebraic, and each has a degree: the smallest degree of a polynomial it satisfies.

Every rational number that could be a root of x² − 2A table of the candidate rational roots allowed by the rational root theorem, with the polynomial's exact value at each.x² − 2candidatevalue thereroot?-22-1-11-122x² − 2 has no rational root — all 4 candidates the theorem allows weretested and none is zerothe numerator of any rational root divides the constant term and thedenominator divides the leading one
Fig. 2 An algebraic number caught in the act. √2 satisfies x² − 2, and the finite table of rational candidates confirms that nothing smaller works — so the degree is exactly 2 and the number is constructible.

A number satisfying no such equation is called transcendental. It is not that its degree is large; it is that the question “what is its degree?” has no answer, because the set of polynomials it satisfies is empty.

Both facts about transcendental numbers are strange in opposite directions. Almost every real number is transcendental — the algebraic numbers are countable, since polynomials with whole-number coefficients can be listed and each has finitely many roots, while the reals are not, which is Cantor’s diagonal argument applied to exactly this. And yet no explicit transcendental number was known until 1844, when Liouville built one on purpose out of a rapidly converging series. The generic case had to be constructed by hand.

π\pi was shown transcendental by Ferdinand von Lindemann in 1882, and squaring the circle died with it: a transcendental number has no degree, so its degree is not a power of two, so it is not constructible.

Why no figure on this page proves it

Here is the honest position, and it belongs near the front rather than buried at the end.

The impossibility proofs in the earlier essays are carried by an exhaustive search. The rational root theorem produces a finite list of candidates; every one is tested; none is a root; the conclusion follows. A reader can check the arithmetic and be finished.

Transcendence is not like that. The claim is:

For every polynomial with whole-number coefficients, P(π)0P(\pi) \ne 0.

That is a statement about infinitely many polynomials, and no finite search touches it. A search can report that it did not find one, and that report is compatible with π\pi being algebraic of a degree just past where the search stopped.

The figure at the top of this page runs the search anyway, because what it does show is worth having. Every integer polynomial of degree at most four with coefficients between 5-5 and 55 — a hundred and sixty-one thousand of them — is evaluated at π\pi, and the closest approach to zero at each degree is reported. The numbers fall: 0.1420.142 at degree one, 0.0310.031 at two, 0.0160.016 at three, 0.0050.005 at four.

That falling sequence is exactly what would happen if π\pi were algebraic and the search were closing in. It is also exactly what happens because polynomial values are dense and a wider search gets nearer to anything. The table cannot tell those two situations apart, and that is the point of showing it.

Looking for a polynomial with √2 as a rootA table of the closest an integer polynomial of each degree comes to vanishing at the number, over a bounded search.√2 = 1.414213562…coefficients from −5 to 5degreeclosest missvalue there1−2x + 30.172110 tried2−2x² + 401,210 tried3−2x³ − 2x² + 4x + 4013,310 tried4−3x⁴ − 2x³ + 4x² + 4x + 40146,410 triedthe same search over 161,040 polynomials finds √2 exactlythe closest miss is reported at each degree, so the search can be seen working
Fig. 3 The same machinery aimed at √2, which finds the polynomial at the first degree it could. A search that finds what is there when it is there is the only reason the search at π is worth reporting at all.
Looking for a polynomial with ∛2 as a rootA table of the closest an integer polynomial of each degree comes to vanishing at the number, over a bounded search.∛2 = 1.259921050…coefficients from −5 to 5degreeclosest missvalue there1−4x + 50.0397110 tried2−3x² + 3x + 10.01761,210 tried3−2x³ + 4013,310 tried4−2x⁴ − 2x³ + 4x + 40146,410 triedthe same search over 161,040 polynomials finds ∛2 exactlythe closest miss is reported at each degree, so the search can be seen working
Fig. 4 And aimed at the cube root of two, where it has to reach degree three. Two controls, two successes — and the same procedure returns nothing at π at any degree it can afford.

The two controls are what make the first figure a measurement rather than a shrug. A machine that says “not found” to everything says nothing by saying it to π\pi. This one finds x22x^2-2 and x32x^3-2, so its silence has content — but the content is evidence, not proof, and the essay says so rather than letting the picture imply otherwise.

How thin the algebraic numbers are

The counting argument deserves more than the sentence it got, because it makes the situation genuinely peculiar.

List the polynomials with whole-number coefficients. There are countably many — order them by degree and by the size of their coefficients, and every one appears somewhere on the list. Each has at most as many roots as its degree. A countable list of finite sets is countable, so the algebraic numbers are countable.

The real numbers are not, and the proof is the diagonal argument: any list of reals can be beaten by a number differing from the nn-th entry in the nn-th place. So the transcendental numbers are not merely present, they are almost all of what there is. Pick a real number at random by any reasonable procedure and it is transcendental with probability one.

That makes the historical order absurd. The typical real number is transcendental; the first one anybody could name was constructed by Liouville in 1844 by writing down 10k!\sum 10^{-k!} — a decimal expansion with runs of zeros growing fast enough that its rational approximations are too good for any algebraic number to allow. ee followed in 1873 and π\pi in 1882. Two of the three most familiar numbers in mathematics were the second and third examples ever produced of the generic case.

Liouville’s method is worth one more sentence because it connects directly to a subject this collection has already been through. An algebraic number of degree dd cannot be approximated by fractions much better than 1/qd1/q^{d} allows — that is a theorem, and it is a sharpening of the general statement about how close a fraction can get. Liouville’s number is built to violate that bound: its decimal has runs of zeros growing so fast that truncating it gives approximations far too good for any degree. So the first transcendental number ever exhibited was produced by approximation theory, which is not where anyone would have looked.

What is typical and what is nameable have very little to do with one another here, and constructibility is one more property where the typical number fails and the nameable ones are the exceptions.

What the proof actually uses

Lindemann’s argument has no picture and it is worth saying what it does have, because the shape of it explains why no picture is coming.

It rests on a theorem of Hermite’s about the exponential function. Hermite showed in 1873 that ee is transcendental; Lindemann generalised the method to show that if aa is a non-zero algebraic number then eae^{a} is transcendental.

Now use the identity that ties the exponential to the circle,

eiπ=1.e^{i\pi} = -1.

The right-hand side is algebraic — as algebraic as a number gets. So iπi\pi cannot be a non-zero algebraic number, since then eiπe^{i\pi} would be transcendental and it is not. Therefore iπi\pi is transcendental, and since ii is algebraic, π\pi is transcendental too.

Everything in that argument is about the exponential function, its power series, and estimates on integrals of it. Nothing in it is about circles, compasses, areas, or lengths. The connection to the geometric problem is the single identity above — which is itself the deepest fact in the relationship between circles and waves — and once that identity is in hand the geometry is over.

That is why this essay’s figures are searches rather than diagrams. The proof lives in a part of mathematics with no diagrams in it, and drawing something suggestive would be drawing something else.

What squaring the circle would have needed

It is worth seeing the construction that is missing, because it is one step away from constructions that work.

Constructing the square root of 3A semicircle on a diameter split into two parts, with the perpendicular at the split reaching the arc.13√31 and 3 on one line, and the perpendicular where they meet has height √3 =1.7321the apex sits on the semicircle, so it sees the diameter at a right angle —checked, at 0
Fig. 5 A square root, built in one semicircle. Given π as a length, this construction would hand over √π immediately — so the whole difficulty is in getting π onto the page in the first place, and that is where it stays.

Given a segment of length π\pi, the square is one semicircle away: lay π\pi next to 11, draw the semicircle, and the perpendicular at the join has length π\sqrt\pi. The hard part is not the square. It is that a segment of length π\pi never appears, no matter how the two instruments are used.

The relationship between π\pi and the circle’s own measurements is as direct as it could be — it is the ratio of circumference to diameter and the area of the unit disc. What cannot be done is transfer: the circumference of a drawn circle cannot be laid out straight, because straightening it is exactly producing a segment of length 2π2\pi.

That operation has a name — rectification — and it is barred by the same theorem. A curve can be drawn and its length cannot be constructed, which is a distinction with no analogue among straight figures and is one of the more counterintuitive consequences of the whole business.

The lunes, which can be squared

The problem is not that curved regions are beyond squaring. Some of them are, and knowing which is what made the circle look approachable for so long.

Hippocrates of Chios, around 440 BC, squared a lune: the crescent between two circular arcs. Take a right-angled isosceles triangle, draw the semicircle on the hypotenuse, and draw the semicircle on one of the legs bulging outward. The crescent trapped between them has exactly the area of half the triangle — a region bounded entirely by arcs, whose area is a rational multiple of a triangle’s, and therefore squarable with the two instruments.

The reason it works is that the $\pi$s cancel. Areas of circular segments are proportional to π\pi times the square of a radius, and the particular arrangement makes two such terms subtract exactly. There are five squarable lunes altogether; Hippocrates found three, and the classification was completed only in the twentieth century.

That is a genuine and slightly cruel near-miss. It shows a curved region being squared, by the permitted instruments, with the π\pi vanishing from the arithmetic — and it gave two thousand years of geometers a reason to believe the circle itself would fall to a cleverer arrangement. It never could, because in the circle’s case there is nothing for the π\pi to cancel against.

After 1882

Transcendence settled the mathematics and did nothing whatever to the flow of proposed solutions, which is a fact about people rather than about circles.

The most celebrated episode is the Indiana General Assembly’s Bill 246 of 1897, which proposed to enact a circle-squaring method as state law. The bill implied several mutually inconsistent values for π\pi, among them 3.23.2. It passed the House unanimously and was indefinitely postponed in the Senate after a mathematician who happened to be in the building explained the situation. Legislating a value for π\pi is impossible for a duller reason than transcendence: π\pi is a ratio, and ratios are not subject to legislation.

The steadier lesson is the one this field keeps returning to. An impossibility result closes a question and does not close the asking of it, because the result is about a stated operation set and most people asking do not have the operation set in mind. A construction using a marked ruler, an infinite process, or a curve that is not a circle is not a counterexample; it is a different question with a different and often affirmative answer.

The one thing the pictures on this page do

Every figure here is a report of a computation and none is a proof. That is unusual for this collection and it is worth stating flatly rather than leaving the reader to infer it.

The searches show that the machinery which located 2\sqrt2 and 23\sqrt[3]2 locates nothing at π\pi within the range it can afford. That is a fact about the range, and it is exactly as much as an exhaustive method can contribute to a statement quantified over an infinite set.

The site’s standing claim is that a figure can be a proof. Here it cannot, and the honest thing is the same thing the incompleteness essay had to do one field earlier: draw the part that is finite, state which part is not, and let the argument that closes the gap live in the prose where it belongs.

Which regular polygons a compass and straightedge can draw, up to 100A grid of the integers with the constructible ones filled in, each verdict computed two independent ways.3 · 4 · 5 · 6 · 8 · 10 · 12 · 15 · 16 · 17 · 20 · 24 · …3φ24φ25φ46φ27φ68φ49φ610φ411φ1012φ413φ1214φ615φ816φ817φ1618φ619φ1820φ821φ1222φ1023φ2224φ825φ2026φ1227φ1828φ1229φ2830φ831φ3032φ1633φ2034φ1635φ2436φ1237φ3638φ1839φ2440φ1641φ4042φ1243φ4244φ2045φ2446φ2247φ4648φ1649φ4250φ2051φ3252φ2453φ5254φ1855φ4056φ2457φ3658φ2859φ5860φ1661φ6062φ3063φ3664φ3265φ4866φ2067φ6668φ3269φ4470φ2471φ7072φ2473φ7274φ3675φ4076φ3677φ6078φ2479φ7880φ3281φ5482φ4083φ8284φ2485φ6486φ4287φ5688φ4089φ8890φ2491φ7292φ4493φ6094φ4695φ7296φ3297φ9698φ4299φ60100φ40n = 3 to 100: 24 constructible, 74 notdecided twice — by the Fermat-prime criterion and by φ(n) being a power of two — and thetwo agreed at every one of the 98
Fig. 6 The contrast, in one grid. The polygon question has a complete answer that a finite computation can produce and check. The circle question has a complete answer that no finite computation can reach — and both are impossibility results about the same two instruments.

The distinction that grid draws is the one worth carrying out of this ladder. Both questions are settled; both settlements are impossibility results; and only one of them has a picture. What decides which is not the difficulty of the mathematics but whether the claim is quantified over a finite set. The polygons are a claim about ninety-eight integers, and ninety-eight things can be checked. Transcendence is a claim about every polynomial there is.

The tower ℚ ⊂ ℚ(√2)A tower of field extensions with the degree of each step, beside the multiplication table of the basis.dim 12ℚ(√2)dim 21√21√21√2√221 square root taken, one at a time, and the degree doubles at each: 1 → 2the 2×2 table is the closure check — every product of basis elements landed on awhole-number multiple of another
Fig. 7 And the machine both results are measured against: one construction step, one doubling, checked closed. Every impossibility in this field is the observation that some number’s degree is not on the list this doubling generates — except the last one, where there is no degree to compare.

The approximations, and why they are not the point

There is an enormous literature of very good approximate quadratures, and they are worth separating from the false proofs, because most of them were never claims to have solved the problem.

Kochański’s construction of 1685 produces a segment of length 3.1415333.141533 against π\pi’s 3.1415933.141593 — accurate to four decimal places, using two circles and a straight line. Ramanujan gave several, one of them accurate to eight places. Every one of these is a genuine and elegant piece of geometry, and none is in tension with Lindemann.

The reason is the same as for the trisections: constructible numbers are dense, so an approximation to any accuracy exists and finding a short one is a craft problem. The theorem forbids exactness in finitely many steps, and exactness is not a limit of accuracy. It is a different property, and the difference is the same one that separates a converging sum from its value.

What this means in practice is that “squaring the circle” as a phrase for a hopeless task is slightly wrong. The task is not hopeless; it is only impossible to do exactly, with those instruments, in finitely many steps. Drop any of the three qualifiers and it becomes routine.

Where this ladder ends

Four problems, four closures, and two different shapes of argument. The cube, the angle and the polygons all fall to a degree count, and every one of those counts is a finite search a reader can redo. The circle falls to a theorem about the exponential function, and no search will ever reach it.

The ladder stops here because the operation set has been fully described: the constructible numbers are the ones reachable from the rationals by finitely many square roots, and every classical question about the compass is a question about that description. What comes next in this field is not a bigger compass but a different operation set entirely — a finite alphabet, an arithmetic that closes, and the question of what can be checked rather than what can be built.

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.

Algebraic numberConstructible numberDegree of an extensionMinimal polynomialPiSquaring the circleStraightedge and compassTranscendental number