Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Lemma 6 — every assignment with (13)–(14) for a feasible LP solution has expected makespan at most 4b + 10

Proved
StochLoadBal.Makespan.lemma_6

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

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

Let m≥1m\ge1m≥1, let the sizes Xij≥0X_{ij}\ge0Xij​≥0 be measurable and integrable with the jobs independent, let b≥0b\ge0b≥0, let yyy be a feasible solution of the LP (5)–(9) with parameter bbb, and let σ\sigmaσ be any assignment with properties (13)–(14) (an output of the rounding). Then

E[max⁡i∈[m]∑j∈JiXij] ≤ 4b+10.\mathbb E\Big[\max_{i\in[m]}\sum_{j\in J_i}X_{ij}\Big]\ \le\ 4b+10 .E[i∈[m]max​j∈Ji​∑​Xij​] ≤ 4b+10.

This is the upper-bound half of Theorem 1 at unit scale: whenever the LP is feasible, the rounding returns an assignment of expected makespan O(b)O(b)O(b).

Formalization Note The statement covers every assignment satisfying (13)–(14), not only the one the Shmoys–Tardos algorithm returns; the bound depends only on bbb.

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

open MeasureTheory ProbabilityTheory

/-- Lemma 6 (Bounding the Makespan, p. 12): for `b ≥ 0`, a feasible LP solution `y` and any
assignment `σ` with properties (13)–(14), the expected makespan is at most `4b + 10`. -/
theorem lemma_6 {m n : ℕ} (hm : 1 ≤ m) {Ω : Type} [MeasurableSpace Ω] (P : Measure Ω)
    [IsProbabilityMeasure P] (X : Fin m → Fin n → Ω → ℝ)
    (hmeas : ∀ i j, Measurable (X i j)) (hnn : ∀ i j ω, 0 ≤ X i j ω)
    (hint : ∀ i j, Integrable (X i j) P) (hind : iIndepFun (fun j ω i => X i j ω) P)
    (b : ℝ) (hb : 0 ≤ b) (y : Fin m → Fin n → ℝ) (hy : LPFeasible P X b y)
    (σ : Fin n → Fin m) (hσ : IsRoundingOutput P X b y σ) :
    expMakespan P X σ ≤ 4 * b + 10 := by sorry

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