Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma C.1 — cumulative monomial counts near half the variables

Proved
AC02Frege.lemma_C_1_cumulative_counts

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

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

Let n≥2n\ge2n≥2, a≥1a\ge1a≥1, N=nℓN=n\ellN=nℓ and ℓ≥128(a+2)\sqrt\ell\ge128(a+2)ℓ​≥128(a+2). For K=⌊N/2−anℓ⌋K=\lfloor N/2-an\sqrt\ell\rfloorK=⌊N/2−anℓ​⌋ and 1≤r≤n1\le r\le n1≤r≤n,

12 MN(K−r)MN(K) ≥ 12exp⁡(−64(a+2)rℓ).\frac12\,\frac{M_N(K-r)}{M_N(K)}\ \ge\ \frac12\exp\Bigl(-64(a+2)\frac{r}{\sqrt\ell}\Bigr).21​MN​(K)MN​(K−r)​ ≥ 21​exp(−64(a+2)ℓ​r​).

Near half the variables the binomial coefficients are flat, so each factor of an approximator removes a fraction η\etaη of the error conditions that is only e−O(r/ℓ)e^{-O(r/\sqrt\ell)}e−O(r/ℓ​) small.

Differences from the source:

  • encoding: K = ⌊N/2 − an√ℓ⌋, M_N(K − r) → the natural-number floor and natural subtraction; reason: under the hypotheses N/2 − an√ℓ > 0 and K ≥ r, so both agree with the integer 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
import Definitions.Def_AC02Frege_rankCounts
Formal statement
namespace AC02Frege

/-- Alekseev–Gryaznov–Pitassi–Robere–Shekhovtsov–Tzameret, *Progress on AC0[2]-Frege Lower Bounds*, manuscript (sha256 88d149fa…), Lemma C.1, p.46 (cumulative monomial counts near half the variables; (35), p.27): let
`n ≥ 2`, `a ≥ 1`, `N = nℓ`, and `√ℓ ≥ 128(a + 2)`. For `K = ⌊N/2 − an√ℓ⌋` and `1 ≤ r ≤ n`,
`½ M_N(K − r)/M_N(K) ≥ ½ exp(−64(a + 2) r/√ℓ)`.

**Formalization Note** The left side is `etaFrac N K r`; `ℓ` need not be odd. -/
theorem lemma_C_1_cumulative_counts (n ℓ r : ℕ) (a : ℝ) (hn : 2 ≤ n) (ha : 1 ≤ a)
    (hℓ : 128 * (a + 2) ≤ Real.sqrt ℓ) (hr1 : 1 ≤ r) (hrn : r ≤ n) :
    (1 / 2 : ℝ) * Real.exp (-(64 * (a + 2) * r / Real.sqrt ℓ)) ≤
      etaFrac (n * ℓ) ⌊((n * ℓ : ℕ) : ℝ) / 2 - a * n * Real.sqrt ℓ⌋₊ r := 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 C.1, p.46; (35), p.27
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