Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 3.1, p. 234 — at a semismooth, strongly BD-regular zero, the ∂_B Newton method (3.2) is well defined and converges superlinearly, and ‖F‖ decreases superlinearly

Proved
QiNonsmoothEq.Local.theorem_3_1

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

bd-regularitynonsmooth-equationsp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1semismooth-newtonsuperlinear-convergence

Let F:Rn→RnF:\mathbb R^n\to\mathbb R^nF:Rn→Rn be locally Lipschitz, let x∗x^*x∗ be a solution of F(x)=0F(x)=0F(x)=0, and let FFF be semismooth and strongly BD-regular at x∗x^*x∗ (every V∈∂BF(x∗)V\in\partial_B F(x^*)V∈∂B​F(x∗) is nonsingular). Consider the Newton method

xk+1=xk−Vk−1F(xk),Vk∈∂BF(xk).(3.2)x^{k+1}=x^k-V_k^{-1}F(x^k),\qquad V_k\in\partial_B F(x^k). \tag{3.2}xk+1=xk−Vk−1​F(xk),Vk​∈∂B​F(xk).(3.2)

Then there is δ>0\delta>0δ>0 such that:

  1. (well defined) for every yyy with ∥y−x∗∥<δ\|y-x^*\|<\delta∥y−x∗∥<δ, every V∈∂BF(y)V\in\partial_B F(y)V∈∂B​F(y) is nonsingular, and the Newton point y−V−1F(y)y-V^{-1}F(y)y−V−1F(y) again satisfies ∥y−V−1F(y)−x∗∥<δ\|y-V^{-1}F(y)-x^*\|<\delta∥y−V−1F(y)−x∗∥<δ;
  2. (superlinear convergence) every sequence generated by (3.2) from ∥x0−x∗∥<δ\|x^0-x^*\|<\delta∥x0−x∗∥<δ, for any choice of Vk∈∂BF(xk)V_k\in\partial_B F(x^k)Vk​∈∂B​F(xk), has all VkV_kVk​ nonsingular, converges to x∗x^*x∗, and
∥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. (superlinear decrease of ∥F∥\|F\|∥F∥) if moreover F(xk)≠0F(x^k)\neq 0F(xk)=0 for all kkk, then
lim⁡k→∞∥F(xk+1)∥∥F(xk)∥=0.(1.9)\lim_{k\to\infty}\frac{\|F(x^{k+1})\|}{\|F(x^k)\|}=0. \tag{1.9}k→∞lim​∥F(xk)∥∥F(xk+1)∥​=0.(1.9)

Restricting the Newton matrices to the B-subdifferential instead of Clarke's generalized Jacobian replaces the nonsingularity of all of ∂F(x∗)\partial F(x^*)∂F(x∗) by the weaker strong BD-regularity; the theorem shows that local superlinear convergence survives, and (1.9) makes the method a descent method for ∥F∥\|F\|∥F∥ near the zero.

Formalization Note A run of (3.2) is a pair of sequences with Vk∈∂BF(xk)V_k\in\partial_B F(x^k)Vk​∈∂B​F(xk) and Vk(xk+1−xk)=−F(xk)V_k(x^{k+1}-x^k)=-F(x^k)Vk​(xk+1−xk)=−F(xk); nonsingularity of each VkV_kVk​ is part of the conclusion. The radius δ\deltaδ is fixed before the run and serves every starting point and every choice of VkV_kVk​. The little-ooo is Mathlib's IsLittleO along atTop. Local Lipschitz continuity is the paper's standing assumption (§1). The second paragraph of the theorem (quadratic convergence) is the separate item theorem_3_1_quadratic.

Preamble
import Mathlib
import Definitions.Def_NonsmoothNewton_Shared_clarkeJac
import Definitions.Def_NonsmoothNewton_Local_dirDeriv
import Definitions.Def_NonsmoothNewton_Local_SemismoothAt
import Definitions.Def_QiNonsmoothEq_Local_Setting
open Filter Topology
Formal statement
namespace QiNonsmoothEq.Local

/-- Qi (1993), Theorem 3.1 (Local Convergence), first paragraph, p. 234. Let `x*` be a zero of
`F`, and let `F` be semismooth and strongly BD-regular at `x*`. Then there is `δ > 0` such that:
(1) for every `y` with `‖y - x*‖ < δ`, every `V ∈ ∂_B F(y)` is nonsingular and the Newton point
`y - V⁻¹F(y)` is again within `δ` of `x*` (the method (3.2) is well defined);
(2) every run of (3.2), `x^{k+1} = x^k - V_k⁻¹F(x^k)` with `V_k ∈ ∂_B F(x^k)` arbitrary, started
with `‖x^0 - x*‖ < δ`, has every `V_k` nonsingular, converges to `x*`, and superlinearly:
`‖x^{k+1} - x*‖ = o(‖x^k - x*‖)`;
(3) if moreover `F(x^k) ≠ 0` for all `k`, then `‖F(x^{k+1})‖ / ‖F(x^k)‖ → 0` (1.9). -/
theorem theorem_3_1 {n : ℕ} (F : EuclideanSpace ℝ (Fin n) → EuclideanSpace ℝ (Fin n))
    (hF : LocallyLipschitz F) (xstar : EuclideanSpace ℝ (Fin n)) (hzero : F xstar = 0)
    (hss : NonsmoothNewton.Local.SemismoothAt F xstar) (hreg : StronglyBDRegularAt F xstar) :
    ∃ δ > 0,
      (∀ y : EuclideanSpace ℝ (Fin n), ‖y - xstar‖ < δ →
        ∀ V ∈ NonsmoothNewton.Shared.bJac F y,
          (∃ W : EuclideanSpace ℝ (Fin n) →L[ℝ] EuclideanSpace ℝ (Fin n), IsInverse V W) ∧
          ∀ W : EuclideanSpace ℝ (Fin n) →L[ℝ] EuclideanSpace ℝ (Fin n), IsInverse V W →
            ‖y - W (F y) - xstar‖ < δ) ∧
      (∀ (x : ℕ → EuclideanSpace ℝ (Fin n))
          (V : ℕ → EuclideanSpace ℝ (Fin n) →L[ℝ] EuclideanSpace ℝ (Fin n)),
        IsBDNewtonRun F x V → ‖x 0 - xstar‖ < δ →
          (∀ k, ∃ W : EuclideanSpace ℝ (Fin n) →L[ℝ] EuclideanSpace ℝ (Fin n),
            IsInverse (V k) W) ∧
          Tendsto x atTop (𝓝 xstar) ∧
          (fun k => x (k + 1) - xstar) =o[atTop] (fun k => x k - xstar) ∧
          ((∀ k, F (x k) ≠ 0) →
            Tendsto (fun k => ‖F (x (k + 1))‖ / ‖F (x k)‖) atTop (𝓝 0))) := by sorry

end QiNonsmoothEq.Local
Source
Qi, Convergence analysis of some algorithms for solving nonsmooth equations, Math. Oper. Res. 18 (1993), p. 234, Theorem 3.1 (first paragraph), with (1.9) (p. 228)
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