Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A.2, p. 35 — if every regular qk>0q_k > 0qk​>0, an assigned facility has positive serving probability Pijr>0P_{ijr} > 0Pijr​>0

Proved
ReliableFacilityLoc.LevelOrder.prob_pos_of_assigned

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

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

Suppose every regular facility has a positive failure probability, qk>0q_k > 0qk​>0 for 0≤k≤J−10 \le k \le J-10≤k≤J−1. Let (X,Y,P)(X,Y,P)(X,Y,P) be a feasible solution of (RUFL). Then for every customer iii, every facility 0≤j≤J0 \le j \le J0≤j≤J (the emergency facility included) and every level 0≤r≤R0 \le r \le R0≤r≤R,

Yijr=1  ⟹  Pijr>0.Y_{ijr} = 1 \implies P_{ijr} > 0.Yijr​=1⟹Pijr​>0.

This is the fact that turns the identity of the swap into the strict inequality "λi(1−qk)(dik−dij)Pjr<0\lambda_i(1-q_k)(d_{ik}-d_{ij})P_{jr} < 0λi​(1−qk​)(dik​−dij​)Pjr​<0" of the paper's proof: the cost change of an improving swap is weighted by PijrP_{ijr}Pijr​, and it is strictly negative only if Pijr>0P_{ijr} > 0Pijr​>0.

Formalization Note The hypothesis qk>0q_k > 0qk​>0 is not in the paper, which uses Pjr>0P_{jr} > 0Pjr​>0 silently. Without it the statement fails: if the level-0 facility has q=0q = 0q=0, every later level has P=0P = 0P=0 by (1f).

Preamble
import Mathlib
import Definitions.Def_ReliableFacilityLoc_LevelOrder_RUFL

open Finset
Formal statement
namespace ReliableFacilityLoc.LevelOrder

/-- **Positivity of the serving probability of an assigned facility** (unnumbered; used for the
strict inequality "`λ_i(1 - q_k)(d_ik - d_ij)P_jr < 0`" in Appendix A.2, p. 35, PDF 37, of Cui,
Ouyang and Shen, *Reliable Facility Location Design under the Risk of Disruptions*,
UCTC-FR-2010-02, Feb. 2010).

If every regular facility has a positive failure probability `q_k > 0`, then in every feasible
solution `(X, Y, P)` of (RUFL), `Y_ijr = 1` implies `P_ijr > 0`, for every facility `j ≤ J`
(including the emergency facility) and every level `r ≤ R`.

Formalization Note: the hypothesis `0 < q k` is not in the paper; without it the statement is false
(if the level-0 facility has `q = 0`, every later level has `P = 0` by (1f)). It is the hypothesis
under which the strict inequality of A.2 holds. -/
theorem prob_pos_of_assigned {I J R : ℕ} (D : Instance I J R) (hq : ∀ k, 0 < D.q k)
    (X : Fin J → ℝ) (Y P : Fin I → Fin (J + 1) → Fin (R + 1) → ℝ) (hfeas : D.IsFeasible X Y P)
    (i : Fin I) (j : Fin (J + 1)) (r : Fin (R + 1)) (hj : Y i j r = 1) :
    0 < P i j r := by sorry

end ReliableFacilityLoc.LevelOrder
Source
Cui, Ouyang, Shen, Reliable Facility Location Design under the Risk of Disruptions, UCTC-FR-2010-02 (Feb. 2010), Appendix A.2 (proof of Proposition 2), p. 35 (PDF 37), the strict inequality "< 0"; (1e)–(1f), p. 9
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