Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 7.9: the long chain CnC_nCn​ maximizes expected sales among all 2-flexibility designs

Proved
SupplyChainTheory.long_chain_optimal

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

combinatorial-optimizationoperations-researchprobabilityprocess-flexibilitysupply-chain

Theorem 7.9. Consider a balanced system of size n≥2n \ge 2n≥2 with exchangeable demand: nnn products, nnn plants of equal capacity, and a random demand vector whose joint law is invariant under permutations of the products. A 2-flexibility design is a set of plant-product capabilities in which every plant can produce exactly two products and every product can be produced by exactly two plants; the long chain CnC_nCn​, in which plant jjj makes products jjj and j+1j + 1j+1 (and plant nnn makes nnn and 111), is one of them. Let F2\mathcal{F}_2F2​ be the set of all 2-flexibility designs. Then

Cn∈arg⁡max⁡A∈F2[A],C_n \in \arg\max_{A \in \mathcal{F}_2} [A],Cn​∈argA∈F2​max​[A],

that is, CnC_nCn​ is a 2-flexibility design and [A]≤[Cn][A] \le [C_n][A]≤[Cn​] for every 2-flexibility design AAA, where [A]=E[P(D,A)][A] = \mathbb{E}[P(D, A)][A]=E[P(D,A)] is the expected maximum sales under AAA.

The book's proof: a 2-flexibility design is a disjoint union of closed chains of lengths n1,…,nmn_1, \dots, n_mn1​,…,nm​ summing to nnn, so [A]=∑j[Cnj]=∑jnj([Lnj]−[Lnj−1])[A] = \sum_j [C_{n_j}] = \sum_j n_j([L_{n_j}] - [L_{n_j - 1}])[A]=∑j​[Cnj​​]=∑j​nj​([Lnj​​]−[Lnj​−1​]) by Lemma 7.8; each increment [Lnj]−[Lnj−1][L_{n_j}] - [L_{n_j-1}][Lnj​​]−[Lnj​−1​] is at most [Ln]−[Ln−1][L_n] - [L_{n-1}][Ln​]−[Ln−1​] by Lemma 7.7 through the identity (7.31), and ∑jnj=n\sum_j n_j = n∑j​nj​=n gives [A]≤n([Ln]−[Ln−1])=[Cn][A] \le n([L_n] - [L_{n-1}]) = [C_n][A]≤n([Ln​]−[Ln−1​])=[Cn​]. This is the analytical explanation of Jordan and Graves's observation that one long chain outperforms several short ones.

Formalization Note Edges are (product, plant) pairs and product indices wrap modulo nnn. The decomposition of a 2-regular bipartite graph into cycles is part of the proof, not of the statement.

Preamble
import Definitions.Def_SupplyChainTheory_flexibility
Formal statement
namespace SupplyChainTheory

theorem long_chain_optimal {Ω : Type*} [MeasurableSpace Ω] {P : MeasureTheory.Measure Ω}
    [MeasureTheory.IsProbabilityMeasure P] {n : ℕ} (S : BalancedSystem P n) (hn : 2 ≤ n) :
    TwoFlex (longChain n) ∧ ∀ A : Finset (Fin n × Fin n), TwoFlex A →
      S.expPerf A ≤ S.expPerf (longChain 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, p. 252, Sect. 7.5.3, Theorem 7.9 and its proof, Eq. (7.31); after Simchi-Levi and Wei (2012)
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