Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 2.6 (Local Descent Lemma) — f(x + d) ≤ f(x) + ∇f(x)ᵀd + (L₂(f)/2)‖d‖² for d with at most two nonzero components

Proved
SparseNLO.Partial.lemma_2_6

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

descent-lemmap2o-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), with L(f)L(f)L(f)-Lipschitz gradient (Assumption 2), and let L2L_2L2​ be a constant satisfying the local Lipschitz condition (2.15): for all i≠ji\neq ji=j, all xxx and all ddd supported in {i,j}\{i,j\}{i,j}, ∥∇i,jf(x)−∇i,jf(x+d)∥≤L2∥d∥\|\nabla_{i,j}f(x)-\nabla_{i,j}f(x+d)\|\le L_2\|d\|∥∇i,j​f(x)−∇i,j​f(x+d)∥≤L2​∥d∥.

Then for all indices i≠ji\neq ji=j, every x∈Rnx\in\mathbb R^nx∈Rn and every d∈Rnd\in\mathbb R^nd∈Rn whose nonzero components lie in {i,j}\{i,j\}{i,j},

f(x+d)≤f(x)+∇f(x)Td+L22∥d∥2.f(x+d)\le f(x)+\nabla f(x)^Td+\frac{L_2}{2}\|d\|^2 .f(x+d)≤f(x)+∇f(x)Td+2L2​​∥d∥2.

This is the local version of the classical descent lemma: along directions with at most two nonzero entries the quadratic upper bound holds with the local constant L2(f)L_2(f)L2​(f), which may be much smaller than the global Lipschitz constant L(f)L(f)L(f). It is the tool behind every decrease estimate of Lemma 4.1.

Formalization Note "Any vector ddd with at most two nonzero components" is formalized as "ddd supported in some {i,j}\{i,j\}{i,j} with i≠ji\neq ji=j"; for n≥2n\ge2n≥2 every vector with at most two nonzero components is of this form. L2L_2L2​ is any constant satisfying (2.15), in particular the paper's L2(f)L_2(f)L2​(f). Assumption 2 (with some constant LfL_fLf​) and Assumption 1 are kept as on the page, although (2.15) is the hypothesis the inequality rests on.

Preamble
import Mathlib
import Definitions.Def_SparseNLO_Partial_Setting

open scoped RealInnerProductSpace
Formal statement
namespace SparseNLO.Partial

/-- Lemma 2.6 (Local Descent Lemma, p. 12): under Assumption 2, with `L2` a constant satisfying
(2.15), `f(x + d) ≤ f(x) + ∇f(x)ᵀd + (L2/2)‖d‖²` for every `d` with at most two nonzero
components, i.e. supported in some `{i, j}` with `i ≠ j`. -/
theorem lemma_2_6 {n : ℕ} (f : EuclideanSpace ℝ (Fin n) → ℝ) (hf : ContDiff ℝ 1 f)
    (hbdd : ∃ γ : ℝ, ∀ x, γ ≤ f x)
    (Lf : NNReal) (hLf : LipschitzWith Lf (gradient f))
    (L2 : ℝ) (hL2 : LocalLipschitz f L2)
    (i j : Fin n) (hij : i ≠ j) (x d : EuclideanSpace ℝ (Fin n))
    (hd : ∀ k : Fin n, k ≠ i → k ≠ j → d k = 0) :
    f (x + d) ≤ f x + ⟪gradient f x, d⟫ + L2 / 2 * ‖d‖ ^ 2 := 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. 12, Lemma 2.6 (with (2.15), p. 11)
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