1.13 Constructions with straight-edge and compass.

The Greeks understood integers and the rational numbers. They were surprised to find that the length of the diagonal of a square of side 11, namely, 2\sqrt{2}, is not rational. They thus realized that they needed to extend their number system. They then hoped that the “constructible” numbers would suffice. Suppose that we are given a length, which we call 11, a straight-edge, and a compass (device for drawing circles). A real number (better a length) is constructible if it can be constructed by forming successive intersections of

  • \diamond  

    lines drawn through two points already constructed, and

  • \diamond  

    circles with centre a point already constructed and radius a constructed length.

This led them to three famous questions that they were unable to answer: is it possible to duplicate the cube, trisect an angle, or square the circle by straight-edge and compass constructions? We’ll see that the answer to all three is negative.

Let FF be a subfield of \mathbb{R}. For a positive aFa\in F, a\sqrt{a} denotes the positive square root of aa in \mathbb{R}{}. The FF-plane is F×F×F\times F\subset\mathbb{R}\times\mathbb{R}. We make the following definitions:

An FF-line is a line in ×\mathbb{R}{}\times\mathbb{R}{} through two points in the FF-plane. These are the lines given by equations

ax+by+c=0,a,b,cF.ax+by+c=0,\quad a,b,c\in F.

An FF-circle is a circle in ×\mathbb{R}{}\times\mathbb{R}{} with centre an FF-point and radius an element of FF. These are the circles given by equations

(xa)2+(yb)2=c2,a,b,cF.(x-a)^{2}+(y-b)^{2}=c^{2},\quad a,b,c\in F.
Lemma 1.34

Let LLL\neq L^{\prime} be FF-lines, and let CCC\neq C^{\prime} be FF-circles.

  1. (a)

    LL=∅︀L\cap L^{\prime}=\emptyset or consists of a single FF-point.

  2. (b)

    LC=∅︀L\cap C=\emptyset or consists of one or two points in the F[e]F[\sqrt{e}]-plane, some eFe\in F, e>0e>0.

  3. (c)

    CC=∅︀C\cap C^{\prime}=\emptyset or consists of one or two points in the F[e]F[\sqrt{e}]-plane, some eFe\in F, e>0e>0.

Proof.

The points in the intersection are found by solving the simultaneous equations, and hence by solving (at worst) a quadratic equation with coefficients in FF.

Lemma 1.35

(a) If cc and dd are constructible, then so also are c+dc+d, c-c, cdcd, and cd\frac{c}{d} (d0)(d\neq 0).

(b) If c>0c>0 is constructible, then so also is c\sqrt{c}.

Sketch of proof.

First show that it is possible to construct a line perpendicular to a given line through a given point, and then a line parallel to a given line through a given point. Hence it is possible to construct a triangle similar to a given one on a side with given length. By an astute choice of the triangles, one constructs cdcd and c1c^{-1}. For (b), draw a circle of radius c+12\frac{c+1}{2} and centre (c+12,0)(\frac{c+1}{2},0), and draw a vertical line through the point A=(1,0)A=(1,0) to meet the circle at PP. The length APAP is c\sqrt{c}. (For more details, see Artin, M., Algebra, 1991, Chapter 13, Section 4.)

Theorem 1.36
  1. (a)

    The set of constructible numbers is a field.

  2. (b)

    A number α\alpha is constructible if and only if it is contained in a subfield of \mathbb{R}{} of the form

    [a1,,ar],ai[a1,,ai1],ai>0.\mathbb{Q}{}[\sqrt{a_{1}},\ldots,\sqrt{a_{r}}],\quad a_{i}\in\mathbb{Q}{}[% \sqrt{a_{1}},\ldots,\sqrt{a_{i-1}}],\quad a_{i}>0\text{.}

Proof.

(a) This restates (a) of Lemma 1.35.

