Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary 4.18 — size bound for semantic AC0[2]-Frege

Proved
SemAC02.corollary_4_18_frege_size_bound

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

ac0-2-fregeliftingp2o-gran-per-chapterp2o-plan-paperp2o-v1polynomial-calculusproof-complexitysemantic-proof-systems

Let FFF be a family of AC0[2] circuits in nnn variables and S={[ ⁣[A] ⁣]:A∈F}S=\{[\![A]\!]:A\in F\}S={[[A]]:A∈F}. Fix integers d≥2d\ge2d≥2, r,R≥1r,R\ge1r,R≥1 and 0<ϵ≤1/2560<\epsilon\le1/2560<ϵ≤1/256, and put

k=⌊(1/2−ϵ)n⌋,q=Rrd−1,θ=12min⁡{r e−128ϵrd−2, R e−128ϵrd−1}.k=\lfloor(1/2-\epsilon)n\rfloor,\qquad q=Rr^{d-1},\qquad \theta=\tfrac12\min\bigl\{r\,e^{-128\epsilon r^{d-2}},\ R\,e^{-128\epsilon r^{d-1}}\bigr\}.k=⌊(1/2−ϵ)n⌋,q=Rrd−1,θ=21​min{re−128ϵrd−2, Re−128ϵrd−1}.

Suppose n≥16/ϵ2n\ge16/\epsilon^2n≥16/ϵ2, rd−1≤ϵn/2r^{d-1}\le\epsilon n/2rd−1≤ϵn/2, and U⊆Bn≤kU\subseteq\mathcal B_n^{\le k}U⊆Bn≤k​ is a linear subspace such that every 0≠f∈U0\ne f\in U0=f∈U has a non-zero degree-3q3q3q fff-relative pseudo-reduction operator for SSS. Then every semantic depth-ddd AC0[2]-Frege refutation π\piπ of FFF satisfies

size(π) ≥ dim⁡UHn(k) eθ.(12)\mathrm{size}(\pi)\ \ge\ \frac{\dim U}{H_n(k)}\,e^{\theta}. \tag{12}size(π) ≥ Hn​(k)dimU​eθ.(12)

The corollary makes the exponent of Theorem 4.16 explicit for a degree cutoff slightly below n/2n/2n/2.

Differences from the source:

  • encoding: AC0[2] circuits with unordered children; size = number of distinct rooted subcircuits → Circ trees with List children; size = number of distinct subterms (proofSize / famSize); reason: a paper circuit is a list presentation of itself with the same evaluation, depth and size; normalising a list circuit or refutation never increases depth or the distinct-subterm count; same instances
  • encoding: a non-zero operator into any linear space W → HasNonzeroRelPseudoRed (some W : Type); reason: a non-zero operator into any W gives one onto its image; same instances
  • encoding: k := ⌊(1/2 − ε)n⌋ → Nat.floor ((1/2 − ε) * n); reason: k ≥ 0 since ε ≤ 1/256
Preamble
import Mathlib
import Definitions.Def_SemAC02_Circ
import Definitions.Def_SemAC02_IsSemRefutation
import Definitions.Def_SemAC02_arith
import Definitions.Def_SemAC02_Ble
import Definitions.Def_SemAC02_IsRelPseudoRed
Formal statement
namespace SemAC02

/-- **Corollary 4.18 (Size bound for semantic AC0[2]-Frege)** (Alekseev–Gryaznov–Itsykson–Pitassi–Robere–Tzameret, *Hard Instances for Strong Semantic Proof
Systems*, manuscript (STOC 2027 submission), Corollary 4.18,
p.37): let `F` be a family of AC0[2] circuits in `n` variables, and let `S = {⟦A⟧ : A ∈ F}` be
its arithmetisation. Fix integers `d ≥ 2` and `r, R ≥ 1`, and a parameter `0 < ϵ ≤ 1/256`, and
put `k := ⌊(1/2 − ϵ)n⌋`, `q := R r^{d−1}`,
`θ := (1/2) min{r e^{−128ϵ r^{d−2}}, R e^{−128ϵ r^{d−1}}}`. Suppose that `n ≥ 16/ϵ²`,
`r^{d−1} ≤ ϵn/2`, and that `U ⊆ B_n^{≤k}` is a linear subspace such that, for every `0 ≠ f ∈ U`,
there is a non-zero degree-`3q` `f`-relative pseudo-reduction operator for `S`. Then every
semantic depth-`d` AC0[2]-Frege refutation `π` of `F` satisfies
`size(π) ≥ (dim(U)/H_n(k)) exp(θ)` (12).

**Formalization Note** `k` is `Nat.floor ((1/2 − ϵ) n)`. The pseudo-reduction may take values in
any `𝔽₂`-vector space `W : Type`. `size(π)` is `proofSize π`. -/
theorem corollary_4_18_frege_size_bound {n : ℕ} (F : Set (Circ (Fin n))) (d r R : ℕ) (hd : 2 ≤ d)
    (hr : 1 ≤ r) (hR : 1 ≤ R) (ε : ℝ) (hε₀ : 0 < ε) (hε : ε ≤ 1 / 256)
    (hn : 16 / ε ^ 2 ≤ (n : ℝ)) (hrn : (r : ℝ) ^ (d - 1) ≤ ε * n / 2)
    (U : Submodule (ZMod 2) (MvPolynomial (Fin n) (ZMod 2)))
    (hU : U ≤ Ble (Fin n) ⌊(1 / 2 - ε) * (n : ℝ)⌋₊)
    (hred : ∀ f ∈ U, f ≠ 0 → HasNonzeroRelPseudoRed (arith '' F) f (3 * (R * r ^ (d - 1))))
    (π : List (Circ (Fin n))) (hπ : IsSemRefutation d F π) :
    (Module.finrank (ZMod 2) U : ℝ) / (Hn n ⌊(1 / 2 - ε) * (n : ℝ)⌋₊ : ℝ) *
        Real.exp (1 / 2 * min ((r : ℝ) * Real.exp (-(128 * ε * (r : ℝ) ^ (d - 2))))
          ((R : ℝ) * Real.exp (-(128 * ε * (r : ℝ) ^ (d - 1))))) ≤
      (proofSize π : ℝ) := by sorry

end SemAC02
Source
Alekseev, Gryaznov, Itsykson, Pitassi, Robere, Tzameret, Hard Instances for Strong Semantic Proof Systems: CNFs for Depth-Four PC and Deep Instances for AC0[2]-Frege, manuscript (STOC 2027 submission, sha256 c228d68b89b45b5c6c547aa994f7d1799441bb22b2a85e36c6cd400bea8cdb6a), Corollary 4.18, p.37 (PDF p.39)
Human review
  • Endorsed by Shuze Chen · Nov 8, 2026

    Confirmed by the moderator at approval.

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