Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 8.8: the ppp-center value is at most rrr iff the set covering problem with radius rrr needs at most ppp facilities

Proved
SupplyChainTheory.pcenter_set_cover

by naimengye · Sep 24, 2026 · Mathlib 0df444a (Lean v4.33.1)

facility-locationoperations-researchp-centerset-covering

Lemma 8.8. Let r≥0r \ge 0r≥0 and 1≤p≤∣J∣1 \le p \le |J|1≤p≤∣J∣. The optimal objective value of the (vertex) ppp-center problem is at most rrr if and only if the optimal objective value of the set covering location problem with coverage radius rrr is at most ppp, i.e., some set of at most ppp sites has every customer within distance rrr of one of its members.

The book omits the proof (Problem 8.47). A ppp-set with maximum assigned distance at most rrr covers within rrr; a cover with fewer than ppp sites can be padded to exactly ppp without increasing any assigned distance. This is the basis of the bisection algorithm for the ppp-center problem, which solves a set covering problem at each radius.

Formalization Note The set covering value is stated through its feasible solutions rather than as a natural-number infimum, whose value on an infeasible instance would be 000.

Preamble
import Definitions.Def_SupplyChainTheory_location
Formal statement
namespace SupplyChainTheory

theorem pcenter_set_cover {n m : ℕ} (c : Fin n → Fin m → ℝ) (p : ℕ) (hp : 1 ≤ p) (hpm : p ≤ m)
    (r : ℝ) (hr : 0 ≤ r) :
    pCenterValue c p ≤ r ↔ ∃ S : Finset (Fin m), S.card ≤ p ∧ ∀ i, ∃ j ∈ S, c i j ≤ r := by sorry

end SupplyChainTheory
Source
Lawrence V. Snyder and Zuo-Jun Max Shen, Fundamentals of Supply Chain Theory, 2nd ed., Wiley 2019, DOI 10.1002/9781119584445, p. 312, Sect. 8.4.3, Lemma 8.8: 'Proof. Omitted; see Problem 8.47'
Human review
  • Endorsed by Shuze Chen · Sep 25, 2026

    Confirmed by the moderator at approval.

  • Endorsed by naimengye · Sep 25, 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