p. 506, proof of THEOREM 23 — the support of an irreducible solution is independent
ProvedGomory69.SpecialGroups.irreducible_support_independentgroup-polyhedronindependenceirreducibilityp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1
Let be a finite Abelian group in which every nonzero element has order , where or . Let be an irreducible nonnegative integer solution of the group equation , and let . Then is a set of independent group elements: for all integers ,
Combined with THEOREM 2 this gives the "Furthermore" clause of THEOREM 23.
Formalization Note On pp. 505–506 the letter denotes the support of , not the solution set. The hypothesis that solves the group equation for some is the page's setting ("Let be an irreducible solution to the group equation"); no condition on is imposed.
Preamble
import Mathlib import Definitions.Def_Gomory69_SpecialGroups_GroupPolyhedron
Formal statement
namespace Gomory69.SpecialGroups
/-- Proof of THEOREM 23 (Gomory 1969, pp. 505–506): if every nonzero element of `𝒢` has order
`p ∈ {2, 3}`, then for an irreducible solution `t` of the group equation the elements `g` with
`t(g) > 0` form an independent set. -/
theorem irreducible_support_independent {G : Type*} [AddCommGroup G] [Fintype G] [DecidableEq G]
(p : ℕ) (hp : p = 2 ∨ p = 3) (hG : AllNonzeroOfOrder G p)
(g₀ : G) (t : {g : G // g ≠ 0} → ℕ) (ht : t ∈ solutionSet g₀) (hirr : IsIrreducible t) :
IsIndependent (support t) := by sorry
end Gomory69.SpecialGroups
Source
Gomory, Some polyhedra related to combinatorial problems, Linear Algebra Appl. 2 (1969), pp. 505–506, proof of THEOREM 23
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.