Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 2.1 — for f_LI(x) = ‖Ax − b‖² with A s-regular, problem (P) has finitely many BF points

Proved
SparseNLO.IHT.lemma_2_1

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

least-squaresoptimality-conditionsp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1sparse-optimization

Let 0<s<n0<s<n0<s<n, let A∈Rm×nA\in\mathbb R^{m\times n}A∈Rm×n be an sss-regular matrix (every sss of its columns are linearly independent) and let b∈Rmb\in\mathbb R^mb∈Rm. Take f=fLIf=f_{LI}f=fLI​,

fLI(x)=∥Ax−b∥2.f_{LI}(x)=\|Ax-b\|^2 .fLI​(x)=∥Ax−b∥2.

Then the set of basic feasible (BF) points of problem (P),

{x∈Cs: ∥x∥0<s⇒∇fLI(x)=0,  ∥x∥0=s⇒∇ifLI(x)=0 ∀i∈I1(x)},\{x\in C_s:\ \|x\|_0<s\Rightarrow\nabla f_{LI}(x)=0,\ \ \|x\|_0=s\Rightarrow\nabla_i f_{LI}(x)=0\ \forall i\in I_1(x)\},{x∈Cs​: ∥x∥0​<s⇒∇fLI​(x)=0,  ∥x∥0​=s⇒∇i​fLI​(x)=0 ∀i∈I1​(x)},

is finite.

Finiteness of the BF points is what lets the proof of Theorem 3.2 separate the candidate limits of the IHT method by a positive distance.

Formalization Note AxAxAx is Matrix.toEuclideanLin A x and ∥⋅∥\|\cdot\|∥⋅∥ is the Euclidean norm on EuclideanSpace ℝ (Fin m). Assumption 1 holds automatically for fLI≥0f_{LI}\ge0fLI​≥0 and is not stated.

Preamble
import Mathlib
import Definitions.Def_SparseNLO_IHT_Setting

open Filter Topology
Formal statement
namespace SparseNLO.IHT

/-- Lemma 2.1 (p. 6). Let `f = f_LI`, `f_LI(x) = ‖Ax − b‖²`, where `A ∈ ℝ^{m×n}` is `s`-regular and
`b ∈ ℝ^m`. Then the number of BF points of problem (P) is finite. -/
theorem lemma_2_1 {m n s : ℕ} (hs : 0 < s) (hsn : s < n)
    (A : Matrix (Fin m) (Fin n) ℝ) (b : EuclideanSpace ℝ (Fin m)) (hA : IsSRegular s A) :
    {x : EuclideanSpace ℝ (Fin n) | SparseNLO.CWOpt.IsBF (fLI A b) s x}.Finite := by sorry

end SparseNLO.IHT
Source
Beck, Eldar, Sparsity Constrained Nonlinear Optimization: Optimality Conditions and Algorithms, SIAM J. Optim. (2013), doi:10.1137/120869778 (source: arXiv:1203.4580v1), p. 6, Lemma 2.1
Human review
  • Endorsed by Shuze Chen · Oct 8, 2026

    Confirmed by the moderator at approval.

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