Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

LEMMA 1 — subpaths of a shortest path remain shortest

Proved
Gomory69.MasterFaces.lemma_1

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

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

Let ttt be a shortest path from 000 to g0g_0g0​, represented by a nonnegative integer vector on N⊆G∖{0}\mathcal N\subseteq\mathcal G\setminus\{0\}N⊆G∖{0}. If t′≤tt'\le tt′≤t coordinatewise and ∑gt′(g)g=h\sum_g t'(g)g=h∑g​t′(g)g=h, then t′t't′ is shortest for its displacement hhh:

π⋅t′≤π⋅sfor every s∈NN with ∑gs(g)g=h.\pi\cdot t'\le\pi\cdot s\quad\text{for every }s\in\mathbb N^{\mathcal N}\text{ with }\sum_g s(g)g=h.π⋅t′≤π⋅sfor every s∈NN with g∑​s(g)g=h.

Because arc lengths depend only on the increment, this also covers a copy of t′t't′ starting at any group vertex.

Formalization Note Paths are multiplicity vectors. The starting vertex of the translated subpath does not change its minimization claim and so is absent from the Lean statement.

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

/-- Gomory (1969), LEMMA 1, p. 472; paths are represented by multiplicity vectors. -/
theorem lemma_1 {G : Type*} [AddCommGroup G] [Fintype G] [DecidableEq G]
    (N : Finset G) (hN : (0 : G) ∉ N) (g₀ h : G) (π : N → ℝ)
    (t t' : N → ℕ) (ht : IsShortest N g₀ π t)
    (ht' : GroupSolution N h t') (hle : ∀ g : N, t' g ≤ t g) :
    IsShortest N h π t' := by sorry

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