Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Identical Prices, p. 869, paragraph ‘Clearly, identical prices …’ — among lengths with identical prices only the shortest is needed

Proved
CuttingStock63.Knapsack.identical_prices

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

cutting-stockidentical-pricesknapsackp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let l1,…,lml_1,\dots,l_ml1​,…,lm​ be lengths and b1,…,bmb_1,\dots,b_mb1​,…,bm​ prices, and let i≠ji\ne ji=j be two items with li<ljl_i<l_jli​<lj​ and bi=bjb_i=b_jbi​=bj​. Then for every vector (α)m(\alpha)_m(α)m​ of nonnegative integers with L≥λ⋅(α)mL\ge\lambda\cdot(\alpha)_mL≥λ⋅(α)m​ there is a vector (α′)m(\alpha')_m(α′)m​ with

L≥λ⋅(α′)m,aj′=0,β⋅(α′)m=β⋅(α)m.L\ge\lambda\cdot(\alpha')_m,\qquad a'_j=0,\qquad \beta\cdot(\alpha')_m=\beta\cdot(\alpha)_m .L≥λ⋅(α′)m​,aj′​=0,β⋅(α′)m​=β⋅(α)m​.

(Substitute the shorter length lil_ili​ for every piece of length ljl_jlj​.) Hence the maximum of the knapsack problem (1) is unchanged when the variable aja_jaj​ is dropped, and among lengths with identical prices only the shortest needs to be considered.

Formalization Note The page's remark that "the density bi/lib_i/l_ibi​/li​ associated with lil_ili​ is greater" holds only for bi>0b_i>0bi​>0; it is an aside and not part of the claim, which needs neither positive lengths nor the density order.

Preamble
import Mathlib
import Definitions.Def_CuttingStock63_Knapsack_Problem
Formal statement
namespace CuttingStock63.Knapsack

/-- Identical Prices, paragraph "Clearly, identical prices …", p. 869: if l_i < l_j and b_i = b_j, then every vector
satisfying the constraint of (1) can be replaced by one with a_j = 0, still satisfying the
constraint, with the same objective (substitute l_i for every piece of length l_j). So the
maximum of (1) does not change when the variable a_j is dropped. -/
theorem identical_prices {m : ℕ} (l b : Fin m → ℝ) (L : ℝ) (i j : Fin m) (hij : i ≠ j)
    (hlt : l i < l j) (hbeq : b i = b j) (a : Fin m → ℕ) (ha : Fits l L a) :
    ∃ a' : Fin m → ℕ, Fits l L a' ∧ a' j = 0 ∧ bet b a' m = bet b a m := by sorry

end CuttingStock63.Knapsack
Source
Gilmore & Gomory, A linear programming approach to the cutting stock problem—Part II, Opns. Res. 11 (1963), p. 869, Identical Prices, paragraph beginning ‘Clearly, identical prices’
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