Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 4.11 — lifted input clauses

Proved
AC02Frege.lemma_4_11_lifted_input_clauses

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, FFF a CNF and G=F∘MajℓG=F\circ\mathrm{Maj}_\ellG=F∘Majℓ​. Let 1+a(x)=11+a(x)=11+a(x)=1 be the encoding of an input clause CCC of GGG, with a=C‾=∏λ∈C(1+λ(x))a=\overline C=\prod_{\lambda\in C}(1+\lambda(x))a=C=∏λ∈C​(1+λ(x)) its complement. If β(f)≤Q\beta(f)\le Qβ(f)≤Q and Q+2w(F)≤DQ+2w(F)\le DQ+2w(F)≤D, then

fa∈C^D.fa\in\widehat C_D .fa∈CD​.

This replaces, for the lifted formula, the fact that the complements of the input clauses lie in CDC_DCD​.

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: w(F), the width of F → width F = the largest clause size of F (0 for the empty CNF); reason: same values
Preamble
import Mathlib
import Definitions.Def_LiftSAParity_CNF
import Definitions.Def_AC02Frege_ML
import Definitions.Def_AC02Frege_PC
import Definitions.Def_AC02Frege_lift
import Definitions.Def_AC02Frege_majorityExpansion
Formal statement
namespace AC02Frege

open MvPolynomial LiftSAParity

/-- Alekseev–Gryaznov–Pitassi–Robere–Shekhovtsov–Tzameret, *Progress on AC0[2]-Frege Lower Bounds*, manuscript (sha256 88d149fa…), Lemma 4.11, p.23 (lifted input clauses): let `1 + a(x) = 1` be the encoding of an input
clause `C` of `G = F ∘ Maj_ℓ`, with `a = C̄` its complement. If `β(f) ≤ Q` and
`Q + 2w(F) ≤ D`, then `fa ∈ Ĉ_D`.

**Formalization Note** `ℓ` is odd; `C̄ = ∏_{λ ∈ C} (1 + λ(x))` is `clauseCompl C`; `w(F)` is
`width F`; `fa` is the product of functions. -/
theorem lemma_4_11_lifted_input_clauses {n ℓ : ℕ} (hℓ : Odd ℓ) (F : CNF (Fin n)) (D Q : ℕ)
    (C : Clause (Fin n × Fin ℓ)) (hC : C ∈ lift F ℓ) (f : MvPolynomial (Fin n × Fin ℓ) (ZMod 2))
    (hf : coeffDeg f ≤ (Q : WithBot ℕ)) (hD : Q + 2 * width F ≤ D) :
    f * clauseCompl C ∈ CHat F ℓ D := 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.11, p.23
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