Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 2.2, p. 8 — for small p > 0 the Lp-L1 solution set lies in the L0-L1 solution set and is constant on (0, p̄]

Proved
SparseLpLq.SmallP.theorem_2_2

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

cardinality-minimizationlp-minimizationnonconvex-optimizationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1sparse-optimization

Let A∈Rm×nA\in\mathbb R^{m\times n}A∈Rm×n, b∈Rmb\in\mathbb R^mb∈Rm and σ≥0\sigma\ge 0σ≥0 satisfy the paper's blanket assumptions for q=1q=1q=1: the feasible set FEA(A,b,σ,1)={x:∥Ax−b∥1≤σ}\mathrm{FEA}(A,b,\sigma,1)=\{x : \|Ax-b\|_1\le\sigma\}FEA(A,b,σ,1)={x:∥Ax−b∥1​≤σ} is nonempty and ∥b∥1>σ\|b\|_1>\sigma∥b∥1​>σ. For 0≤p≤10\le p\le 10≤p≤1 let SOL(A,b,σ,p,1)\mathrm{SOL}(A,b,\sigma,p,1)SOL(A,b,σ,p,1) be the set of optimal solutions of

min⁡x∈Rn ∥x∥pps.t.∥Ax−b∥1≤σ,(1.4)\min_{x\in\mathbb R^n}\ \|x\|_p^p\quad\text{s.t.}\quad \|Ax-b\|_1\le\sigma, \tag{1.4}x∈Rnmin​ ∥x∥pp​s.t.∥Ax−b∥1​≤σ,(1.4)

where ∥x∥pp=∑i∣xi∣p\|x\|_p^p=\sum_i|x_i|^p∥x∥pp​=∑i​∣xi​∣p for p>0p>0p>0 and ∥x∥0\|x\|_0∥x∥0​ is the number of nonzero entries. Then:

  1. there exists p∗∈(0,1]p^*\in(0,1]p∗∈(0,1] such that
SOL(A,b,σ,p,1)⊆SOL(A,b,σ,0,1)for every p∈(0,p∗);\mathrm{SOL}(A,b,\sigma,p,1)\subseteq\mathrm{SOL}(A,b,\sigma,0,1)\quad\text{for every } p\in(0,p^*);SOL(A,b,σ,p,1)⊆SOL(A,b,σ,0,1)for every p∈(0,p∗);
  1. moreover, for this p∗p^*p∗ there exists pˉ∈(0,p∗)\bar p\in(0,p^*)pˉ​∈(0,p∗) such that
SOL(A,b,σ,p,1)=SOL(A,b,σ,pˉ,1)for every p∈(0,pˉ].\mathrm{SOL}(A,b,\sigma,p,1)=\mathrm{SOL}(A,b,\sigma,\bar p,1)\quad\text{for every } p\in(0,\bar p].SOL(A,b,σ,p,1)=SOL(A,b,σ,pˉ​,1)for every p∈(0,pˉ​].

No condition on AAA (such as a restricted isometry or null space property) is assumed. The first clause says that solving the nonconvex ℓp\ell_pℓp​ problem with any sufficiently small p>0p>0p>0 yields a sparsest feasible point; the second says that the solution set stops changing once ppp is small enough.

Differences from the source: none.

Preamble
import Mathlib
import Definitions.Def_SparseLpLq_SmallP_Setting

open scoped ENNReal Matrix
Formal statement
namespace SparseLpLq.SmallP
theorem theorem_2_2 {m n : ℕ} (A : Matrix (Fin m) (Fin n) ℝ) (b : Fin m → ℝ) (σ : ℝ)
    (hσ : 0 ≤ σ) (hfeas : (FEA A b σ 1).Nonempty) (hb : σ < qNorm 1 b) :
    ∃ pstar ∈ Set.Ioc (0 : ℝ) 1,
      (∀ p ∈ Set.Ioo 0 pstar, SOL A b σ p 1 ⊆ SOL A b σ 0 1) ∧
        ∃ pbar ∈ Set.Ioo 0 pstar, ∀ p ∈ Set.Ioc 0 pbar, SOL A b σ p 1 = SOL A b σ pbar 1 := by sorry
end SparseLpLq.SmallP
Source
Yang, Chen & Xiang, Sparse solutions of a class of constrained optimization problems, arXiv:1907.00880v5, p. 8, Theorem 2.2; proof pp. 8–9
Human review
  • Endorsed by Shuze Chen · Oct 24, 2026

    Confirmed by the moderator at approval.

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