Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Section 2, proof of the Theorem — if dˉj<dˉi\bar d_j < \bar d_idˉj​<dˉi​, then jjj or a successor of jjj has a deadline at least as early as iii's

Proved
LawlerMoore.PrecDeadline.exists_successor_deadline_le

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

deadlinesp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1precedence-constraintsscheduling

Let nnn jobs carry real deadlines d1,…,dnd_1,\dots,d_nd1​,…,dn​, let ρ\rhoρ be a precedence relation, and let dˉj=min⁡{dk∣k=j or jρk}+jε\bar d_j = \min\{d_k \mid k = j \text{ or } j\rho k\} + j\varepsilondˉj​=min{dk​∣k=j or jρk}+jε be the modified deadlines. Assume ε\varepsilonε is a small positive number in the sense

ε>0andnε<dl−dk  whenever dk<dl,\varepsilon > 0 \quad\text{and}\quad n\varepsilon < d_l - d_k \ \text{ whenever } d_k < d_l ,ε>0andnε<dl​−dk​  whenever dk​<dl​,

i.e. nεn\varepsilonnε is smaller than every positive difference between two deadlines. Then for any jobs i,ji, ji,j with dˉj<dˉi\bar d_j < \bar d_idˉj​<dˉi​ there is a job kkk that is jjj itself or a successor of jjj (jρkj\rho kjρk) with

dk≤di.d_k \le d_i .dk​≤di​.

In the proof of the §2 Theorem this is what allows two adjacent jobs i,ji, ji,j with dˉi>dˉj\bar d_i > \bar d_jdˉi​>dˉj​ to be interchanged without making iii late.

Formalization Note The paper states this for a consecutive pair i,ji, ji,j of a sequence; the claim does not depend on the sequence, so it is stated for any two jobs. The paper's "ε\varepsilonε is a small number" is made explicit as the displayed condition; it is needed here (with a large ε\varepsilonε the tie-breaking term can outweigh a difference of deadlines). No property of ρ\rhoρ is used, because the definition of dˉj\bar d_jdˉj​ already counts jjj among its own successors. Jobs are Fin n, 0-based.

Preamble
import Mathlib
import Definitions.Def_LawlerMoore_PrecDeadline_modifiedDeadline
Formal statement
namespace LawlerMoore.PrecDeadline

theorem exists_successor_deadline_le (n : ℕ) (d : Fin n → ℝ)
    (ρ : Fin n → Fin n → Prop) [DecidableRel ρ]
    (ε : ℝ) (hε : 0 < ε) (hgap : ∀ k k', d k < d k' → (n : ℝ) * ε < d k' - d k)
    (i j : Fin n) (hlt : modifiedDeadline ρ d ε j < modifiedDeadline ρ d ε i) :
    ∃ k, (k = j ∨ ρ j k) ∧ d k ≤ d i := by sorry

end LawlerMoore.PrecDeadline
Source
Lawler, Moore, A Functional Equation and Its Application to Resource Allocation and Sequencing Problems, Management Sci. 16 (1969), p. 78, Section 2, proof of the Theorem
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