Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 1, proof (converse, conclusion) — the sets c_j with x_j ≠ 0 form an exact cover

Proved
SparseApprox.Hardness.support_isExactCover

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. Suppose x∈Rnx\in\mathbb R^nx∈Rn satisfies

∥Ax−b∥2≤12and3 ∥x∥0≤m.\|Ax-b\|_2\le\tfrac12\qquad\text{and}\qquad 3\,\|x\|_0\le m .∥Ax−b∥2​≤21​and3∥x∥0​≤m.

Then the sub-collection C^={cj:xj≠0}\hat C=\{c_j : x_j\neq 0\}C^={cj​:xj​=0} is an exact cover of SSS: every element of SSS lies in exactly one set cjc_jcj​ with xj≠0x_j\neq0xj​=0.

This is the conclusion of the converse direction of the proof of Theorem 1: a sparse approximate solution of the constructed SAS instance yields an exact cover.

Formalization Note "At most m/3m/3m/3 nonzero entries" is written 3∥x∥0≤m3\|x\|_0\le m3∥x∥0​≤m, avoiding natural-number division. C^\hat CC^ is given by its index set {j:xj≠0}\{j : x_j\neq0\}{j:xj​=0}, so repeated sets in CCC are distinct indices.

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

theorem support_isExactCover {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)
    (hsparse : 3 * nnz x ≤ m) :
    IsExactCover C (Finset.univ.filter (fun j => x j ≠ 0)) := 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, last two sentences ("Now consider the subcollection Ĉ … It is clear that Ĉ is an exact cover for S")
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