Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A.3 / §3.3.1: closed form Φi(S)=λi∑k=1nˉ+1Ck+∑j∈Sμij\Phi_i(S) = \lambda_i\sum_{k=1}^{\bar n+1} C_k + \sum_{j\in S}\mu_{ij}Φi​(S)=λi​∑k=1nˉ+1​Ck​+∑j∈S​μij​

Proved
ReliableFacilityLoc.Supermod.closed_form

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 for every regular facility and R≥1R \ge 1R≥1. Let SSS be a set of regular facilities with ∣S∣≤R|S| \le R∣S∣≤R, listed as j1,…,jnj_1, \dots, j_nj1​,…,jn​ in nondecreasing order of distance dijd_{ij}dij​ (ties in any order), and let nˉ\bar nnˉ, PkP_kPk​, CkC_kCk​ be as in the proof of Proposition 3. Then

Φi(S)=λi∑k=1nˉPk−1(1−qjk) dijk+λiPnˉφi+∑j∈Sμij=λi∑k=1nˉ+1Ck+∑j∈Sμij.\Phi_i(S) = \lambda_i \sum_{k=1}^{\bar n} P_{k-1}(1-q_{j_k})\, d_{ij_k} + \lambda_i P_{\bar n}\varphi_i + \sum_{j\in S}\mu_{ij} = \lambda_i \sum_{k=1}^{\bar n+1} C_k + \sum_{j\in S}\mu_{ij}.Φi​(S)=λi​k=1∑nˉ​Pk−1​(1−qjk​​)dijk​​+λi​Pnˉ​φi​+j∈S∑​μij​=λi​k=1∑nˉ+1​Ck​+j∈S∑​μij​.

In words: it is optimal to assign the facilities of SSS level by level in increasing order of distance, as long as the distance does not exceed the penalty φi\varphi_iφi​, and then the emergency facility. This closed form turns the mixed-integer program defining Φi(S)\Phi_i(S)Φi​(S) into an explicit expression, on which the supermodularity argument operates.

Formalization Note The hypothesis ∣S∣≤R|S| \le R∣S∣≤R is the cardinality constraint (6c) of (MSFi_ii​); without it the formula fails, because only RRR regular facilities fit at the levels 0,…,R−10, \dots, R-10,…,R−1. No sign is assumed on ddd, φi\varphi_iφi​ or μ\muμ.

Preamble
import Mathlib
import Definitions.Def_ReliableFacilityLoc_Supermod_RSP
import Definitions.Def_ReliableFacilityLoc_Supermod_ClosedForm

open Finset
Formal statement
namespace ReliableFacilityLoc.Supermod

/-- **Closed form of `Φ_i(S)`** (Cui, Ouyang & Shen, UCTC-FR-2010-02 (Feb. 2010), §3.3.1, p. 13,
PDF 15, and Appendix A.3, p. 36, PDF 38, the first display). Let `S` be a set of at most `R`
regular facilities and `L = [j_1, …, j_n]` a list of the elements of `S` in nondecreasing order of
distance `d_ij`. Then
`Φ_i(S) = λ_i Σ_{k=1}^{n̄} P_{k−1}(1 − q_{j_k}) d_{ij_k} + P_{n̄} φ_i + Σ_{j∈S} µ_ij
        = λ_i Σ_{k=1}^{n̄+1} C_k + Σ_{j∈S} µ_ij`,
where `n̄` is the number of elements of `S` with `d_ij ≤ φ_i`.

Printed (p. 36): "Following a similar argument as in the proof of Proposition 2, we know that it is
optimal to assign the facilities level by level in increasing order of distance, until the
transportation cost exceeds the penalty cost, i.e., Φi(S) = λi Σ_{k=1}^{n̄} Pk−1(1 − qjk)dijk + Pn̄φi
+ Σ_{j∈S} µij = λi Σ_{k=1}^{n̄+1} Ck + Σ_{j∈S} µij."

Formalization Note: the hypothesis `S.card ≤ R` is not printed next to the display; it is the
constraint (6c) of (MSF_i) (p. 13), and without it the formula is false (only `R` regular
facilities fit at the levels `0, …, R − 1`). `0 ≤ λ_i` (a demand rate), `0 ≤ q_j < 1` and
`R ≥ 1` are the standing assumptions of §3.1 (pp. 7–8). Ties in distance are allowed: the
statement holds for every list of `S` sorted by distance. No sign is assumed on `d`, `φ_i`, `µ`. -/
theorem closed_form {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)) (hS : S.card ≤ R) (L : List (Fin J)) (hLnd : L.Nodup)
    (hLS : L.toFinset = S) (hLsort : L.Pairwise (fun a b => d a ≤ d b)) :
    Phi lam d phi q mu R S =
      lam * ∑ k ∈ Icc 1 (countLE d phi L + 1), Ck d phi q L k + ∑ j ∈ S, mu j := 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, first display; also §3.3.1, p. 13 (PDF 15)
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