Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 4, p. 939, with §3, p. 938 — the optimal lost-sales cost f̄_t(v) is convex on V

Proved
ZipkinLostSales.Variability.fbar_convexOn

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

convexityinventorylost-salesoperations-researchp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Consider the lost-sales model of Zipkin (2008) in the transformed state, with lead time L≥1L\ge1L≥1, costs c,h^,p≥0c,\hat h,p\ge0c,h^,p≥0, discount factor 0<γ≤10<\gamma\le10<γ≤1, and one-period demand law μ\muμ, a probability measure on [0,∞)[0,\infty)[0,∞) with finite mean. Let V={v∈RL:v0≥v1≥⋯≥vL−1≥0}V=\{v\in\mathbb R^L: v_0\ge v_1\ge\dots\ge v_{L-1}\ge0\}V={v∈RL:v0​≥v1​≥⋯≥vL−1​≥0} be the state space and fˉt\bar f_tfˉ​t​ the optimal cost functions of recursion (1)–(2).

Then for all ttt, fˉt\bar f_tfˉ​t​ is convex on VVV:

fˉt(λv+(1−λ)v′)≤λfˉt(v)+(1−λ)fˉt(v′)(v,v′∈V, 0≤λ≤1).\bar f_t(\lambda v+(1-\lambda)v')\le\lambda\bar f_t(v)+(1-\lambda)\bar f_t(v')\qquad(v,v'\in V,\ 0\le\lambda\le1).fˉ​t​(λv+(1−λ)v′)≤λfˉ​t​(v)+(1−λ)fˉ​t​(v′)(v,v′∈V, 0≤λ≤1).

The paper obtains this from Theorem 4 (fˉt\bar f_tfˉ​t​ is L♮^\natural♮-convex) and its remark in §3 that L♮^\natural♮-convexity implies ordinary convexity. In the proof of Theorem 11, convexity of the continuation fˉt+1\bar f_{t+1}fˉ​t+1​ is what makes κˉt\bar\kappa_tκˉt​ jointly convex in (v,ζ,d)(v,\zeta,d)(v,ζ,d).

Formalization Note The optimal cost is indexed by the number of periods to go kkk, with fˉ=0\bar f=0fˉ​=0 at k=0k=0k=0; "for all ttt" is "for all kkk". The statement is for the model's fˉ\bar ffˉ​ only, not a generic "L♮^\natural♮-convex implies convex", which fails without regularity. The conditions c,h^,p≥0c,\hat h,p\ge0c,h^,p≥0, 0<γ≤10<\gamma\le10<γ≤1 read the paper's "unit cost" and "discount rate"; finite mean of demand is added so that q^0\hat q^0q^​0 is finite.

Preamble
import Mathlib
import Definitions.Def_ZipkinLostSales_Variability_Model
open MeasureTheory
Formal statement
namespace ZipkinLostSales.Variability

/-- Theorem 4 (Zipkin 2008, p. 939) with the remark of §3 (p. 938) that L♮-convexity implies
ordinary convexity, for the model's value functions: for one demand law `μ` and every number of
periods to go `k`, `f̄` is convex on the state space `V`. -/
theorem fbar_convexOn {L : ℕ} (hL : 0 < L) (c hh p γ : ℝ) (hc : 0 ≤ c) (hhh : 0 ≤ hh)
    (hp : 0 ≤ p) (hγ0 : 0 < γ) (hγ1 : γ ≤ 1) (μ : Measure ℝ) [IsProbabilityMeasure μ]
    (hμ : μ (Set.Iio 0) = 0) (hμint : Integrable id μ) :
    ∀ k : ℕ, ConvexOn ℝ (ZipkinLostSales.LNatural.V L) (ZipkinLostSales.LNatural.fbar c hh p γ μ k) := by sorry

end ZipkinLostSales.Variability
Source
Zipkin, On the Structure of Lost-Sales Inventory Models, Oper. Res. 56 (2008), p. 939 (PDF p. 4), Theorem 4, and p. 938 (PDF p. 3), §3: "one can see that L♮-convexity also implies ordinary convexity"
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