Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

p. 506, proof of THEOREM 23 — solutions vanishing off the support of t agree with t modulo p and dominate it

Proved
Gomory69.SpecialGroups.solution_on_support

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 in which every nonzero element has order ppp, p∈{2,3}p \in \{2, 3\}p∈{2,3}, and let ttt be an irreducible nonnegative integer solution of the group equation ∑gt(g)⋅g=g0\sum_{g} t(g)\cdot g = g_0∑g​t(g)⋅g=g0​. If uuu is any nonnegative integer solution of the same equation with u(g)=0u(g) = 0u(g)=0 whenever t(g)=0t(g) = 0t(g)=0, then for every g∈G+g \in \mathcal G^+g∈G+

u(g)≡t(g)(modp)andu(g)≥t(g).u(g) \equiv t(g) \pmod p \qquad\text{and}\qquad u(g) \ge t(g).u(g)≡t(g)(modp)andu(g)≥t(g).

In particular ttt is the only such solution whose components are all smaller than ppp.

Formalization Note The page asserts that ttt is the only solution with components zero outside its support. Literally this fails: in G=Z2\mathcal G = \mathbb Z_2G=Z2​ with g0=1g_0 = 1g0​=1, t=(1)t = (1)t=(1) is irreducible and u=(3)u = (3)u=(3) is another solution with the same support. The page's argument (with s(g)≡t(g)−u(g)s(g) \equiv t(g) - u(g)s(g)≡t(g)−u(g), 0≤s(g)<p0 \le s(g) < p0≤s(g)<p, and independence of the support) proves u≡t(modp)u \equiv t \pmod pu≡t(modp); since an irreducible ttt has t(g)<pt(g) < pt(g)<p, this gives u≥tu \ge tu≥t. The statement records that corrected conclusion.

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

/-- Proof of THEOREM 23 (Gomory 1969, p. 506), corrected: if every nonzero element of `𝒢` has
order `p ∈ {2, 3}` and `t` is an irreducible solution of the group equation, then every solution
`u` vanishing wherever `t` vanishes satisfies `u(g) ≡ t(g) (mod p)` and `u(g) ≥ t(g)` for every
`g`; in particular `t` is the only such solution with all components below `p`. (The page asserts
that `t` is the only such solution outright, which fails, e.g. `𝒢 = ℤ₂`, `t = (1)`, `u = (3)`.) -/
theorem solution_on_support {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)
    (u : {g : G // g ≠ 0} → ℕ) (hu : u ∈ solutionSet g₀) (hsupp : ∀ g, t g = 0 → u g = 0) :
    ∀ g, u g ≡ t g [MOD p] ∧ t g ≤ u g := by sorry

end Gomory69.SpecialGroups
Source
Gomory, Some polyhedra related to combinatorial problems, Linear Algebra Appl. 2 (1969), p. 506, proof of THEOREM 23 (corrected; see the Formalization Note)
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