Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma C.1, p. 24 — FEA(A,b,σ,1) = {x : UAx ≤ Ub + σ1}, U the matrix of all sign vectors

Proved
SparseLpLq.SmallP.lemma_c_1

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

l1-normp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1polyhedrasparse-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. Let U={u1,…,u2m}={−1,1}m\mathcal U=\{u_1,\dots,u_{2^m}\}=\{-1,1\}^mU={u1​,…,u2m​}={−1,1}m be the set of all sign vectors and U=[u1,…,u2m]⊤∈R2m×mU=[u_1,\dots,u_{2^m}]^\top\in\mathbb R^{2^m\times m}U=[u1​,…,u2m​]⊤∈R2m×m the matrix whose rows are these vectors, as in (C.1). Then the ℓ1\ell_1ℓ1​-feasible set is a polyhedron described by 2m2^m2m linear inequalities:

FEA(A,b,σ,1)={x∈Rn:∥Ax−b∥1≤σ}={x∈Rn:UAx≤Ub+σ1},\mathrm{FEA}(A,b,\sigma,1)=\{x\in\mathbb R^n : \|Ax-b\|_1\le\sigma\}=\{x\in\mathbb R^n : UAx\le Ub+\sigma\mathbf 1\},FEA(A,b,σ,1)={x∈Rn:∥Ax−b∥1​≤σ}={x∈Rn:UAx≤Ub+σ1},

where 1=(1,…,1)⊤∈R2m\mathbf 1=(1,\dots,1)^\top\in\mathbb R^{2^m}1=(1,…,1)⊤∈R2m. Row by row, the right-hand side is the set of xxx with u⊤Ax≤u⊤b+σu^\top Ax\le u^\top b+\sigmau⊤Ax≤u⊤b+σ for every u∈{−1,1}mu\in\{-1,1\}^mu∈{−1,1}m.

The lemma is what makes FEA(A,b,σ,1)\mathrm{FEA}(A,b,\sigma,1)FEA(A,b,σ,1) a convex polyhedron, so that its intersection with each orthant has finitely many extreme points; this finiteness underlies Proposition 2.1 and Theorem 2.2.

Formalization Note The rows of UUU are quantified directly as all vectors uuu with every entry equal to 111 or −1-1−1, instead of an enumerated 2m×m2^m\times m2m×m matrix.

Differences from the source:

  • generalization: σ > 0 → 0 ≤ σ; reason: the identity holds verbatim at σ = 0 (both sides are {x : Ax = b}), and the paper's blanket assumption and Theorem 2.2 allow σ = 0; every instance with σ > 0 is an instance of the Lean statement
  • encoding: the matrix U = [u₁, …, u_{2^m}]ᵀ and the vector inequality UAx ≤ Ub + σ1 → ∀ u with every uᵢ ∈ {1, −1}, u ⬝ᵥ (A x) ≤ u ⬝ᵥ b + σ; reason: the rows of U are exactly the sign vectors, and a vector inequality is the conjunction of its rows
Preamble
import Mathlib
import Definitions.Def_SparseLpLq_SmallP_Setting

open scoped ENNReal Matrix
Formal statement
namespace SparseLpLq.SmallP
theorem lemma_c_1 {m n : ℕ} (A : Matrix (Fin m) (Fin n) ℝ) (b : Fin m → ℝ) (σ : ℝ)
    (hσ : 0 ≤ σ) :
    FEA A b σ 1 =
      {x | ∀ u : Fin m → ℝ, (∀ i, u i = 1 ∨ u i = -1) → u ⬝ᵥ (A *ᵥ x) ≤ u ⬝ᵥ b + σ} := by sorry
end SparseLpLq.SmallP
Source
Yang, Chen & Xiang, Sparse solutions of a class of constrained optimization problems, arXiv:1907.00880v5, p. 24, Lemma C.1 and (C.1)
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