Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 2.2 — [NC_L] iff ‖x‖₀ ≤ s and the coordinate conditions (2.5)

Proved
SparseNLO.Partial.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, let 0<s<n0<s<n0<s<n, and let L>0L>0L>0. For every x∈Rnx\in\mathbb R^nx∈Rn, the condition [NCL][\mathrm{NC}_L][NCL​], x∈PCs(x−1L∇f(x))x\in P_{C_s}\big(x-\tfrac1L\nabla f(x)\big)x∈PCs​​(x−L1​∇f(x)), holds if and only if ∥x∥0≤s\|x\|_0\le s∥x∥0​≤s and

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

The lemma replaces the projection condition by explicit coordinate conditions. In this mission it turns the coordinate bounds reached at a limit point of the partial sparse-simplex method into L2(f)L_2(f)L2​(f)-stationarity.

Formalization Note PCs(y)P_{C_s}(y)PCs​​(y) is the set of nearest points of CsC_sCs​ to yyy. Assumption 1 is kept as the paper's standing hypothesis, though the statement does not need it.

Preamble
import Mathlib
import Definitions.Def_SparseNLO_Partial_Setting
Formal statement
namespace SparseNLO.Partial

/-- 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) ↔
      (l0 x ≤ s ∧
        (∀ i ∈ I0 x, |gradient f x i| ≤ L * Ms s x) ∧
        (∀ i ∈ I1 x, gradient f x i = 0)) := by sorry

end SparseNLO.Partial
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