Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

pp. 812–813, §2.3 — an optimum can be a minimal cover

Proved
CJP83.CoverSeparation.knapsack_optimum_has_minimal_cover

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

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

Let 0≤xˉj≤10\le\bar x_j\le10≤xˉj​≤1 for every j∈Kj\in Kj∈K, and suppose the strict-cover problem (2.12) has minimum value zzz. For positive rational row weights, there is a minimal cover SSS of (2.5) whose separation objective equals that minimum:

∑j∈S(1−xˉj)=z.\sum_{j\in S}(1-\bar x_j)=z.j∈S∑​(1−xˉj​)=z.

The claim is the reverse direction's central assertion, which begins on p. 812 and continues on p. 813. Nonnegative objective coefficients allow a cover to be reduced without increasing its objective. The paper calls the resulting inequality a “minimum cover” on p. 813; here minimality has its (2.6) meaning.

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

theorem knapsack_optimum_has_minimal_cover
    {ι : 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 ∧
      (∑ j ∈ S, (1 - xbar j)) = z := by sorry
end CJP83.CoverSeparation
Source
Crowder, Johnson and Padberg, Solving Large-Scale Zero-One Linear Programming Problems, Operations Research 31 (1983), pp. 812–813, Section 2.3, (2.12), reverse direction
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