Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The choices required by Definitions 1, 2 and D.1 exist, so Theorems 1, 2 and D.1 are not vacuous

Proved
OWMR.policy_choices_exist

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

inventoryinventory-theoryoperations-researchrenewal-theorystochastic-control

Definitions 1, 2 and D.1 of the source leave several choices open: optimal retailer and supplier (s,S)(s,S)(s,S) pairs satisfying the canonical conditions, half windows with the smallest holding and backlog cost, minimizers, mirror centers, the shortened windows and targets of the DFR policy, and the initialization data of the consolidation policy. Theorems 1, 2 and D.1 hold for every admissible choice. This theorem shows that admissible choices always exist, so the three guarantees are not vacuous.

Let NNN be a one-warehouse multi-retailer network with n≥1n\ge1n≥1 retailers under the standing assumptions of Section 3: demand vectors are i.i.d. over periods with 0<EDi<∞0<\mathbb E D_i<\infty0<EDi​<∞ for every retailer, K0,Ki≥0K_0,K_i\ge0K0​,Ki​≥0, and h,Hi,p>0h,H_i,p>0h,Hi​,p>0. Then:

  1. Definition 1. There are choices c=(si,Si,ai,s0,S0)c=(s_i,S_i,a_i,s_0,S_0)c=(si​,Si​,ai​,s0​,S0​) satisfying IsFIFOChoice N c: for each retailer with Ki>0K_i>0Ki​>0, a canonical optimum (s^i,S^i)(\hat s_i,\hat S_i)(s^i​,S^i​) at planning setup cost 5Ki/35K_i/35Ki​/3, a best half window of [s^i,S^i][\hat s_i,\hat S_i][s^i​,S^i​], whichever of the two has the smaller augmented cost, and a mirror center of the selected policy; base stock at a minimizer of FiF_iFi​ when Ki=0K_i=0Ki​=0; and a supplier pair s0≤S0s_0\le S_0s0​≤S0​ whose average cost equals J0(K0+Kmax⁡)J_0(K_0+K_{\max})J0​(K0​+Kmax​).
  2. Definition 2. For every m>0m>0m>0 there are choices satisfying IsConChoice N m c: immediate retailers using base stock at a minimizer of FiF_iFi​, batch retailers using a canonical optimum at setup cost ζmKi\zeta_mK_iζm​Ki​ or its best half window according to the setup share, the shifted supplier pair (or, if K0=0K_0=0K0​=0, base stock at a nonnegative minimizer of fL0f_{L_0}fL0​​), a retailer receiving the initial warehouse stock, initial offsets in (0,1)(0,1)(0,1), and an enumeration of the rationals in (0,1)(0,1)(0,1).
  3. Definition D.1. For every θ>0\theta>0θ>0, if every retailer with Ki>0K_i>0Ki​>0 has an absolutely continuous DFR demand distribution conditional on positive demand (DFRPositive), there are choices satisfying IsDFRChoice N θ c: in particular, whenever t0<t<1t_0<t<1t0​<t<1, a width w>0w>0w>0 with U[0,w)=t U[0,w^)U[0,w)=t\,U[0,\hat w)U[0,w)=tU[0,w^), a target minimizing the average holding and backlog cost among width-www policies, and a mirror center.

Theorem 2 uses m≥1m\ge1m≥1 and Theorem D.1 uses θ=1−1/γλ\theta=1-1/\gamma_\lambdaθ=1−1/γλ​, both covered here, and the cost conditions of Theorems 1, 2 and D.1 are not needed for existence.

Preamble
import Definitions.Def_owmr_fifo_policy
import Definitions.Def_owmr_consolidation_policy
import Definitions.Def_owmr_dfr_policy

open MeasureTheory
open scoped ENNReal NNReal
Formal statement
namespace OWMR
theorem policy_choices_exist {n : ℕ} (hn : 0 < n) (N : Network n) (hN : N.Standing) :
    (∃ c : FIFOChoice n, IsFIFOChoice N c) ∧
    (∀ m : ℝ, 0 < m → ∃ c : ConChoice n, IsConChoice N m c) ∧
    (∀ θ : ℝ, 0 < θ → (∀ i, 0 < N.K i → N.DFRPositive i) →
      ∃ c : FIFOChoice n, IsDFRChoice 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), Section 3, Definition 1 (FIFO Policy), p. 9; Section 6, Definition 2 (Consolidation Policy) with the constants (33), p. 28; Appendix D, Definition D.1 (DFR Policy) and the demand assumption of Theorem D.1, p. E.23; existence of canonical optimal pairs from Lemma 1, p. 12, and the remark before it ("Coercivity ensures an optimal policy with finite reorder and order-up-to levels").
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