Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 6, p. 5 — normalizing hyperplane of small complexity for a pointed cone

Proved
MIQPInNP.SmallSol.lemma_6

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 C=cone⁡{r1,…,rs}⊆RnC = \operatorname{cone}\{r^1,\dots,r^s\}\subseteq\mathbb R^nC=cone{r1,…,rs}⊆Rn be a pointed cone generated by rational vectors r1,…,rsr^1,\dots,r^sr1,…,rs, s≥1s\ge1s≥1. There is a single polynomial ggg, fixed before nnn, sss and the generators, such that there is a hyperplane H={x:f⊤x=1}\mathcal H = \{x : f^\top x = 1\}H={x:f⊤x=1} with f∈Qnf\in\mathbb Q^nf∈Qn and

  1. size⁡(f)≤g(max⁡isize⁡(ri))\operatorname{size}(f)\le g\big(\max_{i}\operatorname{size}(r^i)\big)size(f)≤g(maxi​size(ri));
  2. for every x∈Cx\in Cx∈C with ∥x∥=1\|x\| = 1∥x∥=1 (Euclidean norm),
f⊤x ≥ 1R,R=max⁡i∈{1,…,s}∥ri∥;f^\top x \ \ge\ \frac1R,\qquad R = \max_{i\in\{1,\dots,s\}}\|r^i\|;f⊤x ≥ R1​,R=i∈{1,…,s}max​∥ri∥;
  1. C∩HC\cap\mathcal HC∩H is bounded.

Such a hyperplane meets every ray of CCC exactly once, and it is used to compactify cones in Lemma 7 and in the proof of Theorem 1.

Formalization Note If all rir^iri are zero then R=0R=0R=0, C={0}C=\{0\}C={0} and item 2 is vacuous.

Differences from the source:

  • encoding: the generators r1,…,rsr^1,\dots,r^sr1,…,rs and the maximum over iii → s≥1s\ge 1s≥1 rational generators; reason: the index range and the maximum presuppose s≥1s\ge1s≥1, and complexity is defined for rational data only.
  • encoding: "polynomially bounded", ∥⋅∥\|\cdot\|∥⋅∥ → Polynomial ℕ quantified before the data, Schrijver's bit-size, Euclidean norm; reason: Lean conventions for the paper's notions.
Preamble
import Mathlib
import Definitions.Def_MIQPInNP_SmallSol_Setting
Formal statement
namespace MIQPInNP.SmallSol

/-- Lemma 6 (normalizing hyperplane), p. 5 (Del Pia, Dey & Molinaro, arXiv:1407.4798v1). -/
theorem lemma_6 :
    ∃ g : Polynomial ℕ, ∀ (n s : ℕ) (r : Fin s → Fin n → ℚ) (hs : 0 < s),
      IsPointedCone (cone (Set.range fun i => toReal (r i))) →
      ∃ f : Fin n → ℚ,
        vecSize f ≤ g.eval (Finset.univ.sup fun i => vecSize (r i)) ∧
        (∀ x ∈ cone (Set.range fun i => toReal (r i)), euclidNorm x = 1 →
          1 / (Finset.univ.sup' ⟨⟨0, hs⟩, Finset.mem_univ _⟩
                fun i => euclidNorm (toReal (r i))) ≤ ∑ j, (f j : ℝ) * x j) ∧
        Bornology.IsBounded (cone (Set.range fun i => toReal (r i)) ∩ hyperplane f) := by sorry

end MIQPInNP.SmallSol
Source
Del Pia, Dey & Molinaro, Mixed-integer quadratic programming is in NP, arXiv:1407.4798v1, p. 5, Lemma 6
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