Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma C.3: shipping at offset thresholds, crossing count, and the averaged reserve over the offset

Proved
OWMR.arb_credited_reserve

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

approximation-algorithmsinventoryinventory-theoryoperations-researchrenewal-theorystochastic-control

Fix a request size Q>0Q>0Q>0 and a nondecreasing cumulative allocation path A0≤A1≤⋯A_0\le A_1\le\cdotsA0​≤A1​≤⋯ with 0≤A00\le A_00≤A0​ and Ak≤QA_k\le QAk​≤Q. For an offset ϑ\varthetaϑ, the request ships its whole allocation in period kkk when the allocation rises to or past a threshold (3Qϑ/43Q\vartheta/43Qϑ/4, and 3Q(1+ϑ)/43Q(1+\vartheta)/43Q(1+ϑ)/4 if ϑ<1/3\vartheta<1/3ϑ<1/3) or reaches QQQ; Sk(ϑ)S_k(\vartheta)Sk​(ϑ) (shippedPath) is the quantity shipped by period kkk. Let N(ϑ)=2N(\vartheta)=2N(ϑ)=2 if ϑ<1/3\vartheta<1/3ϑ<1/3 and N(ϑ)=1N(\vartheta)=1N(ϑ)=1 otherwise. Then:

  1. 0≤Sk(ϑ)≤Ak0\le S_k(\vartheta)\le A_k0≤Sk​(ϑ)≤Ak​, and Sk(ϑ)=QS_k(\vartheta)=QSk​(ϑ)=Q when Ak=QA_k=QAk​=Q;
  2. for ϑ>0\vartheta>0ϑ>0 and every TTT, the number of periods k<Tk<Tk<T with a threshold crossing is at most 1+N(ϑ)1+N(\vartheta)1+N(ϑ);
  3. for z≥0z\ge0z≥0 and Ak<QA_k<QAk​<Q, ∫01(Ak−Sk(ϑ)−z)+dϑ≤((3Q/4−z)+)23Q/2\displaystyle\int_0^1\bigl(A_k-S_k(\vartheta)-z\bigr)^+d\vartheta\le\frac{\bigl((3Q/4-z)^+\bigr)^2}{3Q/2}∫01​(Ak​−Sk​(ϑ)−z)+dϑ≤3Q/2((3Q/4−z)+)2​;
  4. ∫01(1+N(ϑ))dϑ=73\displaystyle\int_0^1\bigl(1+N(\vartheta)\bigr)d\vartheta=\frac73∫01​(1+N(ϑ))dϑ=37​.

Item 3 is the averaged retained reserve against the depletion zzz; item 4 gives the expected number of dispatches 7/37/37/3.

Preamble
import Definitions.Def_owmr_consolidation_policy

open MeasureTheory
open scoped ENNReal
Formal statement
namespace OWMR
theorem arb_credited_reserve (Q : ℝ) (A : ℕ → ℝ) (hQ : 0 < Q) (hA0 : 0 ≤ A 0) (hA : Monotone A)
    (hAQ : ∀ k, A k ≤ Q) :
    (∀ θ k, 0 ≤ shippedPath Q θ A k ∧ shippedPath Q θ A k ≤ A k) ∧
    (∀ θ k, A k = Q → shippedPath Q θ A k = Q) ∧
    (∀ θ T, 0 < θ →
      ∑ k ∈ Finset.range T,
          (if crossesThreshold Q θ (if k = 0 then 0 else A (k - 1)) (A k) then (1 : ℝ) else 0)
        ≤ 1 + if θ < 1 / 3 then 2 else 1) ∧
    (∀ k z, 0 ≤ z → A k < Q →
      ∫⁻ θ in Set.Ioo (0 : ℝ) 1, ENNReal.ofReal (A k - shippedPath Q θ A k - z)
        ≤ ENNReal.ofReal (max (3 * Q / 4 - z) 0 ^ 2 / (3 * Q / 2))) ∧
    ∫⁻ θ in Set.Ioo (0 : ℝ) 1, ENNReal.ofReal (1 + if θ < 1 / 3 then 2 else 1)
      = ENNReal.ofReal (7 / 3) := 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 C, Step 3, Lemma C.3 with (C.12)-(C.15), pp. E.12-E.14; dispatch thresholds of Definition 2, p. 27.

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