Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(21), p. 1432 — under full integrality every cumulative variable w_{c,t} is 0 or 1

Proved
OpenPitMIP.Extraction.eq_21

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

integralitymixed-integer-programmingopen-pit-miningp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Consider an instance of the PCPSP-C satisfying the standing assumptions, and let (x,y)(x,y)(x,y) be feasible for the PCPSP-F, i.e. with full integrality xc,t∈{0,1}x_{c,t}\in\{0,1\}xc,t​∈{0,1} (10). Then the cumulative variables wc,t=∑t′=1txc,t′w_{c,t}=\sum_{t'=1}^{t}x_{c,t'}wc,t​=∑t′=1t​xc,t′​ satisfy

wc,t∈{0,1}∀c∈C, ∀t∈T.(21)w_{c,t}\in\{0,1\}\qquad\forall c\in\mathcal C,\ \forall t\in\mathcal T.\tag{21}wc,t​∈{0,1}∀c∈C, ∀t∈T.(21)

This is the form of the integrality condition used in the proofs of the clique, early start and diamond cuts.

Formalization Note The partial integrality counterpart (22) is not a separate statement: in this formalization condition (11) is already written in the cumulative variables, so (22) is (11) verbatim.

Preamble
import Mathlib
import Definitions.Def_OpenPitMIP_Extraction_Setting
Formal statement
namespace OpenPitMIP.Extraction

/-- Display (21), §5, p. 1432: at every feasible point of the PCPSP-F (full integrality (10)),
every cumulative variable `w_{c,t} = cum x c t` is `0` or `1`. -/
theorem eq_21 {B D C : Type} [Fintype B] [Fintype D] [Fintype C] {T m : ℕ}
    (I : PCPSPC B D C T m) (hI : I.Standing)
    (x : C → Fin T → ℝ) (y : B → D → Fin T → ℝ) (hxy : I.Feasible .F x y) :
    ∀ (c : C) (t : Fin T), PCPSPC.cum x c t = 0 ∨ PCPSPC.cum x c t = 1 := by sorry

end OpenPitMIP.Extraction
Source
Oper. Res. 68(5), §5, (21), p. 1432
Human review
  • Endorsed by Shuze Chen · Oct 10, 2026

    Confirmed by the moderator at approval.

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