Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

THEOREM 10 — face coefficients are shortest-path distances

Proved
Gomory69.MasterFaces.theorem_10

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

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

Let π⋅t≥π0\pi\cdot t\ge\pi_0π⋅t≥π0​ be 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 any g∈Ng\in\mathcal Ng∈N, the one-arc path to ggg has minimum length among all nonnegative integer vectors representing ggg:

π(g)≤∑h∈Nπ(h)s(h)whenever ∑h∈Ns(h)h=g.\pi(g)\le\sum_{h\in\mathcal N}\pi(h)s(h)\quad\text{whenever }\sum_{h\in\mathcal N}s(h)h=g.π(g)≤h∈N∑​π(h)s(h)whenever h∈N∑​s(h)h=g.

This identifies each facet coefficient with a shortest-path value and supports the following subadditivity consequences.

Formalization Note The unit vector at ggg attains the bound, so no real infimum or attainment convention is needed.

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

/-- Gomory (1969), THEOREM 10, p. 473. -/
theorem theorem_10 {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) :
    ∀ s : N → ℕ, GroupSolution N (g : G) s → π g ≤ dot π (castSolution s) := by sorry

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