Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§4.1, p. 1431 — the total extraction x¹ of a feasible PCPSP-C solution is feasible for U-PIT

Proved
OpenPitMIP.UltPit.x1_feasible_upit

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

open-pit-miningp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1ultimate-pit-limit

Consider an instance of the PCPSP-C under the standing assumptions of §2.1 and a feasible solution (x,y)(x, y)(x,y) under either integrality condition. Define, for each cluster ccc,

xc1=∑t∈Txc,t.x^1_c = \sum_{t \in \mathcal T} x_{c,t}.xc1​=t∈T∑​xc,t​.

Then x1x^1x1 is feasible for the ultimate pit limit problem U-PIT: xc1≤xc′1x^1_c \le x^1_{c'}xc1​≤xc′1​ for every arc (c,c′)∈A(c, c') \in \mathcal A(c,c′)∈A, and 0≤xc1≤10 \le x^1_c \le 10≤xc1​≤1 for every cluster ccc.

This is what makes the pit limit POPTP^{OPT}POPT of a PCPSP-C solution, the support of x1x^1x1, comparable with the pit limit of U-PIT in Theorem 1.

Formalization Note The paper states this for a minimal optimal solution (x∗,y∗)(x^*, y^*)(x∗,y∗) and justifies it by constraints (4) alone; the statement here assumes only feasibility, which is stronger. The bound xc1≥0x^1_c \ge 0xc1​≥0 uses that every cluster contains a block (standing assumption), so that xc,t=∑dyb,d,t≥0x_{c,t} = \sum_d y_{b,d,t} \ge 0xc,t​=∑d​yb,d,t​≥0.

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

open PCPSPC

/-- §4.1, p. 1431: for a feasible solution `(x, y)` of the PCPSP-C, the vector
`x¹_c = ∑_{t ∈ 𝒯} x_{c,t}` is feasible for U-PIT (12)–(14). -/
theorem x1_feasible_upit {B D C : Type} [Fintype B] [Fintype D] [Fintype C] {T m : ℕ}
    (I : PCPSPC B D C T m) (hI : I.Standing) (κ : Integrality)
    (x : C → Fin T → ℝ) (y : B → D → Fin T → ℝ) (hxy : I.Feasible κ x y) :
    I.UPitFeasible (fun c => ∑ t, x c t) := by sorry

end OpenPitMIP.UltPit
Source
Oper. Res. 68(5), §4.1, 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