Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Finite expected preparation cost: E∑t<T1{t preparing}(1+∑i∑s<tDs,i)≤C\mathbb E\sum_{t<T}\mathbf 1_{\{t\ \mathrm{preparing}\}}\bigl(1+\sum_i\sum_{s<t}D_{s,i}\bigr)\le CE∑t<T​1{t preparing}​(1+∑i​∑s<t​Ds,i​)≤C

Proved
OWMR.fifo_prep_bound

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

approximation-algorithmsinventoryinventory-theoryoperations-researchrenewal-theorystochastic-control

Let D0,D1,…D_0,D_1,\ldotsD0​,D1​,… be i.i.d. demand vectors with law μ\muμ on [0,∞)n[0,\infty)^n[0,∞)n, each coordinate with positive finite mean; the coordinates may be dependent. Fix T0∈NT_0\in\mathbb NT0​∈N and reals bib_ibi​. Call period ttt a preparation period unless T0≤t+1T_0\le t+1T0​≤t+1 and ∑s<tDs,i≥bi\sum_{s<t}D_{s,i}\ge b_i∑s<t​Ds,i​≥bi​ for every iii. Then there is a finite constant 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<T1{t is a preparation period}(1+∑i∑s<tDs,i)≤C.\mathbb E\sum_{t<T}\mathbf 1_{\{t\ \text{is a preparation period}\}}\Bigl(1+\sum_i\sum_{s<t}D_{s,i}\Bigr)\le C.Et<T∑​1{t is a preparation period}​(1+i∑​s<t∑​Ds,i​)≤C.

With T0T_0T0​ the period by which all prescribed pipelines have arrived and bib_ibi​ the amount by which retailer iii's position must fall to reach its target, this bounds the expected preparation length and the cost of the backlog accumulated during preparation (Appendix B, Step 1), which grows at most linearly in cumulative demand.

Preamble
import Definitions.Def_owmr_network_model

open MeasureTheory
open scoped ENNReal NNReal
Formal statement
namespace OWMR
theorem fifo_prep_bound {n : ℕ} (μ : Measure (Fin n → ℝ≥0)) [IsProbabilityMeasure μ]
    (hpos : ∀ i, 0 < ∫⁻ a, (a i : ℝ≥0∞) ∂μ) (hfin : ∀ i, ∫⁻ a, (a i : ℝ≥0∞) ∂μ < ∞)
    (T0 : ℕ) (b : Fin n → ℝ) :
    ∃ C : ℝ≥0∞, C ≠ ∞ ∧ ∀ T N : ℕ, T ≤ N →
      ∫⁻ z, ∑ t ∈ Finset.range T,
        (if T0 ≤ t + 1 ∧ ∀ i, b i ≤ ∑ s ∈ Finset.range t, ((padHist N z s i : ℝ≥0) : ℝ) then 0
          else ENNReal.ofReal (1 + ∑ i, ∑ s ∈ Finset.range t, ((padHist N z s i : ℝ≥0) : ℝ)))
        ∂(Measure.pi fun _ : Fin N => μ) ≤ 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 1, p. E.4: the preparation duration and the backlog accumulated during preparation have finite expected cost under finite first demand moments.

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