View source for Constructible number

{{short description|Number constructible via compass and straightedge}}
{{distinguish|computable number}}
{{for|numbers "constructible" in the sense of set theory|Constructible universe}}
{{good article}}

[[File:Square root of 2 triangle.svg|thumb|250px|The [[square root of 2]] is equal to the length of the [[hypotenuse]] of a [[right triangle]] with legs of length 1 and is therefore a '''constructible number''']]

In [[geometry]] and [[algebra]], a [[real number]] <math>r</math> is '''constructible''' if and only if, given a [[line segment]] of unit length, a line segment of length <math>|r|</math> can be constructed with [[compass and straightedge constructions|compass and straightedge]] in a finite number of steps. Equivalently, <math>r</math> is constructible if and only if there is a [[closed-form expression]] for <math>r</math> using only [[integers]] and the operations for addition, subtraction, multiplication, division, and [[square roots]].

The geometric definition of constructible numbers motivates a corresponding definition of '''constructible points''', which can again be described either geometrically or algebraically. A point is constructible if it can be produced as one of the points of a compass and straightedge construction (an endpoint of a line segment or crossing point of two lines or circles), starting from a given unit length segment. Alternatively and equivalently, taking the two endpoints of the given segment to be the points (0, 0) and (1, 0) of a [[Cartesian coordinate system]], a point is constructible if and only if its Cartesian coordinates are both constructible numbers.{{sfnmp|Kazarinoff|2003|1pp=10, 15|Martin|1998|2p=41|2loc=Corollary 2.16}} Constructible numbers and points have also been called '''ruler and compass numbers''' and '''ruler and compass points''', to distinguish them from numbers and points that may be constructed using other processes.{{sfnp|Martin|1998|pp=31–32}}

The set of constructible numbers forms a [[field (algebra)|field]]: applying any of the four basic arithmetic operations to members of this set produces another constructible number. This field is a [[field extension]] of the [[rational number]]s and in turn is contained in the field of [[algebraic number]]s.<ref>{{harvp|Courant|Robbins|1996|pp=133–134|loc=Section III.2.2: All constructible numbers are algebraic}}</ref> It is the [[Euclidean closure]] of the [[rational number]]s, the smallest field extension of the rationals that includes the [[square root]]s of all of its positive numbers.{{sfnp|Kazarinoff|2003|p=46}}

The proof of the equivalence between the algebraic and geometric definitions of constructible numbers has the effect of transforming geometric questions about compass and straightedge constructions into [[abstract algebra|algebra]], including several famous problems from [[ancient Greek mathematics]]. The algebraic formulation of these questions led to proofs that their solutions are not constructible, after the geometric formulation of the same problems previously defied centuries of attack.

== Geometric definitions ==
===Geometrically constructible points===
Let <math>O</math> and <math>A</math> be two given distinct points in the [[plane (geometry)|Euclidean plane]], and define <math>S</math> to be the set of points that can be constructed with compass and straightedge starting with <math>O</math> and <math>A</math>. Then the points of <math>S</math> are called '''constructible points'''. <math>O</math> and <math>A</math> are, by definition, elements of <math>S</math>. To more precisely describe the remaining elements of <math>S</math>, make the following two definitions:{{sfnp|Kazarinoff|2003|p=10}}
* a line segment whose endpoints are in <math>S</math> is called a '''constructed segment''', and
* a circle whose center is in <math>S</math> and which passes through a point of <math>S</math> (alternatively, whose radius is the distance between some pair of distinct points of <math>S</math>) is called a '''constructed circle'''.
Then, the points of <math>S</math>, besides <math>O</math> and <math>A</math> are:{{sfnmp|Kazarinoff|2003|1p=10|Martin|1998|2pp=30–31|2loc=Definition 2.1}}
* the [[Line-line intersection|intersection]] of two non-parallel constructed segments, or lines through constructed segments,
* the intersection points of a constructed circle and a constructed segment, or line through a constructed segment, or
* the intersection points of two distinct constructed circles.

