3.5 Constructible numbers revisited

Earlier (1.36) we showed that a real number α\alpha is constructible if and only if it is contained in a subfield of \mathbb{R}{} of the form [a1,,ar]\mathbb{Q}[\sqrt{a_{1}},\ldots,\sqrt{a_{r}}] with each aia_{i} a positive element of [a1,,ai1]\mathbb{Q}{}[\sqrt{a_{1}},\ldots,\sqrt{a_{i-1}}]. In particular

equation (7) (7)
α constructible [[α]:]=2s some s.\alpha\text{\ constructible }\implies[\mathbb{Q}[\alpha]\colon\mathbb{Q}]=2^{s% }\text{\ some }s.

Now we can prove a partial converse to this last statement.

Theorem 3.23

If α\alpha is contained in a subfield of \mathbb{R}{} that is Galois of degree 2r2^{r} over \mathbb{Q}, then it is constructible.

Proof.

Suppose αE\alpha\in E\subset\mathbb{R}{} where EE is Galois of degree 2r2^{r} over \mathbb{Q}, and let G=Gal(E/)G=\operatorname{Gal}(E/\mathbb{Q}). Because finite pp-groups are solvable (GT, 6.7), there exists a sequence of groups

{1}=G0G1G2Gr=G\{1\}=G_{0}\subset G_{1}\subset G_{2}\subset\cdots\subset G_{r}=G

with Gi/Gi1G_{i}/G_{i-1} of order 22. Correspondingly, there will be a sequence of fields,

E=E0E1E2Er=E=E_{0}\supset E_{1}\supset E_{2}\supset\cdots\supset E_{r}=\mathbb{Q}{}

with Ei1E_{i-1} of degree 22 over EiE_{i}. The next lemma shows that Ei=Ei1[ai]E_{i}=E_{i-1}[\sqrt{a_{i}}] for some aiEi1a_{i}\in E_{i-1}, and ai>0a_{i}>0 because otherwise EiE_{i} would not be real. This proves the theorem.

Lemma 3.24

Let E/FE/F be a quadratic extension of fields of characteristic 2\neq 2. Then E=F[d]E=F[\sqrt{d}] for some dFd\in F.

Proof.

Let αE\alpha\in E, αF\alpha\notin F, and let X2+bX+cX^{2}+bX+c be the minimal polynomial of α\alpha. Then α=b±b24c2\alpha=\frac{-b\pm\sqrt{b^{2}-4c}}{2}, and so E=F[b24c]E=F[\sqrt{b^{2}-4c}].

Corollary 3.25

If pp is a prime of the form 2k+12^{k}+1, then cos2πp\cos\frac{2\pi}{p} is constructible.

Proof.

The field [e2πi/p]\mathbb{Q}[e^{2\pi i/p}] is Galois over \mathbb{Q} with Galois group G(/p)×G\simeq(\mathbb{Z}/p\mathbb{Z})^{\times}, which has order p1=2kp-1=2^{k}. The field [cos2πp]\mathbb{Q}{}[\cos\frac{2\pi}{p}] is contained in [e2πi/p]\mathbb{Q}[e^{2\pi i/p}], and therefore is Galois of degree dividing 2k2^{k} (fundamental theorem 3.16 and 1.20). As [cos2πp]\mathbb{Q}{}[\cos\frac{2\pi}{p}] is a subfield of \mathbb{R}{}, we can apply the theorem.

Thus a regular pp-gon, pp prime, is constructible if and only if pp is a Fermat prime, i.e., of the form 22r+12^{2^{r}}+1. For example, we have proved that the regular 6553765537-polygon is constructible, without (happily) having to exhibit an explicit formula for cos2π65537\cos\frac{2\pi}{65537}.

Remark 3.26

The converse to (7) is false; in particular, there are nonconstructible algebraic numbers of degree 44 over \mathbb{Q}{}. The polynomial f(X)=f(X)= X44X+2[X]X^{4}-4X+2\in\mathbb{Q}{}[X] is irreducible, and we’ll show below (LABEL:cg8a) that the Galois group of a splitting field EE{} for ff is S4S_{4}. Each root of f(X)f(X) lies in an extension of degree 222^{2} of \mathbb{Q}{} . If the four roots of f(X)f(X) were constructible, then all the elements of EE would be constructible (1.36a), but if HH denotes a Sylow 22-subgroup of S4S_{4}, then EHE^{H} has odd degree over \mathbb{Q}{}, and so no element of EHE^{H}\smallsetminus\mathbb{Q}{} is constructible.33 3 It is possible to prove this without appealing to the Sylow theorems. If a root α\alpha of f(X)f(X) were constructible, then there would exist a tower of quadratic extensions [α]M\mathbb{Q}[\alpha]\supset M\supset\mathbb{Q}. By Galois theory, the groups Gal(E/M)Gal(E/[α])\operatorname{Gal}(E/M)\supset\operatorname{Gal}(E/\mathbb{Q}[\alpha]) have orders 1212 and 66 respectively. As Gal(E/)=S4\operatorname{Gal}(E/\mathbb{Q})=S_{4}, Gal(E/M)\operatorname{Gal}(E/M) would be A4A_{4}. But A4A_{4} has no subgroup of order 66, a contradiction. Thus no root of f(X)f(X) is constructible. (Actually Gal(E/[α])=S3\operatorname{Gal}(E/\mathbb{Q}[\alpha])=S_{3}, but that does not matter here.)