Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Theorem 4.15 -- M-convex sets correspond to integer submodular functions

Proved
DiscreteConvex.MConvexSets.mconvex_set_iff_base_polyhedron

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

combinatoricsdiscrete-convex-analysis

Theorem 4.15 (p.110). A nonempty set B⊆ZVB \subseteq \mathbb Z^VB⊆ZV is M-convex if and only if B=B(ρ)∩ZVB = B(\rho) \cap \mathbb Z^VB=B(ρ)∩ZV for some integer-valued submodular set function ρ∈S[Z]\rho \in S[\mathbb Z]ρ∈S[Z], establishing a one-to-one correspondence between M-convex sets and integer-valued submodular set functions.

Formalization Note. The book additionally names the two mutually inverse maps realizing this correspondence explicitly (Φ(B)(X)=sup⁡{x(X):x∈B}\Phi(B)(X) = \sup\{x(X):x\in B\}Φ(B)(X)=sup{x(X):x∈B}, Eq. (4.25)); this mission states the iff itself (an existential ρ\rhoρ) and does not construct Φ\PhiΦ as a separate object.

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

Preamble
import Mathlib
import Definitions.Def_DiscreteConvex_MConvexSets_ExchangeAxiomB
import Definitions.Def_DiscreteConvex_MConvexSets_SubmodularSetFunction
import Definitions.Def_DiscreteConvex_MConvexSets_BasePolyhedron
import Definitions.Def_DiscreteConvex_MConvexSets_IsIntegerValued
Formal statement
namespace DiscreteConvex.MConvexSets

/-- Theorem 4.15 (Murota, *Discrete Convex Analysis*, SIAM 2003, p.110). A nonempty set
`B ⊆ Zⱽ` is M-convex if and only if `B = B(ρ) ∩ Zⱽ` for some integer-valued submodular set
function `ρ ∈ S[Z]`, establishing a one-to-one correspondence between M-convex sets and
integer-valued submodular set functions. -/
theorem mconvex_set_iff_base_polyhedron {V : Type*} [Fintype V] [DecidableEq V]
    (B : Set (V → ℤ)) (hB : B.Nonempty) :
    ExchangeAxiomB B ↔
      ∃ ρ : Finset V → WithTop ℝ, SubmodularSetFunction ρ ∧ IsIntegerValued ρ ∧
        B = {x : V → ℤ | (fun v => (x v : ℝ)) ∈ BasePolyhedron ρ} := by sorry

end DiscreteConvex.MConvexSets
Source
Murota, Discrete Convex Analysis, SIAM 2003, DOI 10.1137/1.9780898718508, p.110, Theorem 4.15
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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me