Lemma 6.8, p. 28 — an affine function separates a concave g from a convex f ≥ g on a convex set
ProvedMICPRep.Periodic.lemma_6_8convex-analysisp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1separation
Let be convex and let be such that and are convex and for all . Then there are and with
The paper cites Rockafellar §31; it is used to turn bounded width functions into periodic directions in Lemma 6.13.
Formalization Note are total functions on whose values off are irrelevant; convexity of and concavity of are Mathlib's ConvexOn/ConcaveOn on . No closedness or nonemptiness of is assumed.
Preamble
import Mathlib import Definitions.Def_MICPRep_Periodic_Setting
Formal statement
namespace MICPRep.Periodic
open scoped ENNReal Matrix
/-- Lemma 6.8, p. 28. -/
theorem lemma_6_8 {d : ℕ} (I : Set (Fin d → ℝ)) (hI : Convex ℝ I)
(f g : (Fin d → ℝ) → ℝ) (hf : ConvexOn ℝ I f) (hg : ConcaveOn ℝ I g)
(hgf : ∀ z ∈ I, g z ≤ f z) :
∃ (v : Fin d → ℝ) (K : ℝ), ∀ z ∈ I, g z ≤ v ⬝ᵥ z + K ∧ v ⬝ᵥ z + K ≤ f z := by sorry
end MICPRep.Periodic
Source
Lubin, Vielma, Zadik, Mixed-integer convex representability, arXiv:1706.05135v3, p. 28, Lemma 6.8
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.