Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(5) and §4 — every vector base-stock policy with level vector s lies in Z(s)

Proved
LostSalesOldNew.StateReduction.vectorBaseStock_mem_Zs

by mikedeng1 · Oct 6, 2026 · Mathlib 0df444a (Lean v4.33.1)

lost-salesp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1vector-base-stock

Let L≥1L\ge 1L≥1 be the lead time and let s=(s0,…,sL)s=(s_0,\dots,s_L)s=(s0​,…,sL​) satisfy s0≥s1≥⋯≥sL≥0s_0\ge s_1\ge\dots\ge s_L\ge 0s0​≥s1​≥⋯≥sL​≥0. Let zsz_szs​ be the vector base-stock policy with parameter sss,

zs(x)=[min⁡{sl−vl, l=0,…,L}]+,vl=∑m=lL−1xm, vL=0.z_s(x) = \Bigl[\min\{s_l - v_l,\ l=0,\dots,L\}\Bigr]^+, \qquad v_l=\sum_{m=l}^{L-1}x_m,\ v_L=0 .zs​(x)=[min{sl​−vl​, l=0,…,L}]+,vl​=m=l∑L−1​xm​, vL​=0.

Then zs∈Z(s)z_s\in Z(s)zs​∈Z(s): it orders a nonnegative amount in every state x≥0x\ge 0x≥0, it orders nothing in every state x≥0x\ge 0x≥0 outside X(s)X(s)X(s), and vl+zs(x)≤slv_l+z_s(x)\le s_lvl​+zs​(x)≤sl​ for l=0,…,Ll=0,\dots,Ll=0,…,L and every x∈X(s)x\in X(s)x∈X(s).

The paper states this for Morton's standard vector sˉ\bar ssˉ ("the standard vector base-stock policy [is in Z(sˉ)Z(\bar s)Z(sˉ)], by construction"); the construction gives it for every level vector, which is what is stated here. The same sentence of the paper also asserts that any optimal policy lies in Z(sˉ)Z(\bar s)Z(sˉ); that part rests on Morton's bounds (4), which the paper cites without proof, and it is not part of this statement.

The result shows that Z(s)Z(s)Z(s) contains the paper's vector base-stock heuristics, so Claim 1 applies to them.

Formalization Note. The paper assumes L>0L>0L>0. Policies are functions (Fin L → ℝ) → ℝ; Z(s)Z(s)Z(s) quantifies its sign and zero conditions over nonnegative states only.

Preamble
import Mathlib
import Definitions.Def_LostSalesOldNew_StateReduction_Model
Formal statement
namespace LostSalesOldNew.StateReduction

theorem vectorBaseStock_mem_Zs {L : ℕ} (hL : 0 < L)
    (s : Fin (L + 1) → ℝ) (hs : IsLevelVector s) :
    vectorBaseStock s ∈ Zs s := by sorry

end LostSalesOldNew.StateReduction
Source
Zipkin, Old and New Methods for Lost-Sales Inventory Systems, Operations Research 56(5) (2008), (5) and the definition of vector base-stock policies, p. 1258; §4, p. 1259
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me