(b) It follows from Lemma 1.34 that every constructible number is contained in such a field [a1,,ar]\mathbb{Q}{}[\sqrt{a_{1}},\ldots,\sqrt{a_{r}}]. Conversely, if all the elements of [a1,,ai1]\mathbb{Q}{}[\sqrt{a_{1}},\ldots,\sqrt{a_{i-1}}] are constructible, then ai\sqrt{a_{i}} is constructible (by 1.35b), and so all the elements of [a1,,ai]\mathbb{Q}{}[\sqrt{a_{1}},\ldots,\sqrt{a_{i}}] are constructible (by (a)). Applying this for i=0,1,i=0,1,\ldots, we find that all the elements of [a1,,ar]\mathbb{Q}{}[\sqrt{a_{1}},\ldots,\sqrt{a_{r}}] are constructible.

Corollary 1.37

If α\alpha is constructible, then α\alpha is algebraic over \mathbb{Q}, and [[α]:][\mathbb{Q}[\alpha]\colon\mathbb{Q}] is a power of 22.

Proof.

According to Proposition 1.20, [[α]:][\mathbb{Q}[\alpha]\colon\mathbb{Q}] divides

[[a1][ar]:][\mathbb{Q}[\sqrt{a_{1}}]\cdots[\sqrt{a_{r}}]\colon\mathbb{Q}]

and [[a1,,ar]:][\mathbb{Q}[\sqrt{a_{1}},\ldots,\sqrt{a_{r}}]\colon\mathbb{Q}] is a power of 22.

Corollary 1.38

It is impossible to duplicate the cube by straight-edge and compass constructions.

Proof.

The problem is to construct a cube with volume 22. This requires constructing the real root of the polynomial X32X^{3}-2. But this polynomial is irreducible (by Eisenstein’s criterion 1.16 for example), and so [[23]:]=3[\mathbb{Q}[\sqrt[3]{2}]\colon\mathbb{Q}]=3.

Corollary 1.39

In general, it is impossible to trisect an angle by straight-edge and compass constructions.

Proof.

Knowing an angle is equivalent to knowing the cosine of the angle. Therefore, to trisect 3α3\alpha, we have to construct a solution to

cos3α=4cos3α3cosα.\cos 3\alpha=4\cos^{3}\alpha-3\cos\alpha.

For example, take 3α=603\alpha=60 degrees. As cos60=12\cos 60^{\circ}=\frac{1}{2}, to construct α\alpha, we have to solve 8x36x1=08x^{3}-6x-1=0, which is irreducible (apply 1.11), and so [[α]:]=3[\mathbb{Q}{}[\alpha]\colon\mathbb{Q}{}]=3.

Corollary 1.40

It is impossible to square the circle by straight-edge and compass constructions.

Proof.

A square with the same area as a circle of radius rr has side πr\sqrt{\pi}r. Since π\pi is transcendental1111 11 Proofs of this can be found in many books on number theory, for example, in 11.14 of Hardy, G. H., and Wright, E. M., An Introduction to the Theory of Numbers, Fourth Edition, Oxford, 1960., so also is π\sqrt{\pi}.

We next consider another problem that goes back to the ancient Greeks: list the integers nn such that the regular nn-sided polygon can be constructed using only straight-edge and compass. Here we consider the question for a prime pp (see LABEL:ag11 for the general case). Note that Xp1X^{p}-1 is not irreducible; in fact

Xp1=(X1)(Xp1+Xp2++1).X^{p}-1=(X-1)(X^{p-1}+X^{p-2}+\cdots+1).
Lemma 1.41

If pp is prime, then Xp1++1X^{p-1}+\cdots+1 is irreducible; hence [e2πi/p]\mathbb{Q}[e^{2\pi i/p}] has degree p1p-1 over .\mathbb{Q}.

Proof.

Let f(X)=(Xp1)/(X1)=Xp1++1f(X)=(X^{p}-1)/(X-1)=X^{p-1}+\cdots+1; then

f(X+1)=(X+1)p1X=Xp1++aiXi++p,f(X+1)=\frac{(X+1)^{p}-1}{X}=X^{p-1}+\cdots+a_{i}X^{i}+\cdots+p,

