Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§2.2, p. 1428 — feasible PCPSP-C solutions correspond to a nested sequence of pits

Proved
OpenPitMIP.UltPit.feasible_nested_pits

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

nested-pitsopen-pit-miningp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1precedence-constraints

Consider an instance of the PCPSP-C (formulation (1)–(7)) under the standing assumptions of §2.1, and let (x,y)(x, y)(x,y) be a feasible solution under either integrality condition (10) or (11). For each period t∈Tt \in \mathcal Tt∈T define

B(x;t)={b∈B:∑t′=1txc(b),t′>0}.\mathcal B(x; t) = \Big\{ b \in \mathcal B : \sum_{t'=1}^{t} x_{c(b),t'} > 0 \Big\}.B(x;t)={b∈B:t′=1∑t​xc(b),t′​>0}.

Then:

  1. for every ttt, the set B(x;t)\mathcal B(x; t)B(x;t) is a pit: if b1≺b2b_1 \prec b_2b1​≺b2​ and b2∈B(x;t)b_2 \in \mathcal B(x;t)b2​∈B(x;t) then b1∈B(x;t)b_1 \in \mathcal B(x;t)b1​∈B(x;t);
  2. the sets are nested: t≤t′t \le t't≤t′ implies B(x;t)⊆B(x;t′)\mathcal B(x; t) \subseteq \mathcal B(x; t')B(x;t)⊆B(x;t′).

This is the observation that links PCPSP-C schedules with the phase design problem: a schedule extracts, period by period, an increasing family of pits.

Formalization Note The precedence constraints (4) are imposed only along the arcs A\mathcal AA of the transitive reduction, as in the paper. Periods are Fin T (index ttt is period t+1t+1t+1).

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

open PCPSPC

/-- §2.2, p. 1428: for every feasible solution of the PCPSP-C and every period `t`, the set
`𝓑(x; t) = {b ∈ 𝓑 : ∑_{t'=1}^{t} x_{c(b),t'} > 0}` is a pit, and these sets are nested in `t`. -/
theorem feasible_nested_pits {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) :
    (∀ t, I.IsPit {b | 0 < cum x (I.clu b) t}) ∧
      ∀ t t', t ≤ t' → {b | 0 < cum x (I.clu b) t} ⊆ {b | 0 < cum x (I.clu b) t'} := by sorry

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