Proposition 6.1, p. 22 — S ⊆ S₀ ∪ ⋃ Tᵢ ⊆ cl(S) with S₀ binary MICP-R and each Tᵢ having a nearly periodic MICP formulation
ProvedMICPRep.Periodic.proposition_6_1mixed-integer-convex-programmingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1periodic-setrepresentability
Let be closed and convex such that induces a rational MICP formulation of . If , then there are a binary MICP-R set , and sets , each with a nearly periodic MICP formulation, such that
This is the last step before Theorem 5.1: for closed the sandwich becomes an equality, and the nearly periodic pieces become closed periodic sets.
Formalization Note may be empty here. is valued in .
Preamble
import Mathlib import Definitions.Def_MICPRep_Periodic_Setting
Formal statement
namespace MICPRep.Periodic
open scoped ENNReal Matrix
/-- Proposition 6.1, p. 22. -/
theorem proposition_6_1 {n p d : ℕ} (M : Set (Ambient n p d)) (S : Set (Pt n))
(hM : IsRationalFormulation M S) (hD : micpDiam M < ⊤) :
∃ S₀ : Set (Pt n), IsBinaryMICPR S₀ ∧
∃ (k : ℕ) (T : Fin k → Set (Pt n)),
(∀ i, HasNearlyPeriodicFormulation (T i)) ∧
S ⊆ S₀ ∪ ⋃ i, T i ∧ S₀ ∪ ⋃ i, T i ⊆ closure S := by sorry
end MICPRep.Periodic
Source
Lubin, Vielma, Zadik, Mixed-integer convex representability, arXiv:1706.05135v3, p. 22, Proposition 6.1
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.