Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§8.5, p. 174 — L is good for z iff L ∩ C_z = {0}

Proved
MatousekLP.SparseRecovery.good_iff_kernel_inter_cone

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

convex-geometrylinear-programmingp2o-batch-b23bp2o-gran-per-chapterp2o-plan-bookp2o-v1sparse-recovery

Let AAA be a real m×nm\times nm×n matrix with kernel L={x:Ax=0}L=\{x: Ax=0\}L={x:Ax=0}, let r≥0r\ge 0r≥0, and let z∈Rnz\in\mathbb{R}^nz∈Rn be a boundary point of the crosspolytope B1n={x:∥x∥1≤1}B^n_1=\{x:\|x\|_1\le 1\}B1n​={x:∥x∥1​≤1}, i.e. ∥z∥1=1\|z\|_1=1∥z∥1​=1, with ∣supp⁡(z)∣≤r|\operatorname{supp}(z)|\le r∣supp(z)∣≤r. Let

Cz={t(x−z): t≥0, x∈B1n}.C_z=\{t(x-z):\ t\ge 0,\ x\in B^n_1\}.Cz​={t(x−z): t≥0, x∈B1n​}.

Say that LLL is good for zzz if (L+z)∩B1n={z}(L+z)\cap B^n_1=\{z\}(L+z)∩B1n​={z}. Then

(L+z)∩B1n={z}  ⟺  L∩Cz={0}.(L+z)\cap B^n_1=\{z\}\iff L\cap C_z=\{0\}.(L+z)∩B1n​={z}⟺L∩Cz​={0}.

Together with Lemma 8.5.4, this recasts BP-exactness as the condition that the kernel avoids the cones CzC_zCz​ at the sparse boundary points of the crosspolytope, which is the starting point of the probabilistic proofs of Theorem 8.5.2.

Formalization Note The hypotheses ∥z∥1=1\|z\|_1=1∥z∥1​=1 and ∣supp⁡(z)∣≤r|\operatorname{supp}(z)|\le r∣supp(z)∣≤r are the book's "for zzz as above"; LLL is the kernel of AAA, as in the book's setting of a random matrix AAA.

Preamble
import Mathlib
import Definitions.Def_MatousekLP_SparseRecovery_BasisPursuit
Formal statement
namespace MatousekLP.SparseRecovery

open Matrix

/-- **§8.5, p. 174** ("Intuition for BP-exactness"), Matoušek & Gärtner, *Understanding and
Using Linear Programming*, Springer 2007.  Let `z` be a boundary point of the crosspolytope
(`‖z‖₁ = 1`) with `|supp(z)| ≤ r`, and let `C_z = {t(x − z) : t ≥ 0, x ∈ B₁ⁿ}`.  Then "`L`
good for `z`" (`(L + z) ∩ B₁ⁿ = {z}`) "means exactly that `L ∩ C_z = {0}`", for `L` the
kernel of `A`. -/
theorem good_iff_kernel_inter_cone {m n : ℕ} (A : Matrix (Fin m) (Fin n) ℝ) (r : ℕ)
    (z : Fin n → ℝ) (hz : l1Norm z = 1) (hsupp : (supp z).card ≤ r) :
    IsGoodFor (kernel A) z ↔ kernel A ∩ coneAt z = {0} := by sorry

end MatousekLP.SparseRecovery
Source
Matoušek & Gärtner, Understanding and Using Linear Programming, Springer 2007, p. 174, §8.5 "Intuition for BP-exactness" ("Then L good for z means exactly that L ∩ C_z = {0}")
Human review
  • Endorsed by Shuze Chen · Oct 5, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 5, 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