Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§4.1 claim (b), p. 1431 — U-PIT admits a unique minimal optimal solution

Proved
OpenPitMIP.UltPit.upit_unique_minimal_optimal

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

linear-programmingmaximum-closurep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1ultimate-pit-limit

Let pˉ∈RC\bar p \in \mathbb R^{\mathcal C}pˉ​∈RC be the cluster values pˉc=∑b∈cmax⁡dpb,d\bar p_c = \sum_{b \in c} \max_{d} p_{b,d}pˉ​c​=∑b∈c​maxd​pb,d​ of a PCPSP-C instance, and consider the ultimate pit limit problem

max⁡∑c∈Cpˉcxcs.t.xc≤xc′  ∀(c,c′)∈A,xc∈[0,1]  ∀c∈C.\max \sum_{c \in \mathcal C} \bar p_c x_c \quad \text{s.t.}\quad x_c \le x_{c'}\ \ \forall (c,c') \in \mathcal A, \qquad x_c \in [0,1]\ \ \forall c \in \mathcal C.maxc∈C∑​pˉ​c​xc​s.t.xc​≤xc′​  ∀(c,c′)∈A,xc​∈[0,1]  ∀c∈C.

Then U-PIT has exactly one minimal optimal solution: there is a unique optimal xxx such that every optimal x′≤xx' \le xx′≤x (componentwise) equals xxx.

Theorem 1 speaks of "the" minimal optimal solution of U-PIT; this claim is what makes the article well defined there.

Formalization Note The paper cites this property of maximum closure problems (Hochbaum 2008) rather than proving it. The statement needs at least one destination, so that max⁡dpb,d\max_d p_{b,d}maxd​pb,d​ exists. It holds for every instance, with no standing assumption, so none is stated.

Preamble
import Mathlib
import Definitions.Def_OpenPitMIP_UltPit_Setting
Formal statement
namespace OpenPitMIP.UltPit

open PCPSPC

/-- §4.1 claim (b), p. 1431: the ultimate pit limit problem U-PIT (12)–(14) admits a unique
minimal optimal solution. -/
theorem upit_unique_minimal_optimal {B D C : Type} [Fintype B] [Fintype D] [Fintype C]
    [Nonempty D] {T m : ℕ} (I : PCPSPC B D C T m) :
    ∃! x : C → ℝ, I.UPitMinimalOptimal x := by sorry

end OpenPitMIP.UltPit
Source
Oper. Res. 68(5), §4.1, claim (b), p. 1431
Human review
  • Endorsed by Shuze Chen · Oct 9, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 9, 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