Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 6.1: ∑jhjIj=∑jhj′(Ij′+ITj−1)\sum_j h_j I_j = \sum_j h'_j (I'_j + IT_{j-1})∑j​hj​Ij​=∑j​hj′​(Ij′​+ITj−1​), echelon and local holding costs agree

Proved
SupplyChainTheory.echelon_local_holding

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

algebramultiechelonoperations-researchsupply-chain

Proposition 6.1. In an NNN-stage serial system with local holding costs hj′h'_jhj′​, echelon holding costs hj=hj′−hj+1′h_j = h'_j - h'_{j+1}hj​=hj′​−hj+1′​ (hN+1′=0h'_{N+1} = 0hN+1′​=0), local on-hand inventories Ij′I'_jIj′​, in-transit inventories ITj−1IT_{j-1}ITj−1​ (IT0=0IT_0 = 0IT0​=0) and echelon on-hand inventories Ij=∑i=1j(Ii′+ITi−1)I_j = \sum_{i=1}^j (I'_i + IT_{i-1})Ij​=∑i=1j​(Ii′​+ITi−1​),

∑j=1NhjIj  =  ∑j=1Nhj′ (Ij′+ITj−1).\sum_{j=1}^N h_j I_j \;=\; \sum_{j=1}^N h'_j\,(I'_j + IT_{j-1}).j=1∑N​hj​Ij​=j=1∑N​hj′​(Ij′​+ITj−1​).

Total holding cost can be computed with either echelon or local quantities. The book omits the proof (Problem 6.4); it is a summation by parts. This is what allows the chapter to optimize echelon base-stock levels with the echelon cost (6.9) in place of the local cost (6.8).

Preamble
import Definitions.Def_SupplyChainTheory_multiechelon
Formal statement
namespace SupplyChainTheory

theorem echelon_local_holding (N : ℕ) (h' I' IT : ℕ → ℝ) :
    ∑ j ∈ Finset.Icc 1 N, echelonHolding N h' j * echelonOnHand I' IT j
      = ∑ j ∈ Finset.Icc 1 N, h' j * (I' j + if j = 1 then 0 else IT (j - 1)) := 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. 192, Sect. 6.2.1, Proposition 6.1, Eq. (6.5): 'Proof. Omitted; see Problem 6.4'
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