Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 5, proof (p. 7) — the total number of dummy jobs is m − n

Proved
UnrelatedSched.ThreeHalves.dummy_count

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

countingp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1schedulingthree-dimensional-matching

Let T1,…,TmT_1,\dots,T_mT1​,…,Tm​ be an instance of 3-dimensional matching over sets of size nnn, and let tjt_jtj​ be the number of triples containing aja_jaj​. Suppose every aja_jaj​ lies in at least one triple, tj≥1t_j \ge 1tj​≥1 for all jjj. Then the number of dummy jobs of the instance of Theorem 5 is m−nm - nm−n:

∑j=1n(tj−1)+n=m.\sum_{j=1}^{n} (t_j - 1) + n = m.j=1∑n​(tj​−1)+n=m.

The paper notes this in passing ("the total number of dummy jobs is m−nm - nm−n, as before"); it is the count that leaves exactly one machine per type free for element jobs.

Formalization Note The identity is stated as ∑j(tj−1)+n=m\sum_j (t_j - 1) + n = m∑j​(tj​−1)+n=m to avoid subtracting nnn from mmm in the natural numbers; under tj≥1t_j \ge 1tj​≥1 the subtraction tj−1t_j - 1tj​−1 is exact.

Preamble
import Mathlib
import Definitions.Def_UnrelatedSched_ThreeHalves_Theorem5Instance
Formal statement
namespace UnrelatedSched.ThreeHalves

/-- Lenstra, Shmoys, Tardos, CWI Report OS-R8714 (1987), §4, proof of Theorem 5, p. 7: when every
`a_j` lies in at least one triple (`t_j ≥ 1`), the total number `Σ_j (t_j − 1)` of dummy jobs is
`m − n`, stated without subtraction as `Σ_j (t_j − 1) + n = m`. -/
theorem dummy_count {m n : ℕ} (T : Fin m → Fin n × Fin n × Fin n)
    (hT : ∀ j : Fin n, 1 ≤ typeCount T j) :
    (∑ j : Fin n, (typeCount T j - 1)) + n = m := by sorry

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