Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 4 (Convergence result), p. 5 — a bounded proximal sequence of a Łojasiewicz function has finite length and converges to a critical point

Proved
ProxLoj.Conv.theorem_4

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

convergencefinite-lengthlojasiewicz-inequalityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1proximal-algorithm

Throughout, f:Rn→R∪{+∞}f:\mathbb R^n\to\mathbb R\cup\{+\infty\}f:Rn→R∪{+∞} is proper and lower semicontinuous, ∂f\partial f∂f is the limiting subdifferential, crit⁡f={x:0∈∂f(x)}\operatorname{crit} f=\{x: 0\in\partial f(x)\}critf={x:0∈∂f(x)}, and (xk)k∈N(x^k)_{k\in\mathbb N}(xk)k∈N​ is generated by the proximal algorithm

xk+1∈argmin⁡{f(u)+12λk∣u−xk∣2:u∈Rn}(2)x^{k+1}\in\operatorname{argmin}\Big\{f(u)+\frac{1}{2\lambda_k}|u-x^k|^2 : u\in\mathbb R^n\Big\}\qquad(2)xk+1∈argmin{f(u)+2λk​1​∣u−xk∣2:u∈Rn}(2)

from an arbitrary x0∈Rnx^0\in\mathbb R^nx0∈Rn, with step sizes λk∈(λ−,λ+)\lambda_k\in(\lambda_-,\lambda_+)λk​∈(λ−​,λ+​) for fixed 0<λ−<λ+<+∞0<\lambda_-<\lambda_+<+\infty0<λ−​<λ+​<+∞.

Assume that fff satisfies

  1. (H1) inf⁡Rnf>−∞\inf_{\mathbb R^n} f>-\inftyinfRn​f>−∞;
  2. (H2) the restriction of fff to its domain is continuous;
  3. (H3) the Łojasiewicz property: at every critical point x^\hat xx^ there are C,ε>0C,\varepsilon>0C,ε>0 and θ∈[0,1)\theta\in[0,1)θ∈[0,1) with ∣f(x)−f(x^)∣θ≤C∣x∗∣|f(x)-f(\hat x)|^\theta\le C|x^*|∣f(x)−f(x^)∣θ≤C∣x∗∣ for all x∈B(x^,ε)x\in B(\hat x,\varepsilon)x∈B(x^,ε), x∗∈∂f(x)x^*\in\partial f(x)x∗∈∂f(x) (with 00=00^0=000=0).

If the sequence (xk)k∈N(x^k)_{k\in\mathbb N}(xk)k∈N​ is bounded, then

∑k=0+∞∣xk+1−xk∣<+∞,\sum_{k=0}^{+\infty}|x^{k+1}-x^k|<+\infty,k=0∑+∞​∣xk+1−xk∣<+∞,

and the whole sequence (xk)(x^k)(xk) converges to some critical point x∞∈crit⁡fx^\infty\in\operatorname{crit} fx∞∈critf.

This is the main result of the paper: for nonsmooth, nonconvex functions with the Łojasiewicz property (for example real-analytic functions, or continuous subanalytic ones), boundedness of a proximal sequence is enough for convergence of the whole sequence, not just of a subsequence.

Formalization Note fff is EReal-valued, never −∞-\infty−∞. Boundedness means the range of the sequence is bounded. No hypothesis beyond the page's is added: in particular the proof's reduction xk+1≠xkx^{k+1}\neq x^kxk+1=xk is not assumed.

Preamble
import Mathlib
import Definitions.Def_NonconvexSplitting_Shared_LimitingSubdiff
import Definitions.Def_NonsmoothLojasiewicz_Continuous_slope
import Definitions.Def_ProxLoj_Conv_Setting

open Filter Topology NonconvexSplitting.Shared NonsmoothLojasiewicz.Continuous
Formal statement
namespace ProxLoj.Conv

/-- Theorem 4 (Convergence result), p. 5: if `f` is proper, lower semicontinuous and satisfies
(H1), (H2), (H3), every bounded proximal run has finite length and converges to a critical
point of `f`. -/
theorem theorem_4 {n : ℕ} (f : EuclideanSpace ℝ (Fin n) → EReal)
    (hproper : IsProper f) (hlsc : LowerSemicontinuous f)
    (hH1 : H1 f) (hH2 : H2 f) (hH3 : HasLojProperty f)
    (lam : ℕ → ℝ) (lamMinus lamPlus : ℝ) (hstep : StepBounds lam lamMinus lamPlus)
    (x : ℕ → EuclideanSpace ℝ (Fin n)) (hx : IsProxRun f lam x)
    (hbdd : Bornology.IsBounded (Set.range x)) :
    Summable (fun k => ‖x (k + 1) - x k‖) ∧
      ∃ xinf ∈ crit f, Tendsto x atTop (𝓝 xinf) := by sorry

end ProxLoj.Conv
Source
Attouch & Bolte, On the convergence of the proximal algorithm for nonsmooth functions involving analytic features, author's version hal-00803898v1, p. 5, Theorem 4
Human review
  • Endorsed by Shuze Chen · Oct 7, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 7, 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