Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 2.1 — Canonical completion times form an interval

Proved
LawlerCompress.TardyJobs.lemma_2_1

by mikedeng1 · Nov 11, 2026 · Mathlib 0df444a (Lean v4.33.1)

dynamic-programmingoperations-researchp2o-batch-stoc27ap2o-gran-per-chapterp2o-plan-paperp2o-v1scheduling

Let I be an EDD instance on m≥1 machines with n≥1 jobs. For every input job j, the canonical endpoint a_j satisfies

pj≤aj≤dj+1,Cˉj={aj,aj+1,…,dj},Cˉj=∅⟹aj=dj+1.p_j\le a_j\le d_j+1,\qquad\bar C_j=\{a_j,a_j+1,\ldots,d_j\},\qquad\bar C_j=\varnothing\Longrightarrow a_j=d_j+1.pj​≤aj​≤dj​+1,Cˉj​={aj​,aj​+1,…,dj​},Cˉj​=∅⟹aj​=dj​+1.

Here priority is weight followed by larger index, and a_j is computed as the least canonical time with the stated empty-set default. This identifies the interval that the later algorithm enumerates.

Formalization Note The endpoint is a shared definition, not an arbitrary witness chosen separately in each theorem.

Differences from the source:

  • encoding: jobs and machines numbered from one; positive integral data; a nonempty input with a maximum due date → Fin n jobs and Fin m machines, natural data in Instance, with m,n ≥ 1; reason: zero-based reindexing preserves every schedule and excludes only the undefined empty maximum
Preamble
import Definitions.Def_LawlerCompress_TardyJobs_Canonical

set_option autoImplicit false
Formal statement
namespace LawlerCompress.TardyJobs

theorem lemma_2_1 {m : ℕ} (hm : 1 ≤ m) (I : Instance m)
    (hn : 1 ≤ I.n) (hedd : EDD I) (j : Fin I.n) :
    I.p j ≤ a I j ∧ a I j ≤ I.d j + 1 ∧
    cbar I j = Finset.Icc (a I j) (I.d j) ∧
    (cbar I j = ∅ → a I j = I.d j + 1) := by sorry

end LawlerCompress.TardyJobs
Source
Klaus Jansen, Björn Schumacher, Corinna Wambsganz, Compressing the Lawler-Moore Dynamic Program for Weighted Tardy Jobs, STOC 2027 submission #354 (October 2026), p. 4, Lemma 2.1
Human review
  • Endorsed by Shuze Chen · Nov 12, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Nov 12, 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