Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§8.5, p. 170 — basis pursuit (BP) is the linear program (BP′)

Proved
MatousekLP.SparseRecovery.bp_iff_bp_prime

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

basis-pursuitlinear-programmingp2o-batch-b23bp2o-gran-per-chapterp2o-plan-bookp2o-v1sparse-recovery

Let AAA be a real m×nm\times nm×n matrix and b∈Rmb\in\mathbb{R}^mb∈Rm. Consider basis pursuit

(BP)min⁡ ∥x∥1  s.t. Ax=b,(BP′)min⁡ u1+⋯+un  s.t. Ax=b, −u≤x≤u, u≥0.\text{(BP)}\quad\min\ \|x\|_1\ \text{ s.t. } Ax=b,\qquad\qquad \text{(BP}'\text{)}\quad\min\ u_1+\dots+u_n\ \text{ s.t. } Ax=b,\ -u\le x\le u,\ u\ge 0 .(BP)min ∥x∥1​  s.t. Ax=b,(BP′)min u1​+⋯+un​  s.t. Ax=b, −u≤x≤u, u≥0.

Then:

  1. in every optimal solution (x,u)(x,u)(x,u) of (BP′), ui=∣xi∣u_i=|x_i|ui​=∣xi​∣ for every iii;
  2. xxx is an optimal solution of (BP) if and only if (x,∣x∣)(x,|x|)(x,∣x∣) is an optimal solution of (BP′), where ∣x∣=(∣x1∣,…,∣xn∣)|x|=(|x_1|,\dots,|x_n|)∣x∣=(∣x1​∣,…,∣xn​∣).

This is what makes basis pursuit solvable by linear programming.

Formalization Note The book's sentence ("in an optimal solution of (BP′) we have ui=∣xi∣u_i=|x_i|ui​=∣xi​∣ for every iii") is part 1; the equivalence of the two problems that the book draws from it is formalized as part 2. Optimality is stated against every feasible point.

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

open Matrix

/-- **Equivalence of (BP) and (BP′)**, §8.5, p. 170, Matoušek & Gärtner, *Understanding and
Using Linear Programming*, Springer 2007: "in an optimal solution of (BP′) we have `uᵢ = |xᵢ|`
for every `i`".  Formalized as: (1) every optimal solution `(x, u)` of (BP′) has `uᵢ = |xᵢ|`
for all `i`; (2) `x` is an optimal solution of (BP) if and only if `(x, |x|)` is an optimal
solution of (BP′), where `|x|` is the componentwise absolute value. -/
theorem bp_iff_bp_prime {m n : ℕ} (A : Matrix (Fin m) (Fin n) ℝ) (b : Fin m → ℝ) :
    (∀ x u : Fin n → ℝ, IsBPPrimeOptimal A b x u → ∀ i, u i = |x i|) ∧
      (∀ x : Fin n → ℝ, IsBPOptimal A b x ↔ IsBPPrimeOptimal A b x (fun i => |x i|)) := by sorry

end MatousekLP.SparseRecovery
Source
Matoušek & Gärtner, Understanding and Using Linear Programming, Springer 2007, p. 170, §8.5 (equivalence of (BP) and (BP′), unnumbered)
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