Theorem 8.31, function part — M♮₂-convex functions are integrally convex
ProvedDiscreteConvex.ConjugacyDualityB.mnat2_convex_function_is_integrally_convexconvex-optimizationdiscrete-convex-analysis
Let be a finite ground set and let be a sum of two M♮-convex functions. Then is integrally convex:
where is the convex closure using all finite convex combinations of effective-domain points and is the corresponding closure using only effective-domain points in . This is exactly the function assertion of the mission's Theorem 8.31; the set assertion is a separate leaf.
Preamble
import Mathlib import Definitions.Def_DiscreteConvex_ConjugacyDualityB_MNat2Convex import Definitions.Def_DiscreteConvex_ConjugacyDualityB_IsIntegrallyConvexFunction
Formal statement
theorem DiscreteConvex.ConjugacyDualityB.mnat2_convex_function_is_integrally_convex {V : Type*} [Fintype V] [DecidableEq V]
(f : (V → ℤ) → WithTop ℝ) (hf : DiscreteConvex.ConjugacyDualityB.MNat2Convex f) :
DiscreteConvex.ConjugacyDualityB.IsIntegrallyConvexFunction f := by sorrySource
K. Murota, Discrete Convex Analysis, SIAM, 2003, p.227, Theorem 8.31. https://doi.org/10.1137/1.9780898718508.ch8. Exact set/function clauses separated from the existing mission milestone.