Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 9 — a symmetric polynomial of degree ≤ e vanishing on e+1e+1e+1 weights r0+3ir_0+3ir0​+3i is zero

Open
GoldreichAffine.Exponential.Supplement.symmetric_vanishing_on_weights

by mikedeng1 · Nov 15, 2026 · Mathlib 0df444a (Lean v4.33.1)

boolean-functionscryptographyp2o-batch-stoc27sp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let HHH be a symmetric Boolean polynomial on ddd variables with algebraic degree at most eee. Let r0∈{0,1,2}r_0\in\{0,1,2\}r0​∈{0,1,2} and suppose r0+3e≤dr_0+3e\le dr0​+3e≤d. If

H(z)=0whenever∥z∥∈{r0, r0+3, …, r0+3e},H(z)=0\quad\text{whenever}\quad\|z\|\in\{r_0,\,r_0+3,\,\dots,\,r_0+3e\},H(z)=0whenever∥z∥∈{r0​,r0​+3,…,r0​+3e},

then H≡0H\equiv0H≡0.

The lemma is the vanishing principle behind the algebraic immunity bound of Lemma 10.

Differences from the source:

  • encoding: a symmetric Boolean polynomial H on d variables of degree at most e → H : Word d → Bool, IsSymmetric H, algebraicDegree H ≤ e; reason: a Boolean polynomial and its Boolean function determine each other (unique ANF); degree is Definition 3
  • encoding: ‖z‖ ∈ {r0, r0+3, …, r0+3e}, r0 ∈ {0,1,2} → ∃ i ≤ e, weight z = r0 + 3i, with r0 ≤ 2; reason: same set
Preamble
import Definitions.Def_GoldreichAffine_Exponential_Supplement_Algebraic
open MatousekLP.Codes (Word weight)
set_option autoImplicit false
Formal statement
namespace GoldreichAffine.Exponential.Supplement

/-- Lemma 9, printed p.32 / PDF p.33. -/
theorem symmetric_vanishing_on_weights (d e r0 : ℕ) (H : Predicate d) (hsym : IsSymmetric H)
    (hdeg : algebraicDegree H ≤ e) (hr0 : r0 ≤ 2) (hd : r0 + 3 * e ≤ d)
    (hvan : ∀ z : Word d, (∃ i : ℕ, i ≤ e ∧ weight z = r0 + 3 * i) → H z = false) :
    ∀ z : Word d, H z = false := by sorry

end GoldreichAffine.Exponential.Supplement
Source
Ximing Fu, Mo Li, Shihan Lyu, Affine Advantage in Guess-type Attacks on Goldreich’s PRGs: Generalization, Characterization and Countermeasures, STOC 2027 submission #579 (October 2026), PDF SHA-256 c6e5f1bfbc08adde62b9863b4417adb47a894635ef9e887e40be2e7fcd8c0594, p. 32 (PDF p. 33), Lemma 9; proof pp. 32–33 (PDF pp. 33–34)

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