Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§2, p. 1257 — the one-period costs satisfy q^l(x^l) = γE[q^{l−1}(x_+^{l−1})]

Proved
LostSalesOldNew.LeadTime.q_recursion

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

cost-recursionlost-salesp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Consider the lost-sales system of Zipkin (2008), §2, with cost data c,h^,p≥0c,\hat h,p \ge 0c,h^,p≥0, discount factor γ∈[0,1)\gamma\in[0,1)γ∈[0,1), transformed holding cost h=h^−γch = \hat h - \gamma ch=h^−γc, and i.i.d. demand with law DDD on [0,∞)[0,\infty)[0,∞) with finite mean. Recall q0(y)=cy+hE[[y−d]+]+pE[[y−d]−]q^0(y) = cy + hE[[y-d]^+] + pE[[y-d]^-]q0(y)=cy+hE[[y−d]+]+pE[[y−d]−] and ql(xl)=γlE[q0(y+l)]q^l(x^l) = \gamma^l E[q^0(y_{+l})]ql(xl)=γlE[q0(y+l​)], where y+ly_{+l}y+l​ is the stock on hand lll periods after the state xl=(x0,…,xl)x^l = (x_0,\dots,x_l)xl=(x0​,…,xl​).

For every l≥1l \ge 1l≥1 and every xl∈Rl+1x^l \in \mathbb R^{l+1}xl∈Rl+1,

ql(xl)=γ E[ql−1(x+l−1)],q^l(x^l) = \gamma\, E\bigl[q^{l-1}(x_+^{l-1})\bigr],ql(xl)=γE[ql−1(x+l−1​)],

where x+l−1=([x0−d]++x1,x2,…,xl)x_+^{l-1} = ([x_0-d]^+ + x_1, x_2, \dots, x_l)x+l−1​=([x0​−d]++x1​,x2​,…,xl​) and the expectation is over the current period's demand d∼Dd \sim Dd∼D.

The recursion computes the transformed one-period cost q(x,z)=qL(xL)q(x,z) = q^L(x^L)q(x,z)=qL(xL) one period at a time, and it is the identity that makes the qqq terms cancel in the paper's derivation of the lead-time bound (6).

Formalization Note. The paper states the recursion for l=1,…,Ll = 1,\dots,Ll=1,…,L; it is stated here for every l≥1l \ge 1l≥1 (in Lean, l + 1 for l : ℕ), which contains the paper's range. The state is Fin (l + 2) → ℝ and need not be nonnegative. Finite mean demand (Integrable id D) is assumed so that the Bochner integrals defining q0q^0q0 and qlq^lql are the paper's expectations.

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

open MeasureTheory

theorem q_recursion (K : Costs) (D : Measure ℝ) [IsProbabilityMeasure D]
    (hD : LostSalesOldNew.StateReduction.IsDemand D) (hmean : Integrable (fun d : ℝ => d) D)
    (l : ℕ) (x : Fin (l + 2) → ℝ) :
    qL K D (l + 1) x = K.γ * ∫ d, qL K D l (LostSalesOldNew.StateReduction.shift x d) ∂D := by sorry

end LostSalesOldNew.LeadTime
Source
Zipkin, Old and New Methods for Lost-Sales Inventory Systems, Operations Research 56(5) (2008), §2, the recursion for q^l, p. 1257
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