Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eqs. (3.15)–(3.16) — exponential bound on ∑i=0k+d−1(Ni)εki(1−εk)N−i\sum_{i=0}^{k+d-1}\binom Ni\varepsilon_k^i(1-\varepsilon_k)^{N-i}∑i=0k+d−1​(iN​)εki​(1−εk​)N−i

Proved
ScenarioApproach.Removal.binomial_sum_le_exp

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

binomial-tailp2o-batch-b23ap2o-gran-per-chapterp2o-plan-bookp2o-v1scenario-approach

Let k≥1k \ge 1k≥1, d≥1d \ge 1d≥1 and NNN be natural numbers, let a=1+1/ka = 1 + 1/\sqrt ka=1+1/k​, and let εk∈[0,1]\varepsilon_k \in [0,1]εk​∈[0,1]. Then

∑i=0k+d−1(Ni)εki(1−εk)N−i≤ak+d−1(1−(1−1a)εk)N\sum_{i=0}^{k+d-1} \binom Ni \varepsilon_k^i (1-\varepsilon_k)^{N-i} \le a^{k+d-1}\left(1 - \left(1 - \frac1a\right)\varepsilon_k\right)^Ni=0∑k+d−1​(iN​)εki​(1−εk​)N−i≤ak+d−1(1−(1−a1​)εk​)N

(the last line of (3.15)), and

∑i=0k+d−1(Ni)εki(1−εk)N−i≤exp⁡(−(1−a)(k+d−1))⋅exp⁡(−(1−1a)εkN).(3.16)\sum_{i=0}^{k+d-1} \binom Ni \varepsilon_k^i (1-\varepsilon_k)^{N-i} \le \exp\bigl(-(1-a)(k+d-1)\bigr) \cdot \exp\left(-\left(1-\frac1a\right)\varepsilon_k N\right). \qquad (3.16)i=0∑k+d−1​(iN​)εki​(1−εk​)N−i≤exp(−(1−a)(k+d−1))⋅exp(−(1−a1​)εk​N).(3.16)

These bounds turn the binomial tail in (3.13) into an explicit exponential, from which the violation level εk\varepsilon_kεk​ of Theorem 1.2 is solved for.

Formalization Note The book applies the chain to the specific εk\varepsilon_kεk​ of (1.9); the inequalities hold for every εk∈[0,1]\varepsilon_k \in [0,1]εk​∈[0,1], and that range is stated as a hypothesis (for εk>1\varepsilon_k > 1εk​>1 the factors (1−εk)N−i(1-\varepsilon_k)^{N-i}(1−εk​)N−i change sign and the chain breaks). The exponent k+d−1k+d-1k+d−1 is a natural number, exact because d≥1d \ge 1d≥1; terms with i>Ni > Ni>N vanish since (Ni)=0\binom Ni = 0(iN​)=0.

Preamble
import Mathlib
Formal statement
namespace ScenarioApproach.Removal

theorem binomial_sum_le_exp (N k d : ℕ) (hk : 1 ≤ k) (hd : 1 ≤ d)
    (a : ℝ) (ha : a = 1 + 1 / Real.sqrt k)
    (εk : ℝ) (hε0 : 0 ≤ εk) (hε1 : εk ≤ 1) :
    (∑ i ∈ Finset.range (k + d), (N.choose i : ℝ) * εk ^ i * (1 - εk) ^ (N - i) ≤
        a ^ (k + d - 1) * (1 - (1 - 1 / a) * εk) ^ N) ∧
      (∑ i ∈ Finset.range (k + d), (N.choose i : ℝ) * εk ^ i * (1 - εk) ^ (N - i) ≤
        Real.exp (-(1 - a) * ((k + d - 1 : ℕ) : ℝ)) * Real.exp (-(1 - 1 / a) * εk * N)) := by sorry

end ScenarioApproach.Removal
Source
Campi & Garatti, Introduction to the Scenario Approach, SIAM/MOS 2018, DOI 10.1137/1.9781611975444, p. 47, Eqs. (3.15)–(3.16)
Human review
  • Endorsed by Shuze Chen · Oct 5, 2026

    Confirmed by the moderator at approval.

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