Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

p. 811, (2.9) — validity of configuration inequalities

Proved
CJP83.CoverSeparation.configuration_inequality_valid

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

configuration-inequalityknapsackp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let S∗⊆KS^*\subseteq KS∗⊆K, t∉S∗t\notin S^*t∈/S∗ and 2≤k≤∣S∗∣2\le k\le |S^*|2≤k≤∣S∗∣ form a (1,k)(1,k)(1,k)-configuration for the positive-weight row (2.5): ∑j∈S∗aj≤a0\sum_{j\in S^*}a_j\le a_0∑j∈S∗​aj​≤a0​ and every kkk-element subset Q⊆S∗Q\subseteq S^*Q⊆S∗ makes Q∪{t}Q\cup\{t\}Q∪{t} a minimal cover. For each integer rrr with k≤r≤∣S∗∣k\le r\le |S^*|k≤r≤∣S∗∣ and each T⊆S∗T\subseteq S^*T⊆S∗ of size rrr, every feasible zero–one vector xxx satisfies

(r−k+1)xt+∑j∈Txj≤r.(r-k+1)x_t+\sum_{j\in T}x_j\le r.(r−k+1)xt​+j∈T∑​xj​≤r.

These are all the inequalities in (2.9), including the cases r=kr=kr=k and r=∣S∗∣r=|S^*|r=∣S∗∣.

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

theorem configuration_inequality_valid {ι : Type*} [Fintype ι] [DecidableEq ι]
    (a : ι → ℚ) (a₀ : ℚ) (hpos : ∀ j, 0 < a j)
    (Sstar : Finset ι) (t : ι) (k r : ℕ)
    (hconfig : IsOneKConfiguration a a₀ Sstar t k)
    (hr₁ : k ≤ r) (hr₂ : r ≤ Sstar.card)
    (T x : Finset ι) (hT₁ : T ⊆ Sstar) (hT₂ : T.card = r)
    (hx : IsRowFeasible a a₀ x) :
    ((r : ℝ) - (k : ℝ) + 1) * binaryValue x t +
      ∑ j ∈ T, binaryValue x j ≤ (r : ℝ) := by sorry
end CJP83.CoverSeparation
Source
Crowder, Johnson and Padberg, Solving Large-Scale Zero-One Linear Programming Problems, Operations Research 31 (1983), p. 811, Section 2.2, (2.8)–(2.9)
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