Field theory and polynomials Theorem
Impossibility of trisecting the angle
Builds on Trisecting the angleThe degree of a constructible number is a power of twoPolynomials of degree two or three are irreducible iff they have no rootsRational root theorem
Statement
The angle , that is, , cannot be trisected with straightedge and compass. Equivalently, is not a constructible number.
Remarks
The proof: shows that is a root of . Then is a root of . The polynomial has no rational root, by the rational root theorem. So it is irreducible, and . Since is not a power of , the number is not constructible. The angle itself is constructible, so no general trisection method exists.
History
Pierre Wantzel published the proof in 1837.
Reading path
To understand this page from the ground up, read these 62 pages in order. The foundations come first.
- Group concept
- Straightedge and compass construction concept
- Ring definition
- Constructible number definition
- Trisecting the angle problem
- 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
- Rational root theorem statement
- Field extension definition
- R/M is a field iff M is maximal statement
- 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
- Minimal polynomial of an algebraic element definition
- Remainder theorem statement
- K[x] is a Euclidean domain statement
- Tower law statement
- Field generated by adjoining elements definition
- The minimal polynomial divides every polynomial vanishing at the element statement
- K[x]/(f) is a field iff f is irreducible statement
- Factor theorem statement
- Simple extension definition
- K(a) is isomorphic to K[x] modulo the minimal polynomial statement
- Polynomials of degree two or three are irreducible iff they have no roots 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
- Impossibility of trisecting the angle statement
Where this leads
1 page builds on this one.
Further reading
- Web https://en.wikipedia.org/wiki/Angle_trisection, Proof of impossibility
About this page
| Tag | 0EWXPZCSZ0 |
|---|---|
| URI | m2://0EWXPZCSZ0 |
| Kind | statement, theorem |
| Writing | W0 stub |
| MSC | 12F05 |
| Status | This copy of the site has no build data. Run m2 status 0EWXPZCSZ0. |
| Uses | Trisecting the angle, The degree of a constructible number is a power of two, Polynomials of degree two or three are irreducible iff they have no roots, Rational root theorem |
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.