Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of THEOREM 4, p. 462 — an irreducible t has Σ t(g) ≤ |G| − 1

Proved
Gomory69.Asymptotic.sum_le_card_sub_one

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

group-polyhedronirreducibilityp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let G\mathcal GG be a finite Abelian group and N\mathcal NN a set of nonzero elements of G\mathcal GG. If the nonnegative integer vector ttt is irreducible, then

∑g∈Nt(g)≤∣G∣−1.\sum_{g\in\mathcal N}t(g)\le|\mathcal G|-1.g∈N∑​t(g)≤∣G∣−1.

This is the first step of the proof of THEOREM 4, applied there to a minimizing vertex t∗t^*t∗.

Formalization Note The page writes "∑g∈N(1+t∗(g))≤∣G∣=D\sum_{g\in\mathcal N}(1+t^*(g))\le|\mathcal G|=D∑g∈N​(1+t∗(g))≤∣G∣=D. Expanding shows ..."; the inequality it expands is THEOREM 1's product ∏(1+t∗(g))≤∣G∣\prod(1+t^*(g))\le|\mathcal G|∏(1+t∗(g))≤∣G∣, and the sum is a printing slip. The subtraction is in N\mathbb NN, which is exact because ∣G∣≥1|\mathcal G|\ge 1∣G∣≥1.

Preamble
import Mathlib
import Definitions.Def_Gomory69_Asymptotic_GroupPolyhedron
Formal statement
namespace Gomory69.Asymptotic

/-- Proof of THEOREM 4 (p. 462), first step: an irreducible nonnegative integer vector `t`
satisfies `∑_{g ∈ 𝒩} t(g) ≤ |𝒢| − 1` (natural-number subtraction is exact here, as
`|𝒢| ≥ 1`). -/
theorem sum_le_card_sub_one {G : Type*} [AddCommGroup G] [Fintype G] (𝒩 : Finset G)
    (h𝒩 : (0 : G) ∉ 𝒩) (t : ↥𝒩 → ℕ) (ht : IsIrreducible 𝒩 t) :
    ∑ g : ↥𝒩, t g ≤ Fintype.card G - 1 := by sorry

end Gomory69.Asymptotic
Source
Gomory, Some polyhedra related to combinatorial problems, Linear Algebra Appl. 2 (1969), p. 462, proof of THEOREM 4
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