Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 5.3 (finite unions, binary MICP-R), p. 17 — a finite union of binary MICP-R sets is binary MICP-R

Proved
MICPRep.Periodic.proposition_5_3_union

by mikedeng1 · Oct 22, 2026 · Mathlib 0df444a (Lean v4.33.1)

binary-formulationmixed-integer-convex-programmingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1representability

Let S1,…,Sk⊆RnS_1, \dots, S_k \subseteq \mathbb R^nS1​,…,Sk​⊆Rn (k∈Z+k \in \mathbb Z_+k∈Z+​) be binary MICP-R sets. Then

⋃i=1kSi\bigcup_{i=1}^k S_ii=1⋃k​Si​

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 (k=0k = 0k=0) 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
  • Endorsed by Shuze Chen · Oct 23, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 23, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me