Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Lemma 2 — effective-size Chernoff bound: Σ_i β_k(Y_i) ≤ b implies Pr[Σ_i Y_i ≥ c] ≤ (1/k)^(c−b)

Proved
StochLoadBal.Makespan.lemma_2

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

chernoff-boundconcentrationeffective-sizep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let k≥2k\ge2k≥2 be an integer and let Y1,…,YnY_1,\dots,Y_nY1​,…,Yn​ be independent real random variables with E[e(log⁡k)Yi]<∞\mathbb E\big[e^{(\log k)Y_i}\big]<\inftyE[e(logk)Yi​]<∞. If

∑i=1nβk(Yi) ≤ b,\sum_{i=1}^n \beta_k(Y_i)\ \le\ b,i=1∑n​βk​(Yi​) ≤ b,

then for every real ccc,

Pr⁡[∑i=1nYi ≥ c] ≤ (1k)c−b.\Pr\Big[\sum_{i=1}^n Y_i\ \ge\ c\Big]\ \le\ \Big(\frac1k\Big)^{c-b}.Pr[i=1∑n​Yi​ ≥ c] ≤ (k1​)c−b.

This is the upper-bound property of effective sizes: a total effective size at most bbb makes a load above b+αb+\alphab+α have probability at most k−αk^{-\alpha}k−α. It gives the per-machine tail bound of Observation 3.

Formalization Note The lemma is stated for integers k≥2k\ge2k≥2, where Definition 1's formula applies; for k=1k=1k=1 the right side is 111 and the statement is empty. The exponential-moment hypothesis makes βk(Yi)\beta_k(Y_i)βk​(Yi​) the logarithm of a finite moment generating function rather than a junk value.

Preamble
import Mathlib
import Definitions.Def_StochLoadBal_Makespan_Model
Formal statement
namespace StochLoadBal.Makespan

open MeasureTheory ProbabilityTheory

/-- Lemma 2 (Upper Bound, p. 6): for an integer `k ≥ 2` and independent random variables
`Y_1, …, Y_n` with finite exponential moments `E[e^{(log k) Y_i}]`, if `Σ_i β_k(Y_i) ≤ b` then
`Pr[Σ_i Y_i ≥ c] ≤ (1/k)^{c - b}` for every real `c`. -/
theorem lemma_2 {Ω : Type} [MeasurableSpace Ω] (P : Measure Ω) [IsProbabilityMeasure P]
    (n : ℕ) (Y : Fin n → Ω → ℝ) (hmeas : ∀ i, Measurable (Y i)) (hind : iIndepFun Y P)
    (k : ℕ) (hk : 2 ≤ k)
    (hint : ∀ i, Integrable (fun ω => Real.exp (Real.log k * Y i ω)) P)
    (b c : ℝ) (hb : ∑ i, effSize P k (Y i) ≤ b) :
    (P {ω | c ≤ ∑ i, Y i ω}).toReal ≤ (1 / (k : ℝ)) ^ (c - b) := by sorry

end StochLoadBal.Makespan
Source
Gupta, Kumar, Nagarajan & Shen, Stochastic Load Balancing on Unrelated Machines, arXiv:1904.07271v1, p. 6, Lemma 2
Human review
  • Endorsed by Shuze Chen · Oct 20, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 20, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me