Theorem 10.15 — printed Wagner–Whitin start-up hull
DisprovedPochetWolsey.BacklogStartup.ww_startup_hullLet and . Let be the set defined by (10.14)–(10.17), with given . The printed theorem asserts
where is the system (10.11), (10.15), (10.16), , and . This asserts equality of the entire sets in space, including the free nonnegative terminal-stock direction.
The item preserves the printed hull assertion as the source milestone. Finding F1 supplies a counterexample to its missing lower bound on start-ups, so this faithful item is expected to be disproved.
Formalization Note The right-hand side deliberately does not impose . The corrected variant is separate; it does not replace this statement or its milestone.
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 ww_startup_hull {n : ℕ} (y0 : ℝ) (hy0 : y0 = 0 ∨ y0 = 1) (hn : 0 < n) (d : Fin n → ℝ)
(hd : ∀ t, 0 ≤ d t) :
convexHull ℝ (WWStartup y0 d) = PrintedStartupHull y0 d := by sorry
end PochetWolsey.BacklogStartup
Read-back
What the Lean code literally says, in plain math · claude-opus-5-5
Setting. Let:
- ;
- ;
- with every .
Points are , where has coordinates and , have coordinates . Write:
- for , and otherwise;
- and for ;
- .
The set . is the set of points with:
- ;
- every and every in ;
- for every :
- for all :
The set . is the set of points with:
- ;
- every , and no further condition on ;
- for every :
- for all :
Claim. The convex hull (the set of all finite convex combinations, with no closure taken) of , in the real vector space , equals exactly.
Degenerate cases.
- is excluded.
- Both sets are unbounded in , since has no upper bound.
- In , coordinates may be negative. The lower bound can be as low as , so the claim asserts that every such point of is a convex combination of points of , whose -coordinates are all or .
- If , every demand constraint in both sets reduces to .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.