Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 6.1, p. 21 — a rational MICP-R set splits into a binary MICP-R set and rational pieces whose I_ℤ has an integer point in its relative interior

Proved
MICPRep.Periodic.lemma_6_1

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

mixed-integer-convex-programmingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1rationally-unboundedrepresentability

Let M⊆Rn+p+dM \subseteq \mathbb R^{n+p+d}M⊆Rn+p+d be closed and convex such that (M,d)(M, d)(M,d) induces a rational MICP formulation of a nonempty set S⊆RnS \subseteq \mathbb R^nS⊆Rn. Then there are a binary MICP-R set S0⊆RnS_0 \subseteq \mathbb R^nS0​⊆Rn, k∈Z+k \in \mathbb Z_+k∈Z+​ and closed convex sets M1,…,Mk⊆Rn+p+dM_1, \dots, M_k \subseteq \mathbb R^{n+p+d}M1​,…,Mk​⊆Rn+p+d such that each (Mi,d)(M_i, d)(Mi​,d) induces a rational MICP formulation of a nonempty set SiS_iSi​,

S=S0∪⋃i=1kSi,S = S_0 \cup \bigcup_{i=1}^k S_i,S=S0​∪i=1⋃k​Si​,

and for each iii, with IiI_iIi​ the index set of (Mi,d)(M_i, d)(Mi​,d),

DMICP(Mi)≤DMICP(M)(6.2a),(Ii)Z has an integer point in its relative interior(6.2b).D_{\mathrm{MICP}}(M_i) \le D_{\mathrm{MICP}}(M) \quad (6.2a), \qquad (I_i)_{\mathbb Z} \text{ has an integer point in its relative interior} \quad (6.2b).DMICP​(Mi​)≤DMICP​(M)(6.2a),(Ii​)Z​ has an integer point in its relative interior(6.2b).

This is the first of the two key lemmas behind Theorem 5.1: it reduces to formulations whose index sets are "integrally full-dimensional".

Formalization Note The sets MiM_iMi​ live in the same Rn+p+d\mathbb R^{n+p+d}Rn+p+d as MMM (same ppp and ddd), as "(Mi,d)(M_i, d)(Mi​,d)" says; the relative interior is intrinsicInterior.

Preamble
import Mathlib
import Definitions.Def_MICPRep_Periodic_Setting
Formal statement
namespace MICPRep.Periodic

open scoped ENNReal Matrix

/-- Lemma 6.1, p. 21. -/
theorem lemma_6_1 {n p d : ℕ} (M : Set (Ambient n p d)) (S : Set (Pt n))
    (hM : IsRationalFormulation M S) (hS : S.Nonempty) :
    ∃ S₀ : Set (Pt n), IsBinaryMICPR S₀ ∧
      ∃ (k : ℕ) (Ms : Fin k → Set (Ambient n p d)) (Ss : Fin k → Set (Pt n)),
        (∀ i, IsRationalFormulation (Ms i) (Ss i) ∧ (Ss i).Nonempty) ∧
        S = S₀ ∪ ⋃ i, Ss i ∧
        ∀ i, micpDiam (Ms i) ≤ micpDiam M ∧
          (intrinsicInterior ℝ (IZ (indexSet (Ms i))) ∩ intLattice d).Nonempty := by sorry

end MICPRep.Periodic
Source
Lubin, Vielma, Zadik, Mixed-integer convex representability, arXiv:1706.05135v3, p. 21, Lemma 6.1
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