Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 1 — there is e > 0 with Fₘ(ȳ) ≦ e Fₘ(y) for every y and every subset S of the rows

Proved
HoffmanBound.ErrorBound.lemma1

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

compactnesslinear-inequalitiesp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let FmF_mFm​ be a positive homogeneous function on Rm\mathbb R^mRm in the sense of (3). Then there exists e>0e>0e>0 such that for every y=(y1,…,ym)y=(y_1,\dots,y_m)y=(y1​,…,ym​) and every subset SSS of the half spaces (rows) of (1),

Fm(yˉ)≤e Fm(y),yˉi={yiif i∈S,0otherwise.F_m(\bar y)\le e\,F_m(y),\qquad \bar y_i=\begin{cases}y_i & \text{if } i\in S,\\ 0 & \text{otherwise.}\end{cases}Fm​(yˉ​)≤eFm​(y),yˉ​i​={yi​0​if i∈S,otherwise.​

The constant eee is uniform in yyy and SSS. It lets the bound obtained on the active rows pass back to the full residual (Ax−b)+(Ax-b)^+(Ax−b)+; for the three norms of Section 3, e=1e=1e=1.

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

/-- Hoffman 1952, p. 263, Lemma 1. If `F_m` satisfies (3), there is `e > 0` such that for every
`y` and every subset `S` of the rows, `F_m(ȳ) ≤ e F_m(y)`, where `ȳ` keeps the coordinates of `y`
in `S` and replaces the others by `0`. -/
theorem lemma1 {m : ℕ} (Fm : (Fin m → ℝ) → ℝ) (hFm : IsPosHomogeneous Fm) :
    ∃ e : ℝ, 0 < e ∧ ∀ (y : Fin m → ℝ) (S : Finset (Fin m)), Fm (restrictVec S y) ≤ e * Fm 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 1
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