Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Probability that the first operating facility in a list is j(r)j(r)j(r)

Proved
ReliableFacilityLoc.Scenario.scenario_prob_first_operating

by mikedeng1 · Oct 7, 2026 · Mathlib 0df444a (Lean v4.33.1)

facility-locationp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1probabilityreliability

Let j(0),…,j(r−1)j(0),\dots,j(r-1)j(0),…,j(r−1) be distinct regular facilities and let j(r)j(r)j(r) be a facility (regular or the emergency facility JJJ) different from all of them. Let

Ω(i,r)={ω∈Ω:δj(r)ω=1, δj(ℓ)ω=0  ∀ 0≤ℓ≤r−1}\Omega(i,r) = \{\omega\in\Omega : \delta_{j(r)\omega} = 1,\ \delta_{j(\ell)\omega} = 0\ \ \forall\, 0 \le \ell \le r-1\}Ω(i,r)={ω∈Ω:δj(r)ω​=1, δj(ℓ)ω​=0  ∀0≤ℓ≤r−1}

be the set of scenarios in which j(0),…,j(r−1)j(0),\dots,j(r-1)j(0),…,j(r−1) have all failed and j(r)j(r)j(r) operates. Then

∑ω∈Ω(i,r)pω=(1−qj(r))∏ℓ=0r−1qj(ℓ).\sum_{\omega\in\Omega(i,r)} p_\omega = (1-q_{j(r)})\prod_{\ell=0}^{r-1} q_{j(\ell)}.ω∈Ω(i,r)∑​pω​=(1−qj(r)​)ℓ=0∏r−1​qj(ℓ)​.

This identity converts the scenario sum of (SSP) into the level-by-level probabilities of (RUFL) in both directions of the proof of Proposition 1.

Formalization Note The list j(0),…,j(r−1)j(0),\dots,j(r-1)j(0),…,j(r−1) is a duplicate-free list of regular sites and j(r)j(r)j(r) is any of the J+1J+1J+1 facilities not on it. For j(r)=Jj(r) = Jj(r)=J, δJω=1\delta_{J\omega} = 1δJω​=1 and qJ=0q_J = 0qJ​=0, so the right-hand side is ∏ℓqj(ℓ)\prod_\ell q_{j(\ell)}∏ℓ​qj(ℓ)​.

Preamble
import Definitions.Def_ReliableFacilityLoc_Scenario_SSP

open Finset
Formal statement
namespace ReliableFacilityLoc.Scenario

/-- **Scenario-probability identity** (Cui–Ouyang–Shen, UCTC-FR-2010-02 (Feb. 2010), A.1, proof of
Proposition 1, the third equality of the display on p. 33 (PDF 35), with `Ω(i, r)` as defined on
p. 34 (PDF 36)). Let `j(0), …, j(r-1)` be distinct regular facilities (the list `l`) and let `j(r)`
(the facility `k`, possibly the emergency facility `J`) differ from all of them. For
`Ω(i,r) = {ω ∈ Ω : δ_{j(r)ω} = 1, δ_{j(ℓ)ω} = 0 ∀ 0 ≤ ℓ ≤ r-1}`,
`Σ_{ω ∈ Ω(i,r)} p_ω = (1 - q_{j(r)}) Π_{ℓ=0}^{r-1} q_{j(ℓ)}`.

Formalization Note: `δ_Jω = 1` and `q_J = 0` for the emergency facility (pp. 8, 33), so for
`k = J` the right-hand side is `Π_ℓ q_{j(ℓ)}`. The distinctness hypotheses hold for the levels of a
(RUFL)-feasible assignment ((1b)–(1d)) and for the ordering of `N ∪ {J}` on p. 33; without them the
set `Ω(i,r)` can be empty while the right-hand side is not. -/
theorem scenario_prob_first_operating {I J R : ℕ} (D : Instance I J R) (l : List (Fin J))
    (hl : l.Nodup) (k : Fin (J + 1)) (hk : ∀ j ∈ l, j.castSucc ≠ k) :
    ∑ ω ∈ univ.filter (fun ω : FailureScenario J => delta ω k = true ∧ ∀ j ∈ l, ω j = false),
        D.scenarioProb ω =
      (1 - D.qExt k) * (l.map D.q).prod := by sorry

end ReliableFacilityLoc.Scenario
Source
Cui, Ouyang, Shen, Reliable Facility Location Design under the Risk of Disruptions, UCTC-FR-2010-02 (Feb. 2010), Appendix A.1 (proof of Proposition 1), p. 33 (PDF 35), third equality of the unnumbered display; Ω(i, r) as defined on p. 34 (PDF 36)
Human review
  • Endorsed by Shuze Chen · Oct 7, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 7, 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