Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 7 — binomial transform identity λj+2k(w)=λj(w)+λj(w+2k)\lambda_{j+2^k}(w)=\lambda_j(w)+\lambda_j(w+2^k)λj+2k​(w)=λj​(w)+λj​(w+2k)

Proved
GoldreichAffine.Exponential.Supplement.binomial_transform_identity

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

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

For a binary sequence a=(a(h))h≥0a=(a(h))_{h\ge0}a=(a(h))h≥0​ over F2\mathbb F_2F2​ let λja(w)=∑h=0j(jh)a(w+h)\lambda^a_j(w)=\sum_{h=0}^{j}\binom jh a(w+h)λja​(w)=∑h=0j​(hj​)a(w+h) in F2\mathbb F_2F2​. For every modular function MODbt,S0\mathsf{MOD}^{t,S_0}_bMODbt,S0​​ (t≥2t\ge2t≥2, S0⊆[t]S_0\subseteq[t]S0​⊆[t]), whose coefficients are λj(w)=λja(w)\lambda_j(w)=\lambda^a_j(w)λj​(w)=λja​(w) with a(h)=(1−gt,S0(h))/2a(h)=(1-g_{t,S_0}(h))/2a(h)=(1−gt,S0​​(h))/2, and for all integers j,k,w≥0j,k,w\ge0j,k,w≥0,

λj+2k(w)=λj(w)+λj(w+2k).\lambda_{j+2^k}(w)=\lambda_j(w)+\lambda_j(w+2^k).λj+2k​(w)=λj​(w)+λj​(w+2k).

The identity also holds for the binomial transform λa\lambda^aλa of any binary sequence aaa.

The identity is the tool behind the periodicity of the ANF coefficients of MOD12 (Lemma 8), and hence behind the degree bound of Theorem 4.

Differences from the source:

  • encoding: coefficients over F₂ of MOD^{t,S0}_b, and of an arbitrary binary sequence → binomialTransform over ZMod 2 of modSequence t S0 (first conjunct) and of any a : ℕ → ZMod 2 (second conjunct); reason: ZMod 2 is F₂; λ_j(w) does not depend on b, so the MOD clause needs no b
Preamble
import Definitions.Def_GoldreichAffine_Exponential_Supplement_Modular
open MatousekLP.Codes (Word weight)
set_option autoImplicit false
Formal statement
namespace GoldreichAffine.Exponential.Supplement

/-- Lemma 7, printed p.30 / PDF p.31: lambda_{j+2^k}(w) = lambda_j(w) + lambda_j(w+2^k) over F₂,
    for the coefficients of every MOD^{t,S0} and for the binomial transform of any binary sequence. -/
theorem binomial_transform_identity :
    (∀ (t : ℕ) (S0 : Finset ℕ), 2 ≤ t → S0 ⊆ Finset.range t → ∀ j k w : ℕ,
      binomialTransform (modSequence t S0) (j + 2 ^ k) w =
        binomialTransform (modSequence t S0) j w +
          binomialTransform (modSequence t S0) j (w + 2 ^ k)) ∧
    (∀ (a : ℕ → ZMod 2) (j k w : ℕ),
      binomialTransform a (j + 2 ^ k) w =
        binomialTransform a j w + binomialTransform a j (w + 2 ^ k)) := 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. 30 (PDF p. 31), Lemma 7; proof pp. 30–31 (PDF pp. 31–32)

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