Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 2.1 — (B1) characterizes integer points of integral submodular/supermodular base polytopes

Proved
SteinitzExchange.Duality.baseSet_iff_submodular_system

by mikedeng1 · Sep 27, 2026 · Mathlib 0df444a (Lean v4.33.1)

base-polytopeintegral-base-setp2o-batch-p100bp2o-gran-per-chapterp2o-plan-paperp2o-v1submodular-functionsupermodular-function

Let B⊆ZVB\subseteq\mathbb Z^VB⊆ZV be finite and nonempty. The following are equivalent:

  1. BBB satisfies (B1);
  2. there is an integer-valued submodular f:2V→Zf:2^V\to\mathbb Zf:2V→Z with f(∅)=0f(\emptyset)=0f(∅)=0 such that
B=ZV∩{x∈RV∣x(X)≤f(X) (∀X⊆V), x(V)=f(V)};B=\mathbb Z^V\cap\{x\in\mathbb R^V\mid x(X)\le f(X)\ (\forall X\subseteq V),\ x(V)=f(V)\};B=ZV∩{x∈RV∣x(X)≤f(X) (∀X⊆V), x(V)=f(V)};
  1. there is an integer-valued supermodular g:2V→Zg:2^V\to\mathbb Zg:2V→Z with g(∅)=0g(\emptyset)=0g(∅)=0 such that
B=ZV∩{x∈RV∣x(X)≥g(X) (∀X⊆V), x(V)=g(V)}.B=\mathbb Z^V\cap\{x\in\mathbb R^V\mid x(X)\ge g(X)\ (\forall X\subseteq V),\ x(V)=g(V)\}.B=ZV∩{x∈RV∣x(X)≥g(X) (∀X⊆V), x(V)=g(V)}.

Moreover, the functions fff and ggg are given by f(X)=max⁡{x(X)∣x∈B}f(X)=\max\{x(X)\mid x\in B\}f(X)=max{x(X)∣x∈B} and g(X)=min⁡{x(X)∣x∈B}g(X)=\min\{x(X)\mid x\in B\}g(X)=min{x(X)∣x∈B}.

This folklore result identifies finite integral base sets with the integer points of integral base polytopes; in the duality theorem it provides the supermodular function g1g_1g1​ describing B1B_1B1​ and the submodular function f2f_2f2​ describing B2B_2B2​.

Formalization Note. The page writes ∀X⊂V\forall X\subset V∀X⊂V; it is read as all subsets X⊆VX\subseteq VX⊆V (the paper uses ⊂\subset⊂ for ⊆\subseteq⊆ here, and X=VX=VX=V is covered by the equality constraint anyway). The "Moreover" clause is stated as: every fff (resp. ggg) as in 2 (resp. 3) equals the max (resp. min) formula.

Preamble
import Mathlib
import Definitions.Def_SteinitzExchange_Duality_IntegralBaseSet
import Definitions.Def_SteinitzExchange_Duality_SetFunction
Formal statement
namespace SteinitzExchange.Duality

