Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Observation 1 — the class loop classifies every machine within m iterations, and at most ℓ machines have class at most ℓ

Proved
StochLoadBal.Makespan.observation_1

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

linear-programmingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1roundingstochastic-scheduling

Let m≥1m\ge1m≥1 and let yyy be a feasible solution of the LP (5)–(9) with parameter bbb. Run the class loop of §3.2 on yyy. Then

  1. the loop terminates within mmm iterations, so every machine iii receives a class ℓi\ell_iℓi​ with 1≤ℓi≤m1\le \ell_i\le m1≤ℓi​≤m;
  2. for every ℓ\ellℓ,
#{i∈[m]: ℓi≤ℓ} ≤ ℓ.\#\{i\in[m]:\ \ell_i\le \ell\}\ \le\ \ell .#{i∈[m]: ℓi​≤ℓ} ≤ ℓ.

The second part is the counting fact behind the union bound of Lemma 7: few machines have a small class, and machines of a large class ℓ\ellℓ have a tail probability ℓ−α\ell^{-\alpha}ℓ−α.

Formalization Note "Terminates in at most mmm iterations" is stated as: the loop, run with fuel mmm, leaves no machine with the junk class 000. The second part is stated for every natural number ℓ\ellℓ; it says nothing new for ℓ>m\ell>mℓ>m and, for ℓ=0\ell=0ℓ=0, repeats that every machine is classified.

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

open MeasureTheory ProbabilityTheory

/-- Observation 1 (p. 11): for a feasible LP solution `y`, the class loop classifies every
machine within its `m` iterations (every class lies in `1, …, m`), and for every `ℓ` at most
`ℓ` machines have class at most `ℓ`. -/
theorem observation_1 {m n : ℕ} (hm : 1 ≤ m) {Ω : Type} [MeasurableSpace Ω] (P : Measure Ω)
    (X : Fin m → Fin n → Ω → ℝ) (b : ℝ) (y : Fin m → Fin n → ℝ)
    (hy : LPFeasible P X b y) :
    (∀ i, 1 ≤ machineClass P X b y i ∧ machineClass P X b y i ≤ m) ∧
    ∀ ℓ : ℕ, (Finset.univ.filter (fun i => machineClass P X b y i ≤ ℓ)).card ≤ ℓ := by sorry

end StochLoadBal.Makespan
Source
Gupta, Kumar, Nagarajan & Shen, Stochastic Load Balancing on Unrelated Machines, arXiv:1904.07271v1, p. 11, Observation 1
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