Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§3, pp. 5–6 — the LP rounding procedure is a 2-relaxed decision procedure

Proved
UnrelatedSched.TwoApprox.lp_procedure_two_relaxed

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

approximation-algorithmslinear-programmingp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1scheduling

Let P=(pij)∈Nm×nP=(p_{ij})\in\mathbb N^{m\times n}P=(pij​)∈Nm×n, let VVV be a vertex selector for PPP (for each d∈Nd\in\mathbb Nd∈N it returns a vertex of (LP) with d1=⋯=dm=t=dd_1=\dots=d_m=t=dd1​=⋯=dm​=t=d, or 'none' exactly when that LP is infeasible), and let DDD be the LP rounding procedure driven by VVV: it answers 'no' at ddd exactly when VVV returns 'none', and otherwise it answers with a schedule supported on the chosen vertex that solves (IP) with d1=⋯=dm=t=dd_1=\dots=d_m=t=dd1​=⋯=dm​=t=d. Then DDD is a 222-relaxed decision procedure: for every d∈Nd\in\mathbb Nd∈N,

  1. if DDD answers with a schedule σ\sigmaσ, then makespan⁡(σ)≤2d\operatorname{makespan}(\sigma)\le 2dmakespan(σ)≤2d;
  2. if DDD answers 'no', then every schedule has makespan greater than ddd.

Together with Lemma 1 this gives the paper's 2-approximation algorithm.

Formalization Note The LP solver's choice of vertex is quantified over through the selector VVV; finding a vertex in polynomial time (the ellipsoid method) is not formalized.

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

/-- §3, pp. 5–6: the LP rounding procedure is a 2-relaxed decision procedure. -/
theorem lp_procedure_two_relaxed {m n : ℕ} (P : Matrix (Fin m) (Fin n) ℕ)
    (V : ℕ → Option (Matrix (Fin m) (Fin n) ℝ)) (hV : IsVertexSelector P V)
    (D : DecisionProcedure m n) (hD : IsLPRoundingProcedure P V D) :
    IsRelaxedDecisionProcedure P 2 D := by sorry

end UnrelatedSched.TwoApprox
Source
Lenstra, Shmoys, Tardos, Approximation algorithms for scheduling unrelated parallel machines, CWI Report OS-R8714 (1987), pp. 5–6, §3
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