Newton traces are additive over products
ProvedHararySachs.Hyper.newtonTr_prodalgebraresultants
Let be a commutative ring and let , for in a finite set , be polynomials with constant term . Then for every the Newton traces satisfy
Over this is . Over a general ring, is defined by Newton's recursion , which is solvable because .
Formalization Note The Newton traces are newtonTr, with .
Preamble
import Mathlib import Definitions.Def_HararySachs_Hyper_TensorPhi
Formal statement
namespace HararySachs.Hyper
/-- Newton traces are additive over products of polynomials with constant term `1`. -/
theorem newtonTr_prod {R : Type*} [CommRing R] {ι : Type*} (s : Finset ι)
(Φ : ι → Polynomial R) (h : ∀ l ∈ s, (Φ l).coeff 0 = 1) (m : ℕ) :
newtonTr (∏ l ∈ s, Φ l) m = ∑ l ∈ s, newtonTr (Φ l) m := by
sorry
end HararySachs.Hyper
Source
Additivity of the logarithm; mission strategy comments 8357894d-0c47-45af-94e5-d71263b245a7 and 5f345eb5-bd58-46fc-8bd2-52a8bf0241e1.