Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 7.7: building the long chain edge by edge, [L2n]−[L1n]≤[L3n]−[L2n]≤⋯≤[Lnn]−[Ln−1n]≤[Cn]−[Lnn][L^n_2] - [L^n_1] \le [L^n_3] - [L^n_2] \le \dots \le [L^n_n] - [L^n_{n-1}] \le [C_n] - [L^n_n][L2n​]−[L1n​]≤[L3n​]−[L2n​]≤⋯≤[Lnn​]−[Ln−1n​]≤[Cn​]−[Lnn​]

Proved
SupplyChainTheory.long_chain_increments

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

operations-researchprobabilityprocess-flexibilitysupply-chain

Lemma 7.7. For any balanced system of size nnn with exchangeable demand, the incremental benefit of each flexible edge added while building the long chain is nondecreasing:

[L2n]−[L1n]  ≤  [L3n]−[L2n]  ≤  ⋯  ≤  [Lnn]−[Ln−1n]  ≤  [Cn]−[Lnn],[L^n_2] - [L^n_1] \;\le\; [L^n_3] - [L^n_2] \;\le\; \cdots \;\le\; [L^n_n] - [L^n_{n-1}] \;\le\; [C_n] - [L^n_n],[L2n​]−[L1n​]≤[L3n​]−[L2n​]≤⋯≤[Lnn​]−[Ln−1n​]≤[Cn​]−[Lnn​],

where LknL^n_kLkn​ is the open chain through products and plants 1,…,k1, \dots, k1,…,k together with the dedicated edges of the remaining pairs, L1n=DnL^n_1 = D_nL1n​=Dn​ and Lnn=LnL^n_n = L_nLnn​=Ln​. The proof applies Corollary 7.6 to E=Lk+1nE = L^n_{k+1}E=Lk+1n​ with α=(2,1)\alpha = (2, 1)α=(2,1) and β=(k+1,k)\beta = (k + 1, k)β=(k+1,k): removing β\betaβ gives LknL^n_kLkn​, removing α\alphaα gives LknL^n_kLkn​ after moving pair 111 to the end, which exchangeability allows, and removing both gives Lk−1nL^n_{k-1}Lk−1n​; the last inequality is the same argument on CnC_nCn​ with β=(1,n)\beta = (1, n)β=(1,n). The book notes that, unlike Lemma 7.5, this holds only in expectation (Problem 7.15).

Formalization Note The chain of inequalities is stated as its two kinds of link: the consecutive increments for 2≤k≤n−12 \le k \le n - 12≤k≤n−1, and the final link for n≥2n \ge 2n≥2.

Preamble
import Definitions.Def_SupplyChainTheory_flexibility
Formal statement
namespace SupplyChainTheory

theorem long_chain_increments {Ω : Type*} [MeasurableSpace Ω] {P : MeasureTheory.Measure Ω}
    [MeasureTheory.IsProbabilityMeasure P] {n : ℕ} (S : BalancedSystem P n) :
    (∀ k, 2 ≤ k → k + 1 ≤ n →
        S.expPerf (partialChain n k) - S.expPerf (partialChain n (k - 1))
          ≤ S.expPerf (partialChain n (k + 1)) - S.expPerf (partialChain n k))
      ∧ (2 ≤ n →
        S.expPerf (partialChain n n) - S.expPerf (partialChain n (n - 1))
          ≤ S.expPerf (longChain n) - S.expPerf (partialChain n n)) := 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, pp. 250-251, Sect. 7.5.3, Lemma 7.7 and its proof, Eq. (7.29)
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