Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary 7.6: [E]+[E∖{α,β}]≥[E∖{α}]+[E∖{β}][E] + [E \setminus \{\alpha, \beta\}] \ge [E \setminus \{\alpha\}] + [E \setminus \{\beta\}][E]+[E∖{α,β}]≥[E∖{α}]+[E∖{β}]

Proved
SupplyChainTheory.flex_supermodular_expected

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

operations-researchprobabilityprocess-flexibilitysupermodularitysupply-chain

Corollary 7.6. Let E⊆CnE \subseteq C_nE⊆Cn​ be a flexibility design for a balanced system of size nnn and let α\alphaα and β\betaβ be two flexible edges in EEE. Then, with [E]=E[P(D,E)][E] = \mathbb{E}[P(D, E)][E]=E[P(D,E)] the expected performance over the random demand DDD,

[E]+[E∖{α,β}]  ≥  [E∖{α}]+[E∖{β}].[E] + [E \setminus \{\alpha, \beta\}] \;\ge\; [E \setminus \{\alpha\}] + [E \setminus \{\beta\}].[E]+[E∖{α,β}]≥[E∖{α}]+[E∖{β}].

Since Lemma 7.5 holds for every demand realization it holds in expectation: any two flexible edges of the long chain complement each other, having one increasing the marginal benefit of adding the other. Exchangeability is not needed here; it enters in Lemma 7.7.

Preamble
import Definitions.Def_SupplyChainTheory_flexibility
Formal statement
namespace SupplyChainTheory

theorem flex_supermodular_expected {Ω : Type*} [MeasurableSpace Ω]
    {P : MeasureTheory.Measure Ω} [MeasureTheory.IsProbabilityMeasure P] {n : ℕ}
    (S : BalancedSystem P n) (E : Finset (Fin n × Fin n)) (hE : E ⊆ longChain n)
    (a b : Fin n × Fin n) (ha : a ∈ E) (hb : b ∈ E) (hfa : IsFlexEdge a) (hfb : IsFlexEdge b) :
    S.expPerf (E \ {a}) + S.expPerf (E \ {b}) ≤ S.expPerf E + S.expPerf (E \ {a, b}) := 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. 250, Sect. 7.5.3, Corollary 7.6, Eq. (7.28)
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