Theorems · Theorem · commutative algebra
Polynomial.resultant_eq_prod_eval
∀ {R : Type u_1} [inst : CommRing R] [inst_1 : IsDomain R] (f g : Polynomial R) (n : ℕ),
g.natDegree ≤ n →
f.Splits →
f.resultant g f.natDegree n = f.leadingCoeff ^ n * (Multiset.map (fun x => Polynomial.eval x g) f.roots).prodIf f splits with leading coeff a and degree n,
then Res(f, g) = aⁿ * ∏ g(α) where α runs through the roots of f.
- Cited by
- 3 results in Mathlib
- Foundations
- Depth 155 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites85
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
- Fieldproof · cited by 7,404
- Polynomialstatement and proof · cited by 5,681
- Algebra.algebraMapproof · cited by 4,706
- mul_oneproof · cited by 3,885
- LE.le.transproof · cited by 3,151
- one_mulproof · cited by 2,841
- Multisetproof · cited by 2,627
- CommMonoidproof · cited by 2,264
- IsDomainstatement and proof · cited by 2,196
- SProd.sprodproof · cited by 1,750
Cited by3
Results whose statement or proof uses this declaration.
- Polynomial.resultant_mul_rightproof · cited by 3
- Polynomial.resultant_scaleRootsproof · cited by 1
- Polynomial.resultant_selfproof · cited by 1