Theorems · Theorem · commutative algebra
Polynomial.resultant_eq_prod_roots_sub
∀ {K : Type u_3} [inst : Field K] (f g : Polynomial K),
f.Monic →
g.Monic → f.Splits → g.Splits → f.resultant g = (Multiset.map (fun ij => ij.1 - ij.2) (f.roots ×ˢ g.roots)).prodIf f and g are monic and splits, then Res(f, g) = ∏ (α - β),
where α and β runs through the roots of f and g respectively.
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 154 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- Field
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites105
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coeproof · cited by 62,936
- Fieldstatement and proof · 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
- add_zeroproof · cited by 2,707
- Multisetstatement and proof · cited by 2,627
- CommMonoidproof · cited by 2,264
- mul_commproof · cited by 2,262
- LT.lt.leproof · cited by 2,189
Cited by1
Results whose statement or proof uses this declaration.
- Polynomial.resultant_eq_prod_evalproof · cited by 3