Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Claim 1 — started outside X(s), the process reaches X(s) along any demand path with divergent cumulative demand

Proved
LostSalesOldNew.StateReduction.reaches_Xs

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

invariant-setlost-salesp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let L≥1L\ge 1L≥1. Let s=(s0,…,sL)s=(s_0,\dots,s_L)s=(s0​,…,sL​) satisfy s0≥s1≥⋯≥sL≥0s_0\ge s_1\ge\dots\ge s_L\ge 0s0​≥s1​≥⋯≥sL​≥0, let z∈Z(s)z\in Z(s)z∈Z(s), and let x≥0x\ge 0x≥0 be an initial state. Let (dt)t≥0(d_t)_{t\ge 0}(dt​)t≥0​ be a demand path with dt≥0d_t\ge 0dt​≥0 for all ttt and

∑t=0n−1dt⟶∞(n→∞).\sum_{t=0}^{n-1} d_t \longrightarrow \infty \qquad (n\to\infty).t=0∑n−1​dt​⟶∞(n→∞).

Then the state process x0=xx_0=xx0​=x, xt+1=(xt)+x_{t+1}=(x_t)_+xt+1​=(xt​)+​ (order z(xt)z(x_t)z(xt​), demand dtd_tdt​) visits X(s)X(s)X(s): there is a period ttt with xt∈X(s)x_t\in X(s)xt​∈X(s).

This is the entrance half of the proof of Claim 1: "If the process starts outside X(s)X(s)X(s), it must eventually reach X(s)X(s)X(s) because z(x)=0z(x)=0z(x)=0 until then."

Formalization Note. The paper leaves implicit why the process must reach X(s)X(s)X(s); the divergence of the cumulative demand is the pathwise condition under which the sentence holds (with demand identically 000 and no orders, a state with x0>s0x_0>s_0x0​>s0​ stays put forever). It is a hypothesis of this pathwise milestone only; the goal theorem assumes instead an i.i.d. demand law with P(d>0)>0P(d>0)>0P(d>0)>0, under which the cumulative demand diverges almost surely. The conclusion holds also when x∈X(s)x\in X(s)x∈X(s) already (take t=0t=0t=0).

Preamble
import Mathlib
import Definitions.Def_LostSalesOldNew_StateReduction_Model
Formal statement
namespace LostSalesOldNew.StateReduction

theorem reaches_Xs {L : ℕ} (hL : 0 < L)
    (s : Fin (L + 1) → ℝ) (hs : IsLevelVector s)
    (z : (Fin L → ℝ) → ℝ) (hz : z ∈ Zs s) (x : Fin L → ℝ) (hx : ∀ i, 0 ≤ x i)
    (ds : ℕ → ℝ) (hds : ∀ t, 0 ≤ ds t)
    (hdiv : Filter.Tendsto (fun n => ∑ t ∈ Finset.range n, ds t) Filter.atTop Filter.atTop) :
    ∃ t, traj z x ds t ∈ Xs s := by sorry

end LostSalesOldNew.StateReduction
Source
Zipkin, Old and New Methods for Lost-Sales Inventory Systems, Operations Research 56(5) (2008), proof of Claim 1, p. 1259
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