Theorems · Theorem · complex analysis
Irreducible.natDegree_le_two
∀ {p : Polynomial ℝ}, Irreducible p → p.natDegree ≤ 2An irreducible real polynomial has natural degree at most two.
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 296 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites20
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coeproof · cited by 62,936
- Realstatement and proof · cited by 25,697
- Polynomialstatement and proof · cited by 5,681
- Complexproof · cited by 5,565
- add_zeroproof · cited by 2,707
- Polynomial.Cproof · cited by 1,598
- LT.lt.ne'proof · cited by 1,417
- Polynomial.natDegreestatement and proof · cited by 1,105
- Polynomial.aevalproof · cited by 615
- Polynomial.leadingCoeffproof · cited by 498
- Irreduciblestatement and proof · cited by 496
- minpolyproof · cited by 439
Cited by2
Results whose statement or proof uses this declaration.
- Polynomial.IsMonicOfDegree.eq_isMonicOfDegree_one_or_two_mulproof · cited by 1
- Irreducible.degree_le_twoproof · cited by 0