Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Picard error bound ∣varphi−yk∣leMNk−1hk/k!|\\varphi - y_k| \\le M N^{k-1}h^k/k!∣varphi−yk​∣leMNk−1hk/k!

Disproved
MetodosNumericos.picard_error_bound

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

differential-equationsnumerical-analysis

With MMM a bound for ∣f∣|f|∣f∣ and NNN a Lipschitz constant in yyy on the rectangle, and h=mina,b/Mh = \\min\\{a, b/M\\}h=mina,b/M, the kkk-th Picard iterate satisfies ∣varphi(x)−yk(x)∣lefracMNk−1k!hk|\\varphi(x) - y_k(x)| \\le \\frac{M N^{k-1}}{k!}h^k∣varphi(x)−yk​(x)∣lefracMNk−1k!hk for every xin[x0−h,x0+h]x \\in [x_0-h,x_0+h]xin[x0​−h,x0​+h] and every kge1k \\ge 1kge1, where varphi\\varphivarphi is a solution of the initial value problem. This is the estimate stated in §9.5.

Preamble
import Mathlib
import Definitions.Def_MetodosNumericos_edoDefs
Formal statement
namespace MetodosNumericos

theorem picard_error_bound (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))
    (k : ℕ) (hk : 1 ≤ k) (x : ℝ) (hx : x ∈ Set.Icc (x0 - h) (x0 + h)) :
    |phi x - picardSeq f x0 y0 k x| ≤ M * N ^ (k - 1) * h ^ k / (Nat.factorial k : ℝ) := by
  sorry

end MetodosNumericos
Source
S. R. Freitas, Métodos Numéricos (UFMS, 2000), Cap. 9, §9.5 Método de Picard, p. 186.
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.

For a function fff of two real variables, a function varphi\\varphivarphi of one real variable, and reals x0x_0x0​, y0y_0y0​, aaa, bbb, MMM, NNN, hhh, the hypotheses are: a>0a>0a>0; b>0b>0b>0; M>0M>0M>0; Nge0N \\ge 0Nge0; h=mina,b/Mh = \\min\\{a, b/M\\}h=mina,b/M; ∣f(x,y)∣leM|f(x,y)| \\le M∣f(x,y)∣leM for all (x,y)(x,y)(x,y) in 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]; ∣f(x,u)−f(x,v)∣leN∣u−v∣|f(x,u)-f(x,v)| \\le N|u-v|∣f(x,u)−f(x,v)∣leN∣u−v∣ for xxx in [x0−a,x0+a][x_0-a,x_0+a][x0​−a,x0​+a] and u,vu,vu,v in [y0−b,y0+b][y_0-b,y_0+b][y0​−b,y0​+b]; fff continuous on the rectangle; varphi(x0)=y0\\varphi(x_0)=y_0varphi(x0​)=y0​; varphi\\varphivarphi has derivative f(x,varphi(x))f(x,\\varphi(x))f(x,varphi(x)) at every xin[x0−h,x0+h]x \\in [x_0-h,x_0+h]xin[x0​−h,x0​+h]; and varphi(x)in[y0−b,y0+b]\\varphi(x) \\in [y_0-b,y_0+b]varphi(x)in[y0​−b,y0​+b] for every such xxx.

For a natural number kge1k \\ge 1kge1 and a point xin[x0−h,x0+h]x \\in [x_0-h,x_0+h]xin[x0​−h,x0​+h], the conclusion is

bigl∣varphi(x)−yk(x)bigr∣;le;fracM,N,k−1,h,kk!,\\bigl|\\varphi(x) - y_k(x)\\bigr| \\;\\le\\; \\frac{M\\,N^{\\,k-1}\\,h^{\\,k}}{k!},bigl∣varphi(x)−yk​(x)bigr∣;le;fracM,N,k−1,h,kk!,

where yky_kyk​ is the kkk-th Picard iterate defined by y0equivy0y_0 \\equiv y_0y0​equivy0​ and yj+1(x)=y0+intx0xf(t,yj(t)),dty_{j+1}(x) = y_0 + \\int_{x_0}^{x} f(t,y_j(t))\\,dtyj+1​(x)=y0​+intx0​x​f(t,yj​(t)),dt. The exponent k−1k-1k−1 is truncated natural-number subtraction, which for kge1k \\ge 1kge1 is the ordinary difference. The bound is stated with hkh^khk, not with ∣x−x0∣k|x-x_0|^k∣x−x0​∣k.

Human review
  • Endorsed by LG · Sep 24, 2026

    Confirmed by the mission captain (proposal self-audit).

  • Flagged by Shuze Chen · Sep 24, 2026

    Unfaithful to the mathematics: the bound |phi(x) - y_k(x)| <= M N^(k-1) h^k / k! is the formula printed in Freitas p. 186, but it is off by one level of the Picard iteration and fails for k = 1 (example: M = 1, N = 4, a = b = 1, x0 = y0 = 0, f(t, y) = clamp((y - t + 1/4) / (1/4), -1, 1) for t >= 0 gives phi(t) = t and y_1(1) = -1/2, error 3/2 > M h = 1). The classical estimate M N^k h^(k+1) / (k+1)! is stated as MetodosNumericos.picard_error_bound_classical, to which the milestone is now linked.

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