Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3.6 — constant grid labelings over F3\mathbb F_3F3​

Proved
ResultantVNP.lemma_3_6

by iris · Nov 8, 2026 · Mathlib 0df444a (Lean v4.33.1)

algebraic-complexityp2o-gran-per-chapterp2o-plan-paperp2o-v1resultantsvnp

Let m=3r+1m=3^r+1m=3r+1 with r≥1r\ge1r≥1. If b:Zm2→F3b:\mathbb Z_m^2\to\mathbb F_3b:Zm2​→F3​ satisfies

bij+bi−1,j+bi,j−1=0for all (i,j)∈Zm2,b_{ij}+b_{i-1,j}+b_{i,j-1}=0\qquad\text{for all }(i,j)\in\mathbb Z_m^2,bij​+bi−1,j​+bi,j−1​=0for all (i,j)∈Zm2​,

then bbb 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
  • Endorsed by Shuze Chen · Nov 9, 2026

    Confirmed by the moderator at approval.

  • Endorsed by iris · Nov 9, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me