Field theory and polynomials Proof
Proof of the Gauss–Wantzel theorem
Builds on Constructible numberThe constructible numbers form a field closed under square rootsSum of the roots of unityThe degree of a constructible number is a power of twoCyclotomic polynomialIrreducibility of the cyclotomic polynomials over the rationalsEuler's totient functionMinimal polynomial of an algebraic elementThe minimal polynomial divides every polynomial vanishing at the elementDegree of a simple extension is the degree of the minimal polynomialMultiplicativity of the totient functionTotient of a prime powerFactor theoremFermat primeEuler's formulade Moivre's formulaThe nth roots of unityNumber of nth roots of unityA polynomial over a field has at most as many roots as its degreeSplitting fieldSeparable polynomialCharacterizations of Galois extensionsGalois groupOrder of the Galois group of a Galois extension equals its degreeK(a) is isomorphic to K[x] modulo the minimal polynomialAbelian groupCauchy's theoremNormal subgroupFixed fieldFundamental theorem of Galois theoryTower law
Proof
Let , let , and let be the set of the constructible numbers. By the field theorem, is a subfield of closed under square roots. By Euler's formula and de Moivre's formula, the powers , , are the vertices of a regular -gon with centre . If , they all lie in the field , so this -gon is constructible. Conversely, let a regular -gon with centre be constructed, and let and be adjacent vertices. Its vertices are for . Their sum is , because . So . Also is or , so . So we must show: if and only if has the stated form. Let be Euler's totient function.
The degree of .
- The cyclotomic polynomial is monic, has the root (the factor with ), and has degree . Indeed, for neither nor is coprime to , so both ranges give the same count. It is [[irreducible in |0SK1VHZ5R2]].
- So the minimal polynomial of , which divides , equals . By the degree of a simple extension, .
Necessity.
- Suppose . Then is a power of , say .
- Write with distinct odd primes and . By multiplicativity and the totient of a prime power, .
- Each factor divides , so it is a power of . Since is odd, , and with .
- Suppose that has an odd divisor , say . The polynomial has the root , as is odd. By the factor theorem, divides in .
- Putting shows that divides . Since , we have , which contradicts the primality of .
- So for some , and is a Fermat prime. Hence with distinct Fermat primes .
Sufficiency.
- Let with distinct Fermat primes . By step 4, , where for and . So for some .
- Let and . By the description of the roots of unity, every root of is for some with .
- There are exactly roots of , so are distinct. Then has degree less than and roots, so it is by the root bound.
- So splits over , and . Thus is a splitting field of over .
- Also , so is separable. By the characterisation of Galois extensions, is a finite Galois extension.
- Let , the Galois group. By the order of the Galois group and step 2, .
- For , , so for some integer by step 10. Since [[every element of is with |0ZN39QDTP9]], is determined by .
- For , we get . So , and is abelian.
- Claim: for every , every subfield such that is a finite Galois extension with abelian Galois group of order satisfies . We prove it by induction on .
- If , then by the order of the Galois group. So , and because the subfield contains .
- Let and . By Cauchy's theorem, some has order . As is abelian, is a normal subgroup.
- Let be the fixed field. By the fundamental theorem of Galois theory, , is normal, and , which is abelian of order .
- Every element of lies in , so it is separable over . So is a finite Galois extension, and by the induction hypothesis.
- Choose with . By the tower law, divides and is not . So , , and .
- Let be the minimal polynomial of over , and let . Then .
- So , as a square root of an element of . Then , since is a field containing .
- By the degree of a simple extension, every element of is with . All of these lie in . So , which proves the claim.
- By steps 13, 14 and 16, the claim applies to . So , and the regular -gon is constructible.
Idea
The regular -gon is constructible exactly when is, and has degree over . If is constructible, is a power of , which forces the stated form of . Conversely, if is a power of , the abelian Galois group of can be cut down by subgroups of order . This gives a chain of quadratic extensions, and each quadratic step only needs a square root.
Where this leads
1 page builds on this one.
Further reading
- Web https://en.wikipedia.org/wiki/Constructible_polygon, Conditions for constructibility
About this page
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.