Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 6.4 (Shang and Song): gjl≤gj≤gjug^l_j \le g_j \le g^u_jgjl​≤gj​≤gju​ and Sjl≤Sj∗≤SjuS^l_j \le S^*_j \le S^u_jSjl​≤Sj∗​≤Sju​

Disproved
SupplyChainTheory.shang_song_bounds

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

boundsmultiechelonnewsvendoroperations-researchsupply-chain

Theorem 6.4 (Shang and Song 2003). In the serial system with echelon holding costs hj>0h_j > 0hj​>0, stockout cost p>0p > 0p>0 and lead-time demands of finite mean, let S∗S^*S∗ be built by the sequential minimization of Theorem 6.3 and let gjlg^l_jgjl​ and gjug^u_jgju​ be the truncated cost (6.31) with every local holding cost replaced by hjh_jhj​ (lower) or by ∑k=1jhk\sum_{k=1}^j h_k∑k=1j​hk​ (upper): the single-stage newsvendor cost with demand D~j=D1+⋯+Dj\tilde D_j = D_1 + \dots + D_jD~j​=D1​+⋯+Dj​ and stockout cost p+hj+1′p + h'_{j+1}p+hj+1′​, plus the holding cost of the pipeline stock E[D1]+⋯+E[Dj−1]\mathbb{E}[D_1] + \dots + \mathbb{E}[D_{j-1}]E[D1​]+⋯+E[Dj−1​] at the replaced rate. Then for any jjj and yyy:

(a) gjl(y)≤gj(y)≤gju(y)g^l_j(y) \le g_j(y) \le g^u_j(y)gjl​(y)≤gj​(y)≤gju​(y);

(b) Sjl≤Sj∗≤SjuS^l_j \le S^*_j \le S^u_jSjl​≤Sj∗​≤Sju​, where, as the book says on p. 200, SjuS^u_jSju​ minimizes gjlg^l_jgjl​ and SjlS^l_jSjl​ minimizes gjug^u_jgju​: the cheaper holding rate hjh_jhj​ of the lower bound has the larger fractile, so it is the upper base-stock bound.

The bounds come from the truncated system of (6.31): with all local holding costs equal, all inventory is held at stage 1 and the jjj-stage system collapses to a single stage with lead time L1+⋯+LjL_1 + \dots + L_jL1​+⋯+Lj​. Their average (6.32) is the Shang-Song heuristic, accurate to a fraction of a percent on the authors' test instances.

Formalization Note The bounding functions keep the pipeline holding cost that (6.31) charges on stock in transit; the book drops it when it writes the minimizers, since it does not affect them, but part (a) compares values and fails without it (in Example 6.1, g2(S2∗)=20.82g_2(S^*_2) = 20.82g2​(S2∗​)=20.82 while the single-stage cost alone is 12.212.212.2). Part (b) asserts the existence of a minimizer SjlS^l_jSjl​ of gjug^u_jgju​ and a minimizer SjuS^u_jSju​ of gjlg^l_jgjl​ bracketing Sj∗S^*_jSj∗​; when the fractiles of D~j\tilde D_jD~j​ are unique these are the book's F~j−1\tilde F_j^{-1}F~j−1​ values. In Example 6.2 at j=2j = 2j=2: S2l=11.71≤S2∗=12.02≤S2u=12.35S^l_2 = 11.71 \le S^*_2 = 12.02 \le S^u_2 = 12.35S2l​=11.71≤S2∗​=12.02≤S2u​=12.35. Pairing the minimizers the other way would assert 12.35≤12.0212.35 \le 12.0212.35≤12.02.


Retired. Retired because the demand laws were not required to be supported on [0, ∞), and with D₁ = δ₋₁ the upper bound of (a) fails (accepted disproof); replaced by SupplyChainTheory.shang_song_bounds_v2 with nonnegative demands.

Preamble
import Definitions.Def_SupplyChainTheory_multiechelon
Formal statement
namespace SupplyChainTheory

theorem shang_song_bounds (N : ℕ) (h : ℕ → ℝ) (p : ℝ) (D : ℕ → MeasureTheory.Measure ℝ)
    [∀ j, MeasureTheory.IsProbabilityMeasure (D j)]
    (hD : ∀ j, MeasureTheory.Integrable (fun x => x) (D j))
    (hh : ∀ j, 0 < h j) (hp : 0 < p) (Sstar : ℕ → ℝ) (hS : CSSequential N h p D Sstar)
    (j : ℕ) (hj1 : 1 ≤ j) (hjN : j ≤ N) :
    (∀ y, ssLower N h p D j y ≤ csG N h p D Sstar j y
        ∧ csG N h p D Sstar j y ≤ ssUpper N h p D j y)
      ∧ ∃ Sl Su : ℝ, IsMinOn (ssUpper N h p D j) Set.univ Sl
          ∧ IsMinOn (ssLower N h p D j) Set.univ Su ∧ Sl ≤ Sstar j ∧ Sstar j ≤ Su := 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. 201, Sect. 6.2.3, Theorem 6.4; the bounding functions are defined on p. 200; after Shang and Song (2003)
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