Proposition 5.3 (finite unions, binary MICP-R), p. 17 — a finite union of binary MICP-R sets is binary MICP-R
ProvedMICPRep.Periodic.proposition_5_3_unionbinary-formulationmixed-integer-convex-programmingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1representability
Let () be binary MICP-R sets. Then
is binary MICP-R.
This is the finite-union clause of Proposition 5.3; it lets the proof of Proposition 6.1 merge the binary pieces produced at each induction step into one binary MICP-R set.
Formalization Note Only this clause of Proposition 5.3 is stated; the closure properties under affine maps, products, Minkowski sums and intersections, and the unions of the other classes, are not part of this item. The empty union () is included.
Preamble
import Mathlib import Definitions.Def_MICPRep_Periodic_Setting
Formal statement
namespace MICPRep.Periodic
open scoped ENNReal Matrix
/-- Proposition 5.3, p. 17 (finite-union clause for binary MICP-R sets). -/
theorem proposition_5_3_union {n k : ℕ} (S : Fin k → Set (Pt n))
(hS : ∀ i, IsBinaryMICPR (S i)) :
IsBinaryMICPR (⋃ i, S i) := by sorry
end MICPRep.Periodic
Source
Lubin, Vielma, Zadik, Mixed-integer convex representability, arXiv:1706.05135v3, p. 17, Proposition 5.3 (finite-union clause for binary MICP-R sets)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.