Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 8.9 (Limaye et al.) — small-depth monotone formulas for the ϵ\epsilonϵ-coin problem

Proved
SemAC02.theorem_8_9_coin_formulas

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

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

Fix d≥2d\ge2d≥2. For all sufficiently small ϵ>0\epsilon>0ϵ>0 there is a monotone AND/OR formula TTT of depth at most ddd and size exp⁡(Od(ϵ−1/(d−1)))\exp\bigl(O_d(\epsilon^{-1/(d-1)})\bigr)exp(Od​(ϵ−1/(d−1))) that solves the ϵ\epsilonϵ-coin problem with error at most 1/101/101/10:

Pr⁡x∼Bern((1−ϵ)/2)m[T(x)=1]≤110,Pr⁡x∼Bern((1+ϵ)/2)m[T(x)=0]≤110.\Pr_{x\sim\mathrm{Bern}((1-\epsilon)/2)^m}[T(x)=1]\le\tfrac1{10},\qquad \Pr_{x\sim\mathrm{Bern}((1+\epsilon)/2)^m}[T(x)=0]\le\tfrac1{10}.x∼Bern((1−ϵ)/2)mPr​[T(x)=1]≤101​,x∼Bern((1+ϵ)/2)mPr​[T(x)=0]≤101​.

The paper cites this result of Limaye et al. [52]; it is the starting point of the approximate-majority gadget of §8.3.

Differences from the source:

  • encoding: O_d(ε^{−1/(d−1)}), "for all sufficiently small ε > 0" → one constant A (and ε₀ > 0) chosen before ε; ∃ ε₀ > 0, ∀ ε ∈ (0, ε₀); reason: standard reading of O_d(·) and "for all sufficiently small ε"; the constants depend on d only
  • encoding: formula (circuit with the paper's conventions of p.17) and its size → Circ tree in normal form (IsReduced), size = treeSize (number of nodes); reason: the paper's circuits are flattened with no repeated children by definition; for a formula the size is its number of nodes
  • encoding: Pr over Bern(p)^m → bernProb p, the explicit finite sum; reason: same numbers
Preamble
import Mathlib
import Definitions.Def_SemAC02_Circ
import Definitions.Def_SemAC02_bernProb
import Definitions.Def_SemAC02_IsCoinDistinguisher
Formal statement
namespace SemAC02

/-- **Theorem 8.9 (Limaye et al. [52])** (Alekseev–Gryaznov–Itsykson–Pitassi–Robere–Tzameret, *Hard Instances for Strong Semantic Proof
Systems*, manuscript (STOC 2027 submission), Theorem 8.9, p.66): fix `d ≥ 2`.
For all sufficiently small `ϵ > 0`, there is a monotone AND/OR formula of depth at most `d` and
size `exp(O_d(ϵ^{−1/(d−1)}))` solving the `ϵ`-coin problem with error at most `1/10`.

The paper cites this result; its proof is in Limaye et al. [52].

**Formalization Note** `O_d(·)` is one constant `A` (depending on `d` only) chosen before
`ϵ`; "sufficiently small" is `∃ ϵ₀ > 0, ∀ ϵ ∈ (0, ϵ₀)`. The formula is a `Circ (Fin m)` on some
number `m` of inputs, in the paper's normal form (`IsReduced`); its size is the tree size. -/
theorem theorem_8_9_coin_formulas (d : ℕ) (hd : 2 ≤ d) :
    ∃ A ε₀ : ℝ, 0 < ε₀ ∧ ∀ ε : ℝ, 0 < ε → ε < ε₀ →
      ∃ (m : ℕ) (T : Circ (Fin m)), IsMonotoneCirc T ∧ IsReduced T ∧ T.depth ≤ d ∧
        (T.treeSize : ℝ) ≤ Real.exp (A * ε ^ (-1 / ((d : ℝ) - 1))) ∧
        IsCoinDistinguisher ε (1 / 10) (fun x => T.eval x) := 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), Theorem 8.9, p.66 (PDF p.68)
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