Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

p. 469, proof of THEOREM 7 — for π₀ > 0, a face is a valid inequality with n′ linearly independent tight points of T

Proved
Gomory69.Lifting.face_iff_independent_tight

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

facesgroup-polyhedronp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let G\mathcal GG be a finite nontrivial Abelian group, g0∈Gg_0\in\mathcal Gg0​∈G, T=T(G,g0)T=T(\mathcal G,g_0)T=T(G,g0​) the nonzero nonnegative integer solutions of the group equation, and n′=∣G+∣=∣G∣−1n'=|\mathcal G^+|=|\mathcal G|-1n′=∣G+∣=∣G∣−1. Let π∈RG+\pi\in\mathbb R^{\mathcal G^+}π∈RG+ and π0>0\pi_0>0π0​>0. Then (π,π0)(\pi,\pi_0)(π,π0​) is a face of the master polyhedron P(G,g0)P(\mathcal G,g_0)P(G,g0​) if and only if

π⋅t≥π0  for all t∈T,and there are t1,…,tn′∈T with π⋅ti=π0 that are linearly independent.\pi\cdot t\ge\pi_0\ \text{ for all } t\in T,\qquad\text{and there are } t^1,\dots,t^{n'}\in T \text{ with } \pi\cdot t^i=\pi_0 \text{ that are linearly independent.}π⋅t≥π0​  for all t∈T,and there are t1,…,tn′∈T with π⋅ti=π0​ that are linearly independent.

The criterion turns the affine condition "the tight points generate the hyperplane" into a rank condition. It is the step that makes a count of independent minimal paths prove that an inequality is a face, and it is how THEOREM 19 is established.

Formalization Note This is THEOREM 7 of p. 469 with "basic feasible solution of {πt≥π0, t∈T}\{\pi t\ge\pi_0,\ t\in T\}{πt≥π0​, t∈T}" unfolded: rows of rank n′n'n′ satisfied with equality are n′n'n′ linearly independent tight ttt. It is stated for the master polyhedron (N=G+\mathcal N=\mathcal G^+N=G+), the case this mission needs; the page states it for any N⊆G+\mathcal N\subseteq\mathcal G^+N⊆G+. The hypothesis π0>0\pi_0>0π0​>0 is THEOREM 7's. Nontriviality makes the ambient T-space have positive dimension, as the paper's facet convention requires.

Preamble
import Mathlib
import Definitions.Def_Gomory69_Lifting_GroupPolyhedron
Formal statement
namespace Gomory69.Lifting

theorem face_iff_independent_tight {G : Type*} [AddCommGroup G] [Fintype G] [DecidableEq G]
    [Nontrivial G]
    (g₀ : G) (π : Plus G → ℝ) (π₀ : ℝ) (hπ₀ : 0 < π₀) :
    IsFace G g₀ π π₀ ↔
      (∀ t ∈ T G g₀, π₀ ≤ π ⬝ᵥ castVec t) ∧
        ∃ s : Fin (Fintype.card (Plus G)) → (Plus G → ℕ),
          (∀ i, s i ∈ T G g₀ ∧ π ⬝ᵥ castVec (s i) = π₀) ∧
            LinearIndependent ℝ (fun i => castVec (s i)) := by sorry

end Gomory69.Lifting
Source
Gomory, Some polyhedra related to combinatorial problems, Linear Algebra Appl. 2 (1969), pp. 469–470, THEOREM 7 and its proof
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