Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Effective-size facts (proofs of Observation 2 and Lemma 6, p. 12) — 0 ≤ β_k(Y) ≤ 1 for Y ∈ [0,1], and β_k(Y) ≥ E[Y]

Proved
StochLoadBal.Makespan.effSize_facts

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

effective-sizejensen-inequalityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let k≥1k\ge1k≥1 be an integer.

  1. If YYY is a random variable with values in [0,1][0,1][0,1], then
0 ≤ βk(Y) ≤ 1.0\ \le\ \beta_k(Y)\ \le\ 1 .0 ≤ βk​(Y) ≤ 1.
  1. If YYY is integrable and E[e(log⁡k)Y]<∞\mathbb E\big[e^{(\log k)Y}\big]<\inftyE[e(logk)Y]<∞, then
E[Y] ≤ βk(Y).\mathbb E[Y]\ \le\ \beta_k(Y).E[Y] ≤ βk​(Y).

Part 1 applied to truncated parts gives pmax⁡=max⁡i,jpij≤1p_{\max}=\max_{i,j}p_{ij}\le1pmax​=maxi,j​pij​≤1 in Observation 2; part 2 (Jensen's inequality) gives E[Ti]≤b+1\mathbb E[T_i]\le b+1E[Ti​]≤b+1 for the truncated load of each machine in the proof of Lemma 6.

Formalization Note The page calls Jensen's inequality "for concave functions"; the inequality used is Theorem 5 for the convex function exp⁡\expexp. For k=1k=1k=1, β1=E\beta_1=\mathbb Eβ1​=E and part 2 is an equality.

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

open MeasureTheory ProbabilityTheory

/-- The two effective-size facts used in the proofs of Observation 2 and Lemma 6 (p. 12), for
`k ≥ 1`: (a) a random variable `Y` with values in `[0, 1]` has `0 ≤ β_k(Y) ≤ 1`;
(b) every integrable `Y` with `E[e^{(log k) Y}] < ∞` has `E[Y] ≤ β_k(Y)` (Jensen). -/
theorem effSize_facts {Ω : Type} [MeasurableSpace Ω] (P : Measure Ω) [IsProbabilityMeasure P]
    (k : ℕ) (hk : 1 ≤ k) :
    (∀ Y : Ω → ℝ, Measurable Y → (∀ ω, 0 ≤ Y ω ∧ Y ω ≤ 1) →
      0 ≤ effSize P k Y ∧ effSize P k Y ≤ 1) ∧
    (∀ Y : Ω → ℝ, Measurable Y → Integrable Y P →
      Integrable (fun ω => Real.exp (Real.log k * Y ω)) P →
      ∫ ω, Y ω ∂P ≤ effSize P k Y) := by sorry

end StochLoadBal.Makespan
Source
Gupta, Kumar, Nagarajan & Shen, Stochastic Load Balancing on Unrelated Machines, arXiv:1904.07271v1, p. 12, proof of Observation 2 and proof of Lemma 6 (unnumbered)
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