As an example, the midpoint of constructed segment <math>OA</math> is a constructible point. One construction for it is to construct two circles with <math>OA</math> as radius, and the line through the two crossing points of these two circles. Then the midpoint of segment <math>OA</math> is the point where this segment is crossed by the constructed line.<ref>This construction for the midpoint is given in Book I, Proposition 10 of [[Euclid's Elements|Euclid's ''Elements'']].</ref>

===Geometrically constructible numbers===
The starting information for the geometric formulation can be used to define a [[Cartesian coordinate system]] in which the point <math>O</math> is associated to the origin having coordinates <math>(0,0)</math> and in which the point <math>A</math> is associated with the coordinates <math>(1, 0)</math>. The points of <math>S</math> may now be used to link the geometry and algebra by defining a '''constructible number''' to be a coordinate of a constructible point.{{sfnp|Kazarinoff|2003|p=18}}

Equivalent definitions are that a constructible number is the <math>x</math>-coordinate of a constructible point <math>(x,0)</math>{{sfnp|Martin|1998|pp=30–31|loc=Definition 2.1}} or the length of a constructible line segment.<ref>{{harvp|Herstein|1986|p=237}}. To use the length-based definition, it is necessary to include the number zero as a constructible number, as a special case.</ref> In one direction of this equivalence, if a constructible point has coordinates <math>(x,y)</math>, then the point <math>(x,0)</math> can be constructed as its perpendicular projection onto the <math>x</math>-axis, and the segment from the origin to this point has length <math>x</math>. In the reverse direction, if <math>x</math> is the length of a constructible line segment, then intersecting the <math>x</math>-axis with a circle centered at <math>O</math> with radius <math>x</math> gives the point <math>(x,0)</math>. It follows from this equivalence that every point whose Cartesian coordinates are geometrically constructible numbers is itself a geometrically constructible point. For, when <math>x</math> and <math>y</math> are geometrically constructible numbers, point <math>(x,y)</math> can be constructed as the intersection of lines through <math>(x,0)</math> and <math>(0,y)</math>, perpendicular to the coordinate axes.{{sfnmp|Moise|1974|1p=227|Martin|1998|2p=33|2loc=Theorem 2.4}}

==Algebraic definitions==
===Algebraically constructible numbers===
The algebraically constructible real numbers are the subset of the [[real number]]s that can be described by formulas that combine integers using the operations of addition, subtraction, multiplication, multiplicative inverse, and square roots of positive numbers. Even more simply, at the expense of making these formulas longer, the integers in these formulas can be restricted to be only 0 and 1.{{sfnp|Martin|1998|pp=36–37}} For instance, the [[square root of 2]] is constructible, because it can be described by the formulas <math>\sqrt2</math> or <math>\sqrt{1+1}</math>.

