In geometry and algebra, a real number r is constructible if and only if, given a line segment of unit length, a line segment of length |r| can be constructed with compass and straightedge in a finite number of steps. Not all real numbers are constructible and to describe those that are, algebraic techniques are usually employed. However, in order to employ those techniques, it is useful to first associate points with constructible numbers.
A point in the Euclidean plane is a constructible point if it is either endpoint of the given unit segment, or the point of intersection of two lines determined by previously obtained constructible points, or the intersection of such a line and a circle having a previously obtained constructible point as a center passing through another constructible point, or the intersection of two such circles. Now, by introducing cartesian coordinates so that one endpoint of the given unit segment is the origin (0, 0) and the other at (1, 0), it can be shown that the coordinates of the constructible points are constructible numbers.
In algebraic terms, a number is constructible if and only if it can be obtained using the four basic arithmetic operations and the extraction of square roots, but of no higher-order roots, from constructible numbers, which always include 0 and 1. The set of constructible numbers can be completely characterized in the language of field theory: the constructible numbers form the quadratic closure of the rational numbers: the smallest field extension that is closed under square roots. This has the effect of transforming geometric questions about compass and straightedge constructions into algebra. This transformation leads to the solutions of many famous mathematical problems, which defied centuries of attack.
The traditional approach to the subject of constructible numbers has been geometric in nature, but this is not the only approach. However, the geometric approach does provide the motivation for the algebraic definitions and is historically the way the subject developed. In presenting the material in this manner, the basic ideas are introduced synthetically and then coordinates are introduced to transition to an algebraic setting.
Let O and A be two given distinct points in the Euclidean plane. The set of points that can be constructed with compass and straightedge starting with O and A will be denoted by S and whose elements will be called constructible points. O and A are, by definition, elements of S. To more precisely describe the elements of S, we make the following two definitions:
- a line segment whose endpoints are in S is called a constructed segment, and
- a circle whose center is in S and which passes through a point of S (alternatively, whose radius is the distance between some pair of distinct points of S) is called a constructed circle.
Then, the points of S, besides O and A are:
- the intersection of two non-parallel constructed segments (extended if necessary),
- the intersection points of a constructed circle and a constructed segment (extended if necessary), or
- the intersection points of two distinct constructed circles.
As an example, the midpoint of constructed segment OA is a constructible point. To see this, note that the constructed circle C1 with center O and passing through A intersects the constructed circle C2 with center A and passing through O at the constructible points P and Q. The intersection of constructed segment PQ with constructed segment OA is the desired constructed midpoint.
A Cartesian coordinate system can be introduced where the point O is associated to the origin having coordinates (0, 0) and the point A is associated with (1, 0). The points of S may now be used to link the geometry and algebra, namely, we define
- a constructible number is a coordinate of a constructible point.
Due to point A, 0 and 1 are constructible numbers. Let P be a point in S, that is, a constructible point. If P lies on the x-axis, then OP is a constructed segment and the first coordinate of P is, in absolute value, the length of this constructed segment. If P does not lie on the x-axis then let the foot of the perpendicular from P to the x-axis be the point Q. The point Q is a constructed point, so PQ and OQ are constructed segments. The absolute values of the coordinates of the point P are therefore lengths of constructed segments. This process is reversible, so it is possible to use this device to provide an alternate characterization of constructible numbers, namely:
- 0 is a constructible number and any non-zero real number r is a constructible number if and only if |r| is the length of a constructed segment.
If a and b are the non-zero lengths of constructed segments then elementary compass and straightedge constructions can be used to obtain constructed segments of lengths a + b, a − b (if a ≥ b), ab and a/. The latter two can be done with a construction based on the intercept theorem. A slightly less elementary construction using these tools is based on the geometric mean theorem and will construct a segment of length √ from a constructed segment of length a.
Transformation into algebra
If a and b are constructible numbers with b ≠ 0, then a ± b , a×b, a/, and √, for non-negative a, are constructible. Thus, the set of constructible real numbers form a field. Furthermore, since 1 is a constructible number, all rational numbers are constructible and ℚ is a (proper) subfield of the field of constructible numbers. Also, any constructible number is an algebraic number. More precisely, if γ is a constructible real number and γ ∉ ℚ, then there is a finite sequence of real numbers α1, ... , αn = γ such that ℚ(α1, ... , αi) is an extension of ℚ(α1, ... , αi−1) of degree 2. In particular, [ℚ(γ) : ℚ] = 2r for some integer r ≥ 0. Using slightly different terminology, a real number is constructible if and only if it lies in a field at the top of a finite tower of quadratic extensions, starting with the rational field ℚ. More precisely, γ is constructible if and only if there exists a tower of fields
where γ is in Kn and for all 0 ≤ j < n, [Kj+1 : Kj] = 2.
For yet another formulation of this result, this time using the geometric definition of a constructible point, let P be a non-empty set of points in ℝ2 and K the subfield of ℝ generated by all the coordinates of points in P. If a point r = (x, y) is constructible from the points of P, then the degrees [K(x) : K] and [K(y) : K] are powers of 2.
Using the natural correspondence between points of ℝ2 and complex numbers (namely, (a, b) ⇔ a + bi), some authors prefer to phrase results in the complex setting by defining: a complex number to be constructible if and only if its real and imaginary parts are constructible real numbers. It can then be shown, in a manner analogous to the real case, that a complex number is constructible if and only if it lies in a field at the top of a finite tower of complex quadratic extensions, starting with the field ℚ(i). More precisely, z is constructible if and only if there exists a tower of complex fields
where z is in Fn, and for all 0 ≤ j < n, [Fj+1 : Fj] ≤ 2. Consequently, if a complex number is constructible, then [ℚ(z) : ℚ] is a power of two.
This algebraic characterization of constructible numbers provides an important necessary condition for constructibility: if z is constructible, then it is algebraic, and its minimal irreducible polynomial has degree a power of 2, which is equivalent to the statement that the field extension ℚ(z)/ℚ has dimension a power of 2. However, the converse is false – this is not a sufficient condition for constructibility as there are non-constructible numbers z with [ℚ(z) : ℚ] = 4.
Trigonometric numbers are irrational cosines or sines of angles that are rational multiples of π. Such a number is constructible if and only if the denominator of the fully reduced multiple is a power of 2 or the product of a power of 2 with the product of one or more distinct Fermat primes. Thus, for example, cos(π/15) Is constructible because 15 is the product of two Fermat primes, 3 and 5.
See here a list of trigonometric numbers expressed in terms of square roots.
The ancient Greeks thought that certain construction problems they could not solve were simply obstinate, not unsolvable. However, the non-constructibility of certain numbers proves them to be logically impossible to perform. (The problems themselves, however, are solvable, and the Greeks knew how to solve them, without the constraint of working only with straightedge and compass.)
In the following chart, each row represents a specific ancient construction problem. The left column gives the name of the problem. The second column gives an equivalent algebraic formulation of the problem. In other words, the solution to the problem is affirmative if and only if each number in the given set of numbers is constructible. Finally, the last column provides a simple counterexample. In other words, the number in the last column is an element of the set in the same row, but is not constructible.
|Construction problem||Associated set of numbers||Counterexample|
|Doubling the cube||is not constructible, because its minimal polynomial has degree 3 over Q |
|Trisecting the angle||is not constructible, because has minimal polynomial of degree 3 over Q |
|Squaring the circle||is not constructible, because it is not algebraic over Q |
|Constructing regular polygons||is not constructible, because 7 is not a Fermat prime, nor is 7 the product of and one or more distinct Fermat primes |
The birth of the concept of constructible numbers is inextricably linked with the history of the three impossible compass and straightedge constructions: duplicating the cube, trisecting an angle, and squaring the circle. The restriction of using only compass and straightedge in geometric constructions is often credited to Plato due to a passage in Plutarch. According to Plutarch, Plato gave the duplication of the cube (Delian) problem to Eudoxus and Archytas and Menaechmus, who solved the problem using mechanical means, earning a rebuke from Plato for not solving the problem using pure geometry (Plut., Quaestiones convivales VIII.ii, 718ef). However, this attribution is challenged, due, in part, to the existence of another version of the story (attributed to Eratosthenes by Eutocius of Ascalon) that says that all three found solutions but they were too abstract to be of practical value. Since Oenopides (circa 450 BCE) is credited with two ruler and compass constructions, by Proclus– citing Eudemus (circa 370 - 300 BCE)–when other methods were available to him, has led some authors to hypothesize that Oenopides originated the restriction.
The restriction to compass and straightedge is essential in making these constructions impossible. Angle trisection, for instance, can be done in many ways, several known to the ancient Greeks. The Quadratrix of Hippias of Elis, the conics of Menaechmus, or the marked straightedge (neusis) construction of Archimedes have all been used and we can add a more modern approach via paper folding to the list.
Although not one of the classic three construction problems, the problem of constructing regular polygons with straightedge and compass is usually treated alongside them. The Greeks knew how to construct regular n-gons with n = 2h, 3, 5 (for any integer h ≥ 2) or the product of any two or three of these numbers, but other regular n-gons eluded them. Then, in 1796, an eighteen-year-old student named Carl Friedrich Gauss announced in a newspaper that he had constructed a regular 17-gon with straightedge and compass. Gauss' treatment was algebraic rather than geometric; in fact, he did not actually construct the polygon, but rather showed that the cosine of a central angle was a constructible number. The argument was generalized in his 1801 book Disquisitiones Arithmeticae giving the sufficient condition for the construction of a regular n-gon. Gauss claimed, but did not prove, that the condition was also necessary and several authors, notably Felix Klein, attributed this part of the proof to him as well.
- doubling the cube, and
- trisecting the angle
are impossible to solve if one uses only compass and straightedge. In the same paper he also solved the problem of determining which regular polygons are constructible:
- a regular polygon is constructible if and only if the number of its sides is the product of a power of two and any number of distinct Fermat primes (i.e., the sufficient conditions given by Gauss are also necessary)
An attempted proof of the impossibility of squaring the circle was given by James Gregory in Vera Circuli et Hyperbolae Quadratura (The True Squaring of the Circle and of the Hyperbola) in 1667. Although his proof was faulty, it was the first paper to attempt to solve the problem using algebraic properties of π. It was not until 1882 that Ferdinand von Lindemann rigorously proved its impossibility, by extending the work of Charles Hermite and proving that π is a transcendental number.
The study of constructible numbers, per se, was initiated by René Descartes in La Géométrie, an appendix to his book Discourse on the Method published in 1637. Descartes associated numbers to geometrical line segments in order to display the power of his philosophical method by solving an ancient straightedge and compass construction problem put forth by Pappus.
- Computable number
- Definable real number
- Compass and straightedge constructions
- Constructible polygon
- Fraileigh 1994, p. 426
- John A. Beachy, William D. Blair; Abstract Algebra; Definition 6.3.1 Archived 2012-02-06 at the Wayback Machine
- Kazarinoff 2003, p. 10
- Kazarinoff 2003, p. 15
- Kazarinoff 2003, p. 46
- The other direction is represented in Moise 1974 who replaces the word "constructible" with the word "surd" throughout his discussion.
- Kazarinoff 2003, p. 18
- Moise 1974, p. 227
- Herstein 1986, p. 237
- Herstein 1986, pp. 236–237
- Moise 1974, p. 224
- Fraleigh 1994, pp. 426–427
- Smart, pp. 216–217
- Fraleigh 1994, p. 429
- Roman 1995, p. 59
- Stewart 1989, pp. 54–55
- Roman 1995, p. 207
- Rotman 2006, p. 361
- Rotman 2006, p. 362
- Stewart 1989, p. 51
- Fraleigh 1994, pp. 429–430
- Fraleigh 1994, p. 504
- Kazarinoff 2003, p. 28
- Knorr, Wilbur Richard (1986), The Ancient Tradition of Geometric Problems, Dover Books on Mathematics, Courier Dover Publications, p. 4, ISBN 9780486675329.
- Kazarinoff 2003, p. 29
- Klein, Felix (1956) , Famous Problems of Elementary Geometry, Dover, p. 16
- Kazarinoff 2003, p. 30
- Wantzel, P. L. (1837), "Recherches sur les moyens de reconnaître si un Problème de Géométrie peut se résoudre avec la règle et le compas", Journal de Mathématiques Pures et Appliquées, 1 (2): 366–372
- Boyer, Carl B. (2004) , History of Analytic Geometry, Dover, pp. 83–88, ISBN 978-0-486-43832-0
- Fraleigh, John B. (1994), A First Course in Abstract Algebra (5th ed.), Addison Wesley, ISBN 978-0-201-53467-2
- Herstein, I. N. (1986), Abstract Algebra, Macmillan, ISBN 0-02-353820-1
- Kazarinoff, Nicholas D. (2003) , Ruler and the Round /Classic Problems in Geometric Constructions, Dover, ISBN 0-486-42515-0
- Moise, Edwin E. (1974), Elementary Geometry from an Advanced Standpoint (2nd ed.), Addison Wesley, ISBN 0-201-04793-4
- Roman, Steven (1995), Field Theory, Springer-Verlag, ISBN 978-0-387-94408-1
- Rotman, Joseph J. (2006), A First Course in Abstract Algebra with Applications (3rd ed.), Prentice Hall, ISBN 978-0-13-186267-8
- Stewart, Ian (1989), Galois Theory (2nd ed.), Chapman and Hall, ISBN 978-0-412-34550-0
|Wikimedia Commons has media related to Constructible numbers.|