Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§5, proof of Theorem 7 — each qqq-dimensional matching gives a schedule with makespan pqpqpq

Proved
UnrelatedSched.TwoTimes.matching_gives_schedule

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

makespanmatchingp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1reductionscheduling

Let UUU be a ground set of qnqnqn elements and S1,…,SmS_1,\dots,S_mS1​,…,Sm​ subsets of UUU with ∣Si∣=q|S_i|=q∣Si​∣=q for every iii. Consider the scheduling instance of Theorem 7: mmm machines, qnqnqn element jobs and p(m−n)p(m-n)p(m−n) dummy jobs, where an element job takes ppp time units on a machine whose tuple contains its element and qqq time units otherwise, and every dummy job takes qqq time units everywhere. If the family has a matching, that is, nnn of the tuples whose union is UUU, then there is a schedule σ\sigmaσ with

Cmax⁡(σ)≤pq.C_{\max}(\sigma)\le pq .Cmax​(σ)≤pq.

This is the easy direction of the reduction in Theorem 7.

Formalization Note The statement holds for all natural numbers ppp, qqq; the standing assumptions 0<p<q0<p<q0<p<q and gcd⁡(p,q)=1\gcd(p,q)=1gcd(p,q)=1 of Theorem 7 are not needed for this direction and are omitted, which makes the statement stronger. Schedules, loads and the makespan are those of MatousekLP.Scheduling.Schedule, with the natural-number processing times cast to reals.

Preamble
import Mathlib
import Definitions.Def_MatousekLP_Scheduling_Schedule
import Definitions.Def_UnrelatedSched_TwoTimes_Theorem7Instance

open MatousekLP.Scheduling
Formal statement
namespace UnrelatedSched.TwoTimes

/-- §5, proof of Theorem 7, p. 9 (Lenstra, Shmoys, Tardos, CWI Report OS-R8714 (1987)): "for each
matching there is a schedule with makespan pq". If the family `S` of `q`-subsets of the ground set
`Fin (q * n)` has a matching `F'`, the scheduling instance `twoTimes p q n S` has a schedule whose
makespan is at most `p * q`. -/
theorem matching_gives_schedule (p q : ℕ) {m n : ℕ} (S : Fin m → Finset (Fin (q * n)))
    (hS : ∀ i, (S i).card = q) (F' : Finset (Fin m)) (hF' : IsQMatching S F') :
    ∃ σ : Fin (q * n + p * (m - n)) → Fin m,
      makespan (fun i j => (twoTimes p q n S i j : ℝ)) σ ≤ (p * q : ℝ) := by sorry

end UnrelatedSched.TwoTimes
Source
Lenstra, Shmoys, Tardos, Approximation algorithms for scheduling unrelated parallel machines, CWI Report OS-R8714 (1987), pp. 8-9, §5, proof of Theorem 7 ("It is trivial to see that for each matching there is a schedule with makespan pq.")
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