Theorems · Definition · field theory
Polynomial.decidableDvdMonic
Deprecated since 2026-02-07Use Classical.dec instead.
{R : Type u} → [inst : Ring R] → {q : Polynomial R} → [DecidableEq R] → (p : Polynomial R) → q.Monic → Decidable (q ∣ p)An algorithm for deciding polynomial divisibility.
Prefer Classical.dec, as the algorithm relies on %ₘ and so is noncomputable.
- Defined in
- Mathlib.Algebra.Polynomial.Div
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 120 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- RingDecidableEq
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites5
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Ringstatement and proof · cited by 7,463
- Polynomialstatement and proof · cited by 5,681
- Polynomial.Monicstatement and proof · cited by 461
- Polynomial.modByMonicproof · cited by 82
- Polynomial.modByMonic_eq_zero_iff_dvdproof · cited by 15
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.