Proposition 9.2 — rounded cumulative demand inequalities
ProvedPochetWolsey.Capacities.rounded_demand_validLet , , and for . Write , and assume the discrete lot-sizing feasible set is nonempty.
Every binary feasible setup vector satisfies
These inequalities express the integral number of capacity-sized production opportunities required by each prefix of the horizon.
Formalization Note Periods use zero-based Fin n coordinates; the prefix sum through a coordinate includes it. Integer ceilings are cast to real numbers for comparison.
import Mathlib import Definitions.Def_PochetWolsey_Capacities_Model
namespace PochetWolsey.Capacities
/-- Proposition 9.2. The set in hfeas is (9.1)-(9.2), written out for auditing. -/
theorem rounded_demand_valid {n : ℕ} (hn : 0 < n) (C : ℝ) (hC : 0 < C)
(d : Fin n → ℝ) (hd : ∀ t, 0 ≤ d t ∧ d t ≤ C)
(hfeas : ({y : Fin n → ℝ | (∀ u, y u = 0 ∨ y u = 1) ∧
∀ t, (∑ u ∈ Finset.Iic t, d u) ≤ C * ∑ u ∈ Finset.Iic t, y u} : Set _).Nonempty)
(y : Fin n → ℝ) (hy : ∀ u, y u = 0 ∨ y u = 1)
(hcover : ∀ t, (∑ u ∈ Finset.Iic t, d u) ≤ C * ∑ u ∈ Finset.Iic t, y u) :
∀ t, (⌈(∑ u ∈ Finset.Iic t, d u) / C⌉ : ℤ) ≤
(∑ u ∈ Finset.Iic t, y u) := by sorry
end PochetWolsey.Capacities
Read-back
What the Lean code literally says, in plain math · claude-opus-5-5
The statement is parametrized by the following data and hypotheses:
- with ; periods are in their usual order.
- with .
- with for every .
Write . The statement assumes further:
- (hfeas) There exists some such that every and for all .
- A specific vector satisfying:
- every ;
- for every , where .
Conclusion. For every period ,
with the ceiling an integer compared as a real number.
Degenerate cases.
- Hypothesis (hfeas) is implied by the hypotheses on , since itself is a witness.
- Because and , there is no empty period set and no division by zero.
- The hypotheses are always jointly satisfiable. For example, the all-ones vector works, because each . So the statement is not vacuous.
- If all , the conclusion is .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.