Section 3.3.1 — at of (1.9) the right-hand side of (3.13) is at most
ProvedScenarioApproach.Removal.removal_bound_at_epsK_lebinomial-tailp2o-batch-b23ap2o-gran-per-chapterp2o-plan-bookp2o-v1scenario-approach
Let , , be natural numbers and , and let be given by formula (1.9):
If , then the right-hand side of (3.13) with in place of is at most :
Combined with Theorem 3.9 this gives Theorem 1.2.
Formalization Note The book does not state the condition ; its derivation (3.15) uses (nonnegativity of ), and for the probabilistic conclusion of Theorem 1.2 is trivial. The ranges , (the formula divides by and by ), and 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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.