Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

THEOREM 17 — equalities and subadditivity for master faces

Proved
Gomory69.MasterFaces.theorem_17

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

facetsgroup-polyhedronp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1subadditivity

Let g0≠0g_0\ne0g0​=0 and let π⋅t≥π0\pi\cdot t\ge\pi_0π⋅t≥π0​ be a face of the master polyhedron P(G,g0)P(\mathcal G,g_0)P(G,g0​) with π0>0\pi_0>0π0​>0. With π(0)=0\pi(0)=0π(0)=0, its coefficients satisfy all three conditions:

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

These are the face-implied rows of system (13). In the first line, g=g0g=g_0g=g0​ uses the zero extension and repeats the last equality.

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

/-- Gomory (1969), THEOREM 17, pp. 480–481; `π(0) = 0` by extension. -/
theorem theorem_17 {G : Type*} [AddCommGroup G] [Fintype G] [DecidableEq G]
    (g₀ : G) (hg₀ : g₀ ≠ 0) (π : MasterIndex G → ℝ) (π₀ : ℝ)
    (hπ₀ : 0 < π₀) (hface : IsFace (masterSupport G) g₀ π π₀) :
    (∀ g : MasterIndex G,
      extendZero π (g : G) + extendZero π (g₀ - (g : G)) = π₀) ∧
    (∀ g h : MasterIndex G,
      extendZero π ((g : G) + (h : G)) ≤ π g + π h) ∧
    extendZero π g₀ = π₀ := by sorry

end Gomory69.MasterFaces
Source
Gomory, Some polyhedra related to combinatorial problems, Linear Algebra Appl. 2 (1969), pp. 480–481, THEOREM 17 and preceding positive-constant context. 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