Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 11, p. 941 ("the key step") — κ̄_t(v, ζ | d) is jointly convex in (v, ζ, d)

Proved
ZipkinLostSales.Variability.kappa_jointly_convex

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

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

Fix a lead time L≥1L\ge1L≥1, costs h^,p≥0\hat h,p\ge0h^,p≥0 and a discount factor 0<γ≤10<\gamma\le10<γ≤1. 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}, with the convention vL=0v_L=0vL​=0, and let F:V→RF:V\to\mathbb RF:V→R (standing for the continuation cost fˉt+1\bar f_{t+1}fˉ​t+1​) be convex and nonnegative on VVV. For v∈Vv\in Vv∈V, ζ≤0\zeta\le0ζ≤0 and d≥0d\ge0d≥0 let

κˉ(v,ζ∣d)=inf⁡v+{h^(v+−v1)+p(v+−v0+d)+γF[(v+,v2,…,vL−1,0)−ζe]: −d≤v+−v0≤0, v+−v1≥0},\bar\kappa(v,\zeta\mid d)=\inf_{v_+}\Big\{\hat h(v_+-v_1)+p(v_+-v_0+d)+\gamma F\big[(v_+,v_2,\dots,v_{L-1},0)-\zeta e\big]:\ -d\le v_+-v_0\le0,\ v_+-v_1\ge0\Big\},κˉ(v,ζ∣d)=v+​inf​{h^(v+​−v1​)+p(v+​−v0​+d)+γF[(v+​,v2​,…,vL−1​,0)−ζe]: −d≤v+​−v0​≤0, v+​−v1​≥0},

which is program (4). Then κˉ\bar\kappaκˉ is jointly convex in (v,ζ,d)(v,\zeta,d)(v,ζ,d) on the convex set

{(v,ζ,d): v∈V, ζ≤0, d≥0}.\{(v,\zeta,d):\ v\in V,\ \zeta\le0,\ d\ge0\}.{(v,ζ,d): v∈V, ζ≤0, d≥0}.

The paper calls this "the key step" of the proof of Theorem 11: since κˉt\bar\kappa_tκˉt​ is convex in the demand ddd, its expectation increases when demand becomes larger in the convex order.

Formalization Note The continuation FFF is generic; the result is applied with F=fˉt+1F=\bar f_{t+1}F=fˉ​t+1​, which is convex on VVV (Theorem 4) and nonnegative. Nonnegativity of FFF keeps the infimum in (4) a genuine infimum rather than Lean's junk value. The domain is d≥0d\ge0d≥0: for d<0d<0d<0 the constraint set of (4) is empty. The infimum is over v+∈[max⁡(v0−d,v1),v0]v_+\in[\max(v_0-d,v_1),v_0]v+​∈[max(v0​−d,v1​),v0​], which is the constraint set of (4).

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

/-- Proof of Theorem 11 (Zipkin 2008, p. 941, "the key step"): if the continuation `F` (standing
for `f̄_{t+1}`) is convex and nonnegative on `V`, then `κ̄(v, ζ | d)` of program (4) is jointly
convex in `(v, ζ, d)` on `{v ∈ ZipkinLostSales.LNatural.V, ζ ≤ 0, d ≥ 0}`. -/
theorem kappa_jointly_convex {L : ℕ} (hL : 0 < L) (hh p γ : ℝ) (hhh : 0 ≤ hh) (hp : 0 ≤ p)
    (hγ0 : 0 < γ) (hγ1 : γ ≤ 1) (F : (Fin L → ℝ) → ℝ) (hFconv : ConvexOn ℝ (ZipkinLostSales.LNatural.V L) F)
    (hFnonneg : ∀ v ∈ ZipkinLostSales.LNatural.V L, 0 ≤ F v) :
    ConvexOn ℝ {w : (Fin L → ℝ) × ℝ × ℝ | w.1 ∈ ZipkinLostSales.LNatural.V L ∧ w.2.1 ≤ 0 ∧ 0 ≤ w.2.2}
      (fun w => ZipkinLostSales.LNatural.kappa hh p γ F w.2.2 w.1 w.2.1) := by sorry

end ZipkinLostSales.Variability
Source
Zipkin, On the Structure of Lost-Sales Inventory Models, Oper. Res. 56 (2008), p. 941 (PDF p. 6), proof of Theorem 11: "Moreover (this is the key step), κ̄_t is jointly convex in (v, ζ, d)."; program (4), p. 939 (PDF p. 4)
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