Theorem 5.2 -- L-convex sets are hole free
ProvedDiscreteConvex.LConvexSets.hole_free_lconvexdiscrete-convex-analysisdiscrete-geometry
Theorem 5.2 (p.123). An L-convex set is hole free: for an L-convex set .
(Murota, Discrete Convex Analysis, SIAM 2003, DOI 10.1137/1.9780898718508, p.123, Theorem 5.2.)
Preamble
import Mathlib import Definitions.Def_DiscreteConvex_LConvexSets_LConvexSet import Definitions.Def_DiscreteConvex_LConvexSets_ConvexClosureSet
Formal statement
namespace DiscreteConvex.LConvexSets
/-- Theorem 5.2 (Murota, *Discrete Convex Analysis*, SIAM 2003, p.123). An L-convex set is
hole free: `D = D̄ ∩ Zⱽ` for an L-convex set `D ⊆ Zⱽ`. -/
theorem hole_free_lconvex {V : Type*} [Fintype V] [DecidableEq V] (D : Set (V → ℤ))
(hD : LConvexSet D) :
∀ p : V → ℤ, p ∈ D ↔ (fun v => (p v : ℝ)) ∈ ConvexClosureSet D := by sorry
end DiscreteConvex.LConvexSets
Source
Murota, Discrete Convex Analysis, SIAM 2003, DOI 10.1137/1.9780898718508, p.123, Theorem 5.2
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.