Theorem 7.28 -- sbf_nat_r_iff_polyhedral_lnat_convex
ProvedDiscreteConvex.LConvexFunctionsC.sbf_nat_r_iff_polyhedral_lnat_convexconvex-optimizationdiscrete-convex-analysis
Theorem 7.28 (p.192). For a polyhedral convex function with , (SBF[R]) is equivalent to polyhedral L-convexity.
(Murota, Discrete Convex Analysis, SIAM 2003, DOI 10.1137/1.9780898718508, p.192, Theorem 7.28.)
Preamble
import Mathlib import Definitions.Def_DiscreteConvex_LConvexFunctionsC_DomR import Definitions.Def_DiscreteConvex_LConvexFunctionsC_SBFNatR import Definitions.Def_DiscreteConvex_LConvexFunctionsC_LNaturalConvexR
Formal statement
namespace DiscreteConvex.LConvexFunctionsC
open Classical
open scoped Pointwise
variable {V : Type*} [Fintype V] [DecidableEq V]
/-- Theorem 7.28 (p.192). For a polyhedral convex function, (SBF♮[R]) is equivalent to polyhedral
L♮-convexity. -/
theorem sbf_nat_r_iff_polyhedral_lnat_convex (g : (V → ℝ) → WithTop ℝ) (hdom : (DomR g).Nonempty) :
SBFNatR g ↔ LNaturalConvexR g := by sorry
end DiscreteConvex.LConvexFunctionsC
Source
Murota, Discrete Convex Analysis, SIAM 2003, DOI 10.1137/1.9780898718508, p.192, Theorem 7.28
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.