Motivation
A straightedge and compass are physical tools, but their limits can be expressed as statements about field extensions. Starting with two points at unit distance, every permitted operation produces coordinates satisfying linear or quadratic equations over the coordinates already available. Conversely, field arithmetic and square roots can be built by geometric constructions. The correspondence turns a geometric impossibility problem into a question about the degree of a minimal polynomial.
Definition 8.1.1
(Constructible numbers)
We work in the Euclidean plane with an unmarked straightedge and compass, beginning with and . At each finite step we may draw the line through two distinct available points, draw a circle with an available center and an available radius, and add an isolated intersection of two previously drawn objects. An object is drawn only when its defining data are available. Coincident lines or circles do not supply a new arbitrary point; an intersection must be determined by the objects. A real number is constructible if it is the signed coordinate of a point obtainable by such a finite sequence. A complex number is constructible if its real and imaginary parts are constructible.
The choice of axes is part of the mathematical description: the line through is the real axis, and a perpendicular through supplies the imaginary axis. The word finite is essential. Approximating a point arbitrarily closely by a sequence of constructions is not the same as obtaining it after finitely many steps.
One geometric step gives at most a quadratic equation
Suppose that all coordinates currently available lie in a real subfield . A line through two available points has an equation with coefficients in , and a circle has an equation with coefficients in . Distances squared are sums of squares of coordinate differences, so the radius-squared coefficient lies in even if the length itself is not initially written as an element of .
Two distinct nonparallel lines have a unique intersection obtained by solving two linear equations, and its coordinates lie in . For a line and a circle, substitute a linear parameterization of the line into the circle equation. The parameter satisfies a polynomial of degree at most two with coefficients in . If it has a real solution, its value lies in or in an extension obtained by adjoining the square root of its nonnegative discriminant. Both coordinates then lie in the same field.
For two distinct circles, subtract their equations. The quadratic terms cancel, leaving a line over that contains every common point. Thus their isolated intersections reduce to the line-circle case. A tangency gives one repeated solution and needs no special degree bound. Intersections that do not exist in the real plane add no point.
Theorem 8.1.2
(Constructible coordinates lie in quadratic towers)
If a point is constructible from and , its coordinates lie in a finite tower of real fields
Consequently every constructible real number has degree over equal to a power of two.
Proof
(Proof)
Induct through the finite construction. At each step the defining coordinates belong to a field already in the tower. The line-line case stays in that field. The line-circle and circle-circle cases add at most one real square root to obtain both coordinates of a selected intersection. Append the resulting field; its degree over the previous one is one or two. This gives the stated tower after finitely many steps.
The tower law makes a product of ones and twos, hence a power of two. If is one of the coordinates, then , so divides and is also a power of two. This is a necessary condition; a degree calculation alone should not be treated as a complete geometric construction.
Worked example 8.1.3
(A square root really is constructible)
Construct a perpendicular to the real axis through , mark a unit point on it, and draw the line through parallel to and the line through parallel to . Their intersection is . The distance from to this point is , and a circle centered at with that radius marks on the positive real axis. The field degree of is two, consistent with the theorem.
Constructing arithmetic and square roots
The converse requires actual geometric operations, not just a degree count. Addition, subtraction and sign reversal of signed lengths can be made by transferring compass distances along a line. To see multiplication, use , , and . The line through and has slope . The parallel line through meets the vertical axis at , so similar triangles construct the product. The same construction works with signed coordinates; zero and orientation cases can be handled directly.
For a nonzero constructible , the line through and has slope . Its parallel through meets the vertical axis at . Thus reciprocals, and hence division by a nonzero constructible number, are constructible. The necessary perpendiculars and parallels are standard straightedge-and-compass operations: equal-radius circle intersections construct a perpendicular bisector, and two perpendiculars produce a parallel.
If is constructible, mark a segment of length with a point satisfying and . Draw the circle with diameter and the perpendicular through ; let it meet the circle at . The angle is right, and similarity of the resulting triangles gives . Thus is constructible. The case is already available as the origin.
Theorem 8.1.4
(Quadratic towers and constructibility)
A real number is constructible if and only if it lies in a finite tower of real quadratic extensions of in which each step adjoins a square root of a nonnegative element of the preceding field. More generally, if a complex number lies in a finite tower of quadratic extensions of inside , its real and imaginary parts are constructible.
Proof
(Proof)
The forward implication follows from the preceding intersection analysis: each quadratic parameter is given by a quadratic formula involving a real square root. Conversely, the arithmetic constructions above show inductively that every element of each real field in such a tower is constructible.
For the complex assertion, each quadratic extension in characteristic zero can be generated by a square root: complete the square in the minimal polynomial of a generator. Suppose the tower has reached a field whose elements have constructible real and imaginary parts, and let the next generator be with for constructible reals . Construct . If , put , which is positive, and . Then and , so . If , the roots are obtained directly from when or when . Thus both square roots have constructible real and imaginary parts. Field arithmetic on complex numbers reduces to real arithmetic; a reciprocal has denominator . Induction gives the claim for the entire finite tower.
Concept lensStructural
The smallest field closed under square roots
The constructible reals form the smallest subfield of such that and imply . The arithmetic and square-root constructions show that the constructible reals form such a field. Conversely, any such field contains each step of a real quadratic tower by induction, and hence every constructible real. This replaces “a finite sequence of drawings” by a closure condition, and is the union of the real quadratic towers, so each of its elements has power-of-two degree.
Common mistake
(A power-of-two degree is only the first test)
The degree condition follows because a constructible number sits inside a quadratic tower. It does not state that every algebraic number whose degree is a power of two has been placed in such a tower. To prove a positive construction one must exhibit an appropriate tower or another actual construction; the degree condition alone is only necessary.
Doubling the cube and trisecting an angle
Worked example 8.1.5
(The cube cannot be doubled by these tools)
A cube of side one has volume one. A cube of twice that volume needs side length . The polynomial is irreducible over by Eisenstein's criterion at , so . Three is not a power of two, so the necessary degree condition rules out constructing this length from the unit segment. A numerical approximation to the length does not alter the exact-degree obstruction.
Worked example 8.1.6
(A sixty-degree angle cannot be trisected in general)
A angle is constructible from an equilateral triangle. If it could be trisected by the permitted tools, the cosine would be constructible, since a constructed ray meets the unit circle in a constructible point. The triple-angle identity gives . Put ; then . This monic cubic has no rational root: the only possible rational roots are and , and its values there are and . It is therefore irreducible over , so has degree three. A constructible would make constructible, contradicting the degree condition. This one angle proves there is no construction that trisects every angle; it does not claim that no individual angle can be trisected.
Common mistake
(A cubic equation does not by itself give degree three)
The trisection argument needs irreducibility, not merely a cubic relation. Trisecting leads, by the same identity, to , that is, for . This cubic factors as , and its relevant root is rational, so is constructible. The degree that obstructs a construction is the degree of the minimal polynomial; a polynomial relation of degree three only bounds it from above.
A criterion for regular polygons with prime numbers of sides
For an odd prime , let be a primitive complex th root of unity. The regular -gon is constructible exactly when is constructible: its vertices are the powers of , and the first nontrivial vertex of such a polygon is after the unit circle and orientation are fixed. We use the finite Galois correspondence and the cyclicity of finite multiplicative subgroups of fields, proved in companion units.
Theorem 8.1.7
(Prime-sided regular polygons)
For an odd prime , the regular -gon is constructible if and only if is a power of two.
Proof
(Proof)
The cyclotomic polynomial is irreducible over : after substituting , its nonleading coefficients are divisible by and its constant coefficient is , so Eisenstein's criterion at applies. Therefore . If the polygon is constructible, the real and imaginary parts of lie together in a finite real quadratic tower. Hence the complex field generated by them and lies in a quadratic tower over ; its degree is a power of two, and the tower law makes a divisor of that power. Thus is a power of two.
Conversely suppose . The field is the splitting field of and is Galois over . Every automorphism sends to for some nonzero residue modulo . This gives an injection of its Galois group into . Both groups have order , by the finite-Galois automorphism count and the degree above, so the injection is an isomorphism. The multiplicative group is cyclic. Its subgroups of orders form a chain in which consecutive indices are two.
The Galois correspondence reverses this subgroup chain to a field tower from to , with each field extension of degree two. The complex quadratic-tower construction above therefore makes constructible. Multiplying its powers constructs the remaining vertices, proving the converse.
Proof X-ray
Degrees for necessity, group structure for sufficiency
The two directions use different ingredients. Necessity uses only degrees: Eisenstein's criterion gives , and a quadratic tower of degree containing forces . No automorphisms appear in this direction.
Sufficiency cannot run on the degree alone, as the common mistake above warns. The key move is the identification , which uses that is prime twice: once for the degree and once because is a field, so its multiplicative group is cyclic. A cyclic group of order has a nested chain of subgroups with consecutive indices two, and the Galois correspondence turns each index-two step into a field extension of degree two. The argument closes with the complex quadratic-tower theorem, which needs only that every step is quadratic; the intermediate fields need not be real.
Worked example 8.1.8
(Three, seven and seventeen sides)
For , , so the regular triangle is constructible. For , is not a power of two, so the regular heptagon is not constructible from a unit segment. For , , so the theorem proves existence of a straightedge-and-compass construction of the regular -gon. It gives a finite quadratic tower, but does not list the long sequence of individual drawing steps.
This prime-sided statement is not the full classification of constructible regular polygons with composite numbers of sides. Nor does it prove any result about constructing with a marked ruler or other tools. Both the allowed operations and the exact starting data are part of the theorem.
Practice and solutions
Quick check
(Why does an isolated intersection of two distinct circles lead to an equation of degree at most two over the current coordinate field?)
Compare the two circle equations.
Solution · Answer
Subtracting the two circle equations cancels and leaves a linear equation over the current field. If the circles are concentric this equation has no solution and there is no intersection; otherwise it is a line containing every common point. Intersecting that line with either circle gives a quadratic equation in one parameter.
Quick check
(Can a real number of degree over be constructible?)
Solution · Answer
No. Every constructible real number has degree a power of two over , and is divisible by , so is not a power of two.
Quick check
(Show that a regular pentagon is constructible using the prime-sided criterion.)
Solution · Answer
Five is an odd prime and is a power of two. The theorem supplies a quadratic tower from to , and hence a construction of the pentagon.
Quick check
(Why does the nonconstructibility of rule out a method that trisects every angle, but not the trisection of some specific angles?)
Solution · Answer
Since is constructible, a universal trisection method would construct and hence , contradicting the cubic degree argument. Some individual angles do have constructible trisectors; for example trisects to , which is constructible.
Quick check
(For a constructible real , explain a construction of .)
Solution · Answer
Mark a segment with a point such that and , draw the circle with diameter , and erect the perpendicular at to meet the circle at . The angle at is right, and similar triangles give , so .
Quick check
(Why is the degree test by itself not a complete proof that a number of degree four is constructible?)
Solution · Answer
The theorem gives a necessary degree condition only. A proof of constructibility requires an explicit quadratic tower containing the number, or a direct sequence of constructions; knowing that the degree is four does not supply that tower.