Field theory and polynomials Proof
Proof that polynomials of degree two or three are irreducible iff they have no roots
Builds on FieldIrreducible polynomialRoot of a polynomialFactor theoremDegree of a productUnit of a ringEvaluation homomorphism
Proof
- Let be a field and let with .
- We first find the units of . If in , then by the degree of a product. So , and is a nonzero constant.
- Conversely, a nonzero constant has the inverse . So the units of are exactly the polynomials of degree .
- Since , the polynomial is nonzero and, by Step 3, it is not a unit.
- Suppose that has a root . By the factor theorem, for some .
- By the degree of a product, . By Step 3, neither nor is a unit. So is not irreducible.
- This proves: if is irreducible, then has no root in .
- Now suppose that has no root in . Let with . We show that or is a unit.
- Since , both and are nonzero. By the degree of a product, .
- Suppose that neither nor is a unit. By Step 3, and .
- If both degrees were at least , their sum would be at least , which contradicts Step 9. So one factor, say , has degree .
- Write with and . Then .
- Evaluation at is a ring homomorphism. So , and is a root of in .
- This contradicts the assumption of Step 8. So or is a unit.
- With Step 4, is irreducible over . Together with Step 7, is irreducible over if and only if it has no root in .
Idea
A factorisation into two factors of positive degree splits the degree or as a sum of two positive integers. One of them must be , and a factor of degree gives a root. Conversely, a root gives the factor .
Reading path
To understand this page from the ground up, read these 26 pages in order. The foundations come first. The path takes the proofs Proof of the degree of a product over an integral domain, Proof of the remainder theorem, Proof of the factor theorem.
Show the path as a graph
- no evidence level
- Group concept
- Ring definition
- Commutative ring definition
- Polynomial ring definition
- Ring homomorphism definition
- Unit of a ring definition
- Zero divisor definition
- Divisibility in a commutative ring definition
- Degree of a polynomial definition
- Polynomial evaluation definition
- Field definition
- Integral domain definition
- Leading coefficient definition
- Evaluation homomorphism definition
- Root of a polynomial definition
- Irreducible element definition
- Monic polynomial definition
- Proof of the remainder theorem proof
- Proof of the degree of a product over an integral domain proof
- Irreducible polynomial definition
- Division algorithm for polynomials statement
- Degree of a product statement
- Remainder theorem statement
- Proof of the factor theorem proof
- Factor theorem statement
- Proof that polynomials of degree two or three are irreducible iff they have no roots proof
Where this leads
4 pages build on this one.
Further reading
- Web https://en.wikipedia.org/wiki/Irreducible_polynomial, Simple examples
About this page
| Tag | 4CCCN00HJ7 |
|---|---|
| URI | m2://4CCCN00HJ7 |
| Kind | proof |
| Writing | W0 stub |
| MSC | 12E05 |
| Proves | Polynomials of degree two or three are irreducible iff they have no roots |
| Uses | Field, Irreducible polynomial, Root of a polynomial, Factor theorem, Degree of a product, Unit of a ring, Evaluation homomorphism |
| Methods | Proof by cases |
| Changed | 4 November 2026 |
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.