Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 2 — earlier feasible completions avoid their cancellation snapshot

Disproved
BalasAdditive.Convergence.lemma_2

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

implicit-enumerationinteger-programmingp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let uku^kuk and usu^sus be generated solutions with k<sk<sk<s and Jk⊂JsJ_k\subset J_sJk​⊂Js​. Suppose that for every ppp with k<p≤sk<p\le sk<p≤s, the originally formed improving set NpN_pNp​ has been completely cancelled during the processing of usu^sus. If a feasible binary assignment JtJ_tJt​ strictly contains JkJ_kJk​ and has cost below z∗(s)z^{*(s)}z∗(s), then

(Jt∖Jk)∩Cks=∅.(53)(J_t\setminus J_k)\cap C_k^s=\varnothing.\tag{53}(Jt​∖Jk​)∩Cks​=∅.(53)

The conclusion restricts better completions of an earlier solution to indices outside its cancellation snapshot.

Formalization Note The hypothesis covers every ppp in the printed range, not merely ancestors of JsJ_sJs​. The paper's Cps+1C_p^{s+1}Cps+1​ (the cancellations made before us+1u^{s+1}us+1 is obtained) is read in a state τ\tauτ that is either the current state of iteration s+1s+1s+1 (cancellations so far; this also covers an iteration that ends with a stop) or the successor state in which us+1u^{s+1}us+1 is obtained, whose records are exactly Cps+1C_p^{s+1}Cps+1​. Cancellations only grow and stay inside NpN_pNp​, so the second choice is the printed lemma and the first is an instance of it. CksC_k^sCks​ is the stored snapshot from the moment usu^sus was obtained, and the ceiling is z∗(s)z^{*(s)}z∗(s). The state is reachable, and JtJ_tJt​ need not have been generated.

Preamble
import Mathlib
import Definitions.Def_BalasAdditive_Convergence_Algorithm

set_option autoImplicit false
Formal statement
namespace BalasAdditive.Convergence

/-- Lemma 2, p. 532, equation (53). `σ` is a state of iteration `s + 1` (`u^s` is the
latest generated solution). The printed `C_p^{s+1}` is read in `τ`: either `τ = σ`
(the cancellations accumulated so far, which also covers an iteration that ends in a
stop), or `τ` is the successor of `σ` in which `u^{s+1}` is obtained, whose records are
exactly the cancellations made before `u^{s+1}` was obtained. -/
theorem lemma_2 {n m : ℕ} (P : Problem n m) (σ τ : State n)
    (hr : Reachable P σ)
    (hτ : τ = σ ∨ (Step P σ τ ∧ τ.history.length = σ.history.length + 1)) (k : ℕ)
    (hk : k < σ.history.length - 1)
    (hancestor : σ.J k ⊂ σ.latest)
    (hcancel : ∀ p, k < p → p ≤ σ.history.length - 1 → σ.N p = τ.currentC p)
    (J : Finset (Fin n)) (hfeas : P.lp.Feasible J)
    (hstrict : σ.J k ⊂ J)
    (hcost : (↑(P.lp.cost J) : WithTop ℝ) < ceiling P σ) :
    Disjoint (J \ σ.J k) (σ.snapshotC k) := by sorry

end BalasAdditive.Convergence
Source
Balas, An additive algorithm for solving linear programs with zero-one variables, Oper. Res. 13 (1965), p. 532, Lemma 2, Eq. (53), DOI 10.1287/opre.13.4.517
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