Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 5.2 — preservation of the rules

Proved
AC02Frege.proposition_5_2_preservation

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, FFF a CNF, G=F∘MajℓG=F\circ\mathrm{Maj}_\ellG=F∘Majℓ​, and let π\piπ be a depth-3.5 AC0[2]-Frege refutation of GGG with bottom degree bbb. Choose approximants ATA_{\mathcal T}AT​, PLP_LPL​ of the shape of Definition 5.1 with tin,tout≥1t_{in},t_{out}\ge1tin​,tout​≥1 factors, and put R=btinR=bt_{in}R=btin​. Suppose β(f)≤Q\beta(f)\le Qβ(f)≤Q, both error families (39) and (40) hold, and

Q+max⁡{2Rtout+2R, Rtout+w(G)}≤D,Q+2w(F)≤D.(41)Q+\max\{2Rt_{out}+2R,\ Rt_{out}+w(G)\}\le D,\qquad Q+2w(F)\le D.\tag{41}Q+max{2Rtout​+2R, Rtout​+w(G)}≤D,Q+2w(F)≤D.(41)

Then every line LLL of the refutation satisfies fPL∈C^DfP_L\in\widehat C_DfPL​∈CD​. The empty final line consequently gives f∈C^Df\in\widehat C_Df∈CD​.

This is the simulation step: the rules of the proof system force the corrected approximants, and finally the multiplier itself, into C^D\widehat C_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
  • generalization: the standing setting of §5 (p.28): F of constant width with no PC refutation of degree D = ⌊cn⌋, ℓ = Θ(log n), Q = ⌊cn/16⌋ → any CNF F, any odd ℓ, any D and Q subject only to the printed hypotheses β(f) ≤ Q, (39), (40), (41); reason: the proof (App. D, pp.48–49) uses only these hypotheses, never 1 ∉ C_D, the width of F or the size of ℓ; at the section's values the statement is the source's
  • encoding: lines as disjunctions with weakening and contraction → lines and terms as finite sets (IsRefutation); reason: contraction is implicit; same refutations up to contraction
  • encoding: approximants of the shape of Definition 5.1 → an Approx structure of coefficients; A_T and P_L multilinearized; reason: same approximants as functions
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_D35Refutation
import Definitions.Def_AC02Frege_majorityExpansion
import Definitions.Def_AC02Frege_rankCounts
import Definitions.Def_AC02Frege_approximants
Formal statement
namespace AC02Frege

open MvPolynomial LiftSAParity

/-- Alekseev–Gryaznov–Pitassi–Robere–Shekhovtsov–Tzameret, *Progress on AC0[2]-Frege Lower Bounds*, manuscript (sha256 88d149fa…), Proposition 5.2, (41), p.30 (preservation of the rules; proof App. D, pp.48–49): let
`π` be a depth-3.5 AC0[2]-Frege refutation of `G = F ∘ Maj_ℓ` with bottom degree `b`, and choose
approximants of the shape of Definition 5.1 with `t_in, t_out ≥ 1` factors and `R = b t_in`.
Suppose `β(f) ≤ Q`, both error families (39), (40) hold, and
`Q + max{2R t_out + 2R, R t_out + w(G)} ≤ D`, `Q + 2w(F) ≤ D` (41). Then every line `L` of the
refutation satisfies `f P_L ∈ Ĉ_D`; the empty final line consequently gives `f ∈ Ĉ_D`.

**Formalization Note** `ℓ` odd; `w(·)` is `width`; products are products of functions. -/
theorem proposition_5_2_preservation {n ℓ : ℕ} (hℓ : Odd ℓ) (F : CNF (Fin n))
    (b D Q tin tout : ℕ) (htin : 1 ≤ tin) (htout : 1 ≤ tout)
    (π : List (Line (Fin n × Fin ℓ))) (hπ : IsRefutation b (lift F ℓ) π)
    (Φ : Approx (Fin n × Fin ℓ) tin tout) (f : MvPolynomial (Fin n × Fin ℓ) (ZMod 2))
    (hf : coeffDeg f ≤ (Q : WithBot ℕ)) (h39 : InnerErr F ℓ D Φ π f)
    (h40 : OuterErr F ℓ D Φ π f)
    (h41a : Q + max (2 * (b * tin) * tout + 2 * (b * tin)) (b * tin * tout + width (lift F ℓ))
      ≤ D)
    (h41b : Q + 2 * width F ≤ D) :
    (∀ L ∈ π, f * Φ.P L ∈ CHat F ℓ D) ∧ f ∈ 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), Proposition 5.2, (41), p.30; proof App. D, pp.48–49
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