Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

p. 506 — vertices of P(G, g0) for groups of exponent s ∈ {2, 3}: independent support, entries below s

Proved
Gomory69.SpecialGroups.vertex_characterization

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

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

Let G\mathcal GG be a finite Abelian group in which every nonzero element has order sss, where s=2s = 2s=2 or s=3s = 3s=3 (the groups Gsn\mathcal G_{s^n}Gsn​). A nonzero nonnegative integer vector ttt on G+\mathcal G^+G+ is a vertex of P(G,g0)P(\mathcal G, g_0)P(G,g0​) for some g0≠0ˉg_0 \ne \bar 0g0​=0ˉ if and only if the elements ggg with t(g)>0t(g) > 0t(g)>0 are independent and

t(g)<sfor all g.t(g) < s \quad\text{for all } g .t(g)<sfor all g.

This characterization is what the vertex count v(sn)v(s^n)v(sn) of pp. 506–507 is built on.

Formalization Note The page does not exclude t=0t = 0t=0, whose empty support is independent but which solves no group equation with g0≠0ˉg_0 \ne \bar 0g0​=0ˉ; the hypothesis t≠0t \ne 0t=0 is added. "Vertex for some P(G,g0)P(\mathcal G, g_0)P(G,g0​)" includes that ttt solves the group equation for that g0g_0g0​.

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

/-- The vertex characterization of p. 506 (Gomory 1969): if every nonzero element of `𝒢` has order
`s ∈ {2, 3}`, a nonzero nonnegative integer vector `t` is a vertex of `P(𝒢, g₀)` for some
`g₀ ≠ 0̄` if and only if the `g` with `t(g) > 0` are independent and `t(g) < s` for all `g`. -/
theorem vertex_characterization {G : Type*} [AddCommGroup G] [Fintype G] [DecidableEq G]
    (s : ℕ) (hs : s = 2 ∨ s = 3) (hG : AllNonzeroOfOrder G s)
    (t : {g : G // g ≠ 0} → ℕ) (ht : t ≠ 0) :
    (∃ g₀ : G, g₀ ≠ 0 ∧ t ∈ solutionSet g₀ ∧ toReal t ∈ Set.extremePoints ℝ (masterPolyhedron g₀)) ↔
      (IsIndependent (support t) ∧ ∀ g, t g < s) := by sorry

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