Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(8) — |x − x₀| ≦ c|(Ax − b)⁺| in the max norm, with c = max_{v_S>0} a_S/v_S

Proved
HoffmanBound.ErrorBound.eq8

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

error-boundslinear-inequalitiesmatrix-gamesp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let the system Ax≤bAx\le bAx≤b be consistent and let ∣⋅∣|\cdot|∣⋅∣ be the max norm. For a nonempty set SSS of rows let aSa_SaS​ be the largest absolute value of the coordinates of the rows AiA_iAi​, i∈Si\in Si∈S (6), and let

vS=min⁡λmax⁡i∈S∑j∈Sgijλj,gij=Ai⋅Aj,v_S=\min_{\lambda}\max_{i\in S}\sum_{j\in S}g_{ij}\lambda_j,\qquad g_{ij}=A_i\cdot A_j,vS​=λmin​i∈Smax​j∈S∑​gij​λj​,gij​=Ai​⋅Aj​,

the minimum over λj≥0\lambda_j\ge 0λj​≥0 with ∑j∈Sλj=1\sum_{j\in S}\lambda_j=1∑j∈S​λj​=1: the value of the zero-sum two-person game with matrix (gij)i,j∈S(g_{ij})_{i,j\in S}(gij​)i,j∈S​ (7). Put

c=max⁡vS>0aSvS.c=\max_{v_S>0}\frac{a_S}{v_S}.c=vS​>0max​vS​aS​​.

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∣≤c ∣(Ax−b)+∣.|x-x_0|\le c\,\bigl|(Ax-b)^+\bigr|.∣x−x0​∣≤c​(Ax−b)+​.

This makes the constant of the main theorem explicit for Case II (Fn=Fm=∣⋅∣F_n=F_m=|\cdot|Fn​=Fm​=∣⋅∣) in terms of matrix games.

Formalization Note The maximum defining ccc ranges over the nonempty sets SSS of rows with vS>0v_S>0vS​>0; if there is none (every row of AAA is 000), ccc is taken to be 000, and then every xxx is a solution of the consistent system, so the bound holds with x0=xx_0=xx0​=x.

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, (8). If `Ax ≤ b` is consistent, every `x` has a solution `x₀` with
`|x - x₀| ≤ c |(Ax - b)⁺|` (max norms), where `c = max_{v_S > 0} a_S / v_S` over the nonempty sets
`S` of rows, `a_S` as in (6) and `v_S` the game value (7). -/
theorem eq8 {m n : ℕ} (A : Matrix (Fin m) (Fin n) ℝ) (b : Fin m → ℝ)
    (hcons : (solutionSet A b).Nonempty) :
    ∀ x : Fin n → ℝ, ∃ x₀ ∈ solutionSet A b,
      maxNorm (x - x₀) ≤ constC8 A * maxNorm (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), pp. 264–265 (PDF pp. 2–3), §4, (6), (7), (8)
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