Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Finite-horizon (s,S)(s,S)(s,S) upper bound from a random start, for measurable locally bounded costs

Proved
OWMR.ss_poisson_upper_meas

by Ming Hu · Nov 16, 2026 · Mathlib 0df444a (Lean v4.33.1)

approximation-algorithmsinventoryinventory-theoryoperations-researchrenewal-theorystochastic-control

Let α\alphaα be a measurable space with a point 000, let d0,d1,…d_0,d_1,\ldotsd0​,d1​,… be i.i.d. with law μ\muμ on α\alphaα, and let g:α→[0,∞)g:\alpha\to[0,\infty)g:α→[0,∞) be measurable, so that the demands g(dt)g(d_t)g(dt​) have law ρ\rhoρ with 0<E g(d)0<\mathbb E\,g(d)0<Eg(d). Let f:R→[0,∞)f:\mathbb R\to[0,\infty)f:R→[0,∞) be measurable and bounded above on every bounded interval, and let K≥0K\ge0K≥0, s≤Ss\le Ss≤S and MMM be reals. Let actt\mathrm{act}_tactt​ (an event) and XtX_tXt​ (a real number) be measurable functions of the path that depend only on d0,…,dt−1d_0,\ldots,d_{t-1}d0​,…,dt−1​. Suppose that once active the process stays active and follows the (s,S)(s,S)(s,S) rule Xt+1=X^t−g(dt)X_{t+1}=\widehat X_t-g(d_t)Xt+1​=Xt​−g(dt​), with X^t=S\widehat X_t=SXt​=S if Xt≤sX_t\le sXt​≤s and X^t=Xt\widehat X_t=X_tXt​=Xt​ otherwise, and that it starts at most MMM. Then there is a finite CCC such that, for all T≤NT\le NT≤N, with dN,dN+1,…d_N,d_{N+1},\ldotsdN​,dN+1​,… set to 000,

E∑t<T1actt[K1{Xt≤s, Xt<S}+f(X^t)]≤T cρ(f;K,s,S)+C,\mathbb E\sum_{t<T}\mathbf 1_{\mathrm{act}_t}\bigl[K\mathbf 1_{\{X_t\le s,\ X_t<S\}}+f(\widehat X_t)\bigr]\le T\,c_\rho(f;K,s,S)+C,Et<T∑​1actt​​[K1{Xt​≤s, Xt​<S}​+f(Xt​)]≤Tcρ​(f;K,s,S)+C,

where cρ(f;K,s,S)c_\rho(f;K,s,S)cρ​(f;K,s,S) (ssAvgCost) is the long-run average cost of the (s,S)(s,S)(s,S) policy started at SSS.

This extends the bound for continuous fff to the costs used in Appendix C: the stockout probability P(D(L0)>y)\mathbb P(D^{(L_0)}>y)P(D(L0​)>y) and the width loss ψ((S−y)/w)\psi((S-y)/w)ψ((S−y)/w).

Preamble
import Definitions.Def_owmr_single_location

open MeasureTheory
open scoped ENNReal NNReal
Formal statement
namespace OWMR
theorem ss_poisson_upper_meas {α : Type} [MeasurableSpace α] [Zero α]
    (μ : Measure α) [IsProbabilityMeasure μ] (g : α → ℝ≥0) (hg : Measurable g)
    (ρ : Measure ℝ≥0) [IsProbabilityMeasure ρ] (hρg : μ.map g = ρ)
    (hρ : 0 < ∫⁻ x, (x : ℝ≥0∞) ∂ρ) (f : ℝ → ℝ) (hfm : Measurable f)
    (hfb : ∀ a b : ℝ, ∃ C, ∀ y ∈ Set.Icc a b, f y ≤ C) (hf0 : ∀ y, 0 ≤ f y)
    (K s S M : ℝ) (hK : 0 ≤ K) (hsS : s ≤ S)
    (act : ℕ → (ℕ → α) → Prop) [∀ t, DecidablePred (act t)] (X : ℕ → (ℕ → α) → ℝ)
    (hactm : ∀ t, MeasurableSet {d | act t d}) (hXm : ∀ t, Measurable (X t))
    (hactd : ∀ (t : ℕ) (d d' : ℕ → α), (∀ r < t, d r = d' r) → (act t d ↔ act t d'))
    (hXd : ∀ (t : ℕ) (d d' : ℕ → α), (∀ r < t, d r = d' r) → X t d = X t d')
    (hmono : ∀ t d, act t d → act (t + 1) d)
    (hstep : ∀ t d, act t d → X (t + 1) d = (if X t d ≤ s then S else X t d) - (g (d t) : ℝ))
    (hstart0 : ∀ d, act 0 d → X 0 d ≤ M)
    (hstart : ∀ t d, ¬ act t d → act (t + 1) d → X (t + 1) d ≤ M) :
    ∃ C : ℝ≥0∞, C ≠ ∞ ∧ ∀ T N : ℕ, T ≤ N →
      ∫⁻ z, ∑ t ∈ Finset.range T, (if act t (padHist N z) then ENNReal.ofReal
          (K * (if X t (padHist N z) ≤ s ∧ X t (padHist N z) < S then 1 else 0)
            + f (if X t (padHist N z) ≤ s then S else X t (padHist N z))) else 0)
        ∂(Measure.pi fun _ : Fin N => μ)
      ≤ T * ssAvgCost ρ f K s S + C := by sorry
end OWMR
Source
M. Hu, "A 5/2 Guarantee for Echelon Stock (s,S) Policies in One-Warehouse Multi-Retailer Systems", working paper (manuscript of November 2026), Appendix B (proof of Proposition 2), Step 4, p. E.4, and its use in Appendix C, Steps 4 and 8, pp. E.14-E.16 and E.21-E.22; renewal-reward identities (10) and (11), pp. 13-14.

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