Theorems · Theorem · field theory
Polynomial.rootMultiplicity_eq_nat_find_of_nonzero
Deprecated since 2026-02-12Use Polynomial.rootMultiplicity_eq_natFind_of_ne_zero instead.
∀ {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 ⋯Alias of Polynomial.rootMultiplicity_eq_natFind_of_ne_zero.
- Defined in
- Mathlib.Algebra.Polynomial.Div
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 118 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 · cited by 62,936
- RingHomstatement · cited by 10,189
- Ringstatement · cited by 7,463
- Polynomialstatement · cited by 5,681
- Polynomial.Xstatement · cited by 1,639
- Polynomial.Cstatement · cited by 1,598
- Nat.findstatement · cited by 139
- Polynomial.rootMultiplicitystatement · cited by 79
- Polynomial.finiteMultiplicity_X_sub_Cstatement · cited by 7
- Polynomial.rootMultiplicity_eq_natFind_of_ne_zeroproof · cited by 1
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.