Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 9.2: the steady-state probabilities of the disruption chain, πn=αβα+β(1−β)n−1\pi_n = \frac{\alpha\beta}{\alpha+\beta}(1-\beta)^{n-1}πn​=α+βαβ​(1−β)n−1 and F(n)=1−αα+β(1−β)nF(n) = 1 - \frac{\alpha}{\alpha+\beta}(1-\beta)^nF(n)=1−α+βα​(1−β)n

Proved
SupplyChainTheory.disruption_stationary

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

markov-chainoperations-researchprobabilitysupply-uncertainty

Lemma 9.2. If the disruption probability is α∈(0,1]\alpha \in (0, 1]α∈(0,1] and the recovery probability is β∈(0,1]\beta \in (0, 1]β∈(0,1], then the distribution π0=β/(α+β)\pi_0 = \beta/(\alpha+\beta)π0​=β/(α+β), πn=αβα+β(1−β)n−1\pi_n = \frac{\alpha\beta}{\alpha+\beta}(1-\beta)^{n-1}πn​=α+βαβ​(1−β)n−1 (n≥1n \ge 1n≥1) is summable with total mass 111, satisfies the stationary equations of the disruption chain (state 000 up, state n≥1n \ge 1n≥1 the nnn-th period of a disruption), and its distribution function is

F(n)=1−αα+β(1−β)n,n≥0.F(n) = 1 - \frac{\alpha}{\alpha+\beta}(1-\beta)^n, \qquad n \ge 0.F(n)=1−α+βα​(1−β)n,n≥0.

The book omits the proof (Problem 9.10). Down intervals are geometric with parameter β\betaβ, and π0=β/(α+β)\pi_0 = \beta/(\alpha+\beta)π0​=β/(α+β) is the long-run fraction of up periods (9.8); the chain's stationarity is what justifies treating πn\pi_nπn​ as the probability that a random period is the nnn-th of a disruption in the cost (9.14).

Preamble
import Definitions.Def_SupplyChainTheory_disruptions
Formal statement
namespace SupplyChainTheory

theorem disruption_stationary (α β : ℝ) (hα0 : 0 < α) (hα1 : α ≤ 1) (hβ0 : 0 < β) (hβ1 : β ≤ 1) :
    Summable (disruptionPmf α β) ∧ (∑' n, disruptionPmf α β n) = 1
      ∧ IsStationary α β (disruptionPmf α β)
      ∧ ∀ n, disruptionCdf α β n = 1 - α / (α + β) * (1 - β) ^ 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. 362, Sect. 9.2.2.1, Lemma 9.2: 'Proof. Omitted; see Problem 9.10'; the chain is described on pp. 361-362, Eq. (9.8)-(9.10)
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