Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(4.11)–(4.13), proof of Lemma 4.1 — f(xᵏ) − f(xᵏ⁺¹) ≥ M_s(xᵏ)[max_{I₀}|∇ᵢf(xᵏ)| − L₂M_s(xᵏ)] + xᵏ_{m_k}∇_{m_k}f(xᵏ)

Proved
SparseNLO.Partial.eq_4_13

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

coordinate-descentp2o-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, with Lipschitz gradient (Assumption 2), let 0<s<n0<s<n0<s<n, and let L2>0L_2>0L2​>0 satisfy the local Lipschitz condition (2.15). Let (xk)(x^k)(xk) be a sequence generated by the partial sparse-simplex method, let kkk satisfy ∥xk∥0=s\|x^k\|_0=s∥xk∥0​=s, and let ik1,Tk1,ik2,mk,Tk2i^1_k,T^1_k,i^2_k,m_k,T^2_kik1​,Tk1​,ik2​,mk​,Tk2​ be the selections with which the step from xkx^kxk to xk+1x^{k+1}xk+1 is made; in particular mkm_kmk​ minimizes ∣xik∣|x^k_i|∣xik​∣ over the support I1(xk)I_1(x^k)I1​(xk). Then

f(xk)−f(xk+1) ≥ Ms(xk)[max⁡i∈I0(xk)∣∇if(xk)∣−L2Ms(xk)]+xmkk∇mkf(xk).(4.13)f(x^k)-f(x^{k+1})\ \ge\ M_s(x^k)\Big[\max_{i\in I_0(x^k)}|\nabla_if(x^k)|-L_2M_s(x^k)\Big]+x^k_{m_k}\nabla_{m_k}f(x^k). \tag{4.13}f(xk)−f(xk+1) ≥ Ms​(xk)[i∈I0​(xk)max​∣∇i​f(xk)∣−L2​Ms​(xk)]+xmk​k​∇mk​​f(xk).(4.13)

This is the second half of the decrease estimate (4.7) for saturated iterates: it controls the partial derivatives off the support of xkx^kxk, which the swap move of the method targets.

Formalization Note The selections are explicit arguments, because the right-hand side depends on the chosen mkm_kmk​ when several support coordinates tie for the smallest absolute value. The maximum over I0(xk)I_0(x^k)I0​(xk) is a supremum in R≥0\mathbb R_{\ge0}R≥0​; I0(xk)I_0(x^k)I0​(xk) is nonempty because ∥xk∥0=s<n\|x^k\|_0=s<n∥xk∥0​=s<n. Assumptions 1 and 2 are kept as standing hypotheses.

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

/-- (4.11)–(4.13), proof of Lemma 4.1 (p. 31): under Assumption 2, with `L2 > 0` satisfying
(2.15), if `‖xᵏ‖₀ = s` and the step from `xᵏ` to `xᵏ⁺¹` is made with the selections
`i¹_k, T¹_k, i²_k, m_k, T²_k`, then
`f(xᵏ) − f(xᵏ⁺¹) ≥ M_s(xᵏ) [max_{i∈I₀(xᵏ)} |∇ᵢf(xᵏ)| − L2 M_s(xᵏ)] + xᵏ_{m_k} ∇_{m_k} f(xᵏ)`. -/
theorem eq_4_13 {n s : ℕ} (hs : 0 < s) (hsn : s < n)
    (f : EuclideanSpace ℝ (Fin n) → ℝ) (hf : ContDiff ℝ 1 f) (hbdd : ∃ γ : ℝ, ∀ x, γ ≤ f x)
    (Lf : NNReal) (hLf : LipschitzWith Lf (gradient f))
    (L2 : ℝ) (hL2pos : 0 < L2) (hL2 : LocalLipschitz f L2)
    (x : ℕ → EuclideanSpace ℝ (Fin n)) (hrun : IsPartialRun f s x)
    (k : ℕ) (hk : l0 (x k) = s)
    (i1 : Fin n) (T1 : ℝ) (i2 m : Fin n) (T2 : ℝ)
    (hstep : StepAt f (x k) (x (k + 1)) i1 T1 i2 m T2) :
    Ms s (x k) * (maxAbs (I0 (x k)) (gradient f (x k)) - L2 * Ms s (x k))
        + x k m * gradient f (x k) m ≤ f (x k) - f (x (k + 1)) := 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. 31, §4.2.3, proof of Lemma 4.1, (4.11)–(4.13)
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