Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

THEOREM 3, p. 461 — a minimizing vertex gives an optimal integer solution when B⁻¹(b − Nx_N*) ≥ 0

Proved
Gomory69.Asymptotic.theorem_3

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

group-polyhedroninteger-programmingp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Consider the integer program (2), max⁡c⋅x\max c\cdot xmaxc⋅x subject to Ax=bAx=bAx=b, x≥0x\ge0x≥0 integer, with A=(B,N)A=(B,N)A=(B,N) containing an m×mm\times mm×m unit matrix, BBB nonsingular and an optimal basis of the linear programming relaxation (B−1b≥0B^{-1}b\ge0B−1b≥0 and all relative prices cm+i∗≥0c^*_{m+i}\ge0cm+i∗​≥0). Let G=M(I)/M(B)\mathcal G=M(I)/M(B)G=M(I)/M(B), N\mathcal NN the set of nonzero fNifN_ifNi​ and g0=fbg_0=fbg0​=fb. Let t∗t^*t∗ be a vertex of P(G,N,g0)P(\mathcal G,\mathcal N,g_0)P(G,N,g0​) minimizing (8),

min⁡ ∑g∈Nc∗(g)t(g)subject to∑g∈Ng⋅t(g)=g0, t(g)≥0 integer,\min\ \sum_{g\in\mathcal N}c^*(g)t(g)\quad\text{subject to}\quad\sum_{g\in\mathcal N}g\cdot t(g)=g_0,\ t(g)\ge0\ \text{integer},min g∈N∑​c∗(g)t(g)subject tog∈N∑​g⋅t(g)=g0​, t(g)≥0 integer,

and let xN∗x_N^*xN∗​ be the nonbasic part of a corresponding vertex of Px(B,N,b)P_x(B,N,b)Px​(B,N,b) with Fx∗=t∗Fx^*=t^*Fx∗=t∗ and xm+i>0x_{m+i}>0xm+i​>0 only if cm+i∗=c∗(fNi)c^*_{m+i}=c^*(fN_i)cm+i∗​=c∗(fNi​). If B−1(b−NxN∗)≥0B^{-1}(b-Nx_N^*)\ge0B−1(b−NxN∗​)≥0, then xB∗=B−1(b−NxN∗)x_B^*=B^{-1}(b-Nx_N^*)xB∗​=B−1(b−NxN∗​) is an integer vector and

x∗=(B−1(b−NxN∗), xN∗)x^*=\bigl(B^{-1}(b-Nx_N^*),\,x_N^*\bigr)x∗=(B−1(b−NxN∗​),xN∗​)

is an optimal solution of the integer program (2).

The theorem reduces the integer program to the group minimization problem whenever the basic part it produces is nonnegative.

Formalization Note "Corresponding vertex" is Remark 1 (p. 458) with the least-cost condition, as in the definition file. The optimal LP basis hypothesis is the standing assumption of pp. 460–461. Integrality of xB∗x_B^*xB∗​ is part of the conclusion (the paper derives it from (3), p. 456).

Preamble
import Mathlib
import Definitions.Def_Gomory69_Asymptotic_GroupPolyhedron
import Definitions.Def_Gomory69_Asymptotic_IntegerProgram
Formal statement
namespace Gomory69.Asymptotic

/-- THEOREM 3 (p. 461): let `B` be an optimal linear programming basis of (2), `t*` a vertex
of `P(𝒢, 𝒩, f b)` minimizing (8), and `x_N*` the nonbasic part of a corresponding vertex
using only least cost columns. If `B⁻¹(b − N x_N*) ≥ 0`, then `x_B* = B⁻¹(b − N x_N*)` is an
integer vector and `x* = (x_B*, x_N*)` is an optimal solution of the integer program (2). -/
theorem theorem_3 {m n : ℕ} (B : Matrix (Fin m) (Fin m) ℤ) (N : Matrix (Fin m) (Fin n) ℤ)
    (b : Fin m → ℤ) (c : Fin m ⊕ Fin n → ℝ)
    (hunit : ContainsUnitMatrix B N) (hdet : B.det ≠ 0) (hopt : IsOptimalLPBasis B N b c)
    (tstar : ↥(groupColumnSet B N) → ℝ) (ht : IsMinimizingVertex B N b c tstar)
    (xN : Fin n → ℕ) (hx : IsCorrespondingVertex B N c tstar xN)
    (hnonneg : ∀ k, 0 ≤ basicPart B N b xN k) :
    ∃ xB : Fin m → ℤ, (∀ k, (xB k : ℝ) = basicPart B N b xN k) ∧
      IsOptimal B N b c (Sum.elim xB (fun i => (xN i : ℤ))) := by sorry

end Gomory69.Asymptotic
Source
Gomory, Some polyhedra related to combinatorial problems, Linear Algebra Appl. 2 (1969), p. 461, THEOREM 3
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