Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 11, p. 941 — if d(φ) increases in φ in the convex order, the optimal lost-sales cost f̄_t(v; φ) is nondecreasing in φ

Proved
ZipkinLostSales.Variability.theorem_11

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

inventorylost-salesoperations-researchp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1stochastic-orders

Consider the single-item lost-sales inventory model of Zipkin (2008) in the transformed state v∈V={v∈RL:v0≥v1≥⋯≥vL−1≥0}v\in V=\{v\in\mathbb R^L:v_0\ge v_1\ge\dots\ge v_{L-1}\ge0\}v∈V={v∈RL:v0​≥v1​≥⋯≥vL−1​≥0}, with lead time L≥1L\ge1L≥1, procurement, holding and penalty costs c,h^,p≥0c,\hat h,p\ge0c,h^,p≥0, and discount factor 0<γ≤10<\gamma\le10<γ≤1. Suppose the distribution of demand depends on a real parameter ϕ\phiϕ: for each ϕ\phiϕ, the one-period demand d(ϕ)d(\phi)d(ϕ) has law μϕ\mu_\phiμϕ​, a probability measure on [0,∞)[0,\infty)[0,∞) with finite mean, and demands of different periods are independent with this law. Write fˉt(v;ϕ)\bar f_t(v;\phi)fˉ​t​(v;ϕ) for the optimal cost of recursion (1)–(2), in the state vvv, under demand law μϕ\mu_\phiμϕ​.

Suppose d(ϕ)d(\phi)d(ϕ) is increasing in ϕ\phiϕ with respect to the convex order: for ϕ≤ϕ′\phi\le\phi'ϕ≤ϕ′,

E g(d(ϕ))≤E g(d(ϕ′))for every convex g:R→R for which both expectations exist.E\,g(d(\phi))\le E\,g(d(\phi'))\quad\text{for every convex } g:\mathbb R\to\mathbb R\text{ for which both expectations exist}.Eg(d(ϕ))≤Eg(d(ϕ′))for every convex g:R→R for which both expectations exist.

Then for all ttt and all v∈Vv\in Vv∈V,

ϕ≤ϕ′ ⟹ fˉt(v;ϕ)≤fˉt(v;ϕ′).\phi\le\phi'\ \Longrightarrow\ \bar f_t(v;\phi)\le\bar f_t(v;\phi').ϕ≤ϕ′ ⟹ fˉ​t​(v;ϕ)≤fˉ​t​(v;ϕ′).

In words, more variable demand (in the convex order, which keeps the mean fixed and does not decrease the variance) leads to higher optimal cost. The paper notes that this is known for systems with backorders and new in the lost-sales setting.

Formalization Note "For all ttt" is "for every number of periods to go kkk", with fˉ=0\bar f=0fˉ​=0 at k=0k=0k=0; by stationarity this covers every period of every horizon. The parameter ϕ\phiϕ ranges over R\mathbb RR. The convex order is the platform definition StochasticOrders.Convex.ConvexOrder applied to the identity random variable on (R,μϕ)(\mathbb R,\mu_\phi)(R,μϕ​) and (R,μϕ′)(\mathbb R,\mu_{\phi'})(R,μϕ′​); equal means are not assumed separately. The paper's "min" over orders is an infimum over ζ=−z≤0\zeta=-z\le0ζ=−z≤0. The conditions c,h^,p≥0c,\hat h,p\ge0c,h^,p≥0 and 0<γ≤10<\gamma\le10<γ≤1 read the paper's "unit cost" and "discount rate"; nonnegative demand is the paper's; finite mean of each μϕ\mu_\phiμϕ​ is added so that the expected one-period cost q^0\hat q^0q^​0 is finite.

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

/-- Theorem 11 (Zipkin 2008, p. 941): if the demand `d(φ)`, with law `μ φ`, is increasing in
`φ` with respect to the convex order, then the optimal cost `f̄_t(v; φ)` is nondecreasing in `φ`
for all `t`, i.e. for every number of periods to go `k` and every state `v ∈ ZipkinLostSales.LNatural.V`. -/
theorem theorem_11 {L : ℕ} (hL : 0 < L) (c hh p γ : ℝ) (hc : 0 ≤ c) (hhh : 0 ≤ hh)
    (hp : 0 ≤ p) (hγ0 : 0 < γ) (hγ1 : γ ≤ 1) (μ : ℝ → Measure ℝ)
    (hμprob : ∀ φ, IsProbabilityMeasure (μ φ)) (hμnonneg : ∀ φ, μ φ (Set.Iio 0) = 0)
    (hμint : ∀ φ, Integrable id (μ φ))
    (hcx : ∀ φ φ' : ℝ, φ ≤ φ' → StochasticOrders.Convex.ConvexOrder (μ φ) (μ φ') id id) :
    ∀ k : ℕ, ∀ v ∈ ZipkinLostSales.LNatural.V L, Monotone (fun φ : ℝ => ZipkinLostSales.LNatural.fbar c hh p γ (μ φ) k v) := by sorry

end ZipkinLostSales.Variability
Source
Zipkin, On the Structure of Lost-Sales Inventory Models, Oper. Res. 56 (2008), p. 941 (PDF p. 6), Theorem 11
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