Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Convergence Theorem 2(b) — no solution is generated twice

Proved
BalasAdditive.Convergence.no_solution_twice

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

integer-programmingp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1termination

At every reachable state of the additive algorithm, the generated assignments are pairwise distinct:

p<q≤s ⟹ Jp≠Jq.p<q\le s\ \Longrightarrow\ J_p\ne J_q.p<q≤s ⟹ Jp​=Jq​.

This is part (b) of the proof of the convergence theorem and supplies finiteness of the sequence of generated solutions because there are only finitely many binary assignments.

Formalization Note Equality of assignments is equality of their index sets JpJ_pJp​, since the slacks and objective value are determined by those sets.

Preamble
import Mathlib
import Definitions.Def_BalasAdditive_Convergence_Algorithm

set_option autoImplicit false
Formal statement
namespace BalasAdditive.Convergence

/-- Proof of Convergence Theorem 2, part (b), p. 533. -/
theorem no_solution_twice {n m : ℕ} (P : Problem n m) (σ : State n)
    (hr : Reachable P σ) :
    (σ.history.map Record.J).Nodup := by sorry

end BalasAdditive.Convergence
Source
Balas, An additive algorithm for solving linear programs with zero-one variables, Oper. Res. 13 (1965), p. 533, proof of Convergence Theorem 2, part (b), 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