Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Theorem 5.1 at the argmax set — the localisation of ω° at p₀ is matroidal iff argmax(ω[−p₀]) is an integral base set

Disproved
SteinitzExchange.LocalSupermod.matroidal_iff_argmax

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

discrete-convex-analysislocal-supermodularitym-concavep2o-plan-paperp2o-v1

Murota 1996, p. 291, Theorem 5.1, applied at the argmax set of the localisation's subgradient functional. Let B⊆ZVB \subseteq \mathbb{Z}^VB⊆ZV be a finite integral base set, ω:ZV→R\omega : \mathbb{Z}^V \to \mathbb{R}ω:ZV→R, and p0∈RVp_0 \in \mathbb{R}^Vp0​∈RV. Write ω[−p0](x)=ω(x)−⟨p0,x⟩\omega[-p_0](x) = \omega(x) - \langle p_0, x\rangleω[−p0​](x)=ω(x)−⟨p0​,x⟩ and Ap0=argmax⁡(ω[−p0])={x∈B∣ω(x)−⟨p0,x⟩≥ω(y)−⟨p0,y⟩ ∀y∈B}A_{p_0} = \operatorname{argmax}(\omega[-p_0]) = \{x \in B \mid \omega(x) - \langle p_0, x\rangle \ge \omega(y) - \langle p_0, y\rangle\ \forall y \in B\}Ap0​​=argmax(ω[−p0​])={x∈B∣ω(x)−⟨p0​,x⟩≥ω(y)−⟨p0​,y⟩ ∀y∈B}. Then the localisation L^(ω∘,p0)(p)=inf⁡{⟨p,b⟩∣b∈∂ω∘(p0)}\hat{L}(\omega^\circ, p_0)(p) = \inf\{\langle p, b\rangle \mid b \in \partial\omega^\circ(p_0)\}L^(ω∘,p0​)(p)=inf{⟨p,b⟩∣b∈∂ω∘(p0​)} of the concave conjugate ω∘\omega^\circω∘ at p0p_0p0​ is \emph{matroidal} -- positive homogeneous and satisfying (C1) supermodularity and (C2) greediness -- if and only if Ap0A_{p_0}Ap0​​ is a finite integral base set.\n\nThe two ingredients are visible in Murota's proof. First, Eq. (5.12) identifies the localisation pointwise with the support function of Ap0A_{p_0}Ap0​​, min⁡{⟨p,x⟩∣x∈Ap0}\min\{\langle p, x\rangle \mid x \in A_{p_0}\}min{⟨p,x⟩∣x∈Ap0​​}. Second, Lemma 4.3 says that every integer point of the convex hull of a maximiser set Ap0A_{p_0}Ap0​​ lies again in Ap0A_{p_0}Ap0​​, which is exactly the hypothesis that Theorem 5.1 requires of the set at which its support function is taken. Theorem 5.1 then turns (B1) for Ap0A_{p_0}Ap0​​ into matroidalness of that support function, hence of the localisation. This is the step that transports Theorem 5.1 to the conjugate and is the bridge between Eq. (5.12) and Theorem 4.4 in the proof of Theorem 5.3.


Retired. Retired because it quantified over every ω without the standing hypothesis of §4–§5: the argmax set can have holes, its support function (the localisation) can be matroidal while the set violates (B1) (accepted disproof); replaced by SteinitzExchange.LocalSupermod.matroidal_iff_argmax_v2, which assumes the argmax set hole-free as Theorem 5.1 requires.

Preamble
import Mathlib
import Definitions.Def_SteinitzExchange_LocalSupermod_IntegralBaseSet
import Definitions.Def_SteinitzExchange_LocalSupermod_Exchange
import Definitions.Def_SteinitzExchange_LocalSupermod_Matroidal
import Definitions.Def_SteinitzExchange_LocalSupermod_Localization
Formal statement
namespace SteinitzExchange.LocalSupermod

/-- Murota 1996, p. 291, Theorem 5.1, instantiated at the argmax set of the localisation's
subgradient functional. For every `p₀ : V → ℝ`, the localisation `L̂(ω°, p₀)` of the concave
conjugate at `p₀` is "matroidal" (satisfies positive homogeneity, (C1) and (C2)) if and only if the
argmax set `argmax(ω[−p₀])` of `ω[−p₀] = ω − ⟨p₀, ·⟩` over `B` is a finite integral base set.

This is the step that carries Theorem 5.1 (B1) ↔ matroidalness of the support function over to
Theorem 5.3: by Eq. (5.12) the localisation agrees pointwise with the support function
`ψ°(p) = min{⟨p, x⟩ | x ∈ argmax(ω[−p₀])}` of the argmax set, and Lemma 4.3 supplies the
integral-convexity hypothesis (`hconv`) that Theorem 5.1 requires, since every integer point of the
convex hull of a maximiser set is again a maximiser. -/
theorem matroidal_iff_argmax {V : Type*} [Fintype V] [DecidableEq V] [Nonempty V]
    (B : Finset (V → ℤ)) (hB : IsIntegralBaseSet B) (ω : (V → ℤ) → ℝ) (p₀ : V → ℝ) :
    IsMatroidal (localization (concaveConj B ω) p₀) ↔
      IsIntegralBaseSet (argmaxB B (perturb ω (-p₀))) := by sorry

end SteinitzExchange.LocalSupermod
Source
Murota, Convexity and Steinitz's Exchange Property, Adv. Math. 124 (1996), p. 291-292, Theorem 5.1 applied at argmax(ω[−p₀]) together with Eq. (5.12) and Lemma 4.3

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