Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A.3, Case 2 (diu>divd_{iu} > d_{iv}diu​>div​): Φi(S∪{u,v})−Φi(S∪{u})\Phi_i(S\cup\{u,v\}) - \Phi_i(S\cup\{u\})Φi​(S∪{u,v})−Φi​(S∪{u})

Proved
ReliableFacilityLoc.Supermod.case2

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

facility-locationoperations-researchp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1reliability

Assume λi≥0\lambda_i \ge 0λi​≥0, 0≤qj<10 \le q_j < 10≤qj​<1 and R≥1R \ge 1R≥1. Let SSS be a set of regular facilities, u≠vu \ne vu=v regular facilities not in SSS with ∣S∣+2≤R|S| + 2 \le R∣S∣+2≤R and div<diu≤φid_{iv} < d_{iu} \le \varphi_idiv​<diu​≤φi​. List SSS in nondecreasing order of distance and let nˉ\bar nnˉ, sss, ttt, PkP_kPk​, CkC_kCk​ be computed from SSS, where sss and ttt are the numbers of facilities of SSS with dij≤diud_{ij} \le d_{iu}dij​≤diu​, resp. dij≤divd_{ij} \le d_{iv}dij​≤div​ (so t≤st \le st≤s). Then

Φi(S∪{u,v})−Φi(S∪{u})=λi(1−qv){Pt div−[∑k=t+1sCk+Ps(1−qu) diu+qu∑k=s+1nˉ+1Ck]}+μiv.\Phi_i(S\cup\{u,v\}) - \Phi_i(S\cup\{u\}) = \lambda_i (1-q_v)\Big\{P_t\, d_{iv} - \Big[\sum_{k=t+1}^{s} C_k + P_s(1-q_u)\,d_{iu} + q_u \sum_{k=s+1}^{\bar n+1} C_k\Big]\Big\} + \mu_{iv}.Φi​(S∪{u,v})−Φi​(S∪{u})=λi​(1−qv​){Pt​div​−[k=t+1∑s​Ck​+Ps​(1−qu​)diu​+qu​k=s+1∑nˉ+1​Ck​]}+μiv​.

The bracket is the expected cost, in S∪{u}S \cup \{u\}S∪{u}, of the levels after the ttt-th; comparing it with ∑k=t+1nˉ+1Ck\sum_{k=t+1}^{\bar n+1} C_k∑k=t+1nˉ+1​Ck​ yields inequality (18) in this case.

Formalization Note The bound diu≤φid_{iu} \le \varphi_idiu​≤φi​ is the paper's "without loss of generality" assumption. The paper's justification of (18) in this case passes through an intermediate "≤\le≤" line that does not hold as printed; the difference of the two brackets is in fact equal to (1−qu)[Psdiu−∑k=s+1nˉ+1Ck](1-q_u)\big[P_s d_{iu} - \sum_{k=s+1}^{\bar n+1} C_k\big](1−qu​)[Ps​diu​−∑k=s+1nˉ+1​Ck​]. That justification is not part of this statement.

Preamble
import Mathlib
import Definitions.Def_ReliableFacilityLoc_Supermod_RSP
import Definitions.Def_ReliableFacilityLoc_Supermod_ClosedForm

open Finset
Formal statement
namespace ReliableFacilityLoc.Supermod

/-- **Case 2 of the proof of Proposition 3, `d_iu > d_iv`** (Cui, Ouyang & Shen, UCTC-FR-2010-02
(Feb. 2010), Appendix A.3, p. 37, PDF 39). Let `S` be a set of regular facilities, `u ≠ v` regular
facilities not in `S` with `|S| + 2 ≤ R` and `d_iv < d_iu ≤ φ_i`, and `L = [j_1, …, j_n]` a list
of `S` in nondecreasing order of distance; `n̄`, `s`, `t`, `P_k`, `C_k` are computed from `S`
(`s`, `t` the numbers of elements with `d_ij ≤ d_iu`, resp. `d_ij ≤ d_iv`). Then
`Φ_i(S ∪ {u, v}) − Φ_i(S ∪ {u}) = λ_i (1 − q_v){P_t d_iv − [Σ_{k=t+1}^{s} C_k + P_s(1 − q_u) d_iu
+ q_u Σ_{k=s+1}^{n̄+1} C_k]} + µ_iv`.

Printed (p. 37): "Case 2: diu > div. In this case t ≤ s, and the following assertion holds:
Φi(S ∪ {u, v}) − Φi(S ∪ {u}) = … = λi(1 − qv){Ptdiv − [Σ_{k=t+1}^{s} Ck + Ps(1 − qu)diu +
qu Σ_{k=s+1}^{n̄+1} Ck]} + µiv."

Formalization Note: `d_iu ≤ φ_i` is the paper's "without loss of generality" assumption of p. 36.
`|S| + 2 ≤ R` makes `S ∪ {u, v}` satisfy (6c), so that the closed form applies to every set
involved. `0 ≤ λ_i`, `0 ≤ q_j < 1`, `R ≥ 1` are the standing assumptions of §3.1. -/
theorem case2 {J R : ℕ} (lam : ℝ) (d : Fin J → ℝ) (phi : ℝ) (q : Fin J → ℝ)
    (mu : Fin J → ℝ) (hlam : 0 ≤ lam) (hq0 : ∀ j, 0 ≤ q j) (hq1 : ∀ j, q j < 1) (hR : 1 ≤ R)
    (S : Finset (Fin J)) (u v : Fin J) (huv : u ≠ v) (hu : u ∉ S) (hv : v ∉ S)
    (hS : S.card + 2 ≤ R) (L : List (Fin J)) (hLnd : L.Nodup) (hLS : L.toFinset = S)
    (hLsort : L.Pairwise (fun a b => d a ≤ d b)) (hdvu : d v < d u) (hdu : d u ≤ phi) :
    Phi lam d phi q mu R (insert u (insert v S)) - Phi lam d phi q mu R (insert u S) =
      lam * (1 - q v) * (prodQ q L (countLE d (d v) L) * d v -
        (∑ k ∈ Icc (countLE d (d v) L + 1) (countLE d (d u) L), Ck d phi q L k +
          prodQ q L (countLE d (d u) L) * (1 - q u) * d u +
          q u * ∑ k ∈ Icc (countLE d (d u) L + 1) (countLE d phi L + 1), Ck d phi q L k)) +
        mu v := by sorry

end ReliableFacilityLoc.Supermod
Source
Cui, Ouyang, Shen, Reliable Facility Location Design under the Risk of Disruptions, UCTC-FR-2010-02 (Feb. 2010), p. 37 (PDF 39), Appendix A.3, Case 2
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