Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 5 — projection distance for independent small hyperplanes

Proved
KarpPapadimitriou.Generator.lemma_5

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

ellipsoid-methodp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1polyhedral-geometry

Let H0,…,Hj+1H_0,\ldots,H_{j+1}H0​,…,Hj+1​ be affinely independent small hyperplanes, let rrr lie on H0,…,HjH_0,\ldots,H_jH0​,…,Hj​, and put δ=dist⁡(r,Hj+1)\delta=\operatorname{dist}(r,H_{j+1})δ=dist(r,Hj+1​). For the paper's parameter ttt,

dist⁡(r,⋂i=0j+1Hi)≤(2t−1)δ.\operatorname{dist}\Bigl(r,\bigcap_{i=0}^{j+1}H_i\Bigr)\le(2^t-1)\delta.dist(r,i=0⋂j+1​Hi​)≤(2t−1)δ.

This bounds the movement caused by adding one independent equality to the current flat.

Formalization Note All distances use the Euclidean metric on real space. The report's proof shifts between indices 0,…,j+10,\ldots,j+10,…,j+1 and 1,…,j1,\ldots,j1,…,j; the theorem follows its stated indices.

Preamble
import Mathlib
import Definitions.Def_KarpPapadimitriou_Generator_Hyperplanes
Formal statement
namespace KarpPapadimitriou.Generator

/-- Lemma 5: projecting onto one additional independent small hyperplane increases the
distance by at most the displayed factor. -/
theorem lemma_5 (n P j : ℕ) (c : Fin n → ℤ) (k : ℤ)
    (H : Fin (j + 2) → (Fin n → ℤ) × ℤ)
    (r : EuclideanSpace ℝ (Fin n))
    (hsmall : ∀ i, SmallHyperplane P (H i).1 (H i).2)
    (hind : IndependentNormals H)
    (hr : ∀ i : Fin (j + 2), i.val ≤ j → r ∈ hyperplane (H i).1 (H i).2) :
    Metric.infDist r (flat H) ≤
      ((2 : ℝ) ^ tParam n P c k - 1) *
        hyperplaneDistance (H ⟨j + 1, by omega⟩).1 (H ⟨j + 1, by omega⟩).2 r := by sorry

end KarpPapadimitriou.Generator
Source
Karp & Papadimitriou, On linear characterizations of combinatorial optimization problems, MIT/LCS/TM-154 (Feb. 1980), p. 13, Lemma 5
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

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