Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§5 and (6), p. 1259 — f*^{L−1}(x^{L−2}) ≤ q^{L−1}(x^{L−1}) + f*^L(x^{L−1}) and f*^L(x^{L−1}) ≥ γE[f*^{L−1}(x_+^{L−2})]

Proved
LostSalesOldNew.LeadTime.lead_time_monotone

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

lead-timelost-salesmonotonicityp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Consider two lost-sales systems as in Zipkin (2008), §2, identical except for the lead time: system LLL and system L−1L-1L−1, with L≥2L \ge 2L≥2. Both have cost data c,h^,p≥0c,\hat h,p \ge 0c,h^,p≥0, discount factor γ∈[0,1)\gamma\in[0,1)γ∈[0,1), and i.i.d. demand with law DDD on [0,∞)[0,\infty)[0,∞) with finite mean. Let f∗Lf^{*L}f∗L and f∗L−1f^{*L-1}f∗L−1 be their infinite-horizon optimal discounted costs.

A state of system LLL is xL−1=(x0,…,xL−1)≥0x^{L-1} = (x_0,\dots,x_{L-1}) \ge 0xL−1=(x0​,…,xL−1​)≥0; removing its most recent order gives xL−2=(x0,…,xL−2)x^{L-2} = (x_0,\dots,x_{L-2})xL−2=(x0​,…,xL−2​), a state of system L−1L-1L−1. Let qL−1(xL−1)q^{L-1}(x^{L-1})qL−1(xL−1) be the one-period cost of §2, and let x+L−2=([x0−d]++x1,x2,…,xL−1)x_+^{L-2} = ([x_0-d]^+ + x_1, x_2, \dots, x_{L-1})x+L−2​=([x0​−d]++x1​,x2​,…,xL−1​) be the first L−1L-1L−1 components of the next state of system LLL under demand ddd. Then:

  1. the cost of system L−1L-1L−1 is at most the cost of system LLL plus the one extra period cost that system L−1L-1L−1 incurs:
f∗L−1(xL−2)≤qL−1(xL−1)+f∗L(xL−1);f^{*L-1}(x^{L-2}) \le q^{L-1}(x^{L-1}) + f^{*L}(x^{L-1});f∗L−1(xL−2)≤qL−1(xL−1)+f∗L(xL−1);
  1. inequality (6) holds:
f∗L(xL−1)≥γ E[f∗L−1(x+L−2)].f^{*L}(x^{L-1}) \ge \gamma\, E\bigl[f^{*L-1}(x_+^{L-2})\bigr].f∗L(xL−1)≥γE[f∗L−1(x+L−2​)].

The first inequality makes formal, in the discounted case, the paper's claim that the optimal cost is nondecreasing in the lead time: the two systems have state spaces of different dimension, and the comparison is at matching states. The second inequality is the lower bound on system LLL computed from the solution of system L−1L-1L−1, used for the numerical bounds of the paper.

Formalization Note. In Lean the lead times are n=L−1≥1n = L-1 \ge 1n=L−1≥1 and n+1n+1n+1, avoiding natural-number subtraction; xL−1x^{L-1}xL−1 is x : Fin (n + 1) → ℝ, xL−2x^{L-2}xL−2 is Fin.init x, and x+L−2x_+^{L-2}x+L−2​ is shift x d. Optimal costs take values in [0,∞][0,\infty][0,∞], so the first inequality is kept in the paper's additive form rather than the "turned around" form with subtraction. The optimal cost is the limit of the finite-horizon costs of (2). The cost signs, γ<1\gamma<1γ<1 (both part of the paper's setting), finite mean demand and x≥0x \ge 0x≥0 are hypotheses.

Preamble
import Mathlib
import Definitions.Def_LostSalesOldNew_LeadTime_Model
Formal statement
namespace LostSalesOldNew.LeadTime

open MeasureTheory

theorem lead_time_monotone (K : Costs) (D : Measure ℝ) [IsProbabilityMeasure D]
    (hD : LostSalesOldNew.StateReduction.IsDemand D) (hmean : Integrable (fun d : ℝ => d) D)
    (n : ℕ) (hn : 1 ≤ n) (x : Fin (n + 1) → ℝ) (hx : ∀ i, 0 ≤ x i) :
    fStar K D n (Fin.init x) ≤ ENNReal.ofReal (qL K D n x) + fStar K D (n + 1) x ∧
    ENNReal.ofReal K.γ * ∫⁻ d, fStar K D n (LostSalesOldNew.StateReduction.shift x d) ∂D ≤ fStar K D (n + 1) x := by sorry

end LostSalesOldNew.LeadTime
Source
Zipkin, Old and New Methods for Lost-Sales Inventory Systems, Operations Research 56(5) (2008), §5 Monotonicity, p. 1259, the first display and (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