Equality of assignment coefficients across grid class partitions
ProvedResultantVNP.assignment_coefficients_equalalgebraic-complexitypolynomialsresultants
For a fixed resultant system, grid side m > 0, and total number n of tensor indices, any two grid assignments have the same coefficient in the degree m² characteristic coefficient polynomial. The two assignments may use different class maps. Thus the coefficient depends only on the resultant system, n, and m, not on the class partition or on the assignment. This statement establishes the equality part of Theorem 3.5; it makes no assertion that the common coefficient is nonzero.
Preamble
import Mathlib import Definitions.Def_ResultantVNP_charCoeff import Definitions.Def_ResultantVNP_gridSum
Formal statement
theorem ResultantVNP.assignment_coefficients_equal (𝓡 : ResultantVNP.ResultantSystem) (m n : ℕ) [NeZero m]
(cls cls' : Fin n → ZMod m × ZMod m)
(ν : ∀ p,{a // cls a = p}) (η : ∀ p,{a // cls' a = p}) :
(ResultantVNP.charCoeff 𝓡 n (m^2)).coeff (ResultantVNP.assignMonomial cls ν) =
(ResultantVNP.charCoeff 𝓡 n (m^2)).coeff (ResultantVNP.assignMonomial cls' η) := by sorrySource
Equality part of Theorem 3.5 in Bhargav–Curticapean–Jindal–Shukla, Multivariate Resultants: Complexity and Applications to Real Feasibility, STOC 2027 paper #1103. Proof by extending the bijection between chosen indices to a permutation and applying characteristic-coefficient invariance.