Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A.3, Case 1 (diu≤divd_{iu} \le 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.case1

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 diu≤div≤φid_{iu} \le d_{iv} \le \varphi_idiu​≤div​≤φi​. List SSS in nondecreasing order of distance and let nˉ\bar nnˉ, ttt, PkP_kPk​, CkC_kCk​ be computed from SSS, with ttt the number of facilities of SSS with dij≤divd_{ij} \le d_{iv}dij​≤div​. Then

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

Compared with the marginal cost of vvv at SSS, the transportation part is multiplied by qu∈[0,1]q_u \in [0,1]qu​∈[0,1], because uuu is now served before vvv. Together with the sign of the bracket, this gives inequality (18) in this case.

Formalization Note The printed computation has two typos, (1−qt)(1-q_t)(1−qt​) for (1−qv)(1-q_v)(1−qv​) and uivu_{iv}uiv​ for μiv\mu_{iv}μiv​; the final line, which is stated, is correct. The bound div≤φid_{iv} \le \varphi_idiv​≤φi​ is the paper's "without loss of generality" assumption.

Preamble
import Mathlib
import Definitions.Def_ReliableFacilityLoc_Supermod_RSP
import Definitions.Def_ReliableFacilityLoc_Supermod_ClosedForm

open Finset
Formal statement
namespace ReliableFacilityLoc.Supermod

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

Printed (p. 36): "Case 1: diu ≤ div. In this case, it follows that Φi(S ∪ {u, v}) − Φi(S ∪ {u}) =
… = λi[quPt(1 − qv)div − qu(1 − qv) Σ_{k=t+1}^{n̄+1} Ck] + uiv = λiqu(1 − qv)(Ptdiv −
Σ_{k=t+1}^{n̄+1} Ck) + µiv."

Formalization Note: the printed first line has "`q_u P_t (1 − q_t) d_iv`" for `q_u P_t (1 − q_v) d_iv`
and the second line "`u_iv`" for `µ_iv`; both are typos (the last line is as stated). `d_iv ≤ φ_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 case1 {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)) (hduv : d u ≤ d v) (hdv : d v ≤ phi) :
    Phi lam d phi q mu R (insert u (insert v S)) - Phi lam d phi q mu R (insert u S) =
      lam * q u * (1 - q v) * (prodQ q L (countLE d (d v) L) * d v -
        ∑ k ∈ Icc (countLE d (d v) 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. 36 (PDF 38), Appendix A.3, Case 1
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