Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 2.2 — [NC_L] holds iff ‖x‖₀ ≤ s, ∇ᵢf(x) = 0 on the support and |∇ᵢf(x)| ≤ L·M_s(x) off it (2.5)

Proved
SparseNLO.IHT.lemma_2_2

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

optimality-conditionsp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1sparse-optimization

Let f:Rn→Rf:\mathbb R^n\to\mathbb Rf:Rn→R be continuously differentiable and bounded below (Assumption 1), and let 0<s<n0<s<n0<s<n. For any L>0L>0L>0, a vector x∗∈Rnx^*\in\mathbb R^nx∗∈Rn satisfies

[NCL]x∗∈PCs(x∗−1L∇f(x∗))[\mathrm{NC}_L]\qquad x^*\in P_{C_s}\Big(x^*-\tfrac1L\nabla f(x^*)\Big)[NCL​]x∗∈PCs​​(x∗−L1​∇f(x∗))

if and only if ∥x∗∥0≤s\|x^*\|_0\le s∥x∗∥0​≤s and

∣∇if(x∗)∣ {≤L Ms(x∗)if i∈I0(x∗),=0if i∈I1(x∗).(2.5)|\nabla_i f(x^*)|\ \begin{cases}\le L\,M_s(x^*) & \text{if } i\in I_0(x^*),\\ =0 & \text{if } i\in I_1(x^*).\end{cases}\tag{2.5}∣∇i​f(x∗)∣ {≤LMs​(x∗)=0​if i∈I0​(x∗),if i∈I1​(x∗).​(2.5)

Lemma 2.2 turns the projection condition [NCL][\mathrm{NC}_L][NCL​] into explicit coordinate-wise inequalities. It shows that LLL-stationarity becomes weaker as LLL grows, and it is the form in which the limit argument of Theorem 3.1 verifies LLL-stationarity.

Formalization Note [NCL][\mathrm{NC}_L][NCL​] is the bare membership in the projection set PCsP_{C_s}PCs​​ (the set of all nearest points). Assumption 1 is the paper's standing assumption and is kept although the equivalence does not use it. Indices run over Fin n.

Preamble
import Mathlib
import Definitions.Def_SparseNLO_IHT_Setting

open Filter Topology
Formal statement
namespace SparseNLO.IHT

/-- Lemma 2.2 (p. 7). For any `L > 0`, `x` satisfies `[NC_L]`, i.e.
`x ∈ P_{C_s}(x − (1/L) ∇f(x))`, if and only if `‖x‖₀ ≤ s` and (2.5):
`|∇_i f(x)| ≤ L · M_s(x)` for `i ∈ I₀(x)` and `∇_i f(x) = 0` for `i ∈ I₁(x)`. -/
theorem lemma_2_2 {n s : ℕ} (hs : 0 < s) (hsn : s < n)
    (f : EuclideanSpace ℝ (Fin n) → ℝ) (hf : ContDiff ℝ 1 f) (hbdd : ∃ γ : ℝ, ∀ x, γ ≤ f x)
    (L : ℝ) (hL : 0 < L) (x : EuclideanSpace ℝ (Fin n)) :
    x ∈ projCs n s (x - (1 / L) • gradient f x) ↔
      (SparseNLO.CWOpt.l0 x ≤ s ∧
        (∀ i ∈ SparseNLO.CWOpt.I0 x, |gradient f x i| ≤ L * SparseNLO.CWOpt.Ms s x) ∧
        (∀ i ∈ SparseNLO.CWOpt.I1 x, gradient f x i = 0)) := 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. 7, Lemma 2.2, (2.5)
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