Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 6.2, p. 22 — trichotomy: binary MICP-R, or a nearly periodic formulation, or a rational formulation with d − 1 integer variables sandwiched between S and cl(S)

Proved
MICPRep.Periodic.lemma_6_2

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

mixed-integer-convex-programmingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1periodic-setrepresentability

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 with index set III. If DMICP(M)<∞D_{\mathrm{MICP}}(M) < \inftyDMICP​(M)<∞ and IZI_{\mathbb Z}IZ​ has an integer point in its relative interior, then one of the following holds:

  1. SSS is binary MICP-R;
  2. SSS has a nearly periodic MICP formulation;
  3. there is a closed convex M~\tilde MM~ such that (M~,d−1)(\tilde M, d-1)(M~,d−1) induces a rational MICP formulation of a nonempty set S~\tilde SS~ with
DMICP(M~)≤DMICP(M),S⊆S~⊆cl(S~)⊆cl(S).D_{\mathrm{MICP}}(\tilde M) \le D_{\mathrm{MICP}}(M), \qquad S \subseteq \tilde S \subseteq \mathrm{cl}(\tilde S) \subseteq \mathrm{cl}(S).DMICP​(M~)≤DMICP​(M),S⊆S~⊆cl(S~)⊆cl(S).

This is the second key lemma behind Theorem 5.1; option 3 feeds the induction on the number of integer variables.

Formalization Note "d−1d - 1d−1" is written via d=d′+1d = d' + 1d=d′+1, so option 3 is impossible when d=0d = 0d=0 (no truncated subtraction). The number of continuous variables of M~\tilde MM~ is existential. The nearly periodic formulation in option 2 may be any MICP formulation of SSS, not necessarily rational.

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

open scoped ENNReal Matrix

/-- Lemma 6.2, p. 22. -/
theorem lemma_6_2 {n p d : ℕ} (M : Set (Ambient n p d)) (S : Set (Pt n))
    (hM : IsRationalFormulation M S) (hS : S.Nonempty) (hD : micpDiam M < ⊤)
    (hint : (intrinsicInterior ℝ (IZ (indexSet M)) ∩ intLattice d).Nonempty) :
    IsBinaryMICPR S ∨ HasNearlyPeriodicFormulation S ∨
      ∃ d' : ℕ, d = d' + 1 ∧
        ∃ (p' : ℕ) (Mt : Set (Ambient n p' d')) (St : Set (Pt n)),
          IsRationalFormulation Mt St ∧ St.Nonempty ∧ micpDiam Mt ≤ micpDiam M ∧
          S ⊆ St ∧ St ⊆ closure St ∧ closure St ⊆ closure S := by sorry

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