Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The Picard iterates converge to the solution

Proved
MetodosNumericos.picard_converges

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

differential-equationsnumerical-analysis

Under the hypotheses of the previous milestone, yk(x)tovarphi(x)y_k(x) \\to \\varphi(x)yk​(x)tovarphi(x) as ktoinftyk \\to \\inftyktoinfty, for every xin[x0−h,x0+h]x \\in [x_0-h, x_0+h]xin[x0​−h,x0​+h]. This is the limit statement that closes §9.5.

Preamble
import Mathlib
import Definitions.Def_MetodosNumericos_edoDefs

open Filter Topology
Formal statement
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 MetodosNumericos
Source
S. R. Freitas, Métodos Numéricos (UFMS, 2000), Cap. 9, §9.5, p. 186 ("lim y_k(x) = φ(x)").
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 hypotheses are the same as in the Picard error bound: a,b,M>0a, b, M > 0a,b,M>0, Nge0N \\ge 0Nge0, h=mina,b/Mh = \\min\\{a, b/M\\}h=mina,b/M, the bound ∣f∣leM|f| \\le M∣f∣leM and the Lipschitz estimate with constant NNN on the rectangle [x0−a,x0+a]times[y0−b,y0+b][x_0-a,x_0+a]\\times[y_0-b,y_0+b][x0​−a,x0​+a]times[y0​−b,y0​+b], continuity of fff there, and a function varphi\\varphivarphi with varphi(x0)=y0\\varphi(x_0)=y_0varphi(x0​)=y0​, solving the differential equation on [x0−h,x0+h][x_0-h,x_0+h][x0​−h,x0​+h] and taking values in [y0−b,y0+b][y_0-b,y_0+b][y0​−b,y0​+b] there.

For a fixed xin[x0−h,x0+h]x \\in [x_0-h, x_0+h]xin[x0​−h,x0​+h], the conclusion is that the sequence kmapstoyk(x)k \\mapsto y_k(x)kmapstoyk​(x) of Picard iterates evaluated at xxx converges to varphi(x)\\varphi(x)varphi(x). The statement is pointwise in xxx: no uniformity in xxx is asserted.

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