/-- Murota 1996, p. 277, Theorem 2.1. For a finite nonempty `B ⊆ ℤ^V`:
(a) (B1) ⇔ (b) `B = {x ∈ ℤ^V | x(X) ≤ f(X) ∀ X ⊆ V, x(V) = f(V)}` for an integer-valued
submodular `f` with `f(∅) = 0`; (a) ⇔ (c) the same with a supermodular `g` and `≥`.
Moreover any such `f` is `X ↦ max{x(X) | x ∈ B}` and any such `g` is `X ↦ min{x(X) | x ∈ B}`.
The page's "∀X ⊂ V" is read as all `X ⊆ V`. -/
theorem baseSet_iff_submodular_system {V : Type*} [Fintype V] [DecidableEq V] [Nonempty V]
    (B : Finset (V → ℤ)) (hne : B.Nonempty) :
    (IsIntegralBaseSet B ↔
      ∃ f : Finset V → ℤ, IsSubmodular f ∧ f ∅ = 0 ∧
        ∀ x : V → ℤ, x ∈ B ↔
          (∀ X : Finset V, sumOn x X ≤ f X) ∧ sumOn x Finset.univ = f Finset.univ) ∧
    (IsIntegralBaseSet B ↔
      ∃ g : Finset V → ℤ, IsSupermodular g ∧ g ∅ = 0 ∧
        ∀ x : V → ℤ, x ∈ B ↔
          (∀ X : Finset V, g X ≤ sumOn x X) ∧ sumOn x Finset.univ = g Finset.univ) ∧
    (∀ f : Finset V → ℤ, IsSubmodular f → f ∅ = 0 →
      (∀ x : V → ℤ, x ∈ B ↔
          (∀ X : Finset V, sumOn x X ≤ f X) ∧ sumOn x Finset.univ = f Finset.univ) →
      ∀ X : Finset V, f X = B.sup' hne (fun x => sumOn x X)) ∧
    (∀ g : Finset V → ℤ, IsSupermodular g → g ∅ = 0 →
      (∀ x : V → ℤ, x ∈ B ↔
          (∀ X : Finset V, g X ≤ sumOn x X) ∧ sumOn x Finset.univ = g Finset.univ) →
      ∀ X : Finset V, g X = B.inf' hne (fun x => sumOn x X)) := by sorry

end SteinitzExchange.Duality
Source
Murota, Convexity and Steinitz's Exchange Property, Adv. Math. 124 (1996), p. 277, Theorem 2.1
Read-back

What the Lean code literally says, in plain math · claude-opus-5-5

Setting.

  • VVV is a finite, nonempty type with decidable equality.
  • B⊆ZVB \subseteq \mathbb{Z}^VB⊆ZV is a nonempty finite set.

Write x(X)=∑v∈Xx(v)x(X) = \sum_{v\in X}x(v)x(X)=∑v∈X​x(v) for X⊆VX \subseteq VX⊆V.

  • Submodular: f(X∪Y)+f(X∩Y)≤f(X)+f(Y)f(X\cup Y)+f(X\cap Y) \le f(X)+f(Y)f(X∪Y)+f(X∩Y)≤f(X)+f(Y) for all X,Y⊆VX, Y \subseteq VX,Y⊆V.
  • Supermodular: the reverse inequality, g(X)+g(Y)≤g(X∪Y)+g(X∩Y)g(X)+g(Y) \le g(X\cup Y)+g(X\cap Y)g(X)+g(Y)≤g(X∪Y)+g(X∩Y).
  • Integral base set: BBB is nonempty, and for x,y∈Bx,y\in Bx,y∈B and every uuu with (x−y)(u)>0(x-y)(u)>0(x−y)(u)>0 there is vvv with (x−y)(v)<0(x-y)(v)<0(x−y)(v)<0 and x−χu+χv∈Bx-\chi_u+\chi_v\in Bx−χu​+χv​∈B.

Claim. The theorem asserts all four of the following:

  1. BBB is an integral base set iff there is an integer-valued submodular f:2V→Zf : 2^V \to \mathbb{Z}f:2V→Z with f(∅)=0f(\emptyset)=0f(∅)=0 such that, for every x∈ZVx \in \mathbb{Z}^Vx∈ZV:
x∈B  ⟺  (x(X)≤f(X) ∀X⊆V) and x(V)=f(V).x \in B \iff \bigl(x(X) \le f(X)\ \forall X\subseteq V\bigr) \text{ and } x(V) = f(V).x∈B⟺(x(X)≤f(X) ∀X⊆V) and x(V)=f(V).
  1. BBB is an integral base set iff there is an integer-valued supermodular ggg with g(∅)=0g(\emptyset) = 0g(∅)=0 such that, for every x∈ZVx\in\mathbb{Z}^Vx∈ZV:
x∈B  ⟺  (g(X)≤x(X) ∀X) and x(V)=g(V).x\in B \iff \bigl(g(X) \le x(X)\ \forall X\bigr) \text{ and } x(V) = g(V).x∈B⟺(g(X)≤x(X) ∀X) and x(V)=g(V).
  1. Every integer-valued submodular fff with f(∅)=0f(\emptyset)=0f(∅)=0 that describes BBB in the sense of part 1 satisfies
f(X)=max⁡x∈Bx(X)for all X⊆V.f(X) = \max_{x\in B} x(X) \quad \text{for all } X \subseteq V.f(X)=x∈Bmax​x(X)for all X⊆V.
  1. Every integer-valued supermodular ggg with g(∅)=0g(\emptyset)=0g(∅)=0 that describes BBB in the sense of part 2 satisfies
g(X)=min⁡x∈Bx(X)for all X⊆V.g(X) = \min_{x \in B}x(X) \quad \text{for all } X \subseteq V.g(X)=x∈Bmin​x(X)for all X⊆V.

Parts 3 and 4 do not assume that BBB is an integral base set.

Degenerate cases. The set on the right of parts 1 and 2 ranges over all integer vectors. Equality with BBB therefore also asserts that this integer set is finite, since BBB is a finite set. If no such fff (or ggg) exists, parts 3 and 4 are vacuous. If VVV has one element uuu, the only subsets are ∅\emptyset∅ and {u}\{u\}{u}, and the conditions pin down x(u)x(u)x(u) to the single value f({u})f(\{u\})f({u}) (respectively g({u})g(\{u\})g({u})). Empty VVV and empty BBB are excluded.

Human review
  • Endorsed by Shuze Chen · Sep 27, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Sep 27, 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