Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 6.1, p. 22 — S ⊆ S₀ ∪ ⋃ Tᵢ ⊆ cl(S) with S₀ binary MICP-R and each Tᵢ having a nearly periodic MICP formulation

Proved
MICPRep.Periodic.proposition_6_1

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 S⊆RnS \subseteq \mathbb R^nS⊆Rn. If DMICP(M)<∞D_{\mathrm{MICP}}(M) < \inftyDMICP​(M)<∞, then there are a binary MICP-R set S0S_0S0​, k∈Z+k \in \mathbb Z_+k∈Z+​ and sets T1,…,TkT_1, \dots, T_kT1​,…,Tk​, each with a nearly periodic MICP formulation, such that

S⊆S0∪⋃i=1kTi⊆cl(S).S \subseteq S_0 \cup \bigcup_{i=1}^k T_i \subseteq \mathrm{cl}(S).S⊆S0​∪i=1⋃k​Ti​⊆cl(S).

This is the last step before Theorem 5.1: for closed SSS the sandwich becomes an equality, and the nearly periodic pieces become closed periodic sets.

Formalization Note SSS may be empty here. DMICPD_{\mathrm{MICP}}DMICP​ is valued in [0,∞][0, \infty][0,∞].

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
  • 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