Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

LEMMA 6, p. 335 — in a minimum cost bracket schedule {Aᵢ, Bᵢ} = {T₂ᵢ, T₂ᵢ₋₁}

Proved
GTWSched.NPC.lemma_6

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

earliness-tardinessp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1schedulingsingle-machine

In the special case (tasks T0,…,T2nT_0,\dots,T_{2n}T0​,…,T2n​ with 0<l0<l1<⋯<l2n0<l_0<l_1<\dots<l_{2n}0<l0​<l1​<⋯<l2n​ and common preferred midtime M>∑i=02nliM>\sum_{i=0}^{2n}l_iM>∑i=02n​li​):

LEMMA 6. If S=[An,An−1,…,A1,T0@M,B1,B2,…,Bn]S=[A_n,A_{n-1},\dots,A_1,T_0@M,B_1,B_2,\dots,B_n]S=[An​,An−1​,…,A1​,T0​@M,B1​,B2​,…,Bn​] is a minimum cost schedule, then for every iii, 1≤i≤n1\le i\le n1≤i≤n,

{Ai,Bi}={T2i,T2i−1}.\{A_i,B_i\}=\{T_{2i},T_{2i-1}\}.{Ai​,Bi​}={T2i​,T2i−1​}.

So in an optimal schedule the iii-th tasks on either side of T0T_0T0​ are the iii-th pair of lengths.

Formalization Note The bracket is given by injective maps A B : Fin n → Fin (2n+1) with disjoint ranges avoiding T0T_0T0​ (index 0); for the 0-based k=i−1k=i-1k=i−1 the conclusion is {A k, B k} = {evenTask k, oddTask k}, the indices 2k+22k+22k+2 and 2k+12k+12k+1. The bracket schedule is packed against T0T_0T0​, which is the minimum cost schedule with that order and T0T_0T0​ at MMM.

Preamble
import Mathlib
import Definitions.Def_GTWSched_NPC_Schedules
Formal statement
namespace GTWSched.NPC

/-- LEMMA 6, p. 335: if `[Aₙ, …, A₁, T₀@M, B₁, …, Bₙ]` is a minimum cost schedule, then
`{Aᵢ, Bᵢ} = {T₂ᵢ, T₂ᵢ₋₁}` for every `i` (0-based `i`: the tasks `2i + 2` and `2i + 1`). -/
theorem lemma_6 {n : ℕ} (l : Fin (2 * n + 1) → ℝ) (M : ℝ) (hl0 : 0 < l 0)
    (hmono : StrictMono l) (hM : ∑ i, l i < M) (A B : Fin n → Fin (2 * n + 1))
    (hAB : IsBracket A B) (hmin : IsMinCost l M (centered l M A B)) (i : Fin n) :
    ({A i, B i} : Finset (Fin (2 * n + 1))) = {evenTask i, oddTask i} := by sorry

end GTWSched.NPC
Source
Garey, Tarjan & Wilfong, One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties, Math. Oper. Res. 13 (1988), p. 335, LEMMA 6
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