Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

An optimal (SSP) solution may serve every customer by her nearest operating open facility

Proved
ReliableFacilityLoc.Scenario.ssp_nearest_normalization

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

facility-locationp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1reliabilitystochastic-programming

Let (X,Y)(X,Y)(X,Y) be an optimal solution of (SSP). Then there is an assignment Y′Y'Y′ such that (X,Y′)(X,Y')(X,Y′) is also optimal for (SSP) and, for every customer iii, scenario ω\omegaω and facility kkk,

Yikω′=1  ⟺  k=min⁡{0≤k≤J:δkωXk=1, dik≤dik′ ∀k′≠k with δk′ωXk′=1},Y'_{ik\omega} = 1 \iff k = \min\{0 \le k \le J : \delta_{k\omega}X_k = 1,\ d_{ik} \le d_{ik'}\ \forall k' \ne k \text{ with } \delta_{k'\omega}X_{k'} = 1\},Yikω′​=1⟺k=min{0≤k≤J:δkω​Xk​=1, dik​≤dik′​ ∀k′=k with δk′ω​Xk′​=1},

with the conventions δJω=1\delta_{J\omega} = 1δJω​=1 and XJ=1X_J = 1XJ​=1. In words: each customer is always served by her closest open, operating facility, and ties are broken in favour of the lowest index.

This is the "without loss of generality" step of the second half of the proof of Proposition 1.

Formalization Note The "without loss of generality" is stated as the existence of such a Y′Y'Y′ for the same location vector XXX. It relies on λi≥0\lambda_i \ge 0λi​≥0; no sign is needed on ddd or ϕ\phiϕ.

Preamble
import Definitions.Def_ReliableFacilityLoc_Scenario_SSP

open Finset
Formal statement
namespace ReliableFacilityLoc.Scenario

/-- **Nearest-open-facility normalization of (SSP)** (Cui–Ouyang–Shen, UCTC-FR-2010-02 (Feb. 2010),
A.1, proof of Proposition 1, p. 33 (PDF 35)): "Without loss of generality, we assume that
`Y_ijω = 1` if and only if `j = min{0 ≤ k ≤ J : δ_kω X_k = 1, d_ik ≤ d_ik' ∀ k' ≠ k s.t.
δ_k'ω X_k' = 1}` (by convention, we assume `X_J = 1`)". For every optimal `(X, Y)` of (SSP) there is
an optimal `(X, Y')` of (SSP), with the same `X`, in which every customer in every scenario is
served by her closest operating open facility, ties broken by the lowest index.

Formalization Note: the "without loss of generality" is stated as the existence of such a `Y'`
for the same `X`. It uses `λ_i ≥ 0` (part of `Instance`); no sign is needed on `d` or `φ`. -/
theorem ssp_nearest_normalization {I J R : ℕ} (D : Instance I J R) (X : Fin J → ℝ)
    (Y : Fin I → Fin (J + 1) → FailureScenario J → ℝ) (h : D.IsSSPOptimal X Y) :
    ∃ Y' : Fin I → Fin (J + 1) → FailureScenario J → ℝ,
      D.IsSSPOptimal X Y' ∧ ∀ i ω k, Y' i k ω = 1 ↔ D.IsNearestServer X i ω k := by sorry

end ReliableFacilityLoc.Scenario
Source
Cui, Ouyang, Shen, Reliable Facility Location Design under the Risk of Disruptions, UCTC-FR-2010-02 (Feb. 2010), Appendix A.1 (proof of Proposition 1), p. 33 (PDF 35), "Without loss of generality, we assume that Y_ijω = 1 if and only if …"
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