Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§8.5, p. 169 — condition (ii) of Observation 8.5.1 forces m ≥ 2r

Proved
MatousekLP.SparseRecovery.two_r_le_m

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

linear-algebralinear-programmingp2o-batch-b23bp2o-gran-per-chapterp2o-plan-bookp2o-v1sparse-recovery

Let AAA be a real m×nm\times nm×n matrix with m<nm<nm<n (the standing assumption of the sparse-solution problem in §8.5), and let r≥0r\ge 0r≥0 be an integer. Suppose every 2r2r2r or fewer columns of AAA are linearly independent (condition (ii) of Observation 8.5.1). Then

m ≥ 2r.m\ \ge\ 2r .m ≥ 2r.

Combined with Observation 8.5.1, this says that uniqueness of rrr-sparse solutions requires at least 2r2r2r equations.

Formalization Note Column jjj of AAA is Aᵀ j; the hypothesis m<nm<nm<n is the book's standing assumption on page 168 ("an m×nm\times nm×n matrix AAA with m<nm<nm<n"), without which the claim fails (e.g. m=n=1m=n=1m=n=1, A=(1)A=(1)A=(1), r=1r=1r=1).

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

open Matrix

/-- **§8.5, p. 169** (remark after Observation 8.5.1), Matoušek & Gärtner, *Understanding and
Using Linear Programming*, Springer 2007: "(ii) implies that, in particular, `m ≥ 2r`".
Condition (ii) of Observation 8.5.1 says that every `2r` or fewer columns of the `m × n` matrix
`A` are linearly independent.  The standing assumption `m < n` of §8.5 (p. 168, "an `m × n`
matrix `A` with `m < n`") is a hypothesis. -/
theorem two_r_le_m {m n : ℕ} (A : Matrix (Fin m) (Fin n) ℝ) (r : ℕ) (hmn : m < n)
    (hii : ∀ S : Finset (Fin n), S.card ≤ 2 * r →
      LinearIndependent ℝ (fun j : S => Aᵀ (j : Fin n))) :
    2 * r ≤ m := by sorry

end MatousekLP.SparseRecovery
Source
Matoušek & Gärtner, Understanding and Using Linear Programming, Springer 2007, p. 169, §8.5 (remark after Observation 8.5.1: "(ii) implies that, in particular, m ≥ 2r"); standing assumption m < n from the box on p. 168
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