Field theory and polynomials Galois theory Theorem
Gauss–Wantzel theorem
Builds on Constructible numberIrreducibility of the cyclotomic polynomials over the rationalsThe degree of a constructible number is a power of two
Statement
Let . The regular -gon can be constructed with straightedge and compass if and only if , with and distinct Fermat primes.
Remarks
A Fermat prime is a prime number of the form . The known Fermat primes are and . The regular -gon is constructible if and only if is a constructible number. Its degree over is , by the irreducibility of . The condition on holds if and only if is a power of . So the -gon and the -gon are constructible, but the -gon and the -gon are not.
History
Carl Friedrich Gauss proved in 1796 that the regular -gon is constructible. In his 1801 book Disquisitiones Arithmeticae, he gave the sufficient condition. Pierre Wantzel gave a full proof of the necessity in 1837.
Reading path
To understand this page from the ground up, read these 59 pages in order. The foundations come first.
- Group concept
- Straightedge and compass construction concept
- Ring definition
- Constructible number definition
- Commutative ring definition
- Ideal definition
- Polynomial ring definition
- Ring homomorphism definition
- Subring definition
- Unit of a ring definition
- Zero divisor definition
- Divisibility in a commutative ring definition
- Ideal generated by a subset definition
- Maximal ideal definition
- Two-sided ideal definition
- Degree of a polynomial definition
- Polynomial evaluation definition
- Field definition
- Integral domain definition
- Kernel of a ring homomorphism definition
- Ring isomorphism definition
- Principal ideal definition
- Quotient ring definition
- The only ideals of a field are zero and the whole field statement
- Evaluation homomorphism definition
- Leading coefficient definition
- Root of a polynomial definition
- Subfield definition
- Irreducible element definition
- Euclidean domain definition
- Correspondence theorem for rings statement
- Principal ideal domain definition
- The constructible numbers form a field closed under square roots statement
- Monic polynomial definition
- Universal property of the quotient ring statement
- Irreducible polynomial definition
- Degree of a product statement
- Field extension definition
- R/M is a field iff M is maximal statement
- Cyclotomic polynomial definition
- In a PID a nonzero element is irreducible iff it generates a maximal ideal statement
- Division algorithm for polynomials statement
- Algebraic element definition
- R[x] is an integral domain iff R is statement
- First isomorphism theorem for rings statement
- Intermediate field definition
- Degree of a field extension definition
- Irreducibility of the cyclotomic polynomials over the rationals statement
- Minimal polynomial of an algebraic element definition
- K[x] is a Euclidean domain statement
- Field generated by adjoining elements definition
- Tower law statement
- The minimal polynomial divides every polynomial vanishing at the element statement
- K[x]/(f) is a field iff f is irreducible statement
- Simple extension definition
- K(a) is isomorphic to K[x] modulo the minimal polynomial statement
- Degree of a simple extension is the degree of the minimal polynomial statement
- The degree of a constructible number is a power of two statement
- Gauss–Wantzel theorem statement
Further reading
- Web https://en.wikipedia.org/wiki/Constructible_polygon, Conditions for constructibility
About this page
| Tag | 0Y34JMJNE9 |
|---|---|
| URI | m2://0Y34JMJNE9 |
| Kind | statement, theorem |
| Writing | W0 stub |
| MSC | 12F05 |
| Status | This copy of the site has no build data. Run m2 status 0Y34JMJNE9. |
| Uses | Constructible number, Irreducibility of the cyclotomic polynomials over the rationals, The degree of a constructible number is a power of two |
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.