Theorem 4.15 -- M-convex sets correspond to integer submodular functions
ProvedDiscreteConvex.MConvexSets.mconvex_set_iff_base_polyhedroncombinatoricsdiscrete-convex-analysis
Theorem 4.15 (p.110). A nonempty set is M-convex if and only if for some integer-valued submodular set function , 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 (, Eq. (4.25)); this mission states the iff itself (an existential ) and does not construct 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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.