Proof of Claim 1 — under a policy in Z(s), x ∈ X(s) implies x₊ ∈ X(s) for every demand d ≥ 0
ProvedLostSalesOldNew.StateReduction.Xs_invariantinvariant-setlost-salesp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1
Let . Let satisfy , let , let , and let be a demand. Then the next state
again lies in . In the paper's words: once the process enters , it never leaves.
This is the invariance half of the proof of Claim 1.
Formalization Note. The transition is next x (z x) d. The positive lead time is the standing assumption of §2.
Preamble
import Mathlib import Definitions.Def_LostSalesOldNew_StateReduction_Model
Formal statement
namespace LostSalesOldNew.StateReduction
theorem Xs_invariant {L : ℕ} (hL : 0 < L)
(s : Fin (L + 1) → ℝ) (hs : IsLevelVector s)
(z : (Fin L → ℝ) → ℝ) (hz : z ∈ Zs s) (x : Fin L → ℝ) (hx : x ∈ Xs s)
(d : ℝ) (hd : 0 ≤ d) :
next x (z x) d ∈ Xs s := by sorry
end LostSalesOldNew.StateReduction
Source
Zipkin, Old and New Methods for Lost-Sales Inventory Systems, Operations Research 56(5) (2008), proof of Claim 1, p. 1259
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.