Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 4.3, p. 237 — a semismooth, strongly BD-regular zero that is an accumulation point of the damped Newton method attracts the whole sequence superlinearly, and α_k eventually becomes 1

Proved
QiNonsmoothEq.Damped.theorem_4_3

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

damped-newtonnonsmooth-equationsp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1semismooth-newtonsuperlinear-convergenceunit-step

Let F:Rn→RnF:\mathbb R^n\to\mathbb R^nF:Rn→Rn be locally Lipschitz and B-differentiable at every point, and let g=12∥F∥2g=\tfrac12\|F\|^2g=21​∥F∥2. Fix β∈(0,1)\beta\in(0,1)β∈(0,1) and σ∈(0,1/2)\sigma\in(0,1/2)σ∈(0,1/2), and let {xk}\{x^k\}{xk} be any sequence generated by the damped Newton method (Algorithm 4.1) with s=1s=1s=1: dkd^kdk solves F(xk)+F′(xk;dk)=0F(x^k)+F'(x^k;d^k)=0F(xk)+F′(xk;dk)=0, αk=βmk\alpha_k=\beta^{m_k}αk​=βmk​ with mkm_kmk​ the first nonnegative integer passing the Armijo test (4.1), and xk+1=xk+αkdkx^{k+1}=x^k+\alpha_k d^kxk+1=xk+αk​dk. Assume that F(xk)≠0F(x^k)\ne0F(xk)=0 for all kkk.

Suppose x∗x^*x∗ is an accumulation point of {xk}\{x^k\}{xk} and a zero of FFF, that FFF is semismooth and strongly BD-regular at x∗x^*x∗, and that FFF is semismooth on a neighbourhood of x∗x^*x∗. Then:

  1. the entire sequence converges, xk→x∗x^k\to x^*xk→x∗;
  2. the convergence is superlinear,
∥xk+1−x∗∥=o(∥xk−x∗∥)(k→∞);\|x^{k+1}-x^*\|=o(\|x^k-x^*\|)\qquad(k\to\infty);∥xk+1−x∗∥=o(∥xk−x∗∥)(k→∞);
  1. αk=1\alpha_k=1αk​=1 for all sufficiently large kkk.

The theorem answers three questions Pang raised about his damped Newton method for nonsmooth equations: whether the iteration converges to one point, at what rate, and when the step size becomes 1.

Formalization Note "Theorem 4.2 (b) holds" (each generalized Newton equation has a solution) is implied by the run hypothesis, which supplies a solution dkd^kdk at every iterate. Global B-differentiability is the setting of Theorem 4.2, on which Algorithm 4.1's analysis rests. Semismoothness on a neighbourhood of x∗x^*x∗ is an added hypothesis inherited from Corollary 3.4, whose proof uses (2.16) at points near x∗x^*x∗; Lemma 2.6 proves (2.16) only at semismooth points. An accumulation point is a cluster point of the sequence ({xk}\{x^k\}{xk} is frequently in every neighbourhood of x∗x^*x∗).


Retired 2026-10-27: a Lean-vs-paper fidelity audit found this statement weaker than, or narrower than, the cited result. A corrected statement will be resubmitted.

Preamble
import Mathlib
import Definitions.Def_QiNonsmoothEq_Damped_Setting
Formal statement
namespace QiNonsmoothEq.Damped

open Filter Topology NonsmoothNewton.Local NonsmoothNewton.Shared

theorem theorem_4_3 {n : ℕ} (F : EuclideanSpace ℝ (Fin n) → EuclideanSpace ℝ (Fin n))
    (hF : LocallyLipschitz F) (hB : ∀ y, BDiffAt F y)
    (β σ : ℝ) (hβ0 : 0 < β) (hβ1 : β < 1) (hσ0 : 0 < σ) (hσ1 : σ < 1 / 2)
    (x d : ℕ → EuclideanSpace ℝ (Fin n)) (α : ℕ → ℝ)
    (hrun : IsDampedNewtonRun F 1 β σ x d α) (hne : ∀ k, F (x k) ≠ 0)
    (xstar : EuclideanSpace ℝ (Fin n))
    (hclu : MapClusterPt xstar atTop x) (hzero : F xstar = 0)
    (hss : SemismoothAt F xstar) (hreg : StronglyBDRegularAt F xstar)
    (hssN : ∀ᶠ y in 𝓝 xstar, SemismoothAt F y) :
    Tendsto x atTop (𝓝 xstar) ∧
      (fun k => x (k + 1) - xstar) =o[atTop] (fun k => x k - xstar) ∧
      ∀ᶠ k in atTop, α k = 1 := by sorry

end QiNonsmoothEq.Damped
Source
Qi, Convergence analysis of some algorithms for solving nonsmooth equations, Math. Oper. Res. 18 (1993), p. 237, Theorem 4.3
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

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