Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Section 3.3.1 — at ε=εk\varepsilon = \varepsilon_kε=εk​ of (1.9) the right-hand side of (3.13) is at most β\betaβ

Proved
ScenarioApproach.Removal.removal_bound_at_epsK_le

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

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

Let N≥1N \ge 1N≥1, k≥1k \ge 1k≥1, d≥1d \ge 1d≥1 be natural numbers and β∈(0,1)\beta \in (0,1)β∈(0,1), and let εk\varepsilon_kεk​ be given by formula (1.9):

εk=kN+[kN+k+1N((d−1)ln⁡(k+d−1)+d−1k+ln⁡1β)].\varepsilon_k = \frac{k}{N} + \left[ \frac{\sqrt k}{N} + \frac{\sqrt k + 1}{N}\left( (d-1)\ln(k+d-1) + \frac{d-1}{\sqrt k} + \ln\frac1\beta \right) \right].εk​=Nk​+[Nk​​+Nk​+1​((d−1)ln(k+d−1)+k​d−1​+lnβ1​)].

If εk≤1\varepsilon_k \le 1εk​≤1, then the right-hand side of (3.13) with εk\varepsilon_kεk​ in place of ε\varepsilonε is at most β\betaβ:

(k+d−1k)∑i=0k+d−1(Ni)εki(1−εk)N−i≤β.\binom{k+d-1}{k} \sum_{i=0}^{k+d-1} \binom Ni \varepsilon_k^i (1-\varepsilon_k)^{N-i} \le \beta.(kk+d−1​)i=0∑k+d−1​(iN​)εki​(1−εk​)N−i≤β.

Combined with Theorem 3.9 this gives Theorem 1.2.

Formalization Note The book does not state the condition εk≤1\varepsilon_k \le 1εk​≤1; its derivation (3.15) uses 0≤εk≤10 \le \varepsilon_k \le 10≤εk​≤1 (nonnegativity of (1−εk)N−i(1-\varepsilon_k)^{N-i}(1−εk​)N−i), and for εk>1\varepsilon_k > 1εk​>1 the probabilistic conclusion of Theorem 1.2 is trivial. The ranges N≥1N \ge 1N≥1, k≥1k \ge 1k≥1 (the formula divides by NNN and by k\sqrt kk​), d≥1d \ge 1d≥1 and β∈(0,1)\beta \in (0,1)β∈(0,1) are those of the page.

Preamble
import Mathlib
import Definitions.Def_ScenarioApproach_Removal_epsK
Formal statement
namespace ScenarioApproach.Removal

theorem removal_bound_at_epsK_le (N k d : ℕ) (hk : 1 ≤ k) (hd : 1 ≤ d) (hN : 1 ≤ N)
    (β : ℝ) (hβ0 : 0 < β) (hβ1 : β < 1) (hε1 : epsK N k d β ≤ 1) :
    ((k + d - 1).choose k : ℝ) * ∑ i ∈ Finset.range (k + d),
      (N.choose i : ℝ) * epsK N k d β ^ i * (1 - epsK N k d β) ^ (N - i) ≤ β := by sorry

end ScenarioApproach.Removal
Source
Campi & Garatti, Introduction to the Scenario Approach, SIAM/MOS 2018, DOI 10.1137/1.9781611975444, pp. 47–48, Section 3.3.1 (opening sentence and Eq. (3.18))
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