Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 6.5.1 — a finitely generated cone has a point nearest to b

Proved
MatousekLP.Duality.exists_nearest_point_cone

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

conesconvex-geometryp2o-batch-b23bp2o-gran-per-chapterp2o-plan-bookp2o-v1

Let C⊆RmC\subseteq\mathbb{R}^mC⊆Rm be the convex cone generated by finitely many vectors a1,…,ana_1,\dots,a_na1​,…,an​, and let b∈Rmb\in\mathbb{R}^mb∈Rm be a point with b∉Cb\notin Cb∈/C. Then there is a point z∈Cz\in Cz∈C nearest to bbb in the Euclidean distance:

∥z−b∥≤∥x−b∥for all x∈C.\|z-b\|\le\|x-b\| \qquad\text{for all } x\in C.∥z−b∥≤∥x−b∥for all x∈C.

The nearest point zzz is used to build the separating vector y=z−by=z-by=z−b in the analytic proof of the geometric Farkas lemma (Proposition 6.4.2). The existence of zzz is not automatic, since a nearest point need not exist in a set that is not closed.

Formalization Note Rm\mathbb{R}^mRm is EuclideanSpace ℝ (Fin m), whose norm is the Euclidean norm.

Preamble
import Mathlib
import Definitions.Def_MatousekLP_Duality_Cones
Formal statement
namespace MatousekLP.Duality

/-- Matoušek & Gärtner, Lemma 6.5.1 (p. 95): if `C` is the convex cone in `ℝ^m` generated by
finitely many vectors `a₁, …, aₙ` and `b ∉ C`, then some `z ∈ C` is nearest to `b` in the
Euclidean distance: `‖z - b‖ ≤ ‖x - b‖` for all `x ∈ C`. -/
theorem exists_nearest_point_cone {m n : ℕ} (a : Fin n → EuclideanSpace ℝ (Fin m))
    (b : EuclideanSpace ℝ (Fin m)) (hb : b ∉ coneGen a) :
    ∃ z ∈ coneGen a, ∀ x ∈ coneGen a, ‖z - b‖ ≤ ‖x - b‖ := by sorry

end MatousekLP.Duality
Source
Matoušek & Gärtner, Understanding and Using Linear Programming, Springer 2007, p. 95, Lemma 6.5.1
Human review
  • Endorsed by Shuze Chen · Oct 5, 2026

    Confirmed by the moderator at approval.

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