Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

THEOREM 23, p. 505 — in groups of exponent 2 or 3, irreducible solutions are exactly the vertices of P(G, g0)

Proved
Gomory69.SpecialGroups.theorem_23

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

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

Let G\mathcal GG be a finite Abelian group in which every nonzero element has order 2, or every nonzero element has order 3, and let g0≠0ˉg_0 \ne \bar 0g0​=0ˉ. Let ttt be a nonnegative integer solution 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​.

Then

  1. ttt is irreducible if and only if ttt is a vertex of the master polyhedron P(G,g0)P(\mathcal G, g_0)P(G,g0​);
  2. if ttt is a vertex, the elements ggg with t(g)>0t(g) > 0t(g)>0 form a set of independent group elements.

In a general finite Abelian group every vertex is irreducible but many irreducible solutions are not vertices (p. 460); THEOREM 23 identifies the groups G2,G2,2,…\mathcal G_2, \mathcal G_{2,2}, \ldotsG2​,G2,2​,… and G3,G3,3,…\mathcal G_3, \mathcal G_{3,3}, \ldotsG3​,G3,3​,… as those where the two notions coincide, which is what makes the vertices of P(G,g0)P(\mathcal G, g_0)P(G,g0​) countable in closed form for these groups.

Formalization Note The hypothesis "all elements of G\mathcal GG are of order 2 or all of order 3" is read as "all nonzero elements" (the zero element has order 1), and as one common order p∈{2,3}p \in \{2, 3\}p∈{2,3} for all of them: groups with elements of both orders 2 and 3 are not covered. The page states the first sentence without g0≠0ˉg_0 \ne \bar 0g0​=0ˉ and adds it only for the "Furthermore" clause; it is a hypothesis of the whole statement here, because at g0=0ˉg_0 = \bar 0g0​=0ˉ the polyhedron excludes t=0t = 0t=0 (footnote p. 474) and every nonzero solution is reducible, so the equivalence fails. The page's gloss "and, hence, part of a group basis" is not formalized; independence is stated as defined on p. 504.


Retired 2026-10-27: a Lean-vs-paper fidelity audit found this statement weaker than, or narrower than, the cited result. A corrected statement will be resubmitted.

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

/-- THEOREM 23 (Gomory 1969, p. 505): if every nonzero element of `𝒢` has order 2, or every
nonzero element has order 3, and `g₀ ≠ 0̄`, then a solution `t` of the group equation is
irreducible if and only if it is a vertex of `P(𝒢, g₀)`; furthermore, the elements `g` with
`t(g) > 0` in such a vertex form an independent set. -/
theorem theorem_23 {G : Type*} [AddCommGroup G] [Fintype G] [DecidableEq G]
    (p : ℕ) (hp : p = 2 ∨ p = 3) (hG : AllNonzeroOfOrder G p)
    (g₀ : G) (hg₀ : g₀ ≠ 0) (t : {g : G // g ≠ 0} → ℕ) (ht : t ∈ solutionSet g₀) :
    (IsIrreducible t ↔ toReal t ∈ Set.extremePoints ℝ (masterPolyhedron g₀)) ∧
    (toReal t ∈ Set.extremePoints ℝ (masterPolyhedron g₀) → IsIndependent (support t)) := by sorry

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