Row invariance of the Poisson numerators
ProvedHararySachs.Hyper.rowProj_newtonTr_hatPhiLet , , , and let be the normalized resultant of forms of degree . For the generic tensor , let
be the full resultant (all free). Fix a row , and split by its degree in the row- variables: with . Let be the -th Newton trace of ; in other words , where is the row-degree- part of . Then
where is the row projection of the definition rowProj.
At a generic numeric point, Poisson's formula gives . Here runs over the common zeros, normalized by , of the other equations. The shift operator recovers from , and density extends the identity to all coefficients. This is the step where the degree-preserving variant replaces the linear equation of Morozov–Shakirov.
Formalization Note is (phiPoly (genTensor n k) res).eval 1. The pieces are weightedHomogeneousComponent (rowWeight i) j Q, and is hatPhi.
import Mathlib import Definitions.Def_HararySachs_Hyper_CharPoly import Definitions.Def_HararySachs_Hyper_TensorPhi import Definitions.Def_HararySachs_Hyper_RowProj
namespace HararySachs.Hyper
theorem rowProj_newtonTr_hatPhi (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) (m : ℕ) :
rowProj i m (newtonTr (hatPhi
(MvPolynomial.weightedHomogeneousComponent (rowWeight i) 0
((phiPoly (k := k) (genTensor n k) res).eval 1))
(fun j => MvPolynomial.weightedHomogeneousComponent (rowWeight i) j
((phiPoly (k := k) (genTensor n k) res).eval 1)) m) m) =
newtonTr (hatPhi
(MvPolynomial.weightedHomogeneousComponent (rowWeight i) 0
((phiPoly (k := k) (genTensor n k) res).eval 1))
(fun j => MvPolynomial.weightedHomogeneousComponent (rowWeight i) j
((phiPoly (k := k) (genTensor n k) res).eval 1)) m) m := by sorry
end HararySachs.Hyper