Row invariance of the Newton traces for the generic tensor
ProvedHararySachs.Hyper.newtonTr_generic_row_invarianceLet , and , and let be the resultant of forms of degree in variables, normalized by . Let be the generic tensor, whose entries are independent indeterminates over . Let be the Newton traces of
Fix a row . Let be the tensor obtained by replacing every with the monomial in new variables , keeping the other entries as coefficients. Let . Then for every ,
This is the generic form of the single-row Morozov–Shakirov identity: the Newton traces are fixed by the row projection . The statement for arbitrary tensors with entries in (newtonTr_row_invariance) follows by substituting the entries for the indeterminates.
Formalization Note The coefficient ring is MvPolynomial (Fin n × (Fin (k-1) → Fin n)) ℚ and the variables are those of MvPolynomial (Fin n) over it. The bracket is MvPolynomial.eval 0.
import Mathlib import Definitions.Def_HararySachs_Hyper_CharPoly import Definitions.Def_HararySachs_Hyper_TensorPhi
namespace HararySachs.Hyper
theorem newtonTr_generic_row_invariance (n k : ℕ) (hk : 2 ≤ k) (hn : 1 ≤ n)
(res : MvPolynomial (ResVar n (fun _ => k - 1)) ℤ)
(hres : IsResultant n (fun _ => k - 1) res)
(i : Fin n) (d : ℕ) (hd : 1 ≤ d) :
newtonTr (phiPoly (k := k)
(fun j t => (MvPolynomial.X (j, t) :
MvPolynomial (Fin n × (Fin (k - 1) → Fin n)) ℚ)) res) d =
∑ m : Fin (d + 1), (1 / (Nat.factorial (m.val * (k - 1)) : ℚ)) •
MvPolynomial.eval 0
((fun p : MvPolynomial (Fin n) (MvPolynomial (Fin n × (Fin (k - 1) → Fin n)) ℚ) =>
∑ t : Fin (k - 1) → Fin n, (MvPolynomial.X (i, t) :
MvPolynomial (Fin n × (Fin (k - 1) → Fin n)) ℚ) •
(List.ofFn t).foldr (fun j q => MvPolynomial.pderiv j q) p)^[m.val]
(newtonTr (phiPoly (k := k)
(fun j t => if j = i then ∏ s, MvPolynomial.X (t s)
else MvPolynomial.C (MvPolynomial.X (j, t))) res) d)) := by sorry
end HararySachs.Hyper