Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

The converse of the Extension Theorem — a concave extension with integral base polytope argmaxs forces (EXC)

Proved
SteinitzExchange.Extension.concave_extension_imp_exc

by WillR · Sep 28, 2026 · Mathlib 0df444a (Lean v4.33.1)

concave-extensiondiscrete-convex-analysism-concavep2o-batch-p100bsteinitz-exchange

Let B⊆ZVB\subseteq \mathbb Z^VB⊆ZV be a finite integral base set and ω:B→R\omega:B\to\mathbb Rω:B→R. Suppose there is a function ωˉ:B‾→R\bar\omega:\overline B\to\mathbb Rωˉ:B→R such that

  1. ωˉ\bar\omegaωˉ is concave on B‾\overline BB;
  2. ωˉ(x)=ω(x)\bar\omega(x)=\omega(x)ωˉ(x)=ω(x) for all x∈Bx\in Bx∈B;
  3. for every p∈RVp\in\mathbb R^Vp∈RV, the maximizers over B‾\overline BB of ωˉ[p](b)=ωˉ(b)+⟨p,b⟩\bar\omega[p](b)=\bar\omega(b)+\langle p,b\rangleωˉ[p](b)=ωˉ(b)+⟨p,b⟩ form an integral base polytope.

Then ω\omegaω satisfies the exchange property (EXC): for all 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, x−χu+χv∈Bx-\chi_u+\chi_v\in Bx−χu​+χv​∈B, y+χu−χv∈By+\chi_u-\chi_v\in By+χu​−χv​∈B and

ω(x)+ω(y)≤ω(x−χu+χv)+ω(y+χu−χv).\omega(x)+\omega(y)\le \omega(x-\chi_u+\chi_v)+\omega(y+\chi_u-\chi_v).ω(x)+ω(y)≤ω(x−χu​+χv​)+ω(y+χu​−χv​).

This is the converse (hard) direction of Murota's Extension Theorem (1996, p. 288, Theorem 4.6). The intuition is that concavity of ωˉ\bar\omegaωˉ plus the integrality of every maximizer face pins down the exchange inequality: if it failed at some (x,y,u)(x,y,u)(x,y,u), a carefully chosen linear perturbation would expose a maximizing face of B‾\overline BB that violates the integral base polytope condition, contradicting hypothesis 3. Proving this requires relating the exchange partner v∈supp⁡−(x−y)v\in\operatorname{supp}^-(x-y)v∈supp−(x−y) to an exposed face of the concave closure.

Formalization Note. This child isolates exactly the converse implication, so that the parent Extension Theorem reduces to Lemma 4.5 (agreement on BBB), the concavity of the concave closure, the perturbed-argmax identity, and this converse.

Preamble
import Mathlib
import Definitions.Def_SteinitzExchange_Extension_IntegralBaseSet
import Definitions.Def_SteinitzExchange_Extension_Exchange
import Definitions.Def_SteinitzExchange_Extension_ConcaveClosure
Formal statement
namespace SteinitzExchange.Extension

/-- Murota 1996, p. 288, Theorem 4.6 (Extension Theorem), reverse direction. Let `B ⊆ ℤ^V` be a finite
integral base set and `ω : B → ℝ` a function. Suppose `ω` extends to a concave function
`ω̄ : B̄ → ℝ` agreeing with `ω` on `B` whose maximizers over `B̄` of `ω̄[p](b) = ω̄(b) + ⟨p, b⟩`
are integral base polytopes for every `p : V → ℝ`. Then `ω` satisfies the exchange property (EXC).

This is the converse half of the Extension Theorem: the combinatorial condition on the maximizer
sets of all linear perturbations forces the base-exchange inequality
$$\omega(x) + \omega(y) \le \omega(x - \chi_u + \chi_v) + \omega(y + \chi_u - \chi_v)$$
whenever `x, y ∈ B` and `u ∈ supp⁺(x − y)`. The argument proceeds by contradiction: if the
exchange inequality fails for some `x, y, u`, one produces a linear functional `p` (a supporting
separator at a maximizing face) whose maximizer set over `B̄` cannot be an integral base polytope,
contradicting the hypothesis. -/
theorem concave_extension_imp_exc {V : Type*} [Fintype V] [DecidableEq V] [Nonempty V]
    (B : Finset (V → ℤ)) (hB : IsIntegralBaseSet B) (ω : (V → ℤ) → ℝ)
    (ωbar : (V → ℝ) → ℝ)
    (hconc : ConcaveOn ℝ (hull B) ωbar)
    (hext : ∀ x ∈ B, ωbar (toReal x) = ω x)
    (hpoly : ∀ p : V → ℝ, IsIntegralBasePolytope (argmaxOn (hull B) (fun b => ωbar b + pairing p b))) :
    SatisfiesEXC B ω := by sorry

end SteinitzExchange.Extension
Source
Murota, Convexity and Steinitz's Exchange Property, Adv. Math. 124 (1996), p. 288, Theorem 4.6 (converse direction)

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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me