Theorem 7.5 — complete uncapacitated lot-sizing hull
DisprovedPochetWolsey.Reformulation.ls_u_hullLet and . Fix with . Let be the continuous relaxation defined by , , , , and
Let be the subset with binary setups. Write . Then
This is a complete description in the original production, stock, and setup variables, independent of any particular objective.
Formalization Note This is the faithful literal reading of the displayed domain (7.4), which prints without a nonnegativity subscript, and defines by those constraints on p. 209. It is expected to be disproved: FINDINGS.yaml records the two-period counterexample and the companion corrected item restores , as in (4.5) and (7.47). The claim is preserved rather than silently repaired. Fin n shifts production indices down by one; stocks retain their boundary indices. “Large” means and .
import Mathlib
namespace PochetWolsey.Reformulation
theorem ls_u_hull
(n : ℕ) (hn : 0 < n) (d : Fin n → ℝ) (hd : ∀ t, 0 ≤ d t)
(M : ℝ) (hM : 0 < M) (hlarge : (∑ t, d t) ≤ M) :
let P : Set ((Fin n → ℝ) × (Fin (n + 1) → ℝ) × (Fin n → ℝ)) :=
{z | z.2.1 0 = 0 ∧ z.2.1 (Fin.last n) = 0 ∧
(∀ k, 0 ≤ z.2.1 k) ∧
(∀ t, 0 ≤ z.2.2 t ∧ z.2.2 t ≤ 1 ∧
z.2.1 t.castSucc + z.1 t = d t + z.2.1 t.succ ∧
z.1 t ≤ M * z.2.2 t)}
let X := {z | z ∈ P ∧ ∀ t, z.2.2 t = 0 ∨ z.2.2 t = 1}
convexHull ℝ X =
{z | z ∈ P ∧ ∀ (l : Fin n) (S : Finset (Fin n)),
(∀ j ∈ S, j ≤ l) →
(∑ j ∈ S, z.1 j) ≤
(∑ j ∈ S, (∑ k ∈ Finset.Icc j l, d k) * z.2.2 j) + z.2.1 l.succ} := by sorry
end PochetWolsey.Reformulation
Read-back
What the Lean code literally says, in plain math · claude-opus-5-5
Data. Fix a natural number with , a real vector indexed by periods , and a real number . The hypotheses are for all , , and .
Points. A point is a triple in , where is indexed by .
The set . consists of the with
and, for every period ,
There is no constraint . is the subset of where every .
Claim. The real convex hull of , taken in the product space , equals the set of points satisfying the following. For every period and every finite set of periods all of whose elements are ,
This is an equality of sets: both inclusions are asserted.
Degenerate cases.
- The choice contributes only , already implied by .
- For , the term equals .
- For , forces and . Then consists of the points with and .
- If all , is not forced to vanish, since negative is not excluded by . The claim is still asserted.
- Because may be negative in both and , the equality is asserted for these sets as written.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.