Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

p. 812, §2.3 — violated cover iff separation optimum is below one

Proved
CJP83.CoverSeparation.violated_cover_iff_knapsack_value_lt_one

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

cover-separationknapsackp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let KKK be finite, aj>0a_j>0aj​>0 rational, a0a_0a0​ rational, and 0≤xˉj≤10\le\bar x_j\le10≤xˉj​≤1 for all jjj. Suppose the strict-cover problem (2.12) attains its minimum objective value zzz. Then

(∃ a minimal cover S: ∑j∈Sxˉj>∣S∣−1)⟺z<1.\bigl(\exists\text{ a minimal cover }S:\ \sum_{j\in S}\bar x_j>|S|-1\bigr) \quad\Longleftrightarrow\quad z<1.(∃ a minimal cover S: j∈S∑​xˉj​>∣S∣−1)⟺z<1.

This is the paper's constraint identification equivalence: solving (2.12) detects a minimal cover inequality (2.7) that cuts off xˉ\bar xxˉ.

Formalization Note The paper takes xˉ\bar xxˉ to be an LP-relaxation optimum, but this result uses only its unit-cube bounds. Existence of the optimal value is explicit: if no cover exists, (2.12) has no feasible point and no minimum. The strict knapsack constraint remains strict.

Preamble
import Mathlib
import Definitions.Def_CJP83_CoverSeparation_KnapsackRow
Formal statement
namespace CJP83.CoverSeparation

theorem violated_cover_iff_knapsack_value_lt_one
    {ι : Type*} [Fintype ι] [DecidableEq ι]
    (a : ι → ℚ) (a₀ : ℚ) (hpos : ∀ j, 0 < a j)
    (xbar : ι → ℝ) (hcube : ∀ j, 0 ≤ xbar j ∧ xbar j ≤ 1)
    (z : ℝ) (hz : IsLeast (sepValues a a₀ xbar) z) :
    (∃ S : Finset ι, IsMinimalCover a a₀ S ∧
      (S.card : ℝ) - 1 < ∑ j ∈ S, xbar j) ↔ z < 1 := by sorry
end CJP83.CoverSeparation
Source
Crowder, Johnson and Padberg, Solving Large-Scale Zero-One Linear Programming Problems, Operations Research 31 (1983), p. 812, Section 2.3, (2.7), (2.12), proof continues p. 813
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

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