Theorems · Theorem · field theory
Polynomial.roots_countP_pos_le_signVariations
- #100 of the 100 theorems: Descartes Rule of Signs
∀ {R : Type u_1} [inst : CommRing R] [inst_1 : LinearOrder R] [inst_2 : IsStrictOrderedRing R] (P : Polynomial R),
Multiset.countP (fun x => 0 < x) P.roots ≤ P.signVariationsDescartes' Rule of Signs: the number of positive roots is at most the number of sign variations.
- Defined in
- Mathlib.Algebra.Polynomial.RuleOfSigns
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 134 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites24
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coeproof · cited by 62,936
- CommRingstatement and proof · cited by 17,173
- LinearOrderstatement and proof · cited by 8,572
- Polynomialstatement and proof · cited by 5,681
- IsStrictOrderedRingstatement and proof · cited by 2,490
- le_reflproof · cited by 2,061
- Polynomial.Xproof · cited by 1,639
- Polynomial.Cproof · cited by 1,598
- add_le_addproof · cited by 666
- le_imp_le_of_le_of_leproof · cited by 576
- zero_leproof · cited by 382
- Multiset.consproof · cited by 313
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.