Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§2, proof of Theorem 1, p. 5 — at most one fractional job per machine gives loads at most d_i + t

Proved
UnrelatedSched.TwoApprox.rounding_load_bound

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

linear-programmingp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1roundingscheduling

Let P=(pij)∈Nm×nP=(p_{ij})\in\mathbb N^{m\times n}P=(pij​)∈Nm×n, deadlines d1,…,dm∈Rd_1,\dots,d_m\in\mathbb Rd1​,…,dm​∈R and t≥0t\ge 0t≥0. Let x~\tilde xx~ be a feasible solution of (LP), and let σ\sigmaσ be a schedule supported on x~\tilde xx~ (that is, x~σ(j)j>0\tilde x_{\sigma(j)j}>0x~σ(j)j​>0 for every job jjj) such that for each machine iii there is at most one job jjj with σ(j)=i\sigma(j)=iσ(j)=i and x~ij<1\tilde x_{ij}<1x~ij​<1. Then for every machine iii,

∑j:σ(j)=ipij  ≤  ∑j∈Ji(t)pijx~ij+t  ≤  di+t.\sum_{j:\sigma(j)=i}p_{ij}\;\le\;\sum_{j\in J_i(t)}p_{ij}\tilde x_{ij}+t\;\le\; d_i+t .j:σ(j)=i∑​pij​≤j∈Ji​(t)∑​pij​x~ij​+t≤di​+t.

This is the final step of the Rounding Theorem: the rounded schedule is a solution of (IP).

Formalization Note The paper's rounded point xˉ\bar xxˉ is the 0-1 matrix of σ\sigmaσ; "at most one job jjj such that x~ij<xˉij=1\tilde x_{ij}<\bar x_{ij}=1x~ij​<xˉij​=1" is the hypothesis on σ\sigmaσ above. The conclusion is the outer inequality, the load bound. The paper's ttt is a nonnegative integer; the statement takes any real t≥0t\ge 0t≥0.

Preamble
import Mathlib
import Definitions.Def_MatousekLP_Scheduling_Schedule
import Definitions.Def_UnrelatedSched_TwoApprox_DeadlineLP
Formal statement
namespace UnrelatedSched.TwoApprox

open MatousekLP.Scheduling

/-- §2, proof of Theorem 1, p. 5: a schedule supported on a feasible point of (LP) that, on each
machine, has at most one job with `x̃_ij < 1` has loads at most `d_i + t`. -/
theorem rounding_load_bound {m n : ℕ} (P : Matrix (Fin m) (Fin n) ℕ) (d : Fin m → ℝ) (t : ℝ)
    (ht : 0 ≤ t) (x : Matrix (Fin m) (Fin n) ℝ) (hx : LPFeasible P d t x)
    (σ : Fin n → Fin m) (hσ : SupportedOn x σ)
    (hfrac : ∀ i (j₁ j₂ : Fin n), σ j₁ = i → σ j₂ = i → x i j₁ < 1 → x i j₂ < 1 → j₁ = j₂) :
    ∀ i, load (realTimes P) σ i ≤ d i + t := by sorry

end UnrelatedSched.TwoApprox
Source
Lenstra, Shmoys, Tardos, Approximation algorithms for scheduling unrelated parallel machines, CWI Report OS-R8714 (1987), p. 5, §2, proof of Theorem 1
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 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