Math 2.0

Field theory and polynomials Proposition

Polynomials of degree two or three are irreducible iff they have no roots

Builds on Irreducible polynomialRoot of a polynomialFactor theoremDegree of a product

Statement

Let KK be a field and let f∈K[x]f \in K[x] with deg⁡f=2\deg f = 2 or deg⁡f=3\deg f = 3. Then ff is irreducible over KK if and only if ff has no root in KK.

Remarks

The proof: if f=ghf = g h with deg⁡g,deg⁡h≥1\deg g, \deg h \ge 1, then deg⁡g+deg⁡h≤3\deg g + \deg h \le 3, so one factor has degree 11. A factor ax+ba x + b of degree 11 gives the root −b/a-b/a. The factor theorem gives the converse. For example, x3−2x^3 - 2 has no root in ℚ\mathbb{Q}, so it is irreducible over ℚ\mathbb{Q}. The statement fails in degree 44: (x2+1)2(x^2 + 1)^2 has no real root, but it is not irreducible over ℝ\mathbb{R}.

Reading path

To understand this page from the ground up, read these 19 pages in order. The foundations come first.

Show the path as a graph
Group, concept, no evidence levelGroupconceptRing, definition, no evidence levelRingdefinitionCommutative ring, definition, no evidence levelCommutative ringdefinitionPolynomial ring, definition, no evidence levelPolynomial ringdefinitionUnit of a ring, definition, no evidence levelUnit of a ringdefinitionZero divisor, definition, no evidence levelZero divisordefinitionDegree of a polynomial, definition, no evidence levelDegree of a polynomialdefinitionPolynomial evaluation, definition, no evidence levelPolynomial evaluationdefinitionIntegral domain, definition, no evidence levelIntegral domaindefinitionLeading coefficient, definition, no evidence levelLeading coefficientdefinitionRoot of a polynomial, definition, no evidence levelRoot of a polynomialdefinitionIrreducible element, definition, no evidence levelIrreducible elementdefinitionMonic polynomial, definition, no evidence levelMonic polynomialdefinitionDegree of a product, statement, no evidence levelDegree of a productstatementIrreducible polynomial, definition, no evidence levelIrreducible polynomialdefinitionDivision algorithm for polynomials, statement, no evidence levelDivision algorithm fo…statementRemainder theorem, statement, no evidence levelRemainder theoremstatementFactor theorem, statement, no evidence levelFactor theoremstatementPolynomials of degree two or three are irreducible iff they have no roots, statement, no evidence levelPolynomials of degree…statement
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Group concept
  2. Ring definition
  3. Commutative ring definition
  4. Polynomial ring definition
  5. Unit of a ring definition
  6. Zero divisor definition
  7. Degree of a polynomial definition
  8. Polynomial evaluation definition
  9. Integral domain definition
  10. Leading coefficient definition
  11. Root of a polynomial definition
  12. Irreducible element definition
  13. Monic polynomial definition
  14. Degree of a product statement
  15. Irreducible polynomial definition
  16. Division algorithm for polynomials statement
  17. Remainder theorem statement
  18. Factor theorem statement
  19. Polynomials of degree two or three are irreducible iff they have no roots statement

Where this leads

2 pages build on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Irreducible_polynomial, Simple examples
About this page
Tag0VNE161QCK
URIm2://0VNE161QCK
Kindstatement, proposition
WritingW0 stub
MSC12E05
StatusThis copy of the site has no build data. Run m2 status 0VNE161QCK.
UsesIrreducible polynomial, Root of a polynomial, Factor theorem, Degree of a product

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

Used by