Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 8 (FIFO holding and backlog bound): after initialization, every period satisfies hW_t+Σ_i F_i(P_it) ≤ φ(E_t)+Σ_i[F_i(P̂_it)+φ(a_i-P̂_it)]

Proved
OWMR.fifo_running_bound

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

inventoryinventory-theoryoperations-researchrenewal-theorystochastic-control

Consider πFIFO\pi_{\rm FIFO}πFIFO​ of Definition 1 (fifoPolicy) with choices satisfying Definition 1 (IsFIFOChoice), on a network under the standing assumptions, from a valid initial state, along any demand sequence. The predicate act t characterizes the periods after the initialization of Appendix B: all prescribed pipelines have arrived (Tpipe≤t+1T_{\rm pipe}\le t+1Tpipe​≤t+1) and every retailer's position, after receipts, is at most its target SiS_iSi​. The positions including outstanding requests P^i,t\widehat P_{i,t}Pi,t​ (Ph) are pinned down by the retailers' rule: P^i,t=Si\widehat P_{i,t}=S_iPi,t​=Si​ in the first such period, and thereafter P^i,t+1\widehat P_{i,t+1}Pi,t+1​ is the post-request position of the (si,Si)(s_i,S_i)(si​,Si​) rule applied to P^i,t−Di,t\widehat P_{i,t}-D_{i,t}Pi,t​−Di,t​ (before the initialization Ph is the natural position, which plays no role). Let WtW_tWt​ be the warehouse stock after the dispatches of period ttt, Pi,tP_{i,t}Pi,t​ retailer iii's net inventory plus stock in transit after those dispatches, aia_iai​ the mirror centers, Et=Wt+∑i(Pi,t−ai)E_t=W_t+\sum_i(P_{i,t}-a_i)Et​=Wt​+∑i​(Pi,t​−ai​) as in (24), and ϕ(y)=hy++py−\phi(y)=hy^++py^-ϕ(y)=hy++py−. Then every period ttt after the initialization satisfies

hWt+∑iFi(Pi,t)≤ϕ(Et)+∑i[Fi(P^i,t)+ϕ(ai−P^i,t)].hW_t+\sum_iF_i(P_{i,t})\le\phi(E_t)+\sum_i\bigl[F_i(\widehat P_{i,t})+\phi(a_i-\widehat P_{i,t})\bigr].hWt​+i∑​Fi​(Pi,t​)≤ϕ(Et​)+i∑​[Fi​(Pi,t​)+ϕ(ai​−Pi,t​)].
Preamble
import Definitions.Def_owmr_fifo_policy

open MeasureTheory
open scoped ENNReal NNReal
Formal statement
namespace OWMR
theorem fifo_running_bound {n : ℕ} (N : Network n) (hN : N.Standing) (x : InitState n)
    (hx : x.Valid) (c : FIFOChoice n) (hc : IsFIFOChoice N c)
    (d : ℕ → DemandVec n) (act : ℕ → Prop) [DecidablePred act]
    (hact : ∀ t, act t ↔ (N.Tpipe ≤ t + 1 ∧ ∀ i, x.I i + ∑ s ∈ Finset.range (N.L i), x.retPipe i s
      - ∑ s ∈ Finset.range t, ((d s i : ℝ≥0) : ℝ) ≤ c.S i))
    (Ph : ℕ → Fin n → ℝ)
    (hPh0 : ∀ i, Ph 0 i = if act 0 then c.S i else x.I i + ∑ s ∈ Finset.range (N.L i), x.retPipe i s)
    (hPh : ∀ t i, Ph (t + 1) i = if act (t + 1) then
        (if act t then (if Ph t i - ((d t i : ℝ≥0) : ℝ) ≤ c.s i then c.S i
          else Ph t i - ((d t i : ℝ≥0) : ℝ)) else c.S i)
      else x.I i + ∑ s ∈ Finset.range (N.L i), x.retPipe i s
        - ∑ s ∈ Finset.range (t + 1), ((d s i : ℝ≥0) : ℝ))
    (t : ℕ) (ht : act t) :
    let W := Policy.whStock N x (fifoPolicy N x c).toPolicy () d t
    let P : Fin n → ℝ := fun i => x.I i + ∑ s ∈ Finset.range (N.L i), x.retPipe i s
      + ∑ r ∈ Finset.range (t + 1), (fifoPolicy N x c).toPolicy.dispatch r () d i
      - ∑ r ∈ Finset.range t, ((d r i : ℝ≥0) : ℝ)
    let E := W + ∑ i, (P i - c.a i)
    N.h * W + ∑ i, N.F i (P i)
      ≤ whLoss N.h N.p E + ∑ i, (N.F i (Ph t i) + whLoss N.h N.p (c.a i - Ph t i)) := 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), Section 5.2, Lemma 8 (FIFO Holding and Backlog Cost Bound), p. 23, with the queue invariants (23) and the aggregate position (24) of Section 5.1, p. 22, Definition 1 (p. 9) and the initialization of Appendix B (p. E.4).
Human review
  • Endorsed by Shuze Chen · Nov 17, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Ming Hu · Nov 17, 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