with ai=(pi+1)a_{i}=\tbinom{p}{i+1}. We know (1.4) that p|aip|a_{i} for i=1,,p2i=1,...,p-2, and so f(X+1)f(X+1) is irreducible by Eisenstein’s criterion 1.16. This implies that f(X)f(X) is irreducible.

In order to construct a regular pp-gon, pp an odd prime, we need to construct

cos2πp=e2πip+e2πip2.\cos\tfrac{2\pi}{p}=\frac{e^{\frac{2\pi i}{p}}+e^{-\frac{2\pi i}{p}}}{2}.

Note that

[e2πip][cos2πp].\mathbb{Q}[e^{\frac{2\pi i}{p}}]\supset\mathbb{Q}[\cos\tfrac{2\pi}{p}]\supset% \mathbb{Q}.

The degree of [e2πip]\mathbb{Q}[e^{\frac{2\pi i}{p}}] over [cos2πp]\mathbb{Q}[\cos\frac{2\pi}{p}] is 22 because the equation

α22cos2πpα+1=0,α=e2πip,\alpha^{2}-2\cos\tfrac{2\pi}{p}\cdot\alpha+1=0,\quad\alpha=e^{\frac{2\pi i}{p}},

shows that it is at most 22, and it is not 11 because e2πipe^{\frac{2\pi i}{p}}\notin\mathbb{R}{}. Hence

[[cos2πp]:]=p12.[\mathbb{Q}[\cos\tfrac{2\pi}{p}]\colon\mathbb{Q}]=\frac{p-1}{2}.

We deduce that, if the regular pp-gon is constructible, then (p1)/2(p-1)/2 is a power of 22; later (LABEL:ag11) we’ll prove the converse statement. Thus, the regular pp-gon is constructible if and only if p=2r+1p=2^{r}+1 for some positive integer rr.

A number 2r+12^{r}+1 can be prime only if rr is a power of 22: if tt is odd, then

Yt+1=(Y+1)(Yt1Yt2++1)Y^{t}+1=(Y+1)(Y^{t-1}-Y^{t-2}+\cdots+1)

and so

2st+1=(2s+1)((2s)t1(2s)t2++1).2^{st}+1=(2^{s}+1)((2^{s})^{t-1}-(2^{s})^{t-2}+\cdots+1)\text{.}

We conclude that the primes pp for which the regular pp-gon is constructible are exactly those of the form 22r+12^{2^{r}}+1 for some rr. Such pp are called Fermat primes (because Fermat conjectured that all numbers of the form 22r+12^{2^{r}}+1 are prime). For r=0,1,2,3,4r=0,1,2,3,4, we have 22r+1=3,5,17,257,655372^{2^{r}}+1=3,5,17,257,65537, which are indeed prime, but Euler showed that 232+1=(641)(6700417)2^{32}+1=(641)(6700417), and we don’t know whether there are any more Fermat primes. Thus, we do not know the list of primes pp for which the regular pp-gon is constructible. See Wikipedia: Fermat number.

Gauss showed that1212 12 Or perhaps that cos2π17=116+11617+11634217+1817+3172342171702617\cos\frac{2\pi}{17}=-\frac{1}{16}+\frac{1}{16}\sqrt{17}+\frac{1}{16}\sqrt{34-2% \sqrt{17}}+\frac{1}{8}\sqrt{17+3\sqrt{17}-2\sqrt{34-2\sqrt{17}}-\sqrt{170-26% \sqrt{17}}} — both expressions are correct.

cos2π17=116+11617+11634217+1817+31734217234+217\cos\frac{2\pi}{17}=-\frac{1}{16}+\frac{1}{16}\sqrt{17}+\frac{1}{16}\sqrt{34-2% \sqrt{17}}+\frac{1}{8}\sqrt{17+3\sqrt{17}-\sqrt{34-2\sqrt{17}}-2\sqrt{34+2% \sqrt{17}}}

when he was 18 years old. This success encouraged him to become a mathematician.