Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 5, pp. 4–5 — a feasible mixed-integer linear system has a solution of polynomial bit-size (MIP is in NP)

Disproved
MIQPInNP.SmallSol.proposition_5

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

computational-complexitymixed-integer-programmingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1polyhedraquadratic-programming

Let A∈Qm×nA\in\mathbb Q^{m\times n}A∈Qm×n, b∈Qmb\in\mathbb Q^mb∈Qm and p∈Np\in\mathbb Np∈N. There is a single polynomial ggg, fixed before nnn, ppp, mmm and the data, such that: if the mixed-integer linear system

Ax≤b,x∈Zp×Rn−pAx\le b,\qquad x\in\mathbb Z^p\times\mathbb R^{n-p}Ax≤b,x∈Zp×Rn−p

has a real solution, then it has a rational solution x^\hat xx^ with size⁡(x^)≤g(size⁡[A b])\operatorname{size}(\hat x)\le g(\operatorname{size}[A\ b])size(x^)≤g(size[A b]).

The paper states this as "the decision version of MIP is in NP" and justifies it by presenting a vertex of one of the polytopes PiP_iPi​ of Proposition 4 as a certificate. The proof of Theorem 1 (Case 1, p. 7) uses exactly this: a point of the mixed-integer linear set of small complexity.

Formalization Note If p>np>np>n, all coordinates are required to be integers. The polynomial is quantified before all dimensions and data.

Differences from the source:

  • reading: "the decision version of MIP is in NP" → every feasible mixed-integer linear system has a rational solution of bit-size at most g(size⁡[A b])g(\operatorname{size}[A\ b])g(size[A b]); reason: Mathlib has no class NP; this is the certificate the paper presents on p. 5, and checking it is routine.
  • encoding: "polynomial", "complexity" → Polynomial ℕ evaluated at Schrijver's bit-size; reason: polynomially equivalent to any standard encoding.
Preamble
import Mathlib
import Definitions.Def_MIQPInNP_SmallSol_Setting
Formal statement
namespace MIQPInNP.SmallSol

/-- Proposition 5, pp. 4–5 (certificate form, p. 5) (Del Pia, Dey & Molinaro, arXiv:1407.4798v1). -/
theorem proposition_5 :
    ∃ g : Polynomial ℕ, ∀ (n p m : ℕ) (A : Matrix (Fin m) (Fin n) ℚ) (b : Fin m → ℚ),
      (∃ x ∈ polyhedron A b, IsMixedInt p x) →
      ∃ xh : Fin n → ℚ, toReal xh ∈ polyhedron A b ∧ IsMixedInt p (toReal xh) ∧
        vecSize xh ≤ g.eval (matSize A + vecSize b) := by sorry

end MIQPInNP.SmallSol
Source
Del Pia, Dey & Molinaro, Mixed-integer quadratic programming is in NP, arXiv:1407.4798v1, pp. 4–5, Proposition 5 and its justification
Human review
  • Endorsed by Shuze Chen · Oct 24, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 24, 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