Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 5.1, (5.3)–(5.5), p. 239 — near a B-differentiable zero x*, ‖x − x*‖ ≤ 2c‖F(x)‖

Proved
QiNonsmoothEq.Attraction.error_bound_5_5

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

bd-regularityerror-boundnonsmooth-equationsp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let F:Rn→RnF:\mathbb R^n\to\mathbb R^nF:Rn→Rn be locally Lipschitz and B-differentiable at a zero x∗x^*x∗ of FFF, and let ccc be a constant with

∥h∥≤c ∥F′(x∗;h)∥for all h∈Rn.(5.3)\|h\|\le c\,\|F'(x^*;h)\|\quad\text{for all }h\in\mathbb R^n. \tag{5.3}∥h∥≤c∥F′(x∗;h)∥for all h∈Rn.(5.3)

Then for every δ1>0\delta_1>0δ1​>0 there is δ∈(0,δ1)\delta\in(0,\delta_1)δ∈(0,δ1​) such that every xxx with ∥x−x∗∥≤δ\|x-x^*\|\le\delta∥x−x∗∥≤δ satisfies

∥x−x∗∥ ≤ 2c ∥F(x)∥.(5.5)\|x-x^*\|\ \le\ 2c\,\|F(x)\|. \tag{5.5}∥x−x∗∥ ≤ 2c∥F(x)∥.(5.5)

This local error bound converts the residual ∥F(x)∥\|F(x)\|∥F(x)∥ into a bound on the distance to x∗x^*x∗, with the explicit constant 2c2c2c tied to the ccc of (5.3). It is the first step of the proof of the attraction theorem.

Formalization Note B-differentiability is assumed only at x∗x^*x∗, which is all the argument uses; Theorem 5.1 assumes it everywhere.

Preamble
import Mathlib
import Definitions.Def_NonsmoothNewton_Local_dirDeriv
import Definitions.Def_QiNonsmoothEq_Attraction_Setting
open Filter Topology NonsmoothNewton.Local
Formal statement
namespace QiNonsmoothEq.Attraction

/-- Qi 1993, proof of Theorem 5.1, (5.3)–(5.5), p. 239: if `F` is B-differentiable at a zero
`x*` and `‖h‖ ≤ c ‖F'(x*; h)‖` for all `h` (5.3), then for every `δ₁ > 0` there is
`δ ∈ (0, δ₁)` with `‖y - x*‖ ≤ 2c ‖F(y)‖` whenever `‖y - x*‖ ≤ δ` (5.5). -/
theorem error_bound_5_5 {n : ℕ}
    (F : EuclideanSpace ℝ (Fin n) → EuclideanSpace ℝ (Fin n)) (hF : LocallyLipschitz F)
    (xstar : EuclideanSpace ℝ (Fin n)) (hBx : QiNonsmoothEq.Local.BDiffAt F xstar) (hzero : F xstar = 0)
    (c : ℝ) (hc : ∀ h : EuclideanSpace ℝ (Fin n), ‖h‖ ≤ c * ‖dirDeriv F xstar h‖) :
    ∀ δ₁ : ℝ, 0 < δ₁ → ∃ δ : ℝ, 0 < δ ∧ δ < δ₁ ∧
      ∀ y : EuclideanSpace ℝ (Fin n), ‖y - xstar‖ ≤ δ → ‖y - xstar‖ ≤ 2 * c * ‖F y‖ := by sorry

end QiNonsmoothEq.Attraction
Source
Qi, Convergence analysis of some algorithms for solving nonsmooth equations, Math. Oper. Res. 18 (1993), p. 239, proof of Theorem 5.1, (5.3)–(5.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