Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Display (10), p. 464 — the optimal x* of THEOREM 4 satisfies ∏(1 + x_{m+i}) ≤ D

Proved
Gomory69.Asymptotic.display_10

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

asymptotic-integer-programminggroup-polyhedroninteger-programmingp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Under the hypotheses of THEOREM 4 (b∈KB(lmax⁡(D−1))b\in K_B(l_{\max}(D-1))b∈KB​(lmax​(D−1)), BBB an optimal LP basis, t∗t^*t∗ a vertex of P(G,N,fb)P(\mathcal G,\mathcal N,fb)P(G,N,fb) minimizing (8), xN∗x_N^*xN∗​ a corresponding vertex using only least cost columns), the optimal integer solution x∗=(B−1(b−NxN∗),xN∗)x^*=(B^{-1}(b-Nx_N^*),x_N^*)x∗=(B−1(b−NxN∗​),xN∗​) of (2) also satisfies

∏i=1n(1+xm+i∗)≤D,D=∣det⁡B∣.\prod_{i=1}^{n}\bigl(1+x^*_{m+i}\bigr)\le D,\qquad D=|\det B|.i=1∏n​(1+xm+i∗​)≤D,D=∣detB∣.

So there are optimal integer programming solutions whose nonbasic part is small in this multiplicative sense.

Formalization Note The paper says "there are optimal integer programming solutions xxx to (2) with" this bound; it is stated here for the specific optimal solution x∗x^*x∗ built from a minimizing vertex, which is the solution the paper's argument produces (the existence of a minimizing vertex is taken for granted on p. 461 and is not part of this statement).

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

/-- Display (10) (p. 464): under the hypotheses of THEOREM 4, the optimal solution
`x* = (B⁻¹(b − N x_N*), x_N*)` obtained from a minimizing vertex also satisfies
`∏_{i=1}^{n} (1 + x*_{m+i}) ≤ D`, `D = |det B|`. -/
theorem display_10 {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)
    (hb : realVec b ∈ deepCone B (lmax N * ((detAbs B : ℝ) - 1)))
    (tstar : ↥(groupColumnSet B N) → ℝ) (ht : IsMinimizingVertex B N b c tstar)
    (xN : Fin n → ℕ) (hx : IsCorrespondingVertex B N c tstar xN) :
    ∃ xB : Fin m → ℤ, (∀ k, (xB k : ℝ) = basicPart B N b xN k) ∧
      IsOptimal B N b c (Sum.elim xB (fun i => (xN i : ℤ))) ∧
      ∏ i : Fin n, (1 + xN i) ≤ detAbs B := by sorry

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