Convergence of the linear iterative method under
ProvedMetodosNumericos.mil_convergenceLet be differentiable on with derivative , let for all with , and assume maps into itself. If is a fixed point of and , then the iterates converge to . This is item (i) of Proposição 3.3.2, with the invariance of the interval added as an explicit hypothesis.
import Mathlib import Definitions.Def_MetodosNumericos_zerosDefs open Filter Topology
namespace MetodosNumericos
theorem mil_convergence (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) :
Tendsto (iterSeq g x0) atTop (𝓝 xbar) := 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 two functions and five real numbers , , , , . The hypotheses are:
- for every , ;
- for every , has derivative at (two-sided differentiability at every point of the closed interval, endpoints included);
- for every , ;
- ;
- ;
- ;
- .
The conclusion is that the sequence defined by and converges to .
The function is an independent argument constrained only on . The hypothesis forces the interval to be nonempty, so the derivative bound forces ; no vacuous instance arises from an empty interval. No function whose zero is sought appears: the fixed point is given as a hypothesis.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.