Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

LEMMA 2 — every coordinate occurs in a tight shortest path

Proved
Gomory69.MasterFaces.lemma_2

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

facetsgroup-polyhedronp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1shortest-path

Suppose π⋅t≥π0\pi\cdot t\ge\pi_0π⋅t≥π0​ is a face of P(G,N,g0)P(\mathcal G,\mathcal N,g_0)P(G,N,g0​) with π0>0\pi_0>0π0​>0. For every g∈Ng\in\mathcal Ng∈N there is a nonnegative integer solution ttt of the group equation such that

π⋅t=π0,t(g)>0.\pi\cdot t=\pi_0,\qquad t(g)>0.π⋅t=π0​,t(g)>0.

Thus some shortest path to g0g_0g0​ passes through the group vertex ggg. The claim ensures that no coordinate of a facet is absent from all tight integer points.

Formalization Note The displayed integer-vector assertion is the first sentence of the lemma; the path-through-ggg assertion is its graph interpretation.

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

/-- Gomory (1969), LEMMA 2, p. 472. -/
theorem lemma_2 {G : Type*} [AddCommGroup G] [Fintype G] [DecidableEq G]
    (N : Finset G) (hN : (0 : G) ∉ N) (g₀ : G) (π : N → ℝ) (π₀ : ℝ)
    (hπ₀ : 0 < π₀) (hface : IsFace N g₀ π π₀) (g : N) :
    ∃ t : N → ℕ, GroupSolution N g₀ t ∧
      dot π (castSolution t) = π₀ ∧ 0 < t g := by sorry

end Gomory69.MasterFaces
Source
Gomory, Some polyhedra related to combinatorial problems, Linear Algebra Appl. 2 (1969), pp. 472–473, LEMMA 2. 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