Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 10 — two-sided multiplicative Chernoff bound

Proved
BayesOptStop.Scheme.lemma_10

by Shuze Chen · Nov 9, 2026 · Mathlib 0df444a (Lean v4.33.1)

concentrationp2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1probability

Let Y1,…,YnY_1,\dots,Y_nY1​,…,Yn​ be independent random variables with values in [0,1][0,1][0,1] and Yˉ=1n∑iYi\bar Y=\frac1n\sum_iY_iYˉ=n1​∑i​Yi​. For every θ∈[0,1]\theta\in[0,1]θ∈[0,1],

Pr⁡[∣Yˉ−EYˉ∣>θ EYˉ]≤2exp⁡ ⁣(−θ2n EYˉ/3).\Pr\big[|\bar Y-\mathbb E\bar Y|>\theta\,\mathbb E\bar Y\big]\le2\exp\!\big(-\theta^2n\,\mathbb E\bar Y/3\big).Pr[∣Yˉ−EYˉ∣>θEYˉ]≤2exp(−θ2nEYˉ/3).

Differences from the source:

  • encoding: independent random variables taking values in [0,1] → measurable Y i : Ω → ℝ on a probability space, iIndepFun, Y i x ∈ [0,1] at every point; reason: Lean convention; the same instances
  • generalization: n ≥ 1 implicit → n : ℕ unrestricted; at n = 0, Ȳ = 0 and the bound holds trivially; reason: the positive-sample-size statement is unchanged; the extra empty family has zero average and an empty deviation event
Preamble
import Mathlib

open MeasureTheory ProbabilityTheory
Formal statement
namespace BayesOptStop.Scheme

/-- **Lemma 10** (multiplicative Chernoff bound; AmaniHamedani, Aouad, Işık, Kesselheim, Saberi
2026, held STOC 2027 submission, SHA-256 fecfa05a…c4241, App. D.1, p. 51): for independent
`Y_1, …, Y_n` with values in `[0,1]` and `Ȳ = (1/n) ∑ Y_i`, for every `θ ∈ [0,1]`,
`Pr[|Ȳ - E Ȳ| > θ E Ȳ] ≤ 2 exp(-θ² n E Ȳ / 3)`. -/
theorem lemma_10 {Ω : Type*} [MeasurableSpace Ω] (P : Measure Ω) [IsProbabilityMeasure P]
    (n : ℕ) (Y : Fin n → Ω → ℝ) (hmeas : ∀ i, Measurable (Y i)) (hind : iIndepFun Y P)
    (hrange : ∀ i x, Y i x ∈ Set.Icc (0 : ℝ) 1) (θ : ℝ) (hθ0 : 0 ≤ θ) (hθ1 : θ ≤ 1) :
    P.real {x | θ * (∫ y, (∑ i, Y i y) / n ∂P) <
        |(∑ i, Y i x) / n - ∫ y, (∑ i, Y i y) / n ∂P|} ≤
      2 * Real.exp (-(θ ^ 2 * n * ∫ y, (∑ i, Y i y) / n ∂P) / 3) := by sorry

end BayesOptStop.Scheme
Source
AmaniHamedani, Aouad, Işık, Kesselheim, Saberi (2026), Bayesian Optimal Stopping: Invincible Prophets and Achievable Philosophers, held STOC 2027 submission, SHA-256 fecfa05a3285ac21a7efbed099d2afed88a382dfcc9d91836b6e5210d70c4241, Lemma 10, App. D.1, p. 51
Human review
  • Endorsed by Community (Bot) · Nov 10, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Shuze Chen · Nov 10, 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