Observation 10.3 — detecting an interval with no setups
ProvedPochetWolsey.BacklogStartup.no_setup_intervalLet be an exact binary setup and start-up plan satisfying (10.5)–(10.8), with given . For periods ,
Thus an initial setup and the subsequent start-ups together detect whether any setup occurs in the interval. This observation underlies the stock inequalities used in the joint formulation.
Initial-state convention: the parameter y0 is the same fixed binary datum in every feasible set in this item (printed p. 138 / PDF 155); it is not optimized.
import Mathlib import Definitions.Def_PochetWolsey_BacklogStartup_StartupModel
namespace PochetWolsey.BacklogStartup
theorem no_setup_interval {n : ℕ} (y0 : ℝ) (hy0 : y0 = 0 ∨ y0 = 1) (y z : Fin n → ℝ) (h : ExactStartup y0 y z)
(k t : ℕ) (hk : 1 ≤ k) (hkt : k < t) (ht : t ≤ n) :
(period y k + ∑ j ∈ Finset.Icc (k + 1) t, period z j) = 0 ↔
∀ j ∈ Finset.Icc k t, period y j = 0 := by sorry
end PochetWolsey.BacklogStartup
Read-back
What the Lean code literally says, in plain math · claude-opus-5-5
Setting. Let and let be a real number with or . Let , with coordinates and . Write:
- for , and otherwise;
- and for .
Hypotheses on and . Assume the exact startup conditions:
- every ;
- every ;
- for every :
Claim. Let with . Then
All indices involved lie in , so no zero-extension values enter.
Degenerate cases.
- The hypotheses force . For , no such exist and the statement is vacuous.
- The interval has at least two periods, so the sum on the left contains at least one -term.
- The value of enters only through the hypotheses at , and in particular through the constraint on . Since , never appears in the sum.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.