Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

p. 506, proof of THEOREM 23 — an irreducible solution minimizes π and is a vertex

Proved
Gomory69.SpecialGroups.minimizer_vertex

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

group-polyhedronp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1vertices

Let G\mathcal GG be a finite Abelian group in which every nonzero element has order ppp, p∈{2,3}p \in \{2, 3\}p∈{2,3}, and let ttt be an irreducible nonnegative integer solution of ∑gt(g)⋅g=g0\sum_{g} t(g)\cdot g = g_0∑g​t(g)⋅g=g0​, with support T={g:t(g)>0}T = \{g : t(g) > 0\}T={g:t(g)>0}. Define

π(g)={0,g∈T,1,g∉T.\pi(g) = \begin{cases} 0, & g \in T,\\ 1, & g \notin T.\end{cases}π(g)={0,1,​g∈T,g∈/T.​

Then

  1. ttt minimizes π⋅u=∑gπ(g)u(g)\pi\cdot u = \sum_g \pi(g) u(g)π⋅u=∑g​π(g)u(g) over the nonnegative integer solutions uuu of the group equation;
  2. every minimizing solution uuu satisfies u≥tu \ge tu≥t componentwise;
  3. ttt is a vertex of P(G,g0)P(\mathcal G, g_0)P(G,g0​).

This is the step "irreducible ⇒\Rightarrow⇒ vertex" of THEOREM 23.

Formalization Note The page says that ttt is the unique minimizer of this π\piπ. That fails literally (in Z2\mathbb Z_2Z2​, g0=1g_0 = 1g0​=1: π≡0\pi \equiv 0π≡0 and every solution minimizes), for the reason recorded in the item on solutions vanishing off the support; clause 2 is the corrected form, and clause 3 is the page's conclusion "So t(g)t(g)t(g) is a vertex".

Preamble
import Mathlib
import Definitions.Def_Gomory69_SpecialGroups_GroupPolyhedron
Formal statement
namespace Gomory69.SpecialGroups

/-- Proof of THEOREM 23 (Gomory 1969, p. 506), corrected: if every nonzero element of `𝒢` has
order `p ∈ {2, 3}` and `t` is an irreducible solution of the group equation, put `π(g) = 0` where
`t(g) > 0` and `π(g) = 1` where `t(g) = 0`. Then `t` minimizes `π · u` over the solutions `u`,
every minimizer `u` satisfies `u ≥ t` componentwise, and `t` is a vertex of `P(𝒢, g₀)`. -/
theorem minimizer_vertex {G : Type*} [AddCommGroup G] [Fintype G] [DecidableEq G]
    (p : ℕ) (hp : p = 2 ∨ p = 3) (hG : AllNonzeroOfOrder G p)
    (g₀ : G) (t : {g : G // g ≠ 0} → ℕ) (ht : t ∈ solutionSet g₀) (hirr : IsIrreducible t) :
    let π : {g : G // g ≠ 0} → ℕ := fun g => if t g = 0 then 1 else 0
    (∀ u ∈ solutionSet g₀, ∑ g, π g * t g ≤ ∑ g, π g * u g) ∧
    (∀ u ∈ solutionSet g₀, ∑ g, π g * u g = ∑ g, π g * t g → t ≤ u) ∧
    toReal t ∈ Set.extremePoints ℝ (masterPolyhedron g₀) := by sorry

end Gomory69.SpecialGroups
Source
Gomory, Some polyhedra related to combinatorial problems, Linear Algebra Appl. 2 (1969), p. 506, proof of THEOREM 23 (corrected; see the Formalization Note)
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