Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

pp. 487–488, proof of THEOREM 19 — the lifted inequality has D − 1 linearly independent minimal paths

Proved
Gomory69.Lifting.rank_D_sub_one

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

group-polyhedronhomomorphismliftingp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let ψ\psiψ be a homomorphism of the finite Abelian group G\mathcal GG onto the finite Abelian group H\mathcal HH, with ψg0≠0ˉ\psi g_0\neq\bar 0ψg0​=0ˉ, let D=∣G∣D=|\mathcal G|D=∣G∣, and let (π′,π0)(\pi',\pi_0)(π′,π0​) be a face of P(H,ψg0)P(\mathcal H,\psi g_0)P(H,ψg0​) with π0>0\pi_0>0π0​>0. Put π(g)=π′(ψg)\pi(g)=\pi'(\psi g)π(g)=π′(ψg), g∈G+g\in\mathcal G^+g∈G+, with π′(0ˉ)=0\pi'(\bar 0)=0π′(0ˉ)=0. Then there are D−1D-1D−1 solutions t1,…,tD−1∈T(G,g0)t^1,\dots,t^{D-1}\in T(\mathcal G,g_0)t1,…,tD−1∈T(G,g0​) with

π⋅ti=π0(i=1,…,D−1)\pi\cdot t^i=\pi_0\quad(i=1,\dots,D-1)π⋅ti=π0​(i=1,…,D−1)

that are linearly independent in RG+\mathbb R^{\mathcal G^+}RG+.

In the paper these are the lifted paths Tk(τ)T_k(\tau)Tk​(τ) over all k∈Kk\in\mathcal Kk∈K and all ∣H∣−1|\mathcal H|-1∣H∣−1 independent minimal paths τ\tauτ of the quotient problem, together with one path for each nonzero k∈Kk\in\mathcal Kk∈K obtained by adding s(k)s(k)s(k) copies of kkk to a lifted path. Together with the validity of the lift, this is what THEOREM 19 asserts.

Formalization Note The page says "for each k∈Kk\in\mathcal Kk∈K a row"; 0ˉ\bar 00ˉ has no column, so the rows are added for k∈K−0ˉk\in\mathcal K-\bar 0k∈K−0ˉ, which is the count that gives D−1D-1D−1. The hypothesis π0>0\pi_0>0π0​>0 is not on the page; without it the statement fails (see the goal theorem).

Preamble
import Mathlib
import Definitions.Def_Gomory69_Lifting_GroupPolyhedron
import Definitions.Def_Gomory69_Lifting_Lift
Formal statement
namespace Gomory69.Lifting

theorem rank_D_sub_one {G H : Type*} [AddCommGroup G] [Fintype G] [DecidableEq G]
    [AddCommGroup H] [Fintype H] [DecidableEq H]
    (ψ : G →+ H) (hψ : Function.Surjective ψ) (g₀ : G) (hg₀ : ψ g₀ ≠ 0)
    (π' : Plus H → ℝ) (π₀ : ℝ) (hπ₀ : 0 < π₀) (hface : IsFace H (ψ g₀) π' π₀) :
    ∃ s : Fin (Fintype.card (Plus G)) → (Plus G → ℕ),
      (∀ i, s i ∈ T G g₀ ∧ liftCoeff ψ π' ⬝ᵥ castVec (s i) = π₀) ∧
        LinearIndependent ℝ (fun i => castVec (s i)) := by sorry

end Gomory69.Lifting
Source
Gomory, Some polyhedra related to combinatorial problems, Linear Algebra Appl. 2 (1969), pp. 487–488, proof of THEOREM 19 (Figs. 6, 7)
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