Theorem 8.31, set part — M♮₂-convex sets are integrally convex
ProvedDiscreteConvex.ConjugacyDualityB.mnat2_convex_set_is_integrally_convexdiscrete-convex-analysisdiscrete-geometry
Let be a finite ground set and let be M♮₂-convex, meaning that is the intersection of two M♮-convex sets. Then is integrally convex: for every real vector ,
This is the set assertion in Theorem 8.31, separated from the function assertion so it can be proved and reused independently. Empty sets and empty ground sets are included.
Preamble
import Mathlib import Definitions.Def_DiscreteConvex_ConjugacyDualityB_MNat2ConvexSet import Definitions.Def_DiscreteConvex_ConjugacyDualityB_IsIntegrallyConvex
Formal statement
theorem DiscreteConvex.ConjugacyDualityB.mnat2_convex_set_is_integrally_convex {V : Type*} [Fintype V] [DecidableEq V]
(D : Set (V → ℤ)) (hD : DiscreteConvex.ConjugacyDualityB.MNat2ConvexSet D) :
DiscreteConvex.ConjugacyDualityB.IsIntegrallyConvex D := 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.