Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 4 — truncated items lower bound: Σ_j β_m(X_j) ≥ 17m forces expected makespan ≥ c₁

Proved
StochLoadBal.Makespan.lemma_4

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

effective-sizeexpected-maximump2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1stochastic-scheduling

There is an absolute constant c1>0c_1>0c1​>0 with the following property. Let m≥1m\ge1m≥1, let X1,…,XnX_1,\dots,X_nX1​,…,Xn​ be independent random variables with values in [0,1][0,1][0,1], and let {Ji}i=1m\{J_i\}_{i=1}^m{Ji​}i=1m​ be any partition of [n][n][n] (given by an assignment σ:[n]→[m]\sigma:[n]\to[m]σ:[n]→[m], Ji=σ−1(i)J_i=\sigma^{-1}(i)Ji​=σ−1(i)). If

∑j=1nβm(Xj) ≥ 17 m,\sum_{j=1}^n \beta_m(X_j)\ \ge\ 17\,m,j=1∑n​βm​(Xj​) ≥ 17m,

then

E[max⁡i∈[m]∑j∈JiXj] ≥ c1.\mathbb E\Big[\max_{i\in[m]}\sum_{j\in J_i}X_j\Big]\ \ge\ c_1 .E[i∈[m]max​j∈Ji​∑​Xj​] ≥ c1​.

Here βm\beta_mβm​ is the effective size of Definition 1 (with β1=E\beta_1=\mathbb Eβ1​=E). Lemma 4 is the lower bound for truncated parts; applied to the machines of a subset KKK with k=∣K∣k=|K|k=∣K∣, it yields the constraints (4) and (8) on every subset of machines.

Formalization Note The page's conclusion "=Ω(1)=\Omega(1)=Ω(1)" is written as an explicit constant c1>0c_1>0c1​>0 quantified before everything else, so it does not depend on mmm, nnn or the distributions. The machines are identical here (job jjj has size XjX_jXj​ on every machine).

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

open MeasureTheory ProbabilityTheory

/-- Lemma 4 (Truncated Items Lower Bound, p. 7), with the `Ω(1)` made an absolute constant `c₁`:
for independent `[0, 1]`-valued `X_1, …, X_n` and any partition `{J_i}` of the jobs among `m`
machines (here `J_i = {j | σ j = i}`), if `Σ_j β_m(X_j) ≥ 17 m` then
`E[max_i Σ_{j ∈ J_i} X_j] ≥ c₁`. -/
theorem lemma_4 :
    ∃ c₁ : ℝ, 0 < c₁ ∧
      ∀ (m n : ℕ), 1 ≤ m →
      ∀ (Ω : Type) [MeasurableSpace Ω] (P : Measure Ω) [IsProbabilityMeasure P]
        (X : Fin n → Ω → ℝ),
        (∀ j, Measurable (X j)) → iIndepFun X P →
        (∀ j ω, 0 ≤ X j ω ∧ X j ω ≤ 1) →
        ∀ σ : Fin n → Fin m,
          17 * (m : ℝ) ≤ ∑ j, effSize P m (X j) →
          c₁ ≤ expMakespan P (fun _ : Fin m => X) σ := by sorry

end StochLoadBal.Makespan
Source
Gupta, Kumar, Nagarajan & Shen, Stochastic Load Balancing on Unrelated Machines, arXiv:1904.07271v1, p. 7, Lemma 4 (proof pp. 7–8)
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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me