Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 1, proof (converse, first step) — ‖Ax − b‖₂ ≤ 1/2 forces every entry of Ax into [1/2, 3/2]

Proved
SparseApprox.Hardness.entries_between_half_and_three_halves

by mikedeng1 · Sep 27, 2026 · Mathlib 0df444a (Lean v4.33.1)

exact-covernp-hardness-reductionp2o-batch-p200ap2o-gran-per-chapterp2o-plan-paperp2o-v1sparse-approximation

Let C=c1,…,cnC=c_1,\dots,c_nC=c1​,…,cn​ be a list of subsets of S={s1,…,sm}S=\{s_1,\dots,s_m\}S={s1​,…,sm​}, let A∈Rm×nA\in\mathbb R^{m\times n}A∈Rm×n be its incidence matrix and b=(1,…,1)∈Rmb=(1,\dots,1)\in\mathbb R^mb=(1,…,1)∈Rm. For every x∈Rnx\in\mathbb R^nx∈Rn with ∥Ax−b∥2≤1/2\|Ax-b\|_2\le 1/2∥Ax−b∥2​≤1/2 and every row iii,

12≤(Ax)i≤32.\tfrac12\le (Ax)_i\le\tfrac32 .21​≤(Ax)i​≤23​.

In particular every entry of AxAxAx is nonzero, so every element sis_isi​ lies in some set cjc_jcj​ with xj≠0x_j\neq0xj​=0. This is the first step of the converse direction in the proof of Theorem 1.

Formalization Note The statement holds for every xxx, with no sparsity assumption and no condition on the sizes of the sets; ∥⋅∥2\|\cdot\|_2∥⋅∥2​ is the Euclidean norm on EuclideanSpace ℝ (Fin m).

Preamble
import Mathlib
import Definitions.Def_SparseApprox_Hardness_Basic
Formal statement
namespace SparseApprox.Hardness

theorem entries_between_half_and_three_halves {m n : ℕ} (C : Fin n → Finset (Fin m))
    (x : EuclideanSpace ℝ (Fin n))
    (hx : ‖Matrix.toEuclideanLin (incidence C) x - onesVec m‖ ≤ 1 / 2) (i : Fin m) :
    1 / 2 ≤ Matrix.toEuclideanLin (incidence C) x i ∧
      Matrix.toEuclideanLin (incidence C) x i ≤ 3 / 2 := by sorry

end SparseApprox.Hardness
Source
Natarajan, Sparse Approximate Solutions to Linear Systems, SIAM J. Comput. 24 (1995), p. 228, proof of Theorem 1, last paragraph, first sentence ("Since ‖Ax − b‖₂ ≤ 1/2, each entry of Ax must be between 1/2 and 3/2")
Human review
  • Endorsed by Shuze Chen · Sep 27, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Sep 27, 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