Compass and straightedge constructions
Part of a convergent series on Mathematics |
1+1=11 |
Geometry from the days of the ancient Greeks placed great emphasis on problems of constructing various geometric figures using only a compass (the circle-drawing gadget), and a straightedge (like a ruler, but without distance markings). For the most part, early mathematicians were highly successful in this undertaking: Euclid's Elements, for example, contains a vast collection of elementary constructions, including, for example, a way to bisect any angle, or construct a regular pentagon.
A few problems in particular proved resistant to these constructive methods, perhaps most notoriously that of squaring the circle. Nonetheless they occupy an important role in the history of mathematics: the first earliest hints of calculus appear in Archimedes' work on the closely related problem of approximating , and the proof of the impossibility of these constructions was among the earliest triumphs of new algebraic methods developed in the 1800s.
The problems also enjoy an important role in the history of pseudomathematics, where they have long served as a distraction for cranks. In the late 1700s the bogus suggestions of means for squaring the circle were so numerous that both the French Academie des Sciences and English Royal Society were forced to pass resolutions declaring that they would cease to review any manuscripts suggesting solutions to these problems.^{[1]} Even though the impossibility of these constructions has been well-understood for more than a hundred years, circle-squarers persist in their efforts even today.
Contents
The problems[edit]
A few constructions remained that the Greeks were never able to give, and these remained mysteries until modern times. Three problems in particular attracted the most attention:
- Squaring the circle: given a circle, construct using compass and straightedge a square having the same area.
- Trisecting an angle: given an angle , divide it into three equal angles of measure .
- Doubling the cube: given a cube, construct another cube with twice its volume.
The attempts[edit]
The problem of squaring the circle has a very, very long history. Approximate methods were known to the Babylonians, Egyptians, and early Indian mathematicians. The problem was the source of considerable consternation to the Greek geometers, many of whom struggled with it, perhaps most notably Anaxagoras and Hippocrates of Chios. It became a famous enough question that it is mentioned in Aristophanes' The Birds, and the Greeks even found it necessary to coin a word for those who wasted time on the problem. The other two problems too were studied intensively by the Greeks, though they appear to have received comparatively little attention in later eras.^{[2]}
The medieval Arabs too invested considerable effort in the quadrature of the circle: Al-Haytham announced that he had discovered a method, but later failed to produce it. Various medieval Italians, including Leonardo, also failed to make much progress. Even non-mathematicians weighed in, and Thomas Hobbes in his later years believed that he had found the solution.^{[1]}
The first real insight into the problem came from James Gregory, one of the first mathematicians to come to terms with infinite sequences. He realized that the problem boiled down to understanding the algebraic properties of . Unfortunately the specifics of his argument were deeply flawed. In 1761 Lambert made a major advance by proving that was irrational, but this was not enough to rule out the possibility of circle-squaring: for example, Failed to parse (PNG conversion failed; check for correct installation of latex and dvipng (or dvips + gs + convert)): \sqrt2 is possible to construct (it's the length of the diagonal of a unit square), but it is irrational.
Gauss soon announced that the doubling of the cube and trisection of an angle were impossible, though his proofs have never been located. The impossibility of trisecting the angle and doubling the cube, the proofs of which rely on similar methods, were finally settled in 1837 by Pierre Wantzel, and Sturm soon improved on his methods. Even with great advances in algebra, the final nail in the coffin of the circle-squarers was not delivered until 1882 with Lindemann's proof that is transcendental.^{[3]}
The solution[edit]
It's generally easy to prove that it is possible to carry out some geometric construction, simply by showing how to do it. However, it is not at all clear how one could hope to show that it's impossible to make other constructions -- how can we hope to rule out the infinite different techniques that might be applied to the problem?
The key insight in this proof was to translate it from a problem in geometry to a problem in algebra. Each of the three problems eventually boils down to constructing a line segment of some certain length , starting with a line segment of length 1. This works as follows:
- Suppose we are given a circle of radius . Since Failed to parse (PNG conversion failed; check for correct installation of latex and dvipng (or dvips + gs + convert)): A=\pi r^2 , this circle has the same area as a square with side length Failed to parse (PNG conversion failed; check for correct installation of latex and dvipng (or dvips + gs + convert)): r \sqrt{\pi} . If we take a circle of radius = 1, the square will have side Failed to parse (PNG conversion failed; check for correct installation of latex and dvipng (or dvips + gs + convert)): \sqrt{\pi} . Thus the problem of squaring the circle is equivalent to constructing a line segment of length Failed to parse (PNG conversion failed; check for correct installation of latex and dvipng (or dvips + gs + convert)): \ell_1=\sqrt{\pi} : if a segment of length Failed to parse (PNG conversion failed; check for correct installation of latex and dvipng (or dvips + gs + convert)): \sqrt{\pi} could be constructed, the circle may be squared, and vice versa.
- Suppose we are given a cube of side length 1. If this cube could be duplicated, the new cube would have side length Failed to parse (PNG conversion failed; check for correct installation of latex and dvipng (or dvips + gs + convert)): \sqrt[3]2 . So the problem of a doubling the cube is equivalent to constructing a line segment of length Failed to parse (PNG conversion failed; check for correct installation of latex and dvipng (or dvips + gs + convert)): \ell_2=\sqrt[3]2 .
- To show that it is impossible to trisect the angle, it's enough to show that there is some specific angle that can be constructed, but one third of which cannot. This would show that a general method for any angle cannot be created because that general method should also be applicable to this novel case. One example of such an angle is Failed to parse (PNG conversion failed; check for correct installation of latex and dvipng (or dvips + gs + convert)): \theta=60^\circ ; that is, there's no way to construct a angle exactly using just a compass and straightedge. As illustrated below, trisecting a Failed to parse (PNG conversion failed; check for correct installation of latex and dvipng (or dvips + gs + convert)): 60^\circ angle is equivalent to constructing a line segment of length Failed to parse (PNG conversion failed; check for correct installation of latex and dvipng (or dvips + gs + convert)): \ell_3=\cos(20^\circ) .
A number is called constructible if a line segment of length can be constructed by straightedge and compass, starting with a segment of length 1: the proofs of impossibility eventually come down to an analysis of the algebraic properties of constructible numbers, and the observation that all three of Failed to parse (PNG conversion failed; check for correct installation of latex and dvipng (or dvips + gs + convert)): \ell_1,\ell_2,\ell_3 are not constructible.
Let's briefly consider which lengths it does seem possible to construct in this way.
- We can construct a segment of length Failed to parse (PNG conversion failed; check for correct installation of latex and dvipng (or dvips + gs + convert)): n for any whole number Failed to parse (PNG conversion failed; check for correct installation of latex and dvipng (or dvips + gs + convert)): n . Just stick a bunch of length-1 segments together.
- We can construct a segment of length of any rational (i.e. fractional) length. Construct a segment of length Failed to parse (PNG conversion failed; check for correct installation of latex and dvipng (or dvips + gs + convert)): p (an integer), and then divide it into Failed to parse (PNG conversion failed; check for correct installation of latex and dvipng (or dvips + gs + convert)): q pieces (this is easy to do -- it was known to Euclid).
- We can get for any whole Failed to parse (PNG conversion failed; check for correct installation of latex and dvipng (or dvips + gs + convert)): n .
- It's also possible to get things like Failed to parse (PNG conversion failed; check for correct installation of latex and dvipng (or dvips + gs + convert)): \sqrt3 by similar methods.
For a more exhaustive discussion of which numbers are constructible, see below.
The above examples suggest that the constructible numbers are those which we can get by adding and repeatedly taking square roots. This intuition turns out to be basically correct. For example, Gauss showed that it's possible to construct the heptadecagon, a regular polygon with 17 sides. Such a construction is equivalent to constructing the number
- Failed to parse (PNG conversion failed; check for correct installation of latex and dvipng (or dvips + gs + convert)): \cos\left(\frac{2\pi}{17}\right)=\frac{\sqrt{17}-1+\sqrt{34-2\sqrt{17}}+2\sqrt{17+3\sqrt{17}-\sqrt{34-2\sqrt{17}}-2\sqrt{34+2\sqrt{17}}}}{16}
This number looks complicated, but it's something we get just by taking a bunch of square roots. So it turns out to be constructible!
It is this basic intuition that makes possible the proofs that Failed to parse (PNG conversion failed; check for correct installation of latex and dvipng (or dvips + gs + convert)): \ell_1,\ell_2,\ell_3 are not constructible:
- Failed to parse (PNG conversion failed; check for correct installation of latex and dvipng (or dvips + gs + convert)): \ell_1=\sqrt{\pi} . Lindemann proved that (and therefore Failed to parse (PNG conversion failed; check for correct installation of latex and dvipng (or dvips + gs + convert)): \sqrt{\pi} ) is transcendental -- this implies that it can't be made using roots at all (even allowing cube roots, etc). But this means that it isn't constructible.
- Failed to parse (PNG conversion failed; check for correct installation of latex and dvipng (or dvips + gs + convert)): \ell_2=\sqrt[3]2 . This is a cube root, not a square root. But we're not allowed to take cube roots when writing down a constructible number.
- Failed to parse (PNG conversion failed; check for correct installation of latex and dvipng (or dvips + gs + convert)): \ell_3=\cos(20^\circ) . This one's a little trickier, but a bit of high school trignometry shows that Failed to parse (PNG conversion failed; check for correct installation of latex and dvipng (or dvips + gs + convert)): \cos(3\theta)=4\cos^3(\theta)-3\cos(\theta) . Plugging in Failed to parse (PNG conversion failed; check for correct installation of latex and dvipng (or dvips + gs + convert)): \theta=20^\circ this shows that Failed to parse (PNG conversion failed; check for correct installation of latex and dvipng (or dvips + gs + convert)): \cos(60^\circ)=\frac12=4\cos^3(20^\circ)-3\cos(20^\circ)=4\ell_3^3-3\ell_3 . So Failed to parse (PNG conversion failed; check for correct installation of latex and dvipng (or dvips + gs + convert)): 8\ell_3^3-6\ell_3-1=0 . This is a cubic equation; it's possible to show that it has no rational roots using the rational root test, and a cubic equation that has no rational solutions has no solutions involving only square roots, either. While it's possible to solve the equation exactly using e.g. Cardano's formula, what matters is that the solution is necessarily not representable without using cube roots, which shows it is not constructible.
The cranks[edit]
This was all on very firm footing by 1900, and no serious mathematicians or sane amateurs believed otherwise. Nevertheless cranks persist in working on these three problems even today. "The race of circle squarers," wrote Schubert, "will never die out as long as ignorance and the thirst for glory remain united."^{[4]} They now have even bolder goals than the cranks of previous eras: a method of squaring the circle with compass and straightedge would not merely settle an old problem and bring fame to its solver, but would bring down much of the mathematics done in the last 150 years with it.
Needless to say none of them have succeeded, or come close. The exploits of the modern circle-squarers have been extensively chronicled by the mathematician Underwood Dudley, in volumes including Mathematical Cranks and The Trisectors.^{[5]}
What is possible[edit]
If tools other than a compass and straightedge are allowed, all of these constructions become possible. For example, if one allows paper folding (origami-like techniques), it becomes possible to trisect the angle and double the cube. Similarly, angle trisection is possible using a marked ruler, which is distinct from the straightedge considered here, and only requires the meta-step of using the compass to mark off intervals on the straightedge.
Approximate solutions to these problems are also fairly easy to come by. Ramanujan, Martin Gardner, and Benjamin Bold have all given methods of squaring the circle accurate to about 0.0001% based on the approximation Failed to parse (PNG conversion failed; check for correct installation of latex and dvipng (or dvips + gs + convert)): \pi\approx\frac{355}{113}=3.1415929203\ldots
Some technical stuff[edit]
A bit of abstract algebra is all that is needed to make the above arguments about constructible numbers rigorous. The curious reader can find a more careful and accurate treatment of this material in any reasonable algebra textbook.^{[6]} A field is, roughly speaking, a collection of numbers that can be added and multiplied (while staying in the collection) and for which all Failed to parse (PNG conversion failed; check for correct installation of latex and dvipng (or dvips + gs + convert)): x not equal to zero, the multiplicative inverse Failed to parse (PNG conversion failed; check for correct installation of latex and dvipng (or dvips + gs + convert)): \frac1x and the additive inverse Failed to parse (PNG conversion failed; check for correct installation of latex and dvipng (or dvips + gs + convert)): -x are also in the collection. For example, the set of numbers of the form Failed to parse (PNG conversion failed; check for correct installation of latex and dvipng (or dvips + gs + convert)): a+b\sqrt5 where Failed to parse (PNG conversion failed; check for correct installation of latex and dvipng (or dvips + gs + convert)): a and Failed to parse (PNG conversion failed; check for correct installation of latex and dvipng (or dvips + gs + convert)): b are rational, is a field (denoted ), since:
- Failed to parse (PNG conversion failed; check for correct installation of latex and dvipng (or dvips + gs + convert)): (a+b\sqrt5)+(c+d\sqrt5)=(a+c)+(b+d)\sqrt5
A key theorem is that the constructible numbers are a field. For all three of the above facts, this is pretty easy to see: if we have two constructible numbers, their sum is constructible because we can just stick line segments of the two lengths together. The other important fact is that if Failed to parse (PNG conversion failed; check for correct installation of latex and dvipng (or dvips + gs + convert)): x is constructible, then Failed to parse (PNG conversion failed; check for correct installation of latex and dvipng (or dvips + gs + convert)): \sqrt x is too, so this field is closed under the operation of taking square roots.
The most important algebraic definition required here is that of the degree of an algebraic number. A number is said to be algebraic if it satisfies some polynomial with integer coefficients. The degree of Failed to parse (PNG conversion failed; check for correct installation of latex and dvipng (or dvips + gs + convert)): x is defined to be the smallest Failed to parse (PNG conversion failed; check for correct installation of latex and dvipng (or dvips + gs + convert)): n such that there is a polynomial of degree Failed to parse (PNG conversion failed; check for correct installation of latex and dvipng (or dvips + gs + convert)): n , with integer coefficients, which has Failed to parse (PNG conversion failed; check for correct installation of latex and dvipng (or dvips + gs + convert)): x as a root. Thus
- Any rational number Failed to parse (PNG conversion failed; check for correct installation of latex and dvipng (or dvips + gs + convert)): p/q is of degree 1, since it is a root of Failed to parse (PNG conversion failed; check for correct installation of latex and dvipng (or dvips + gs + convert)): qx-p=0 .
- The square root of two has degree 2, since it satisfies Failed to parse (PNG conversion failed; check for correct installation of latex and dvipng (or dvips + gs + convert)): x^2-2=0 but does not satisfy any polynomial of degree one.
This polynomial of minimal degree is called the minimal polynomial of Failed to parse (PNG conversion failed; check for correct installation of latex and dvipng (or dvips + gs + convert)): x .
For the numbers important to the constructability questions above, we have:
- Failed to parse (PNG conversion failed; check for correct installation of latex and dvipng (or dvips + gs + convert)): \ell_1=\sqrt{\pi} is transcendental, meaning it doesn't satisfy any polynomial at all. Thus it does not have a degree.
- Failed to parse (PNG conversion failed; check for correct installation of latex and dvipng (or dvips + gs + convert)): \ell_2=\sqrt[3]2 . This satisfies Failed to parse (PNG conversion failed; check for correct installation of latex and dvipng (or dvips + gs + convert)): x^3-2=0 , but no smaller polynomial. Thus it is of degree 3.
- Failed to parse (PNG conversion failed; check for correct installation of latex and dvipng (or dvips + gs + convert)): \ell_3=\cos(20^\circ) . The trigonometry recited above shows that this satisfies . It too is of degree 3.
The intuition above is that a constructible number is an algebraic number built by repeatedly taking square roots. But any number of this form has a degree which is a power of 2. Since the numbers above do not have such degrees, we conclude that they are not constructible!
Once this foundation in Galois theory was in place, problems about straightedge and compass became fairly routine: in general, it's not terribly difficult to determine whether a given construction can be done or not, using tools of algebra. For example, there's a simple criterion to test whether the angle can be trisected, in terms of algebraic properties of Failed to parse (PNG conversion failed; check for correct installation of latex and dvipng (or dvips + gs + convert)): \cos(\theta) .
References[edit]
- ↑ ^{1.0} ^{1.1} Squaring the circle
- ↑ [1]
- ↑ Lindemann's original paper
- ↑ Beckmann, Petr. A History of Pi (author may be crazy, but nothing wrong with the book)
- ↑ Buy it at Amazon!
- ↑ For example, try Artin's Algebra