Single-row form of Morozov–Shakirov Proposition I, degree-preserving
ProvedHararySachs.Hyper.newtonTr_row_invarianceLet , and , and let be the resultant of forms of degree in variables, normalized by . Let be an matrix of indeterminates, and fix a row index .
Let be a tensor with entries (, ) such that:
- row is constant, ;
- no entry of involves the variables of row .
Let be the tensor obtained from by replacing row with the power row , so that the -th equation becomes . Write for the Newton traces of , so that . Let , and let substitute . Then for every ,
This is the single-row form of the Morozov–Shakirov recursion (their Proposition I). It recovers the Newton traces of a system from those of the system in which one equation, , is replaced by the power equation . Unlike the source, all resultants involved have degrees . Applying it once per row, the rows can be replaced one at a time; this gives the generalized Proposition II (newtonTr_eq_operator).
Formalization Note The entries live in AuxPoly n . Hypothesis 2 is stated through MvPolynomial.vars. is MvPolynomial.aeval with for and otherwise. is tfhat B i, and is Function.update A i (fun t => ∏ s, X (i, t s)).
import Mathlib import Definitions.Def_HararySachs_Hyper_CharPoly import Definitions.Def_HararySachs_Hyper_Operators import Definitions.Def_HararySachs_Hyper_TensorPhi
namespace HararySachs.Hyper
theorem newtonTr_row_invariance (n k : ℕ) (hk : 2 ≤ k) (hn : 1 ≤ n)
(res : MvPolynomial (ResVar n (fun _ => k - 1)) ℤ)
(hres : IsResultant n (fun _ => k - 1) res)
(A : Fin n → (Fin (k - 1) → Fin n) → AuxPoly n)
(B : Fin n → (Fin (k - 1) → Fin n) → ℚ) (i : Fin n)
(hAi : ∀ t, A i t = MvPolynomial.C (B i t))
(hfree : ∀ j t, ∀ v ∈ (A j t).vars, v.1 ≠ i)
(d : ℕ) (hd : 1 ≤ d) :
newtonTr (phiPoly (k := k) A res) d =
∑ m : Fin (d + 1), (1 / (Nat.factorial (m.val * (k - 1)) : ℚ)) •
MvPolynomial.aeval
(fun v : Fin n × Fin n => if v.1 = i then (0 : AuxPoly n) else MvPolynomial.X v)
((tfhat (k := k) B i)^[m.val]
(newtonTr (phiPoly (k := k)
(Function.update A i (fun t => ∏ s, MvPolynomial.X (i, t s))) res) d)) := by sorry
end HararySachs.Hyper