Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 6.13, p. 30 — each integer recession direction r gives a unique asymptotic direction u, and for u = 0 the unions along z + rℝ₊ are convex with diameter at most D_MICP(M)

Proved
MICPRep.Periodic.lemma_6_13

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

convex-analysismixed-integer-convex-programmingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1periodic-set

Let M⊆Rn+p+dM \subseteq \mathbb R^{n+p+d}M⊆Rn+p+d be closed and convex, inducing a rational MICP formulation with index set III and zzz-projected sets {Az}\{A_z\}{Az​}. Assume DMICP(M)<∞D_{\mathrm{MICP}}(M) < \inftyDMICP​(M)<∞ and IZI_{\mathbb Z}IZ​ has an integer point in its relative interior. Then for every r∈Zd∩(I∞∖{0})r \in \mathbb Z^d \cap (I_\infty \setminus\{0\})r∈Zd∩(I∞​∖{0}) there is a unique u∈Rnu \in \mathbb R^nu∈Rn with

x+λu∈cl(Az+λr)∀λ>0, z∈Zd∩I, x∈Az.(6.26)x + \lambda u \in \mathrm{cl}(A_{z + \lambda r}) \qquad \forall \lambda > 0,\ z \in \mathbb Z^d \cap I,\ x \in A_z. \tag{6.26}x+λu∈cl(Az+λr​)∀λ>0, z∈Zd∩I, x∈Az​.(6.26)

Furthermore, if u=0u = 0u=0, then for every z∈Zd∩Iz \in \mathbb Z^d \cap Iz∈Zd∩I the set A~z=⋃z′∈z+rR+Az′\tilde A_z = \bigcup_{z' \in z + r\mathbb R_+} A_{z'}A~z​=⋃z′∈z+rR+​​Az′​ is convex, D(A~z)≤DMICP(M)D(\tilde A_z) \le D_{\mathrm{MICP}}(M)D(A~z​)≤DMICP​(M), and

⋃z′∈(z+rR+)∩ZdAz′⊆A~z⊆⋃z′∈(z+rR+)∩Zdcl(Az′).\bigcup_{z' \in (z + r\mathbb R_+) \cap \mathbb Z^d} A_{z'} \subseteq \tilde A_z \subseteq \bigcup_{z' \in (z + r\mathbb R_+)\cap\mathbb Z^d} \mathrm{cl}(A_{z'}).z′∈(z+rR+​)∩Zd⋃​Az′​⊆A~z​⊆z′∈(z+rR+​)∩Zd⋃​cl(Az′​).

Either the recession direction produces a nearly periodic formulation (u≠0u \neq 0u=0) or the integer variable along rrr can be relaxed without increasing the diameter (u=0u = 0u=0); this is the dichotomy behind Lemma 6.2.

Formalization Note λ>0\lambda > 0λ>0 ranges over the reals, R+=[0,∞)\mathbb R_+ = [0, \infty)R+​=[0,∞), and diameters are extended (Metric.ediam). "If u=0u = 0u=0" is stated as: for every uuu satisfying (6.26), if u=0u = 0u=0 then the conclusions hold.

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

open scoped ENNReal Matrix

/-- Lemma 6.13, p. 30. -/
theorem lemma_6_13 {n p d : ℕ} (M : Set (Ambient n p d)) (S : Set (Pt n))
    (hM : IsRationalFormulation M S) (hD : micpDiam M < ⊤)
    (hint : (intrinsicInterior ℝ (IZ (indexSet M)) ∩ intLattice d).Nonempty)
    (r : Fin d → ℝ) (hrZ : r ∈ intLattice d) (hrI : r ∈ recCone (indexSet M)) (hr0 : r ≠ 0) :
    (∃! u : Pt n, ∀ t : ℝ, 0 < t → ∀ z ∈ intLattice d ∩ indexSet M, ∀ x ∈ zProj M z,
        x + t • u ∈ closure (zProj M (z + t • r))) ∧
    ∀ u : Pt n, (∀ t : ℝ, 0 < t → ∀ z ∈ intLattice d ∩ indexSet M, ∀ x ∈ zProj M z,
        x + t • u ∈ closure (zProj M (z + t • r))) → u = 0 →
      ∀ z ∈ intLattice d ∩ indexSet M,
        Convex ℝ (⋃ z' ∈ {w | ∃ t : ℝ, 0 ≤ t ∧ w = z + t • r}, zProj M z') ∧
        Metric.ediam (⋃ z' ∈ {w | ∃ t : ℝ, 0 ≤ t ∧ w = z + t • r}, zProj M z') ≤ micpDiam M ∧
        (⋃ z' ∈ {w | ∃ t : ℝ, 0 ≤ t ∧ w = z + t • r} ∩ intLattice d, zProj M z') ⊆
          (⋃ z' ∈ {w | ∃ t : ℝ, 0 ≤ t ∧ w = z + t • r}, zProj M z') ∧
        (⋃ z' ∈ {w | ∃ t : ℝ, 0 ≤ t ∧ w = z + t • r}, zProj M z') ⊆
          ⋃ z' ∈ {w | ∃ t : ℝ, 0 ≤ t ∧ w = z + t • r} ∩ intLattice d,
            closure (zProj M z') := by sorry

end MICPRep.Periodic
Source
Lubin, Vielma, Zadik, Mixed-integer convex representability, arXiv:1706.05135v3, p. 30, Lemma 6.13 and (6.26)
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