Theorems · Theorem · field theory
Polynomial.rootMultiplicity_eq_natFind_of_ne_zero
∀ {R : Type u} [inst : Ring R] {p : Polynomial R} (p0 : p ≠ 0) {a : R}
[inst_1 : DecidablePred fun n => ¬(Polynomial.X - Polynomial.C a) ^ (n + 1) ∣ p],
Polynomial.rootMultiplicity a p = Nat.find ⋯- Defined in
- Mathlib.Algebra.Polynomial.Div
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 117 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- RingDecidablePred
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites10
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coestatement and proof · cited by 62,936
- RingHomstatement · cited by 10,189
- Ringstatement and proof · cited by 7,463
- Polynomialstatement and proof · cited by 5,681
- Polynomial.Xstatement and proof · cited by 1,639
- Polynomial.Cstatement and proof · cited by 1,598
- Nat.findstatement and proof · cited by 139
- Polynomial.rootMultiplicitystatement · cited by 79
- Classical.decPredproof · cited by 26
- Polynomial.finiteMultiplicity_X_sub_Cstatement and proof · cited by 7
Cited by1
Results whose statement or proof uses this declaration.
- Polynomial.rootMultiplicity_eq_nat_find_of_nonzeroproof · cited by 0