Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(10) — if w = minᵢ(g_ii + Σ_{g_ij<0} g_ij) > 0, then |x − x₀| ≦ (a/w)||(Ax − b)⁺||

Proved
HoffmanBound.ErrorBound.eq10

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

error-boundslinear-inequalitiesp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let the system Ax≤bAx\le bAx≤b be consistent, let gij=Ai⋅Ajg_{ij}=A_i\cdot A_jgij​=Ai​⋅Aj​ be the Gram matrix of all the rows of AAA, and suppose

w=min⁡i(gii+∑j: gij<0gij)>0.w=\min_i\Bigl(g_{ii}+\sum_{j:\,g_{ij}<0}g_{ij}\Bigr)>0 .w=imin​(gii​+j:gij​<0∑​gij​)>0.

Let a=max⁡i,j∣aij∣a=\max_{i,j}|a_{ij}|a=maxi,j​∣aij​∣, let ∣⋅∣|\cdot|∣⋅∣ be the max norm and ∥⋅∥\|\cdot\|∥⋅∥ the sum norm (sum of the absolute values of the coordinates). Then for every x∈Rnx\in\mathbb R^nx∈Rn there is a solution x0x_0x0​ of Ax≤bAx\le bAx≤b with

∣x−x0∣≤aw ∥(Ax−b)+∥.|x-x_0|\le\frac{a}{w}\,\bigl\|(Ax-b)^+\bigr\|.∣x−x0​∣≤wa​​(Ax−b)+​.

This is the special case of Case III (Fn=∣⋅∣F_n=|\cdot|Fn​=∣⋅∣, Fm=∥⋅∥F_m=\|\cdot\|Fm​=∥⋅∥) singled out in Section 5.

Formalization Note The page prints the summation range in www as "j=1,…,nj=1,\dots,nj=1,…,n"; since ggg is an m×mm\times mm×m matrix indexed by rows, jjj is read as ranging over the mmm rows. The bound is in the language of the main theorem: some solution x0x_0x0​ satisfies it.

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

open Matrix

/-- Hoffman 1952, p. 265, (10). If `Ax ≤ b` is consistent and
`w = min_i (g_ii + ∑_{j : g_ij < 0} g_ij) > 0` for the Gram matrix `g_ij = A_i · A_j` of all rows,
then with `a = max_{i,j} |a_ij|` every `x` has a solution `x₀` with
`|x - x₀| ≤ (a / w) ‖(Ax - b)⁺‖` (max norm on the left, sum norm on the right). -/
theorem eq10 {m n : ℕ} (A : Matrix (Fin m) (Fin n) ℝ) (b : Fin m → ℝ)
    (hcons : (solutionSet A b).Nonempty) (hw : 0 < wConst A) :
    ∀ x : Fin n → ℝ, ∃ x₀ ∈ solutionSet A b,
      maxNorm (x - x₀) ≤ aMax A / wConst A * sumNorm (posPartVec (A *ᵥ x - b)) := by sorry

end HoffmanBound.ErrorBound
Source
Hoffman, On Approximate Solutions of Systems of Linear Inequalities, J. Res. Nat. Bur. Standards 49 (1952), p. 265 (PDF p. 3), §5, (10)
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