THEOREM 2, p. 460 — every vertex of P(G, g0), g0 ≠ 0, is irreducible
ProvedGomory69.SpecialGroups.theorem_2group-polyhedronirreducibilityp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1vertices
Let be a finite Abelian group and . Every vertex of the master polyhedron is a nonnegative integer solution of the group equation , and that solution is irreducible:
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 with any set of nonzero elements; here it is stated for , the polyhedron of §3F. The hypothesis is added: for the polyhedron excludes (footnote p. 474), and every nonzero solution of is reducible (, ), so the statement would fail. That the vertex is an integer solution is part of the conclusion (the page takes it for granted, "").
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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.