Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 2 — the nearest solution is also the nearest point of the intersection of the active half spaces

Proved
HoffmanBound.ErrorBound.lemma2

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

linear-inequalitiesnearest-pointp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let Ω={x∈Rn:Ax≤b}\Omega=\{x\in\mathbb R^n : Ax\le b\}Ω={x∈Rn:Ax≤b} be the solution set of the system (1), let x∉Ωx\notin\Omegax∈/Ω, and let yyy be a point of Ω\OmegaΩ nearest to xxx in the Euclidean distance. Let

S={i:Ai⋅y=bi},ΩS={z∈Rn:Ai⋅z≤bi for all i∈S}S=\{i : A_i\cdot y=b_i\},\qquad \Omega_S=\{z\in\mathbb R^n : A_i\cdot z\le b_i\ \text{for all } i\in S\}S={i:Ai​⋅y=bi​},ΩS​={z∈Rn:Ai​⋅z≤bi​ for all i∈S}

be the half spaces of (1) whose bounding hyperplanes contain yyy and their intersection. Then x∉ΩSx\notin\Omega_Sx∈/ΩS​, and yyy is a point of ΩS\Omega_SΩS​ nearest to xxx.

This lemma reduces the error bound to the finitely many sets of active constraints, which is where the uniform constant of the main theorem comes from.

Formalization Note The paper says "the point nearest"; the Euclidean nearest point of a nonempty closed convex set is unique, so the hypothesis is stated as "yyy is a nearest point" and the conclusion as "yyy is a nearest point of ΩS\Omega_SΩS​". If S=∅S=\emptysetS=∅, then ΩS=Rn\Omega_S=\mathbb R^nΩS​=Rn.

Preamble
import Mathlib
import Definitions.Def_HoffmanBound_ErrorBound_Model
Formal statement
namespace HoffmanBound.ErrorBound

open Matrix

/-- Hoffman 1952, p. 263, Lemma 2. Let `Ω` be the solution set of `Ax ≤ b`, `x ∉ Ω`, and `y` a
point of `Ω` nearest to `x` (Euclidean). Let `S` be the set of half spaces whose bounding
hyperplane contains `y` and `Ω_S` their intersection. Then `x ∉ Ω_S` and `y` is a nearest point
of `Ω_S` to `x`. -/
theorem lemma2 {m n : ℕ} (A : Matrix (Fin m) (Fin n) ℝ) (b : Fin m → ℝ) (x y : Fin n → ℝ)
    (hx : x ∉ solutionSet A b) (hy : IsNearest (solutionSet A b) x y) :
    x ∉ {z : Fin n → ℝ | ∀ i ∈ activeSet A b y, (A *ᵥ z) i ≤ b i} ∧
      IsNearest {z : Fin n → ℝ | ∀ i ∈ activeSet A b y, (A *ᵥ z) i ≤ b i} x y := by sorry

end HoffmanBound.ErrorBound
Source
Hoffman, On Approximate Solutions of Systems of Linear Inequalities, J. Res. Nat. Bur. Standards 49 (1952), p. 263 (PDF p. 1), Lemma 2
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