Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(4.2)–(4.5), proof of Theorem 4.3, p. 237 — near a semismooth, strongly BD-regular zero the damped Newton method takes the unit step and halves the error

Proved
QiNonsmoothEq.Damped.unit_step_near

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

armijodamped-newtonnonsmooth-equationsp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1unit-step

Let F:Rn→RnF:\mathbb R^n\to\mathbb R^nF:Rn→Rn be locally Lipschitz and B-differentiable at every point. 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}, {dk}\{d^k\}{dk}, {αk}\{\alpha_k\}{αk​} be a run of the damped Newton method (Algorithm 4.1) with s=1s=1s=1, with F(xk)≠0F(x^k)\ne0F(xk)=0 for all kkk. Let x∗x^*x∗ be a zero of FFF at which FFF is semismooth and strongly BD-regular, and assume FFF is semismooth on a neighbourhood of x∗x^*x∗.

Then there is δˉ>0\bar\delta>0δˉ>0 such that for every kkk with ∥xk−x∗∥≤δˉ\|x^k-x^*\|\le\bar\delta∥xk−x∗∥≤δˉ,

αk=1,xk+1=xk+dk,∥xk+1−x∗∥≤12∥xk−x∗∥.\alpha_k=1,\qquad x^{k+1}=x^k+d^k,\qquad \|x^{k+1}-x^*\|\le\tfrac12\|x^k-x^*\|.αk​=1,xk+1=xk+dk,∥xk+1−x∗∥≤21​∥xk−x∗∥.

These are (4.3), (4.4) and the first inequality of (4.2) in the paper's proof of Theorem 4.3; the last one yields (4.5), ∥xk+1−x∗∥≤δ\|x^{k+1}-x^*\|\le\delta∥xk+1−x∗∥≤δ whenever ∥xk−x∗∥≤δ≤δˉ\|x^k-x^*\|\le\delta\le\bar\delta∥xk−x∗∥≤δ≤δˉ, so a ball around x∗x^*x∗ of radius at most δˉ\bar\deltaδˉ is invariant under the iteration.

Formalization Note Semismoothness on a neighbourhood of x∗x^*x∗ is an added hypothesis, inherited from Corollary 3.4 (its proof uses (2.16) at points near x∗x^*x∗, which Lemma 2.6 proves only at semismooth points). Global B-differentiability is the standing setting of Algorithm 4.1 (Theorem 4.2's "F is B-differentiable"). The first nonnegative integer passing (4.1) is mkm_kmk​, so αk=1\alpha_k=1αk​=1 means mk=0m_k=0mk​=0.

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

open Filter Topology NonsmoothNewton.Local NonsmoothNewton.Shared

theorem unit_step_near {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))
    (hzero : F xstar = 0) (hss : SemismoothAt F xstar) (hreg : StronglyBDRegularAt F xstar)
    (hssN : ∀ᶠ y in 𝓝 xstar, SemismoothAt F y) :
    ∃ δbar > 0, ∀ k, ‖x k - xstar‖ ≤ δbar →
      α k = 1 ∧ x (k + 1) = x k + d k ∧ ‖x (k + 1) - xstar‖ ≤ (1 / 2) * ‖x k - xstar‖ := by sorry

end QiNonsmoothEq.Damped
Source
Qi, Convergence analysis of some algorithms for solving nonsmooth equations, Math. Oper. Res. 18 (1993), p. 237, proof of Theorem 4.3, (4.2)–(4.5)
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