Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

DFR retailer bound (proof of Theorem D.1, Steps 1-3): Li≤(1+θλ)Ji(Ki/θ)\mathcal L_i\le(1+\theta\lambda)J_i(K_i/\theta)Li​≤(1+θλ)Ji​(Ki​/θ)

Proved
OWMR.dfr_retailer_bound

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

approximation-algorithmsinventoryinventory-theoryoperations-researchrenewal-theorystochastic-control

Fix a network under the standing assumptions, a weight 0<θ≤10<\theta\le10<θ≤1, choices ccc satisfying IsDFRChoice N θ c (Definition D.1), and a retailer iii with Hi≥hH_i\ge hHi​≥h and p≥hp\ge hp≥h whose demand is DFR conditional on positive demand (DFRPositive) if Ki>0K_i>0Ki​>0. Then si≤Sis_i\le S_isi​≤Si​, and the augmented cost of the selected retailer policy satisfies

Li:=ci(Fi;Ki,si,Si)+mirrorAvgi(si,Si,ai)≤(1+θλ) Ji(Ki/θ),\mathcal L_i:=c_i(F_i;K_i,s_i,S_i)+\mathrm{mirrorAvg}_i(s_i,S_i,a_i)\le(1+\theta\lambda)\,J_i(K_i/\theta),Li​:=ci​(Fi​;Ki​,si​,Si​)+mirrorAvgi​(si​,Si​,ai​)≤(1+θλ)Ji​(Ki​/θ),

where ci(Fi;Ki,si,Si)c_i(F_i;K_i,s_i,S_i)ci​(Fi​;Ki​,si​,Si​) (ssAvgCost) is the long-run average cost of the (si,Si)(s_i,S_i)(si​,Si​) policy with setup cost KiK_iKi​ per order and cost FiF_iFi​ of the post-order position, mirrorAvgi\mathrm{mirrorAvg}_imirrorAvgi​ is its long-run average mirror loss at center aia_iai​, and λ=2−2\lambda=2-\sqrt2λ=2−2​.

This is the per-retailer bound established in Steps 1-3 of the proof of Theorem D.1.

Preamble
import Definitions.Def_owmr_dfr_policy

open scoped ENNReal
Formal statement
namespace OWMR
theorem dfr_retailer_bound {n : ℕ} (N : Network n) (hN : N.Standing) (θ : ℝ) (hθ0 : 0 < θ)
    (hθ1 : θ ≤ 1) (c : FIFOChoice n) (hc : IsDFRChoice N θ c) (i : Fin n)
    (hH : N.h ≤ N.H i) (hp : N.h ≤ N.p) (hD : 0 < N.K i → N.DFRPositive i) :
    c.s i ≤ c.S i ∧
      ssAvgCost (N.marginal i) (N.F i) (N.K i) (c.s i) (c.S i)
          + mirrorAvg (N.marginal i) N.h N.p (c.s i) (c.S i) (c.a i)
        ≤ ENNReal.ofReal (1 + θ * dfrLambda) * N.J i (N.K 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), Appendix D, proof of Theorem D.1, Steps 1-3 and (D.5)-(D.6), pp. E.25-E.27, with Definition D.1 (DFR Policy), p. E.23.

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