Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 4, p. 939 — if f̄_{t+1} is L♮-convex, so is ḡ_t(v, ζ) of (5)

Proved
ZipkinLostSales.LNatural.gbar_lnatconvex

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

inventoryl-natural-convexitylost-salesoperations-researchp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Consider the lost-sales model with lead time L≥1L\ge1L≥1, nonnegative independent demands with common law μ\muμ of finite mean, nonnegative unit costs c,h^,pc,\hat h,pc,h^,p and discount factor 0<γ≤10<\gamma\le10<γ≤1. Let fˉk\bar f_kfˉ​k​ and gˉk\bar g_kgˉ​k​ be the optimal cost functions with kkk periods to go in the transformed state, so that

gˉk(v,ζ)=−γLcζ+q^0(v0−v1)+γE[fˉk(v+)].\bar g_k(v,\zeta)=-\gamma^L c\zeta+\hat q^0(v_0-v_1)+\gamma E\big[\bar f_k(v_+)\big].gˉ​k​(v,ζ)=−γLcζ+q^​0(v0​−v1​)+γE[fˉ​k​(v+​)].

If fˉk\bar f_kfˉ​k​ (the paper's fˉt+1\bar f_{t+1}fˉ​t+1​) is L♮-convex on VVV, then gˉk\bar g_kgˉ​k​ (the paper's gˉt\bar g_tgˉ​t​) is L♮-convex on V×ℜ−V\times\Re^-V×ℜ−.

In the paper this is the step gˉt(v,ζ)=−γLcζ+Ed[κˉt(v,ζ∣d)]\bar g_t(v,\zeta)=-\gamma^Lc\zeta+E_d[\bar\kappa_t(v,\zeta\mid d)]gˉ​t​(v,ζ)=−γLcζ+Ed​[κˉt​(v,ζ∣d)] of (5), with L♮-convexity preserved by expectation; together with Lemma 2 it closes the induction of Theorem 4.

Formalization Note. gˉk\bar g_kgˉ​k​ is defined by the recursion (1) in the transformed state, not by (5); the two agree by the reformulation milestone (optimal a=min⁡{d,v0−v1}a=\min\{d,v_0-v_1\}a=min{d,v0​−v1​}). Time is the number of periods to go. The cost hypotheses read "unit cost" and "discount rate"; finite mean demand is added so that q^0\hat q^0q^​0 is finite. Expectations are Bochner integrals against μ\muμ.

Preamble
import Mathlib
import Definitions.Def_ZipkinLostSales_LNatural_Model
open MeasureTheory
Formal statement
namespace ZipkinLostSales.LNatural

/-- Proof of Theorem 4 (Zipkin 2008, p. 939): if `f̄_{t+1}` (here `fbar … k`) is L♮-convex on `V`,
then `ḡ_t(v, ζ) = −γ^L c ζ + E_d[κ̄_t(v, ζ | d)]` (here `gbar … k`) is L♮-convex on `V × ℜ⁻`. -/
theorem gbar_lnatconvex (L : ℕ) (hL : 0 < L) (μ : Measure ℝ) [IsProbabilityMeasure μ]
    (hμ : μ (Set.Iio 0) = 0) (hμint : Integrable id μ)
    (c hh p γ : ℝ) (hc : 0 ≤ c) (hhh : 0 ≤ hh) (hp : 0 ≤ p) (hγ0 : 0 < γ) (hγ1 : γ ≤ 1)
    (k : ℕ) (hk : LNatConvexOn (V L) (fbar c hh p γ μ k)) :
    LNatConvexOn (VxNeg L) (liftG (gbar c hh p γ μ k)) := by sorry

end ZipkinLostSales.LNatural
Source
Zipkin, On the Structure of Lost-Sales Inventory Models, Oper. Res. 56 (2008), p. 939 (PDF p. 4), proof of Theorem 4, display (5) and "L♮-convexity is preserved by expectation, therefore ḡ_t is L♮-convex"
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