Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(4.10), proof of Lemma 4.1 — a saturated step of the partial sparse-simplex method decreases f by at least (1/(2L₂)) max_{i∈I₁(xᵏ)} (∇ᵢf(xᵏ))²

Proved
SparseNLO.Partial.eq_4_10

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 (with the argmin selection of ik1i^1_kik1​).

For every kkk with ∥xk∥0=s\|x^k\|_0=s∥xk∥0​=s,

f(xk)−f(xk+1) ≥ 12L2max⁡i∈I1(xk)(∇if(xk))2.(4.10)f(x^k)-f(x^{k+1})\ \ge\ \frac{1}{2L_2}\max_{i\in I_1(x^k)}\big(\nabla_if(x^k)\big)^2. \tag{4.10}f(xk)−f(xk+1) ≥ 2L2​1​i∈I1​(xk)max​(∇i​f(xk))2.(4.10)

This is the first half of the decrease estimate (4.7) for saturated iterates: it controls the partial derivatives on the support of xkx^kxk.

Formalization Note The maximum over I1(xk)I_1(x^k)I1​(xk) is a supremum in R≥0\mathbb R_{\ge0}R≥0​ of ∣∇if(xk)∣2|\nabla_i f(x^k)|^2∣∇i​f(xk)∣2; I1(xk)I_1(x^k)I1​(xk) is nonempty because ∥xk∥0=s>0\|x^k\|_0=s>0∥xk∥0​=s>0. Assumptions 1 and 2 are kept as standing hypotheses.

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

/-- (4.10), proof of Lemma 4.1 (p. 31): under Assumption 2, with `L2 > 0` satisfying (2.15),
every step of the partial sparse-simplex method from an iterate with `‖xᵏ‖₀ = s` satisfies
`f(xᵏ) − f(xᵏ⁺¹) ≥ (1/(2 L2)) max_{i∈I₁(xᵏ)} (∇ᵢf(xᵏ))²`. -/
theorem eq_4_10 {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) :
    1 / (2 * L2) * maxSq (I1 (x k)) (gradient f (x k)) ≤ 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.10)
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