THEOREM 23, p. 505 — in groups of exponent 2 or 3, irreducible solutions are exactly the vertices of P(G, g0)
ProvedGomory69.SpecialGroups.theorem_23Let be a finite Abelian group in which every nonzero element has order 2, or every nonzero element has order 3, and let . Let be a nonnegative integer solution of the group equation
Then
- is irreducible if and only if is a vertex of the master polyhedron ;
- if is a vertex, the elements with 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 and as those where the two notions coincide, which is what makes the vertices of countable in closed form for these groups.
Formalization Note The hypothesis "all elements of 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 for all of them: groups with elements of both orders 2 and 3 are not covered. The page states the first sentence without and adds it only for the "Furthermore" clause; it is a hypothesis of the whole statement here, because at the polyhedron excludes (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.
import Mathlib import Definitions.Def_Gomory69_SpecialGroups_GroupPolyhedron
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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.