Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Fact 2.10 — the (d+1)-th alternating difference of a polynomial of degree at most d vanishes

Proved
LowRankShifts.MatPoly.fact_2_10

by Shuze Chen · Nov 10, 2026 · Mathlib 0df444a (Lean v4.33.1)

p2o-gran-per-chapterp2o-plan-paperp2o-v1polynomialsworst-case-to-average-case

Let FFF be any field, f∈F[x1,…,xℓ]f\in F[x_1,\dots,x_\ell]f∈F[x1​,…,xℓ​] a commutative polynomial of total degree at most ddd, and x,a1,…,ad+1∈Fℓx,a_1,\dots,a_{d+1}\in F^\ellx,a1​,…,ad+1​∈Fℓ. Then

∑S⊆[d+1](−1)∣S∣ f(x+∑i∈Sai)=0.\sum_{S\subseteq[d+1]}(-1)^{|S|}\,f\Big(x+\sum_{i\in S}a_i\Big)=0 .S⊆[d+1]∑​(−1)∣S∣f(x+i∈S∑​ai​)=0.

This identity is what makes a low-degree function locally correctable: the value at xxx is a signed sum of the values at the 2d+1−12^{d+1}-12d+1−1 points x+∑i∈Saix+\sum_{i\in S}a_ix+∑i∈S​ai​, S≠∅S\ne\emptysetS=∅. Lemma 2.11 and Corollary 2.12 rest on it.

Formalization Note. fff is an MvPolynomial (Fin ℓ) F with totalDegree ≤ d; [d+1][d+1][d+1] is Fin (d + 1).

Differences from the source:

  • encoding: [d+1] = {1, …, d+1} and S ⊆ [d+1] → Fin (d + 1) and S : Finset (Fin (d + 1)); reason: 0-based indices; the same sum
  • encoding: f ∈ F[x_1, …, x_ℓ] with degree at most d → f : MvPolynomial (Fin ℓ) F with f.totalDegree ≤ d; reason: Mathlib's multivariate polynomials; the same objects
Preamble
import Mathlib

set_option autoImplicit false
Formal statement
namespace LowRankShifts.MatPoly

/-- Fact 2.10 (p. 13): for any field `F`, any commutative polynomial `f ∈ F[x_1, …, x_ℓ]` of total
degree at most `d`, and any `x, a_1, …, a_{d+1} ∈ F^ℓ`,
`Σ_{S ⊆ [d+1]} (−1)^{|S|} f(x + Σ_{i∈S} a_i) = 0`. -/
theorem fact_2_10 {F : Type*} [Field F] {ℓ d : ℕ} (f : MvPolynomial (Fin ℓ) F)
    (hf : f.totalDegree ≤ d) (x : Fin ℓ → F) (a : Fin (d + 1) → Fin ℓ → F) :
    ∑ S : Finset (Fin (d + 1)),
      (-1 : F) ^ S.card * MvPolynomial.eval (x + ∑ i ∈ S, a i) f = 0 := by sorry

end LowRankShifts.MatPoly
Source
Golovnev, Nagargoje, Shinkar, Singh, Stephens-Davidowitz, Worst-Case to Average-Case Reductions for Linear Algebra: Optimal, Simple, and General, STOC 2027 submission (manuscript sha256 ebcf9677…), p. 13 (PDF 16), Fact 2.10
Human review
  • Endorsed by Community (Bot) · Nov 10, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Shuze Chen · Nov 10, 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