Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Claim B.1.2, p. A:45 — at most an exp⁡(−c mε2)\exp(-c\,m\varepsilon^2)exp(−cmε2) fraction of mmm-subsets TTT overestimate a Boolean average by ε\varepsilonε

Proved
ObfImpossibility.PseudoOracle.chernoff_count_T

by mikedeng1 · Oct 7, 2026 · Mathlib 0df444a (Lean v4.33.1)

concentrationcountingp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1sampling-without-replacement

There is an absolute constant c>0c>0c>0 with the following property. Let UUU be a finite set, f:U→{0,1}f:U\to\{0,1\}f:U→{0,1}, m∈Nm\in\mathbb Nm∈N and ε>0\varepsilon>0ε>0. Then the number of mmm-element subsets T⊆UT\subseteq UT⊆U with

Pr⁡y∈T[f(y)=1]−Pr⁡y∈U[f(y)=1]>ε\Pr_{y\in T}\big[f(y)=1\big]-\Pr_{y\in U}\big[f(y)=1\big]>\varepsilony∈TPr​[f(y)=1]−y∈UPr​[f(y)=1]>ε

is at most exp⁡(−c m ε2)(∣U∣m)\exp(-c\,m\,\varepsilon^2)\binom{|U|}{m}exp(−cmε2)(m∣U∣​).

This is the Chernoff bound for sampling without replacement that the paper invokes ("most large subsets are good approximators of the average of a Boolean function"). Applied with U=LGU=L_GU=LG​, f=Mf=Mf=M, m=∣SG∣≈(1−γ)K1−5δm=|S_G|\approx(1-\gamma)K^{1-5\delta}m=∣SG​∣≈(1−γ)K1−5δ and ε=12Kδ\varepsilon=\frac1{2K^\delta}ε=2Kδ1​, it says that at most an exp⁡(−Ω(K1−7δ))\exp(-\Omega(K^{1-7\delta}))exp(−Ω(K1−7δ)) fraction of the possible images T=G(SG)T=G(S_G)T=G(SG​) satisfy inequality (9), which is the saving in the description of GGG.

Formalization Note The constant ccc is quantified before the type UUU lives in, so it is universal. For m=0m=0m=0 the empty set has average 000 and the count is 000; for m>∣U∣m>|U|m>∣U∣ both sides are 000.

Preamble
import Mathlib
import Definitions.Def_ObfImpossibility_PseudoOracle_Setting
Formal statement
namespace ObfImpossibility.PseudoOracle

/-- The Chernoff count, p. A:45 (proof of Claim B.1.2): there is an absolute constant
`c > 0` such that for every Boolean function `f` on a finite set `U`, every `m` and every
`ε > 0`, at most an `exp(-c m ε²)` fraction of the `m`-element subsets `T ⊆ U` satisfy
`Pr_{y∈T}[f(y) = 1] - Pr_{y∈U}[f(y) = 1] > ε`. -/
theorem chernoff_count_T :
    ∃ c : ℝ, 0 < c ∧ ∀ {α : Type} [DecidableEq α] (U : Finset α) (f : α → Bool) (m : ℕ)
      (ε : ℝ), 0 < ε →
        (((U.powersetCard m).filter fun T => ε < avg T f - avg U f).card : ℝ) ≤
          Real.exp (-(c * (m : ℝ) * ε ^ 2)) * ((U.card.choose m : ℕ) : ℝ) := by sorry

end ObfImpossibility.PseudoOracle
Source
Barak et al., On the (Im)possibility of Obfuscating Programs, J. ACM 59(2) (2012), author's copy, p. A:45, Appendix B, proof of Claim B.1.2 (Chernoff bound for the sets T satisfying (9))
Human review
  • Endorsed by Shuze Chen · Oct 7, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 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