Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 6.6, p. 25 — a rational affine change of the integer variables keeps a rational MICP formulation and does not increase D_MICP

Proved
MICPRep.Periodic.lemma_6_6

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 S⊆RnS \subseteq \mathbb R^nS⊆Rn with index set III and zzz-projected sets {Az}\{A_z\}{Az​}. Let R:Rd→RdR : \mathbb R^d \to \mathbb R^dR:Rd→Rd be an invertible rational affine map with R−1(Zd)⊆ZdR^{-1}(\mathbb Z^d) \subseteq \mathbb Z^dR−1(Zd)⊆Zd, and

M′={(x,y,z):(x,y,R−1(z))∈M}.M' = \{(x, y, z) : (x, y, R^{-1}(z)) \in M\}.M′={(x,y,z):(x,y,R−1(z))∈M}.

Then M′M'M′ is closed and convex, (M′,d)(M', d)(M′,d) induces a rational MICP formulation of

S′=⋃z′∈R(I)∩ZdAR−1(z′)S' = \bigcup_{z' \in R(I) \cap \mathbb Z^d} A_{R^{-1}(z')}S′=z′∈R(I)∩Zd⋃​AR−1(z′)​

with index set I′=R(I)I' = R(I)I′=R(I), and DMICP(M′)≤DMICP(M)D_{\mathrm{MICP}}(M') \le D_{\mathrm{MICP}}(M)DMICP​(M′)≤DMICP​(M). If in addition R(Zd)=R−1(Zd)=ZdR(\mathbb Z^d) = R^{-1}(\mathbb Z^d) = \mathbb Z^dR(Zd)=R−1(Zd)=Zd, then S′=SS' = SS′=S and DMICP(M)=DMICP(M′)D_{\mathrm{MICP}}(M) = D_{\mathrm{MICP}}(M')DMICP​(M)=DMICP​(M′).

The lemma lets the proof rearrange the index set by unimodular and slicing maps without loss of generality.

Formalization Note R=R = R= ratAff A b with AAA invertible and R−1=R^{-1} = R−1= ratAffInv A b; R−1(Zd)R^{-1}(\mathbb Z^d)R−1(Zd) is written as the preimage of Zd\mathbb Z^dZd under RRR.

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

open scoped ENNReal Matrix

/-- Lemma 6.6, p. 25. -/
theorem lemma_6_6 {n p d : ℕ} (M : Set (Ambient n p d)) (S : Set (Pt n))
    (hM : IsRationalFormulation M S) (A : Matrix (Fin d) (Fin d) ℚ) (b : Fin d → ℚ)
    (hA : IsUnit A) (hpre : ratAff A b ⁻¹' intLattice d ⊆ intLattice d) :
    let M' : Set (Ambient n p d) := {q | (q.1, q.2.1, ratAffInv A b q.2.2) ∈ M}
    let S' : Set (Pt n) :=
      ⋃ z' ∈ ratAff A b '' indexSet M ∩ intLattice d, zProj M (ratAffInv A b z')
    IsRationalFormulation M' S' ∧ indexSet M' = ratAff A b '' indexSet M ∧
      micpDiam M' ≤ micpDiam M ∧
      (ratAff A b '' intLattice d = intLattice d →
        ratAff A b ⁻¹' intLattice d = intLattice d →
        S' = S ∧ micpDiam M = micpDiam M') := by sorry

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