Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 1, second sentence, corrected — if the LP (5)–(9) with b = 17 is infeasible, every expected makespan exceeds c₀ (polynomial-time solvability not formalized)

Proved
StochLoadBal.Makespan.proposition_1

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

linear-programminglower-boundp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1stochastic-scheduling

There is an absolute constant c0>0c_0>0c0​>0 with the following property. For every instance of stochastic load balancing on m≥1m\ge1m≥1 unrelated machines (sizes Xij≥0X_{ij}\ge0Xij​≥0 measurable and integrable, jobs independent), if the linear program (5)–(9) with b=17b=17b=17 has no feasible solution, then every assignment σ\sigmaσ has

E[max⁡i∈[m]∑j∈JiXij] > c0.\mathbb E\Big[\max_{i\in[m]}\sum_{j\in J_i}X_{ij}\Big]\ >\ c_0 .E[i∈[m]max​j∈Ji​∑​Xij​] > c0​.

Infeasibility of the LP is the lower-bound certificate of the algorithm: at scale MMM (sizes divided by MMM) it certifies that the optimal expected makespan exceeds c0Mc_0 Mc0​M.

Formalization Note Corrected: the page has 111 in place of c0c_0c0​, which inherits the error of Lemma 5 (3). The first sentence of the proposition (the LP is solvable in polynomial time) is not formalized; the mission has no model of running time.

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

open MeasureTheory ProbabilityTheory

/-- Proposition 1 (Lower Bound via LP, p. 10), second sentence, corrected: there is an absolute
constant `c₀ > 0` such that, if the LP (5)–(9) with `b = 17` is infeasible, then every
assignment has expected makespan more than `c₀` (the page has `1` in place of `c₀`). -/
theorem proposition_1 :
    ∃ c₀ : ℝ, 0 < c₀ ∧
      ∀ (m n : ℕ), 1 ≤ m →
      ∀ (Ω : Type) [MeasurableSpace Ω] (P : Measure Ω) [IsProbabilityMeasure P]
        (X : Fin m → Fin n → Ω → ℝ),
        (∀ i j, Measurable (X i j)) → (∀ i j ω, 0 ≤ X i j ω) →
        (∀ i j, Integrable (X i j) P) → iIndepFun (fun j ω i => X i j ω) P →
        (¬ ∃ y : Fin m → Fin n → ℝ, LPFeasible P X 17 y) →
        ∀ σ : Fin n → Fin m, c₀ < expMakespan P X σ := by sorry

end StochLoadBal.Makespan
Source
Gupta, Kumar, Nagarajan & Shen, Stochastic Load Balancing on Unrelated Machines, arXiv:1904.07271v1, p. 10, Proposition 1 (second sentence)
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