Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

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

Proved
Gomory69.SpecialGroups.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 and g0≠0ˉg_0 \ne \bar 0g0​=0ˉ. Every vertex xxx of the master polyhedron P(G,g0)P(\mathcal G, g_0)P(G,g0​) is a nonnegative integer solution ttt of the group equation ∑g∈G+t(g)⋅g=g0\sum_{g \in \mathcal G^+} t(g)\cdot g = g_0∑g∈G+​t(g)⋅g=g0​, and that solution is irreducible:

x∈vert⁡P(G,g0)  ⟹  x=t for an irreducible solution t.x \in \operatorname{vert} P(\mathcal G, g_0) \;\Longrightarrow\; x = t \text{ for an irreducible solution } t .x∈vertP(G,g0​)⟹x=t for an irreducible solution t.

This is the easy half of THEOREM 23: a vertex is irreducible in every finite Abelian group.

Formalization Note The page states THEOREM 2 for P(G,N,g0)P(\mathcal G, \mathcal N, g_0)P(G,N,g0​) with any set N\mathcal NN of nonzero elements; here it is stated for N=G+\mathcal N = \mathcal G^+N=G+, the polyhedron P(G,g0)P(\mathcal G, g_0)P(G,g0​) of §3F. The hypothesis g0≠0ˉg_0 \ne \bar 0g0​=0ˉ is added: for g0=0ˉg_0 = \bar 0g0​=0ˉ the polyhedron P(G,0ˉ)P(\mathcal G, \bar 0)P(G,0ˉ) excludes t=0t = 0t=0 (footnote p. 474), and every nonzero solution ttt of ∑t(g)g=0ˉ\sum t(g) g = \bar 0∑t(g)g=0ˉ is reducible (r=0r = 0r=0, s=ts = ts=t), so the statement would fail. That the vertex is an integer solution is part of the conclusion (the page takes it for granted, "v=(t(g))v = (t(g))v=(t(g))").

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

/-- THEOREM 2 (Gomory 1969, p. 460) for the master polyhedron `P(𝒢, g₀)`, `g₀ ≠ 0̄`: every vertex
of `P(𝒢, g₀)` is (the real image of) an irreducible nonnegative integer solution of the group
equation. -/
theorem theorem_2 {G : Type*} [AddCommGroup G] [Fintype G] [DecidableEq G]
    (g₀ : G) (hg₀ : g₀ ≠ 0) (x : {g : G // g ≠ 0} → ℝ)
    (hx : x ∈ Set.extremePoints ℝ (masterPolyhedron g₀)) :
    ∃ t ∈ solutionSet g₀, toReal t = x ∧ IsIrreducible t := by sorry

end Gomory69.SpecialGroups
Source
Gomory, Some polyhedra related to combinatorial problems, Linear Algebra Appl. 2 (1969), p. 460, THEOREM 2 (for N = G⁺, the polyhedron P(G, g0) of pp. 474–475)
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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me