Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 4.8 — coefficient degree in scalar coordinates

Proved
AC02Frege.lemma_4_8_coeff_degree_scalar

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

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

Let ℓ\ellℓ be odd. If p=∑TcTxT≠0p=\sum_T c_Tx_T\ne0p=∑T​cT​xT​=0 is a multilinear polynomial in the lifted variables, then

β(p)=max⁡{∣J(T)∣:cT≠0},\beta(p)=\max\{|J(T)|: c_T\ne0\},β(p)=max{∣J(T)∣:cT​=0},

where J(T)J(T)J(T) is the set of blocks in which xTx_TxT​ selects more than half the bits. Consequently p∈WQp\in W_Qp∈WQ​ if and only if cT=0c_T=0cT​=0 whenever ∣J(T)∣>Q|J(T)|>Q∣J(T)∣>Q.

So the restriction β(f)≤Q\beta(f)\le Qβ(f)≤Q on the multiplier is a set of coordinate restrictions on its scalar coefficients.

Differences from the source:

  • encoding: ℓ odd, m = (ℓ − 1)/2 (standing assumption of §4) → hypothesis Odd ℓ, m = ℓ / 2; reason: same instances
  • encoding: p = Σ_T c_T x_T with c_T ≠ 0 → multilinear p; its monomials s ∈ p.support, with T = s.support; reason: a multilinear monomial is determined by its support
  • generalization: "Consequently p ∈ W_Q iff …" under p ≠ 0 → the equivalence for every multilinear p, including p = 0; reason: for p = 0 both sides hold (β(0) = −∞ and there is no monomial); specializes to the source
  • encoding: β(p) with β(0) = −∞ → coeffDeg p : WithBot ℕ; reason: same values
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.8, p.22 (coefficient degree in scalar coordinates): for odd `ℓ`, if
`p = Σ_T c_T x_T ≠ 0` then `β(p) = max{|J(T)| : c_T ≠ 0}`; consequently `p ∈ W_Q` iff `c_T = 0`
whenever `|J(T)| > Q`.

**Formalization Note** `p` is multilinear, so its monomials `s` are the `x_T` with `T = s.support`
and `c_T ≠ 0` means `s ∈ p.support`. The second clause is stated for every multilinear `p`
(for `p = 0` both sides hold). -/
theorem lemma_4_8_coeff_degree_scalar {n ℓ : ℕ} (hℓ : Odd ℓ)
    (p : MvPolynomial (Fin n × Fin ℓ) (ZMod 2)) (hp : IsMultilinear p) :
    (p ≠ 0 → coeffDeg p = ((p.support.sup (fun s => (heavyBlocks s.support).card) : ℕ) :
      WithBot ℕ)) ∧
    ∀ Q : ℕ, p ∈ WQ n ℓ Q ↔ ∀ s ∈ p.support, (heavyBlocks s.support).card ≤ 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.8, p.22
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