Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 4.5 — majority expansion

Proved
AC02Frege.lemma_4_5_majority_expansion

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

ac0-2-fregemajority-liftingp2o-gran-per-chapterp2o-plan-paperp2o-v1polynomial-calculusproof-complexity

Let ℓ\ellℓ be odd and hi=Majℓ(xi)h_i=\mathrm{Maj}_\ell(x_i)hi​=Majℓ​(xi​). Every polynomial ppp in the lifted variables has a unique expansion

p(x)=∑A∈AxA pA(h1(x),…,hn(x)),p(x)=\sum_{A\in\mathcal A}x_A\,p_A\bigl(h_1(x),\dots,h_n(x)\bigr),p(x)=A∈A∑​xA​pA​(h1​(x),…,hn​(x)),

with every pA(y1,…,yn)p_A(y_1,\dots,y_n)pA​(y1​,…,yn​) multilinear. Here A\mathcal AA is the set of A⊆[n]×[ℓ]A\subseteq[n]\times[\ell]A⊆[n]×[ℓ] that select at most m=(ℓ−1)/2m=(\ell-1)/2m=(ℓ−1)/2 positions of every block.

The coefficient polynomials pAp_ApA​ are what polynomial calculus for the original formula FFF acts on; the coefficient degree and the space C^D\widehat C_DCD​ are defined through them.

Differences from the source:

  • encoding: ℓ odd, m = (ℓ − 1)/2 (standing assumption of §4) → hypothesis Odd ℓ, m = ℓ / 2; reason: same instances
  • encoding: polynomials over F2 identified with functions on the cube; products of functions → MvPolynomial over ZMod 2; products multilinearized by ML (membership in Ĉ_D and β depend only on ML p); reason: Definition 2.1 identifies a function with its multilinear polynomial; no instance changes
  • encoding: a family (p_A)_{A ∈ 𝒜} → a family indexed by all A ⊆ [n] × [ℓ] with p_A = 0 for A ∉ 𝒜 (IsExpansion); reason: the extra coordinates are forced to be zero, so the families correspond one to one
Preamble
import Mathlib
import Definitions.Def_AC02Frege_ML
import Definitions.Def_AC02Frege_lift
import Definitions.Def_AC02Frege_majorityExpansion
Formal statement
namespace AC02Frege

open MvPolynomial

/-- Alekseev–Gryaznov–Pitassi–Robere–Shekhovtsov–Tzameret, *Progress on AC0[2]-Frege Lower Bounds*, manuscript (sha256 88d149fa…), Lemma 4.5, (17), p.21 (majority expansion): for odd `ℓ`, every polynomial `p` in the
lifted variables has a unique expansion `p(x) = Σ_{A ∈ 𝒜} x_A p_A(h_1(x), …, h_n(x))` with every
`p_A(y_1, …, y_n)` multilinear.

**Formalization Note** `p` is identified with its function `ML p`; the family `q` is indexed by
all `A ⊆ [n] × [ℓ]` with `q_A = 0` off `𝒜` (`IsExpansion`), and the product is multilinearized. -/
theorem lemma_4_5_majority_expansion {n ℓ : ℕ} (hℓ : Odd ℓ)
    (p : MvPolynomial (Fin n × Fin ℓ) (ZMod 2)) : ∃! q, IsExpansion p q := by sorry

end AC02Frege
Source
Alekseev, Gryaznov, Pitassi, Robere, Shekhovtsov, Tzameret, Progress on AC0[2]-Frege Lower Bounds (manuscript dated November 3, 2026, STOC 2027 submission, sha256 88d149fa2bcae702e55a6b72efecda2b4137fd18dca3e23a056c3db5da0ece61), Lemma 4.5, (17), p.21
Human review
  • Endorsed by Shuze Chen · Nov 7, 2026

    Confirmed by the moderator at approval.

  • Endorsed by iris · Nov 7, 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