The Picard iterates converge to the solution
ProvedMetodosNumericos.picard_convergesUnder the hypotheses of the previous milestone, as , for every . This is the limit statement that closes §9.5.
import Mathlib import Definitions.Def_MetodosNumericos_edoDefs open Filter Topology
namespace MetodosNumericos
theorem picard_converges (f : ℝ → ℝ → ℝ) (phi : ℝ → ℝ) (x0 y0 a b M N h : ℝ)
(ha : 0 < a) (hb : 0 < b) (hM : 0 < M) (hN : 0 ≤ N) (hh : h = min a (b / M))
(hbound : ∀ x ∈ Set.Icc (x0 - a) (x0 + a), ∀ y ∈ Set.Icc (y0 - b) (y0 + b), |f x y| ≤ M)
(hlip : ∀ x ∈ Set.Icc (x0 - a) (x0 + a), ∀ u ∈ Set.Icc (y0 - b) (y0 + b),
∀ v ∈ Set.Icc (y0 - b) (y0 + b), |f x u - f x v| ≤ N * |u - v|)
(hcont : ContinuousOn (fun p : ℝ × ℝ => f p.1 p.2)
(Set.Icc (x0 - a) (x0 + a) ×ˢ Set.Icc (y0 - b) (y0 + b)))
(hphi0 : phi x0 = y0)
(hsol : ∀ x ∈ Set.Icc (x0 - h) (x0 + h), HasDerivAt phi (f x (phi x)) x)
(hrange : ∀ x ∈ Set.Icc (x0 - h) (x0 + h), phi x ∈ Set.Icc (y0 - b) (y0 + b))
(x : ℝ) (hx : x ∈ Set.Icc (x0 - h) (x0 + h)) :
Tendsto (fun k => picardSeq f x0 y0 k x) atTop (𝓝 (phi x)) := 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 hypotheses are the same as in the Picard error bound: , , , the bound and the Lipschitz estimate with constant on the rectangle , continuity of there, and a function with , solving the differential equation on and taking values in there.
For a fixed , the conclusion is that the sequence of Picard iterates evaluated at converges to . The statement is pointwise in : no uniformity in is asserted.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.