A posteriori error estimate
ProvedMetodosNumericos.mil_error_estimateUnder the hypotheses of the previous milestone ( differentiable with on , mapping into itself, a fixed point in , ), the fixed-point iterates satisfy for every . This is the practical stopping criterion of Proposição 3.3.4: the distance to the root is controlled by the last observed increment.
import Mathlib import Definitions.Def_MetodosNumericos_zerosDefs
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 MetodosNumericosRead-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 and reals , , , , , with hypotheses: maps every point of into ; has derivative at every ; for every ; ; ; ; and .
Writing for the sequence with the given and , the conclusion is that for every natural number ,
The quantifier includes , so the first instance compares with and the increment . The constant is well defined because , and it is nonnegative because the nonempty interval forces .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.