Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A.2, p. 35 — moving the emergency facility up one level and dropping jjj changes the cost by λiPijr(ϕi−dij)\lambda_i P_{ijr}(\phi_i - d_{ij})λi​Pijr​(ϕi​−dij​)

Proved
ReliableFacilityLoc.LevelOrder.emergency_cost_identity

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

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

Let (X,Y,P)(X,Y,P)(X,Y,P) be a feasible solution of (RUFL). Suppose customer iii is assigned to the regular facility jjj at level rrr and to the emergency facility JJJ at level r+1≤Rr+1 \le Rr+1≤R, i.e. Yijr=YiJ,r+1=1Y_{ijr} = Y_{iJ,r+1} = 1Yijr​=YiJ,r+1​=1. Let Y′Y'Y′ be obtained by assigning JJJ at level rrr in place of jjj and dropping jjj (so YiJ,r+1′=Yij,r+1′=0Y'_{iJ,r+1} = Y'_{ij,r+1} = 0YiJ,r+1′​=Yij,r+1′​=0), and let P′=P(Y′)P' = P(Y')P′=P(Y′) be the probabilities recomputed from (1e)–(1f). Then (X,Y′,P′)(X,Y',P')(X,Y′,P′) is feasible, and

Φ(X,Y′,P′)−Φ(X,Y,P)=λi Pijr (ϕi−dij)(computed from (1f)).\Phi(X,Y',P') - \Phi(X,Y,P) = \lambda_i\,P_{ijr}\,(\phi_i - d_{ij}) \qquad\text{(computed from (1f))}.Φ(X,Y′,P′)−Φ(X,Y,P)=λi​Pijr​(ϕi​−dij​)(computed from (1f)).

This is the case k=Jk = Jk=J of the proof of Proposition 2: if dij>diJ=ϕid_{ij} > d_{iJ} = \phi_idij​>diJ​=ϕi​, λi>0\lambda_i > 0λi​>0 and Pijr>0P_{ijr} > 0Pijr​>0, the move strictly lowers the cost.

Formalization Note The page does not print this value; it says only that the case k=Jk = Jk=J "is similar, except that Yij,r+1′=Pij,r+1′=0Y'_{ij,r+1} = P'_{ij,r+1} = 0Yij,r+1′​=Pij,r+1′​=0, which reduces the cost even more". The explicit difference follows from (1e)–(1f): the emergency facility at level rrr has PiJr′=Pijr/(1−qj)P'_{iJr} = P_{ijr}/(1-q_j)PiJr′​=Pijr​/(1−qj​) and the removed level-(r+1)(r+1)(r+1) term had PiJ,r+1=qjPijr/(1−qj)P_{iJ,r+1} = q_j P_{ijr}/(1-q_j)PiJ,r+1​=qj​Pijr​/(1−qj​).

Preamble
import Mathlib
import Definitions.Def_ReliableFacilityLoc_LevelOrder_RUFL
import Definitions.Def_ReliableFacilityLoc_LevelOrder_Moves

open Finset
Formal statement
namespace ReliableFacilityLoc.LevelOrder

/-- **Emergency case `k = J`** (unnumbered; Appendix A.2, proof of Proposition 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).

Let `(X, Y, P)` be feasible for (RUFL), and let customer `i` be assigned to the regular facility `j`
at level `r` and to the emergency facility `J` at level `r + 1 ≤ R`. Move `J` up to level `r` and
drop `j` (`emergencyUpY`), recomputing the probabilities from (1e)–(1f) (`transProb`). The result is
feasible, and its objective differs from that of `(X, Y, P)` by `λ_i P_ijr (φ_i - d_ij)`.

Formalization Note: the page states only that this case "is similar, except that
`Y′_{ij,r+1} = P′_{ij,r+1} = 0`, which reduces the cost even more". The explicit change
`λ_i P_ijr (φ_i - d_ij)` is computed from (1e)–(1f): the emergency facility at level `r` has
`P′_iJr = P_ijr / (1 - q_j)`, and the removed level-`r+1` term had `P_{iJ,r+1} = q_j P_ijr / (1 - q_j)`. -/
theorem emergency_cost_identity {I J R : ℕ} (D : Instance I J R) (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) (r : Fin R)
    (hj : Y i j.castSucc r.castSucc = 1) (hJ : Y i (Fin.last J) r.succ = 1) :
    D.IsFeasible X (emergencyUpY i j.castSucc r Y)
        (D.transProb (emergencyUpY i j.castSucc r Y)) ∧
      D.objective X (emergencyUpY i j.castSucc r Y)
          (D.transProb (emergencyUpY i j.castSucc r Y)) - D.objective X Y P =
        D.lam i * P i j.castSucc r.castSucc * (D.phi i - D.d i j) := 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), case k = J
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