Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

THEOREM 18 — master faces are basic solutions of system (13)

Proved
Gomory69.MasterFaces.theorem_18

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

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

Let G\mathcal GG be a finite Abelian group, g0≠0g_0\ne0g0​=0, and π0>0\pi_0>0π0​>0. An inequality π⋅t≥π0\pi\cdot t\ge\pi_0π⋅t≥π0​ defines a face of the master polyhedron P(G,g0)P(\mathcal G,g_0)P(G,g0​) if and only if π\piπ is a basic feasible solution of system (13):

π(g0)=π0,π(g)+π(g0−g)=π0(g≠0,g0),\pi(g_0)=\pi_0,\qquad \pi(g)+\pi(g_0-g)=\pi_0\quad(g\ne0,g_0),π(g0​)=π0​,π(g)+π(g0​−g)=π0​(g=0,g0​), π(g)+π(h)≥π(g+h)(g,h≠0),π(g)≥0(g≠0).\pi(g)+\pi(h)\ge\pi(g+h)\quad(g,h\ne0),\qquad \pi(g)\ge0\quad(g\ne0).π(g)+π(h)≥π(g+h)(g,h=0),π(g)≥0(g=0).

The theorem replaces the infinite integer-point description of faces by a finite system of equations and subadditive inequalities. Both directions of the equivalence are part of the target.

Formalization Note A face is a facet generated by tight integer points. Basicness means that tight row coefficient vectors span the full ∣G∣−1|\mathcal G|-1∣G∣−1 variable space. The system includes ordered pairs and g=hg=hg=h; π(0)=0\pi(0)=0π(0)=0, π0\pi_0π0​ is fixed, and the zero right-hand side is excluded.

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

/-- Gomory (1969), THEOREM 18, pp. 481–483. -/
theorem theorem_18 {G : Type*} [AddCommGroup G] [Fintype G] [DecidableEq G]
    (g₀ : G) (hg₀ : g₀ ≠ 0) (π : MasterIndex G → ℝ) (π₀ : ℝ)
    (hπ₀ : 0 < π₀) :
    IsFace (masterSupport G) g₀ π π₀ ↔ IsSystem13Basic g₀ π₀ π := by sorry

end Gomory69.MasterFaces
Source
Gomory, Some polyhedra related to combinatorial problems, Linear Algebra Appl. 2 (1969), pp. 481–483, THEOREM 18 and system (13). 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