–convexity (Definition 7)
DefinitionTiltedCvx_Supplement_IsHConvexconvex-analysisgeneralized-convexitynonsmooth-analysisoptimizationp2o-gran-per-chapterp2o-plan-bookp2o-v1
Let be a set and a family of functions . A function is –convex if there is a non-empty set with
For the affine functions on , the proper –convex functions are exactly the proper lower semicontinuous convex functions.
Formalization Note The supremum is taken in EReal.
Definition code
import Mathlib
namespace TiltedCvx.Supplement
/-- **`H`–convexity (Definition 7).** Pedramfar–Khanna–Quinn–Aggarwal, arXiv:2611.03472,
Definition 7, p.15: let `X` be a set and `H` a family of functions `h : X → ℝ̄`. A function
`f : X → ℝ̄` is `H`–convex if there is a non-empty set `U ⊆ H` such that
`f(x) = sup_{h ∈ U} h(x)` for all `x ∈ X`.
**Formalization Note** The supremum is taken in `EReal` (complete lattice). -/
def IsHConvex {X : Type*} (H : Set (X → EReal)) (f : X → EReal) : Prop :=
∃ U : Set (X → EReal), U ⊆ H ∧ U.Nonempty ∧ ∀ x, f x = ⨆ h ∈ U, h x
end TiltedCvx.Supplement
Source
Pedramfar–Khanna–Quinn–Aggarwal, Tilted Convexity and an Exact Offline–Online Separation, arXiv:2611.03472, Definition 7, p.15