Lemma 3.6 — constant grid labelings over
ProvedResultantVNP.lemma_3_6algebraic-complexityp2o-gran-per-chapterp2o-plan-paperp2o-v1resultantsvnp
Let with . If satisfies
then is constant.
Differences from the source:
- encoding: ℤ_m and 𝔽₃ → ZMod (3^r + 1) and ZMod 3; reason: Lean convention; same instances
Preamble
import Mathlib
Formal statement
namespace ResultantVNP
/-- **Lemma 3.6 (Constant grid labelings).** Let `m = 3^r + 1` with `r ≥ 1`. If `b : ℤ_m² → 𝔽₃`
satisfies `b_{ij} + b_{i−1,j} + b_{i,j−1} = 0` for all `(i, j) ∈ ℤ_m²`, then `b` is constant.
Bhargav–Curticapean–Jindal–Shukla, *Multivariate Resultants: Complexity and Applications to Real Feasibility*, STOC 2027 submission manuscript (sha256 8827709b…7f8271), Lemma 3.6, Eq. (6), p.16.
**Formalization Note** `ℤ_m` is `ZMod m` and `𝔽₃` is `ZMod 3`. -/
theorem lemma_3_6 (r : ℕ) (hr : 1 ≤ r) (b : ZMod (3 ^ r + 1) × ZMod (3 ^ r + 1) → ZMod 3)
(hb : ∀ i j, b (i, j) + b (i - 1, j) + b (i, j - 1) = 0) : ∀ p q, b p = b q := by sorry
end ResultantVNP
Source
Bhargav–Curticapean–Jindal–Shukla, Multivariate Resultants: Complexity and Applications to Real Feasibility, STOC 2027 submission (manuscript sha256 8827709b…7f8271), Lemma 3.6, Eq. (6), p.16
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.