Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

THEOREM 7 — faces as basic feasible solutions of the integer-point system

Proved
Gomory69.MasterFaces.theorem_7

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

basic-feasible-solutionfacetsgroup-polyhedronp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let N⊆G∖{0}\mathcal N\subseteq\mathcal G\setminus\{0\}N⊆G∖{0} and π0>0\pi_0>0π0​>0. The inequality π⋅t≥π0\pi\cdot t\ge\pi_0π⋅t≥π0​ defines a face of P(G,N,g0)P(\mathcal G,\mathcal N,g_0)P(G,N,g0​) if and only if π\piπ is a basic feasible solution of the system

π⋅t≥π0(t∈T(G,N,g0)).\pi\cdot t\ge\pi_0\qquad(t\in T(\mathcal G,\mathcal N,g_0)).π⋅t≥π0​(t∈T(G,N,g0​)).

This characterizes Gomory's faces by the rank of the tight integer-point rows. The system can have infinitely many rows, but only ∣N∣|\mathcal N|∣N∣ coefficient variables.

Formalization Note. N\mathcal NN is assumed nonempty (n′≥1n'\ge1n′≥1, as on p. 457): for N=∅\mathcal N=\varnothingN=∅ the zero-dimensional coefficient space makes every π\piπ trivially basic while no nonzero π\piπ, hence no face, exists.

Preamble
import Mathlib
import Definitions.Def_Gomory69_MasterFaces_BasicFeasible
Formal statement
namespace Gomory69.MasterFaces

/-- Gomory (1969), THEOREM 7, pp. 469–470. `N` is nonempty (`n′ ≥ 1`, p. 457): at
`N = ∅` the tight-row span is trivially full while no face exists. -/
theorem theorem_7 {G : Type*} [AddCommGroup G] [Fintype G] [DecidableEq G]
    (N : Finset G) (hN : (0 : G) ∉ N) (hNne : N.Nonempty) (g₀ : G) (π : N → ℝ) (π₀ : ℝ)
    (hπ₀ : 0 < π₀) :
    IsFace N g₀ π π₀ ↔ IsTBasicFeasible N g₀ π₀ π := by sorry

end Gomory69.MasterFaces
Source
Gomory, Some polyhedra related to combinatorial problems, Linear Algebra Appl. 2 (1969), pp. 469–470, THEOREM 7. DOI: 10.1016/0024-3795(69)90017-2
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