Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 9.4: the optimal base-stock level is an integer multiple of ddd

Proved
SupplyChainTheory.disruption_optimal_multiple

by naimengye · Sep 24, 2026 · Mathlib 0df444a (Lean v4.33.1)

base-stockinventoryoperations-researchsupply-uncertainty

Lemma 9.4. In the infinite-horizon newsvendor problem with deterministic demand d>0d > 0d>0 and supply disruptions (0<α,β≤10 < \alpha, \beta \le 10<α,β≤1, h,p>0h, p > 0h,p>0), the expected cost per period g(S)=∑nπng^(S,n)g(S) = \sum_n \pi_n \hat g(S, n)g(S)=∑n​πn​g^​(S,n) has a minimizer that is an integer multiple of ddd, and its least minimizer is such a multiple.

The book's sketch: ggg is piecewise linear in SSS with breakpoints at the multiples of ddd, so the minimum of the (convex) function is attained at a breakpoint. This reduces the choice of the base-stock level to a discrete search, which Theorem 9.5 then resolves in closed form.

Preamble
import Definitions.Def_SupplyChainTheory_disruptions
Formal statement
namespace SupplyChainTheory

theorem disruption_optimal_multiple (α β h p d : ℝ) (hα0 : 0 < α) (hα1 : α ≤ 1) (hβ0 : 0 < β)
    (hβ1 : β ≤ 1) (hh : 0 < h) (hp : 0 < p) (hd : 0 < d) :
    ∃ k : ℕ, IsMinOn (meanCost α β h p d) Set.univ (k * d)
      ∧ ∀ S, IsMinOn (meanCost α β h p d) Set.univ S → k * d ≤ S := by sorry

end SupplyChainTheory
Source
Lawrence V. Snyder and Zuo-Jun Max Shen, Fundamentals of Supply Chain Theory, 2nd ed., Wiley 2019, DOI 10.1002/9781119584445, p. 363, Sect. 9.2.2.4, Lemma 9.4 and its proof sketch ('g is a piecewise-linear function of S, with breakpoints at multiples of d')
Human review
  • Endorsed by Shuze Chen · Sep 25, 2026

    Confirmed by the moderator at approval.

  • Endorsed by naimengye · Sep 25, 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