Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 1.2 — uniform linearization error ∥F(z)−F(y)−F′(y)(z−y)∥≤ε∥z−y∥\|F(z)-F(y)-F'(y)(z-y)\|\le\varepsilon\|z-y\|∥F(z)−F(y)−F′(y)(z−y)∥≤ε∥z−y∥ near xxx

Proved
GlobalInexactNewton.Backtracking.lemma_1_2

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

inexact-newtonnonlinear-equationsp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let EEE be a finite-dimensional real normed space and F:E→EF:E\to EF:E→E continuously differentiable. For every x∈Ex\in Ex∈E and ε>0\varepsilon>0ε>0 there is δ>0\delta>0δ>0 such that

∥F(z)−F(y)−F′(y)(z−y)∥≤ε ∥z−y∥\|F(z)-F(y)-F'(y)(z-y)\|\le\varepsilon\,\|z-y\|∥F(z)−F(y)−F′(y)(z−y)∥≤ε∥z−y∥

whenever ∥y−x∥<δ\|y-x\|<\delta∥y−x∥<δ and ∥z−x∥<δ\|z-x\|<\delta∥z−x∥<δ.

The derivative is taken at the base point yyy, not at the centre xxx. The lemma controls the error of the local linear model uniformly on a neighbourhood and is used to show that inexact Newton steps eventually give sufficient decrease.

Formalization Note Nδ(x)N_\delta(x)Nδ​(x) is the open ball of radius δ\deltaδ about xxx. Continuous differentiability is the paper's standing assumption (p. 395).

Preamble
import Mathlib
import Definitions.Def_GlobalInexactNewton_Backtracking_Method
open Filter Topology
Formal statement
namespace GlobalInexactNewton.Backtracking

/-- Eisenstat–Walker (1994), pp. 395–396, Lemma 1.2: for any `x` and `ε > 0` there is `δ > 0`
such that `‖F(z) - F(y) - F'(y)(z - y)‖ ≤ ε ‖z - y‖` whenever `y, z ∈ N_δ(x)`.
Standing assumption (p. 395): `F` is continuously differentiable. -/
theorem lemma_1_2 {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E] [FiniteDimensional ℝ E]
    (F : E → E) (hF : ContDiff ℝ 1 F) (x : E) (ε : ℝ) (hε : 0 < ε) :
    ∃ δ > 0, ∀ y ∈ Metric.ball x δ, ∀ z ∈ Metric.ball x δ,
      ‖F z - F y - fderiv ℝ F y (z - y)‖ ≤ ε * ‖z - y‖ := by sorry

end GlobalInexactNewton.Backtracking
Source
Eisenstat and Walker, Globally Convergent Inexact Newton Methods, SIAM J. Optim. 4(2) (1994), pp. 395–396, Lemma 1.2
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