(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
ProvedQiNonsmoothEq.Damped.unit_step_nearLet be locally Lipschitz and B-differentiable at every point. Fix and , and let , , be a run of the damped Newton method (Algorithm 4.1) with , with for all . Let be a zero of at which is semismooth and strongly BD-regular, and assume is semismooth on a neighbourhood of .
Then there is such that for every with ,
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), whenever , so a ball around of radius at most is invariant under the iteration.
Formalization Note Semismoothness on a neighbourhood of is an added hypothesis, inherited from Corollary 3.4 (its proof uses (2.16) at points near , 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 , so means .
import Mathlib import Definitions.Def_QiNonsmoothEq_Damped_Setting
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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.