Proposition 11.3 — extreme points with sales
OpenPochetWolsey.Variants.sales_extreme_pointsFor the nonnegative-demand sales model with zero initial and final stock, let be an extreme point of the convex hull of its original feasible set. There are subsets and of the periods, with and , such that
and outside .
This gives the regeneration structure used in the sales formulation. It asserts that every extreme point has such a description, not that every unconstrained choice of the three sets is feasible.
Formalization Note The book's third set is called to avoid confusion with production types. The last displayed clause uses the production period as its index; the source switches to the letter there. Empty is allowed when production is zero.
import Definitions.Def_PochetWolsey_Variants_SalesModel
/- Imported module source, reproduced verbatim for declaration-only auditing.
import Mathlib
open scoped BigOperators
namespace PochetWolsey.Variants
abbrev SalesPoint (n : ℕ) := (Fin n → ℝ) × (Fin n → ℝ) × (Fin n → ℝ)
structure SalesModel (n : ℕ) where
d : Fin n → ℝ
u : Fin n → ℝ
M : ℝ
def SalesModel.Standing {n : ℕ} (D : SalesModel n) : Prop :=
0 < n ∧ (∀ t, 0 ≤ D.d t ∧ 0 ≤ D.u t) ∧
0 < D.M ∧ (∑ t, (D.d t + D.u t)) ≤ D.M
def SalesModel.feasible {n : ℕ} (D : SalesModel n) : Set (SalesPoint n) :=
{w | (∀ t, 0 ≤ w.1 t ∧ 0 ≤ w.2.1 t ∧ w.2.1 t ≤ D.u t ∧
(w.2.2 t = 0 ∨ w.2.2 t = 1) ∧ w.1 t ≤ D.M * w.2.2 t) ∧
(∀ t, (∑ j ∈ Finset.univ.filter (fun j => j ≤ t), (w.2.1 j + D.d j)) ≤
∑ j ∈ Finset.univ.filter (fun j => j ≤ t), w.1 j) ∧
(∑ j, w.1 j) = ∑ j, (w.2.1 j + D.d j)}
noncomputable def SalesModel.regenerationPattern {n : ℕ} (D : SalesModel n)
(w : SalesPoint n) : Prop :=
∃ I J H : Finset (Fin n), I ⊆ J ∧
(∀ t, w.2.2 t = if t ∈ J then 1 else 0) ∧
(∀ t, w.2.1 t = if t ∈ H then D.u t else 0) ∧
(∀ t, w.1 t = if t ∈ I then
∑ r ∈ Finset.univ.filter (fun r => t ≤ r ∧ ∀ j ∈ I, t < j → r < j),
(w.2.1 r + D.d r) else 0)
end PochetWolsey.Variants
-/
namespace PochetWolsey.Variants
theorem sales_extreme_points {n : ℕ} (D : SalesModel n) (hD : D.Standing)
(w : SalesPoint n) (hw : w ∈ (convexHull ℝ D.feasible).extremePoints ℝ) :
D.regenerationPattern w := by sorry
end PochetWolsey.Variants
Read-back
What the Lean code literally says, in plain math · claude-opus-5-5
Let and let be a sales model with and . Assume satisfies the standing condition:
- ;
- and for all ;
- ;
- .
Let be the set of triples satisfying three groups of conditions. First, for every :
Second, for every , with periods in their natural order:
Third:
Let be any extreme point of the convex hull , taken in the real vector space . Being an extreme point means two things: , and whenever lies in the open segment between two points of , then .
The theorem asserts that such a has the regeneration pattern. That is, there exist with such that for every :
Here . This is the run of periods from up to just before the next element of , or up to if there is none.
The statement is a one-way implication: it does not claim that every point with this pattern is an extreme point, or that it is feasible. It places no further condition relating to or .
Degenerate cases. The standing condition rules out . It permits , , and , where .
The hypotheses are jointly satisfiable. Under the standing condition, contains the point with:
- and otherwise;
- ;
- and otherwise.
When some , the conditions on hold whether or not , so is not determined by .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.