Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 6, p. 940 — the last-period policy z̄_T(v) is in Z(s̄)

Proved
ZipkinLostSales.Bounds.lemma_6

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

dynamic-programminginventorylost-salesoperations-researchp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Consider the lost-sales model of §4 under its standing assumptions (i.i.d. nonnegative demand with finite mean, c,h^,p≥0c,\hat h,p\ge 0c,h^,p≥0, 0<γ≤10<\gamma\le10<γ≤1, 0<c+h<p+h0<c+h<p+h0<c+h<p+h with h=h^−γch=\hat h-\gamma ch=h^−γc). In the last period TTT the function to be minimized is the one-period cost gT(v,z)=q(v,z)=γLE[q0(y+L)]g_T(v,z)=q(v,z)=\gamma^L E[q^0(y_{+L})]gT​(v,z)=q(v,z)=γLE[q0(y+L​)]. For every state v∈Vv\in Vv∈V, the smallest minimizer zˉT(v)\bar z_T(v)zˉT​(v) of q(v,⋅)q(v,\cdot)q(v,⋅) over z≥0z\ge0z≥0 exists and satisfies the bounds of Z(sˉ)Z(\bar s)Z(sˉ):

v∉V(sˉ) ⇒ zˉT(v)=0,v∈V(sˉ) ⇒ zˉT(v)≤sˉL  and  vl+zˉT(v)≤sˉl  (l=0,…,L−1).v\notin V(\bar s)\ \Rightarrow\ \bar z_T(v)=0,\qquad v\in V(\bar s)\ \Rightarrow\ \bar z_T(v)\le\bar s_L\ \text{ and }\ v_l+\bar z_T(v)\le \bar s_l\ \ (l=0,\dots,L-1).v∈/V(sˉ) ⇒ zˉT​(v)=0,v∈V(sˉ) ⇒ zˉT​(v)≤sˉL​  and  vl​+zˉT​(v)≤sˉl​  (l=0,…,L−1).

This is the base case of the bounds: the myopic order is limited by the fractiles (6) of the lead-time demand.

Formalization Note t=Tt=Tt=T is k=0k=0k=0 periods of continuation, where gT=qg_T=qgT​=q (with fT+1=0f_{T+1}=0fT+1​=0). "The policy zˉT(v)\bar z_T(v)zˉT​(v)" is read as the least minimizer, and its existence is part of the statement. The statement is about §4's recursion; its identification with §2's optimal policy ("some algebra", p. 940) is not formalized. The finite mean and the sign conventions on c,h^,p,γc,\hat h,p,\gammac,h^,p,γ are added readings of §2.

Preamble
import Mathlib
import Definitions.Def_ZipkinLostSales_Bounds_Model
Formal statement
namespace ZipkinLostSales.Bounds

/-- Lemma 6, p. 940: the policy `z̄_T(v)` is in `Z(s̄)`. With one period to go (`k = 0`,
`t = T`), for every `v ∈ ZipkinLostSales.LNatural.V` the smallest minimizer of `g_T(v, ·) = q(v, ·)` over `z ≥ 0` exists and
satisfies the bounds of `Z(s̄)` at `v`. -/
theorem lemma_6 {L : ℕ} (M : Data) (hM : Assumptions L M) (v : Fin L → ℝ) (hv : v ∈ ZipkinLostSales.LNatural.V L) :
    ∃ z : ℝ, IsOptOrder M 0 v z ∧ InZ L M v z := by sorry

end ZipkinLostSales.Bounds
Source
Zipkin, On the Structure of Lost-Sales Inventory Models, Oper. Res. 56 (2008), p. 940 (PDF p. 5), Lemma 6
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