Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

THEOREM 2, p. 460 — every vertex of P(G, N, g0) is irreducible

Proved
Gomory69.Asymptotic.theorem_2

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

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

Let G\mathcal GG be a finite Abelian group, N\mathcal NN a set of nonzero elements of G\mathcal GG and g0∈Gg_0\in\mathcal Gg0​∈G. Every vertex vvv of P(G,N,g0)P(\mathcal G,\mathcal N,g_0)P(G,N,g0​) is an integer point: there is a nonnegative integer solution ttt of the group equation

∑g∈Nt(g)⋅g=g0\sum_{g\in\mathcal N}t(g)\cdot g=g_0g∈N∑​t(g)⋅g=g0​

with v=tv=tv=t (coordinatewise), and this ttt is irreducible.

Together with THEOREM 1, this bounds the size of every vertex of the corner polyhedron.

Formalization Note "Vertex" is an extreme point of the convex hull. The paper's one-line statement contains two facts, made explicit here: a vertex of P(G,N,g0)P(\mathcal G,\mathcal N,g_0)P(G,N,g0​) is one of the integer solutions it is the hull of, and that integer solution is irreducible.

Preamble
import Mathlib
import Definitions.Def_Gomory69_Asymptotic_GroupPolyhedron
Formal statement
namespace Gomory69.Asymptotic

/-- THEOREM 2 (p. 460): every vertex of `P(𝒢, 𝒩, g₀)` is (the real image of) an
irreducible nonnegative integer solution of the group equation (5). -/
theorem theorem_2 {G : Type*} [AddCommGroup G] [Finite G] (𝒩 : Finset G)
    (h𝒩 : (0 : G) ∉ 𝒩) (g₀ : G) (v : ↥𝒩 → ℝ)
    (hv : v ∈ Set.extremePoints ℝ (groupPolyhedron 𝒩 g₀)) :
    ∃ t ∈ groupSolutions 𝒩 g₀, toReal 𝒩 t = v ∧ IsIrreducible 𝒩 t := by sorry

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