Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 1, proof (converse, second step) — a 1/2-approximate solution has at least m/3 nonzeros

Proved
SparseApprox.Hardness.nnz_ge_third

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 3-element 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. 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 has at least m/3m/3m/3 nonzero entries:

m≤3 ∥x∥0.m\le 3\,\|x\|_0 .m≤3∥x∥0​.

This is the step "since each column of AAA has only three nonzero entries, xxx must have at least m/3m/3m/3 entries" of the proof of Theorem 1; combined with the sparsity assumption it shows that xxx has exactly m/3m/3m/3 nonzero entries.

Formalization Note "At least m/3m/3m/3" is written multiplicatively, m≤3∥x∥0m\le 3\|x\|_0m≤3∥x∥0​, to avoid natural-number division. The hypothesis that every cjc_jcj​ has exactly 333 elements is the paper's "3-element subsets".

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

theorem nnz_ge_third {m n : ℕ} (C : Fin n → Finset (Fin m))
    (hC : ∀ j, (C j).card = 3) (x : EuclideanSpace ℝ (Fin n))
    (hx : ‖Matrix.toEuclideanLin (incidence C) x - onesVec m‖ ≤ 1 / 2) :
    m ≤ 3 * nnz x := 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, second sentence ("Since each column of A has only three nonzero entries, x must have at least m/3 entries")
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