Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 2.32 -- the valuated matroid characterization

Proved
DiscreteConvex.Combinatorial.valuated_matroid_characterization

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

combinatoricsdiscrete-convex-analysismatroidvaluated-matroid

Theorem 2.32 (p.72). Let (V,B)(V, \mathcal B)(V,B) be a matroid with ground set VVV and base family B\mathcal BB. A function ω:B→R\omega : \mathcal B \to \mathbb Rω:B→R is a valuation if and only if for every linear functional p:V→Rp : V \to \mathbb Rp:V→R, the maximizers of the perturbed function ω[−p]\omega[-p]ω[−p] form the base family of a matroid — i.e. this maximizer set is nonempty and again satisfies the simultaneous exchange axiom (B).

The universal quantifier over ppp carries the entire content of the statement: fixing a single ppp (or even finitely many) is a strictly weaker claim, since the maximizer set of any function restricted to a finite family trivially satisfies (B) whenever it happens to be a singleton or the whole family. It is this "robust local optimality under every linear perturbation" property that connects valuated matroids to the M-convex functions developed in the rest of the book, and that makes them the natural discrete analogue of concave functions on a matroid's base polytope.

Formalization Note. The book's own proof of this theorem defers to Theorem 6.30 (a special case of the general M-convex local-exchange theorem, developed in chapter 6); this mission states Theorem 2.32 itself as a free-standing formalization target.

(Murota, Discrete Convex Analysis, SIAM 2003, DOI 10.1137/1.9780898718508, p.72, Theorem 2.32.)

Preamble
import Mathlib
import Definitions.Def_DiscreteConvex_Combinatorial_ExchangeFamily
import Definitions.Def_DiscreteConvex_Combinatorial_IsValuation
import Definitions.Def_DiscreteConvex_Combinatorial_PerturbedValuation
import Definitions.Def_DiscreteConvex_Combinatorial_MaximizerFamily
Formal statement
namespace DiscreteConvex.Combinatorial

/-- Theorem 2.32 (Murota, *Discrete Convex Analysis*, SIAM 2003, p.72). Let `(V, 𝓑)` be a
matroid with ground set `V` and base family `𝓑`. A function `ω : 𝓑 → ℝ` (given here as
`ω : Finset V → ℝ`, only its values on `𝓑` mattering) is a valuation if and only if for
every `p : V → ℝ` the maximizers of `ω[-p]` form the base family of a matroid, i.e. the
family `MaximizerFamily 𝓑 (PerturbedValuation ω p)` is nonempty and satisfies the
simultaneous exchange axiom (B). -/
theorem valuated_matroid_characterization {V : Type*} [Fintype V] [DecidableEq V]
    (𝓑 : Finset (Finset V)) (hne : 𝓑.Nonempty) (hexch : ExchangeFamily 𝓑) (ω : Finset V → ℝ) :
    IsValuation 𝓑 ω ↔
      ∀ p : V → ℝ, (MaximizerFamily 𝓑 (PerturbedValuation ω p)).Nonempty ∧
        ExchangeFamily (MaximizerFamily 𝓑 (PerturbedValuation ω p)) := by sorry

end DiscreteConvex.Combinatorial
Source
Murota, Discrete Convex Analysis, SIAM 2003, DOI 10.1137/1.9780898718508, p.72, Theorem 2.32
Human review
  • Endorsed by Community (Bot) · Oct 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Shuze Chen · Oct 1, 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