Section 2 — implies
ProvedLawlerMoore.PrecDeadline.rho_imp_modifiedDeadline_ltLet jobs carry real deadlines , and let be a transitive precedence relation on them (: job must precede job ). Assume the jobs are numbered so that implies . Let and let be the modified deadlines. Then for any two distinct jobs ,
So ordering jobs by increasing modified deadline never places a job before one of its required predecessors; this is what makes the sequence of the §2 Theorem consistent with the precedence constraints.
Formalization Note The paper's relation is a partial order, hence reflexive; "" in this sentence means that must precede , so the statement is made for (for it would read ). Only transitivity, the numbering and are used, so only these are assumed; the paper's " is a small number" is read as here (smallness is not needed for this claim). Jobs are Fin n, 0-based.
import Mathlib import Definitions.Def_LawlerMoore_PrecDeadline_modifiedDeadline
namespace LawlerMoore.PrecDeadline
theorem rho_imp_modifiedDeadline_lt (n : ℕ) (d : Fin n → ℝ)
(ρ : Fin n → Fin n → Prop) [DecidableRel ρ]
(htrans : ∀ i j k, ρ i j → ρ j k → ρ i k)
(hnum : ∀ i j, ρ i j → i ≤ j)
(ε : ℝ) (hε : 0 < ε) :
∀ i j, i ≠ j → ρ i j → modifiedDeadline ρ d ε i < modifiedDeadline ρ d ε j := by sorry
end LawlerMoore.PrecDeadline
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.