Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 5, proof (p. 8) — a schedule of makespan at most 2 yields a 3-dimensional matching

Proved
UnrelatedSched.ThreeHalves.makespan_two_gives_matching

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

p2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1reductionschedulingthree-dimensional-matching

Let T1,…,TmT_1,\dots,T_mT1​,…,Tm​ be an instance of 3-dimensional matching over sets of size nnn, and consider the scheduling instance of Theorem 5 built from it. If some schedule σ\sigmaσ of this instance has

Cmax⁡(σ)≤2,C_{\max}(\sigma) \le 2,Cmax​(σ)≤2,

then the matching instance has a matching.

This is the "only if" half of the reduction of Theorem 5.

Formalization Note No assumption tj≥1t_j \ge 1tj​≥1 is made: when some aja_jaj​ lies in no triple there is no schedule of makespan at most 2 (and no matching), so the implication holds in that case as well.

Preamble
import Mathlib
import Definitions.Def_MatousekLP_Scheduling_Schedule
import Definitions.Def_UnrelatedSched_ThreeHalves_ThreeDimMatching
import Definitions.Def_UnrelatedSched_ThreeHalves_Theorem5Instance

open MatousekLP.Scheduling
Formal statement
namespace UnrelatedSched.ThreeHalves

/-- Lenstra, Shmoys, Tardos, CWI Report OS-R8714 (1987), §4, proof of Theorem 5, p. 8 (converse):
if the scheduling instance of Theorem 5 built from `T` has a schedule with makespan at most `2`,
then `T` has a matching. -/
theorem makespan_two_gives_matching {m n : ℕ} (T : Fin m → Fin n × Fin n × Fin n)
    (σ : Fin (numJobs T) → Fin m) (hσ : makespan (fun i r => (P T i r : ℝ)) σ ≤ 2) :
    HasMatching T := by sorry

end UnrelatedSched.ThreeHalves
Source
Lenstra, Shmoys, Tardos, Approximation algorithms for scheduling unrelated parallel machines, CWI Report OS-R8714 (1987), p. 8, Section 4, proof of Theorem 5
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