Analogously, the algebraically constructible [[complex number]]s are the subset of complex numbers that have formulas of the same type, using a more general version of the square root that is not restricted to positive numbers but can instead take arbitrary complex numbers as its argument, and produces the [[Square root#Principal square root of a complex number|principal square root]] of its argument. Alternatively, the same system of complex numbers may be defined as the complex numbers whose real and imaginary parts are both constructible real numbers.{{sfnp|Roman|1995|p=207}} For instance, the complex number <math>i</math> has the formulas <math>\sqrt{-1}</math> or <math>\sqrt{0-1}</math>, and its real and imaginary parts are the constructible numbers 0 and 1 respectively.

These two definitions of the constructible complex numbers are equivalent.<ref name=lz440>{{harvp|Lawrence|Zorzitto|2021|p= [https://books.google.com/books?id=-koyEAAAQBAJ&pg=PA440 440]}}.</ref> In one direction, if <math>q=x+iy</math> is a complex number whose real part <math>x</math> and imaginary part <math>y</math> are both constructible real numbers, then replacing <math>x</math> and <math>y</math> by their formulas within the larger formula <math>x+y\sqrt{-1}</math> produces a formula for <math>q</math> as a complex number. In the other direction, any formula for an algebraically constructible complex number can be transformed into formulas for its real and imaginary parts, by recursively expanding each operation in the formula into operations on the real and imaginary parts of its arguments, using the expansions<ref>For the addition and multiplication formula, see {{harvp|Kay|2021|p=187|loc=Theorem 8.1.10}}. For the division formula, see {{harvp|Kay|2021|pp= 188, 224|loc= Equations 8.8 & 9.2}}. The expansion of the square root can be derived from the [[half-angle formula]] of trigonometry; see an equivalent formula at {{harvp|Lawrence|Zorzitto|2021|p= [https://books.google.com/books?id=-koyEAAAQBAJ&pg=PA440 440]}}.</ref>
*<math>(a+ib)\pm (c+id)=(a \pm c)+i(b \pm d)</math>
*<math>(a+ib)(c+id)=(ac-bd) + i(ad+bc)</math>
*<math>\frac{1}{a+ib}=\frac{a}{a^2+b^2} + i \frac{-b}{a^2+b^2}</math>
*<math>\sqrt{a+ib} = \frac{(a+r)\sqrt{r}}{s} + i\frac{b\sqrt{r}}{s}</math>, where <math>r=\sqrt{a^2+b^2{}_{\!}}</math> and <math>s=\sqrt{(a+r)^2+b^2}</math>.

===Algebraically constructible points===
The algebraically constructible points may be defined as the points whose two real Cartesian coordinates are both algebraically constructible real numbers. Alternatively, they may be defined as the points in the [[complex plane]] given by algebraically constructible complex numbers. By the equivalence between the two definitions for algebraically constructible complex numbers, these two definitions of algebraically constructible points are also equivalent.<ref name=lz440/>

==Equivalence of algebraic and geometric definitions==
If <math>a</math> and <math>b</math> are the non-zero lengths of geometrically constructed segments then elementary compass and straightedge constructions can be used to obtain constructed segments of lengths <math>a+b</math>, <math>|a-b|</math>, <math>ab</math>, and <math>a/b</math>. 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 <math>\sqrt{a}</math> from a constructed segment of length <math>a</math>. It follows that every algebraically constructible number is geometrically constructible, by using these techniques to translate a formula for the number into a construction for the number.<ref>{{harvp|Herstein|1986|pp=236–237}}; {{harvp|Moise|1974|p=224}}; {{harvp|Fraleigh|1994|pp=426–427}}; {{harvp|Courant|Robbins|1996|pp=120–122|loc=Section III.1.1: Construction of fields and square root extraction}}.</ref>

{{multiple image|total_width=720|align=center|header=Compass and straightedge constructions for constructible numbers
|image1=Number construction multiplication.svg|caption1=<math>ab</math> based on the [[intercept theorem]]
|image2=Number construction division.svg|caption2=<math>\frac{a}{b} </math> based on the [[intercept theorem]]
|image3=Root_construction_geometric_mean5.svg|caption3=<math>\sqrt{p}</math> based on the [[geometric mean theorem#Constructing_a_square_root|geometric mean theorem]]}}

In the other direction, a set of geometric objects may be specified by algebraically constructible real numbers: coordinates for points, slope and <math>y</math>-intercept for lines, and center and radius for circles. It is possible (but tedious) to develop formulas in terms of these values, using only arithmetic and square roots, for each additional object that might be added in a single step of a compass-and-straightedge construction. It follows from these formulas that every geometrically constructible number is algebraically constructible.{{sfnmp|1a1=Martin|1y=1998|1pp=38–39|2a1=Courant|2a2=Robbins|2y=1996|2pp=131–132}}

==Algebraic properties==
The definition of algebraically constructible numbers includes the sum, difference, product, and multiplicative inverse of any of these numbers, the same operations that define a [[field (algebra)|field]] in [[abstract algebra]]. Thus, the constructible numbers (defined in any of the above ways) form a field. More specifically, the constructible real numbers form a [[Euclidean field]], an ordered field containing a square root of each of its positive elements.{{sfnp|Martin|1998|p=35|loc=Theorem 2.7}} Examining the properties of this field and its subfields leads to necessary conditions on a number to be constructible, that can be used to show that specific numbers arising in classical geometric construction problems are not constructible.

It is convenient to consider, in place of the whole field of constructible numbers, the subfield <math>\mathbb{Q}(\gamma)</math> generated by any given constructible number <math>\gamma</math>, and to use the algebraic construction of <math>\gamma</math> to decompose this field. If <math>\gamma</math> is a constructible real number, then the values occurring within a formula constructing it can be used to produce a finite sequence of real numbers <math>\alpha_1,\dots, \alpha_n=\gamma</math> such that, for each <math>i</math>, <math>\mathbb{Q}(\alpha_1,\dots,\alpha_i)</math> is an [[Algebraic extension|extension]] of <math>\mathbb{Q}(\alpha_1,\dots,\alpha_{i-1})</math> of degree 2.{{sfnp|Fraleigh|1994|p=429}}  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 fields|tower]] of real [[quadratic extension]]s,
<math display=block>\mathbb{Q} = K_0 \subseteq K_1 \subseteq \dots \subseteq K_n,</math>
starting with the rational field <math>\mathbb{Q}</math> where <math>\gamma</math> is in <math>K_n</math> and for all <math>0< j\le n</math>, <math>[K_j:K_{j-1}]=2</math>.{{sfnp|Roman|1995|p=59}} It follows from this decomposition that the [[Degree of a field extension|degree of the field extension]] <math>[\mathbb{Q}(\gamma):\mathbb{Q}]</math> is <math>2^r</math>, where <math>r</math> counts the number of quadratic extension steps.{{sfnp|Neumann|1998}}

Analogously to the real case, 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.{{sfnp|Rotman|2006|p=361}} More precisely, <math>\gamma</math> is constructible if and only if there exists a tower of fields
<math display=block>\mathbb{Q} = F_0 \subseteq F_1 \subseteq \dots \subseteq F_n,</math>
where <math>\gamma</math> is in <math>F_n</math>, and for all <math>0<j\le n</math>, <math>[F_j:F_{j-1}]= 2</math>. The difference between this characterization and that of the real constructible numbers is only that the fields in this tower are not restricted to being real. Consequently, if a complex number a complex number <math>\gamma</math> is constructible, then the above characterization implies that <math>[\mathbb{Q}(\gamma):\mathbb{Q}]</math> is a power of two. However, this condition is not sufficient - there exist field extensions whose degree is a power of two, but which cannot be factored into a sequence of quadratic extensions.{{sfnp|Rotman|2006|p=362}} 

To obtain a sufficient condition for constructibility, one must instead consider the [[splitting field]] <math>K=\mathbb{Q}(\gamma,\gamma',\gamma'',\dots)</math> obtained by adjoining all roots of the minimal polynomial of <math>\gamma</math>.  If the degree of {{em|this}} extension is a power of two, then its Galois group <math>G=\mathrm{Gal}(K/\mathbb{Q})</math> is a [[P-group|2-group]], and thus admits a descending sequence of subgroups
<math display="block">G = G_n \supseteq G_{n-1} \supseteq \cdots \supseteq G_0 = 1,</math>
with <math>|G_k| = 2^k</math> for <math>0\leq k \leq n.</math> By the [[fundamental theorem of Galois theory]], there is a corresponding tower of quadratic extensions
<math display=block>\mathbb{Q} = F_0 \subseteq F_1 \subseteq \dots \subseteq F_n = K,</math>
whose topmost field contains <math>\gamma,</math> and from this it follows that <math>\gamma</math> is constructible.

The fields that can be generated from towers of quadratic extensions of <math>\mathbb{Q}</math> are called ''{{dfn|iterated quadratic extensions}}'' of <math>\mathbb{Q}</math>. The fields of real and complex constructible numbers are the unions of all real or complex iterated quadratic extensions of <math>\mathbb{Q}</math>.{{sfnp|Martin|1998|p=37|loc=Theorem 2.10}}

==Trigonometric numbers==
{{main|Trigonometric number}}
[[Trigonometric number]]s are the cosines or sines of angles that are rational multiples of <math>\pi</math>. These numbers are always algebraic, but they may not be constructible. The cosine or sine of the angle <math>2\pi/n</math> is constructible only for certain special numbers <math>n</math>:{{sfnp|Martin|1998|p=46}}
*The [[power of two|powers of two]]
*The [[Fermat prime]]s, prime numbers that are one plus a power of two
*The products of powers of two and any number of distinct Fermat primes.
Thus, for example, <math>\cos(\pi/15)</math> is constructible because 15 is the product of the Fermat primes 3 and 5; but <math>\cos(\pi/9)</math> is not constructible (not being the product of {{em|distinct}} Fermat primes) and neither is <math>\cos(\pi/7)</math> (being a non-Fermat prime).

== Impossible constructions ==
{{multiple image|total_width=600
|image1=01-Würfelverdoppelung-Menaichmos-1.svg|caption1=A cube and its double
|image2=01 Dreiteilung-Winkel Einleitungsbild.svg|caption2=An angle and its trisection
|image3=SquareCircle.svg|caption3=Circle and square with equal areas}}
The [[ancient Greece|ancient Greeks]] thought that certain problems of [[straightedge and compass construction]] they could not solve were simply obstinate, not unsolvable.{{sfnp|Stewart|1989|p=51}}  However, the non-constructibility of certain numbers proves that these constructions are logically impossible to perform.{{sfnp|Klein|1897|p=3}} (The problems themselves, however, are solvable using methods that go beyond the constraint of working only with straightedge and compass, and the Greeks knew how to solve them in this way. One such example is [[Archimedes|Archimedes']] [[Neusis construction]] solution of the problem of [[Angle trisection]].)<ref>The description of these alternative solutions makes up much of the content of {{harvp|Knorr|1986}}.</ref>

In particular, the algebraic formulation of constructible numbers leads to a proof of the impossibility of the following construction problems:

;[[Doubling the cube]]
:The problem of doubling the unit square is solved by the construction of another square on the diagonal of the first one, with side length <math>\sqrt2</math> and area <math>2</math>. Analogously, the problem of doubling the cube asks for the construction of the length <math>\sqrt[3]{2}</math> of the side of a cube with volume <math>2</math>. It is not constructible, because the [[minimal polynomial (field theory)|minimal polynomial]] of this length, <math>x^3-2</math>, has degree 3 over <math>\Q</math>.{{sfnmp|Klein|1897|1p=13|Fraleigh|1994|2pp=429–430}} As a cubic polynomial whose only real root is irrational, this polynomial must be irreducible, because if it had a quadratic real root then the [[Conjugate (square roots)|quadratic conjugate]] would provide a second real root.<ref>{{harvp|Courant|Robbins|1996|pp=134–135|loc=Section III.3.1: Doubling the cube}}</ref>
;[[Angle trisection]]
:In this problem, from a given angle <math>\theta</math>, one should construct an angle <math>\theta/3</math>. Algebraically, angles can be represented by their [[trigonometric function]]s, such as their [[sine]]s or [[cosine]]s, which give the Cartesian coordinates of the endpoint of a line segment forming the given angle with the initial segment. Thus, an angle <math>\theta</math> is constructible when <math>x=\cos\theta</math> is a constructible number, and the problem of trisecting the angle can be formulated as one of constructing <math>\cos(\tfrac{1}{3}\arccos x)</math>. For example, the angle <math>\theta=\pi/3=60^\circ</math> of an equilateral triangle can be constructed by compass and straightedge, with <math>x=\cos\theta=\tfrac12</math>. However, its trisection <math>\theta/3=\pi/9=20^\circ</math> cannot be constructed, because <math>\cos\pi/9</math> has minimal polynomial <math>8x^3-6x-1</math> of degree 3 over <math>\Q</math>. Because this specific instance of the trisection problem cannot be solved by compass and straightedge, the general problem also cannot be solved.<ref>{{harvp|Fraleigh|1994|pp=429–430}}; {{harvp|Courant|Robbins|1996|pp=137–138|loc=Section III.3.3: Trisecting the angle}}.</ref>
;[[Squaring the circle]]
:A square with area <math>\pi</math>, the same area as a [[unit circle]], would have side length <math>\sqrt\pi</math>, a [[transcendental number]]. Therefore, this square and its side length are not constructible, because it is not algebraic over <math>\Q</math>.{{sfnp|Fraleigh|1994|pp=429–430}}
;[[Constructible polygon|Regular polygons]]
:If a regular <math>n</math>-gon is constructed with its center at the origin, the angles between the segments from the center to consecutive vertices are <math>2\pi/n</math>. The polygon can be constructed only when the cosine of this angle is a trigonometric number. Thus, for instance, a 15-gon is constructible, but the regular [[heptagon]] is not constructible, because 7 is prime but not a Fermat prime.{{sfnp|Fraleigh|1994|p=504}} For a more direct proof of its non-constructibility, represent the vertices of a regular heptagon as the complex roots of the polynomial <math>x^7-1</math>. Removing the factor <math>x-1</math>, dividing by <math>x^3</math>, and substituting <math>y=x+1/x</math> gives the simpler polynomial <math>y^3+y^2-2y-1</math>, an irreducible cubic with three real roots, each two times the real part of a complex-number vertex. Its roots are not constructible, so the heptagon is also not constructible.<ref>{{harvp|Courant|Robbins|1996|pp=138–139|loc=Section III.3.4: The regular heptagon}}.</ref>
;[[Alhazen's problem]]
:If two points and a circular mirror are given, where on the circle does one of the given points see the reflected image of the other? Geometrically, the lines from each given point to the point of reflection meet the circle at equal angles and in equal-length chords. However, it is impossible to construct a point of reflection using a compass and straightedge. In particular, for a unit circle with the two points <math>(\tfrac16,\tfrac16)</math> and <math>(-\tfrac12,\tfrac12)</math> inside it, the solution has coordinates forming roots of an irreducible degree-four polynomial <math>x^4-2x^3+4x^2+2x-1</math>. Although its degree is a power of two, the [[splitting field]] of this polynomial has degree divisible by three, so it does not come from an iterated quadratic extension and Alhazen's problem has no compass and straightedge solution.<ref>{{harvp|Neumann|1998}}. {{harvp|Elkin|1965}} comes to the same conclusion using different points and a different polynomial.</ref>

==History==

The birth of the concept of constructible numbers is inextricably linked with the history of the three impossible compass and straightedge constructions: doubling 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 of Cnidus|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]].<ref>Plutarch, ''Quaestiones convivales'' [https://web.archive.org/web/20080815001514/http://ebooks.adelaide.edu.au/p/plutarch/symposiacs/chapter8.html#section80 VIII.ii], 718ef.</ref> However, this attribution is challenged,{{sfnp|Kazarinoff|2003|p=28}} 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.{{sfnp|Knorr|1986|p=4}} [[Proclus]], citing [[Eudemus of Rhodes]], credited [[Oenopides]] ({{circa}} 450 BCE) with two ruler and compass constructions, leading some authors to hypothesize that Oenopides originated the restriction.{{sfnp|Knorr|1986|pp=15–17}} The restriction to compass and straightedge is essential to the impossibility of the classic construction problems. Angle trisection, for instance, can be done in many ways, several known to the ancient Greeks. The [[Quadratrix of Hippias|Quadratrix]] of [[Hippias of Elis]], the [[conic section|conics]] of Menaechmus, or the marked straightedge ([[Neusis construction|neusis]]) construction of [[Archimedes]] have all been used, as has a more modern approach via [[mathematics of paper folding|paper folding]].{{sfnp|Friedman|2018|pp=1–3}}
 
Although not one of the classic three construction problems, the problem of constructing regular polygons with straightedge and compass is often treated alongside them. The Greeks knew how to construct regular {{nowrap|<math>n</math>-gons}} with <math>n=2^h</math> (for any integer <math>h\ge 2</math>), 3, 5, or the product of any two or three of these numbers, but other regular {{nowrap|<math>n</math>-gons}} eluded them. In 1796 [[Carl Friedrich Gauss]], then an eighteen-year-old student, announced in a newspaper that he had constructed a [[Heptadecagon|regular 17-gon]] with straightedge and compass.{{sfnp|Kazarinoff|2003|p=29}} Gauss's 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 {{em|sufficient}} condition for the construction of a regular {{nowrap|<math>n</math>-gon.}} Gauss claimed, but did not prove, that the condition was also necessary and several authors, notably [[Felix Klein]],{{sfnp|Klein|1897|p=16}} attributed this part of the proof to him as well.{{sfnp|Kazarinoff|2003|p=30}} Alhazen's problem is also not one of the classic three problems, but despite being named after [[Ibn al-Haytham]] (Alhazen), a [[Mathematics in medieval Islam|medieval Islamic mathematician]], it already appears in [[Ptolemy]]'s [[Optics (Ptolemy)|work on optics]] from the second century.{{sfnp|Neumann|1998}}

[[Pierre Wantzel]] proved algebraically that the problems of doubling the cube and trisecting the angle are impossible to solve using 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 prime]]s (i.e., the sufficient conditions given by Gauss are also necessary).{{sfnmp|Wantzel|1837|Martin|1998|2p=46}} An attempted proof of the impossibility of squaring the circle was given by [[James Gregory (astronomer and mathematician)|James Gregory]] in ''{{lang|la|Vera Circuli et Hyperbolae Quadratura|italic=unset}}'' (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 {{pi}}. It was not until 1882 that [[Ferdinand von Lindemann]] rigorously proved its impossibility, by extending the work of [[Charles Hermite]] and proving that {{pi}} is a [[transcendental number]].{{sfnp|Martin|1998|p=44}}<ref>{{harvp|Klein|1897|pp=68–77|loc=Chapter IV}}: The transcendence of the number {{pi}}.</ref> Alhazen's problem was not proved impossible to solve by compass and straightedge until the work of Jack Elkin.<ref>{{harvp|Elkin|1965}}; see also {{harvp|Neumann|1998}} for an independent solution with more of the history of the problem.</ref>

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 of Alexandria|Pappus]].{{sfnp|Boyer|2004|pp=83–88}}

==See also==
*[[Computable number]]
*[[Definable real number]]

==Notes==
{{reflist|30em}}

==References==
{{refbegin|30em}}
* {{citation |last= Boyer |first= Carl B. |date= 2004 |title= History of Analytic Geometry |orig-date= 1956 |publisher= Dover |isbn= 978-0-486-43832-0 |author-link= Carl Benjamin Boyer }}
* {{citation |last1= Courant |first1= Richard |last2= Robbins |first2= Herbert |date= 1996 |contribution= Chapter III: Geometrical constructions, the algebra of number fields |edition= 2nd |isbn= 0-19-510519-2 |pages= 117–164 |publisher= Oxford University Press |title= What is Mathematics? An elementary approach to ideas and methods |author1-link= Richard Courant |author2-link= Herbert Robbins }}
* {{citation |last= Elkin |first= Jack M. |date= March 1965 |title= A deceptively easy problem |journal= The Mathematics Teacher |pages= 194–199 |volume= 58 |issue= 3 |doi= 10.5951/MT.58.3.0194 |jstor= 27968003 }}
* {{citation |last= Fraleigh |first= John B. |date= 1994 |title= A First Course in Abstract Algebra |edition= 5th |publisher= Addison Wesley |isbn= 978-0-201-53467-2 }}
* {{citation |last= Friedman |first= Michael |date= 2018 |title= A History of Folding in Mathematics: Mathematizing the Margins |title-link= A History of Folding in Mathematics |series= Science Networks. Historical Studies |publisher= Birkhäuser |volume= 59 |isbn= 978-3-319-72486-7 }}
* {{citation |last= Herstein |first= I. N. |date= 1986 |title= Abstract Algebra |publisher= Macmillan |isbn= 0-02-353820-1 |author-link= Israel Nathan Herstein }}
* {{citation |last= Kay |first= Anthony |date= 2021 |title= Number Systems: A Path into Rigorous Mathematics |publisher= Taylor & Francis |isbn= 978-0-367-18065-2}}
* {{citation |last= Kazarinoff |first= Nicholas D. |date= 2003 |title= Ruler and the Round: Classic Problems in Geometric Constructions |orig-date= 1970 |publisher= Dover |isbn= 0-486-42515-0 |author-link= Nicholas D. Kazarinoff }}
* {{citation |last= Klein |first= Felix |title= Famous Problems of Elementary Geometry |date= 1897 |publisher= Ginn & Co |translator1-last= Beman |translator1-first= Wooster Woodruff |translator2-last= Smith |translator2-first= David Eugene |url= https://archive.org/details/famousproblemse00kleigoog |author-link= Felix Klein }}
* {{citation |last= Knorr |first= Wilbur Richard |date= 1986 |title= The Ancient Tradition of Geometric Problems |title-link= The Ancient Tradition of Geometric Problems |series= Dover Books on Mathematics |author-link= Wilbur Knorr |publisher= Courier Dover Publications |isbn= 978-0-486-67532-9 }}
* {{citation |last1= Lawrence |first1= John W. |last2= Zorzitto |first2= Frank A. |date= 2021 |title= Abstract Algebra: A Comprehensive Introduction |series= Cambridge Mathematical Textbooks |publisher= Cambridge University Press |isbn= 978-1-108-86551-7}}
* {{citation |last= Martin |first= George E. |date= 1998 |title= Geometric Constructions |title-link= Geometric Constructions |publisher= Springer-Verlag, New York |series= Undergraduate Texts in Mathematics |isbn= 0-387-98276-0 }}
* {{citation |last= Moise |first= Edwin E. |date= 1974 |title= Elementary Geometry from an Advanced Standpoint |edition= 2nd |publisher= Addison Wesley |isbn= 0-201-04793-4 |author-link= Edwin E. Moise }}
* {{citation |last= Neumann |first= Peter M. |date= 1998 |title= Reflections on reflection in a spherical mirror |journal= American Mathematical Monthly |issue= 6 |pages= 523–528 |volume= 105 |jstor= 2589403 |doi= 10.2307/2589403 |author-link= Peter M. Neumann }}
* {{citation |last= Roman |first= Steven |date= 1995 |title= Field Theory |publisher= Springer-Verlag |isbn= 978-0-387-94408-1 |author-link= Steven Roman }}
* {{citation |last= Rotman |first= Joseph J. |date= 2006 |title= A First Course in Abstract Algebra with Applications |edition= 3rd |publisher= Prentice Hall |isbn= 978-0-13-186267-8 |author-link= Joseph J. Rotman }}
* {{citation |last= Stewart |first= Ian |date= 1989 |title= Galois Theory |edition= 2nd |publisher= Chapman and Hall |isbn= 978-0-412-34550-0 |author-link= Ian Stewart (mathematician) }}
* {{citation |last= Wantzel |first= P. L. |date= 1837 |title= 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= Journal de Mathématiques Pures et Appliquées |language= fr |volume= 1 |issue= 2 |pages= 366–372 |url= http://visualiseur.bnf.fr/ConsulterElementNum?O=NUMM-16381&Deb=374&Fin=380&E=PDF |author-link= Pierre Wantzel }}
{{refend}}

==External links==
{{commons category|Constructible numbers}}
* {{MathWorld |title=Constructible Number |urlname=ConstructibleNumber|mode=cs2|ref=none}}
* [http://www.cut-the-knot.org/arithmetic/rational.shtml Constructible Numbers] at [[Cut-the-knot]]

{{Algebraic numbers}}
{{Number systems}}

[[Category:Euclidean plane geometry]]
[[Category:Algebraic numbers]]