Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Protected newsvendor under association: pooling a subset of retailers costs no more than the aggregate (C.18)

Proved
OWMR.arb_protected_newsvendor

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

approximation-algorithmsinventoryinventory-theoryoperations-researchrenewal-theorystochastic-control

Let a network satisfy the standing assumptions and have associated demand components (Associated), and let PPP be a set of retailers. Let DtP=∑i∈PDt,iD^P_t=\sum_{i\in P}D_{t,i}DtP​=∑i∈P​Dt,i​, i.i.d. over periods, and ϕ(y)=hy++py−\phi(y)=hy^++py^-ϕ(y)=hy++py−. Then

inf⁡z E ϕ(z−∑j<L0DjP)≤inf⁡yfL0(y),fL0(y)=E ϕ(y−D(L0)),\inf_z\ \mathbb E\,\phi\Bigl(z-\sum_{j<L_0}D^P_j\Bigr)\le\inf_y f_{L_0}(y),\qquad f_{L_0}(y)=\mathbb E\,\phi\bigl(y-D^{(L_0)}\bigr),zinf​ Eϕ(z−j<L0​∑​DjP​)≤yinf​fL0​​(y),fL0​​(y)=Eϕ(y−D(L0​)),

where D(L0)D^{(L_0)}D(L0​) is the aggregate demand of all retailers over L0L_0L0​ periods. The newsvendor problem of a sub-aggregate is no harder than that of the whole aggregate.

Preamble
import Definitions.Def_owmr_consolidation_policy

open MeasureTheory
open scoped ENNReal NNReal
Formal statement
namespace OWMR
theorem arb_protected_newsvendor {n : ℕ} (N : Network n) (hN : N.Standing) (hA : N.Associated)
    (P : Finset (Fin n)) :
    ⨅ z : ℝ, ∫ w, whLoss N.h N.p (z - ∑ j, (w j : ℝ))
        ∂(Measure.pi fun _ : Fin N.L0 =>
          (N.μ.map (fun x : DemandVec n => (∑ i ∈ P, x i : ℝ≥0)) : Measure ℝ≥0))
      ≤ ⨅ y : ℝ, N.fL0 y := 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 4, (C.16)-(C.18), pp. E.14-E.15 (association of demand components, Esary, Proschan and Walkup 1967).

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