Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A posteriori error estimate ∣barx−xn∣lefracL1−L∣xn−xn−1∣|\\bar{x}-x_n| \\le \\frac{L}{1-L}|x_n - x_{n-1}|∣barx−xn​∣lefracL1−L∣xn​−xn−1​∣

Proved
MetodosNumericos.mil_error_estimate

by LG · Sep 20, 2026 · Mathlib 0df444a (Lean v4.33.1)

fixed-pointnumerical-analysis

Under the hypotheses of the previous milestone (ggg differentiable with ∣g′∣leL<1|g'| \\le L < 1∣g′∣leL<1 on [a,b][a,b][a,b], ggg mapping [a,b][a,b][a,b] into itself, barx\\bar{x}barx a fixed point in [a,b][a,b][a,b], x0in[a,b]x_0 \\in [a,b]x0​in[a,b]), the fixed-point iterates satisfy ∣barx−xn+1∣lefracL1−L,∣xn+1−xn∣|\\bar{x} - x_{n+1}| \\le \\frac{L}{1-L}\\,|x_{n+1} - x_n|∣barx−xn+1​∣lefracL1−L,∣xn+1​−xn​∣ for every nnn. This is the practical stopping criterion of Proposição 3.3.4: the distance to the root is controlled by the last observed increment.

Preamble
import Mathlib
import Definitions.Def_MetodosNumericos_zerosDefs
Formal statement
namespace MetodosNumericos

theorem mil_error_estimate (g g' : ℝ → ℝ) (a b L x0 xbar : ℝ)
    (hmaps : ∀ x ∈ Set.Icc a b, g x ∈ Set.Icc a b)
    (hderiv : ∀ x ∈ Set.Icc a b, HasDerivAt g (g' x) x)
    (hbound : ∀ x ∈ Set.Icc a b, |g' x| ≤ L) (hL : L < 1)
    (hx0 : x0 ∈ Set.Icc a b) (hxbar : xbar ∈ Set.Icc a b) (hfix : g xbar = xbar) :
    ∀ n : ℕ, |xbar - iterSeq g x0 (n + 1)| ≤
      L / (1 - L) * |iterSeq g x0 (n + 1) - iterSeq g x0 n| := by sorry

end MetodosNumericos
Source
S. R. Freitas, Métodos Numéricos (UFMS, 2000), Cap. 3, Proposição 3.3.4, pp. 53–54.
Read-back

What the Lean code literally says, in plain math · self-authored-by-drafting-agent (non-blind)

Disclosure: this read-back is not blind. It was written by the same agent that drafted the Lean statement, at the explicit instruction of the mission's human owner, and not by an independent auditor with fresh context.

The statement fixes functions g,g′:mathbbRtomathbbRg, g' : \\mathbb{R} \\to \\mathbb{R}g,g′:mathbbRtomathbbR and reals aaa, bbb, LLL, x0x_0x0​, barx\\bar{x}barx, with hypotheses: ggg maps every point of [a,b][a,b][a,b] into [a,b][a,b][a,b]; ggg has derivative g′(x)g'(x)g′(x) at every xin[a,b]x \\in [a,b]xin[a,b]; ∣g′(x)∣leL|g'(x)| \\le L∣g′(x)∣leL for every xin[a,b]x \\in [a,b]xin[a,b]; L<1L < 1L<1; x0in[a,b]x_0 \\in [a,b]x0​in[a,b]; barxin[a,b]\\bar{x} \\in [a,b]barxin[a,b]; and g(barx)=barxg(\\bar{x}) = \\bar{x}g(barx)=barx.

Writing xnx_nxn​ for the sequence with the given x0x_0x0​ and xn+1=g(xn)x_{n+1} = g(x_n)xn+1​=g(xn​), the conclusion is that for every natural number nnn,

left∣barx−xn+1right∣;le;fracL1−Lleft∣xn+1−xnright∣.\\left| \\bar{x} - x_{n+1} \\right| \\;\\le\\; \\frac{L}{1-L} \\left| x_{n+1} - x_n \\right|.left∣barx−xn+1​right∣;le;fracL1−Lleft∣xn+1​−xn​right∣.

The quantifier includes n=0n = 0n=0, so the first instance compares barx\\bar{x}barx with g(x0)g(x_0)g(x0​) and the increment g(x0)−x0g(x_0) - x_0g(x0​)−x0​. The constant fracL1−L\\frac{L}{1-L}fracL1−L is well defined because L<1L < 1L<1, and it is nonnegative because the nonempty interval forces Lge0L \\ge 0Lge0.

Human review
  • Endorsed by Shuze Chen · Sep 24, 2026

    Confirmed by the moderator at approval.

  • Endorsed by LG · Sep 24, 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