Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eq. (49) — tail bound for sampling without replacement

Proved
AC02Frege.eq_49_sampling_tail

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

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

Choose a uniform jjj-subset of an NNN-element set, 0≤j≤N0\le j\le N0≤j≤N. For a fixed set III of L≥1L\ge1L≥1 coordinates, let XXX count how many are selected, and put p=j/Np=j/Np=j/N. For every u≥0u\ge0u≥0,

Pr⁡[X−Lp≥u]≤exp⁡(−2u2/L).\Pr[X-Lp\ge u]\le\exp(-2u^2/L).Pr[X−Lp≥u]≤exp(−2u2/L).

This is the tail estimate behind the bound (33) on the fraction of monomials excluded by WQW_QWQ​.

Differences from the source:

  • encoding: the probability under a uniform j-subset → the number of j-subsets S of Fin N with |S ∩ I| − |I| j/N ≥ u, divided by C(N, j); reason: the uniform distribution on j-subsets
Preamble
import Mathlib
Formal statement
namespace AC02Frege

/-- Alekseev–Gryaznov–Pitassi–Robere–Shekhovtsov–Tzameret, *Progress on AC0[2]-Frege Lower Bounds*, manuscript (sha256 88d149fa…), App. C, (49), p.45 (tail bound for sampling without replacement): choose a uniform
`j`-subset of an `N`-element set; for a fixed set of `L ≥ 1` coordinates let `X` count how many
are selected, and put `p = j/N`. For every `u ≥ 0`, `Pr[X − Lp ≥ u] ≤ exp(−2u²/L)`.

**Formalization Note** The probability is the fraction of `j`-subsets `S` of `Fin N` with
`|S ∩ I| − |I| j/N ≥ u`, over `C(N, j)`; `0 ≤ j ≤ N`. -/
theorem eq_49_sampling_tail (N j : ℕ) (hj : j ≤ N) (I : Finset (Fin N)) (hI : 1 ≤ I.card)
    (u : ℝ) (hu : 0 ≤ u) :
    ((((Finset.univ : Finset (Finset (Fin N))).filter (fun S => S.card = j ∧
        u ≤ ((S ∩ I).card : ℝ) - (I.card : ℝ) * ((j : ℝ) / N))).card : ℕ) : ℝ)
        / (N.choose j : ℝ)
      ≤ Real.exp (-2 * u ^ 2 / I.card) := 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), App. C, (49), p.45
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