Theorem 2.19 (Peano) — existence of a solution for continuous f on [t₀, t₀ + T₀]
ProvedTeschlODE.IVP.peano_existenceLet , , and . Suppose is continuous on
and let . Then there exists at least one solution of the initial value problem
on which remains in , where
The analogous result holds for the interval , with and the maximum of there.
No Lipschitz condition is assumed, and uniqueness may fail (e.g. , ). This is the book's existence theorem for merely continuous right-hand sides; it is proved by Euler polygons and the Arzelà–Ascoli theorem.
Formalization Note. The book writes the open ball and "the maximum of ", and says the solution "remains in ". A maximum over the open ball need not exist, and the solution can reach the sphere at (e.g. , , , gives with ), so the statement uses the closed ball throughout, as the book's own proof does (). is given as the greatest element of , which exists since is compact and nonempty. is if M = 0 then T else min T (δ / M), the book's convention . "Solution on remaining in " means: and, for every in the interval, and has derivative at relative to the interval (one-sided at the endpoints). The book's is not needed: is only required to be continuous on . The forward and backward statements are the two conjuncts, each with its own and .
import Mathlib import Definitions.Def_TeschlODE_IVP_IsSolutionOn
namespace TeschlODE.IVP
theorem peano_existence {n : ℕ}
(f : ℝ × EuclideanSpace ℝ (Fin n) → EuclideanSpace ℝ (Fin n))
(t₀ T δ : ℝ) (x₀ : EuclideanSpace ℝ (Fin n)) (hT : 0 < T) (hδ : 0 < δ) :
-- forward in time, on `V = [t₀, t₀ + T] × B̄_δ(x₀)`
(ContinuousOn f (Set.Icc t₀ (t₀ + T) ×ˢ Metric.closedBall x₀ δ) →
∀ M : ℝ,
IsGreatest ((fun p => ‖f p‖) '' (Set.Icc t₀ (t₀ + T) ×ˢ Metric.closedBall x₀ δ)) M →
∃ x : ℝ → EuclideanSpace ℝ (Fin n), x t₀ = x₀ ∧
IsSolutionOn (Set.Icc t₀ (t₀ + T) ×ˢ Metric.closedBall x₀ δ) f
(Set.Icc t₀ (t₀ + (if M = 0 then T else min T (δ / M)))) x) ∧
-- backward in time, on `V = [t₀ - T, t₀] × B̄_δ(x₀)`
(ContinuousOn f (Set.Icc (t₀ - T) t₀ ×ˢ Metric.closedBall x₀ δ) →
∀ M : ℝ,
IsGreatest ((fun p => ‖f p‖) '' (Set.Icc (t₀ - T) t₀ ×ˢ Metric.closedBall x₀ δ)) M →
∃ x : ℝ → EuclideanSpace ℝ (Fin n), x t₀ = x₀ ∧
IsSolutionOn (Set.Icc (t₀ - T) t₀ ×ˢ Metric.closedBall x₀ δ) f
(Set.Icc (t₀ - (if M = 0 then T else min T (δ / M))) t₀) x) := by sorry
end TeschlODE.IVP
Read-back
What the Lean code literally says, in plain math · claude-opus-5-5
The statement is a conjunction of two independent claims: a forward-in-time part and a backward-in-time part. Each part has its own continuity hypothesis and its own bound .
Setting. The claims share these data:
- is a dimension, and is the Euclidean space with the usual Euclidean norm .
- is an arbitrary function defined everywhere. It takes a pair with time and state . No regularity is assumed globally.
- are real numbers with and .
- is a point.
- is the closed Euclidean ball.
The two claims use these rectangles:
The predicate . The conclusions use , taken from the imported module Definitions.Def_TeschlODE_IVP_IsSolutionOn. Its definition is not included in the code given here, so its meaning cannot be stated from this artifact. Its arguments are, in order:
- a set ;
- the function ;
- a set of times ;
- a curve , defined on all of .
Whatever the statement asserts about solving the equation , it asserts only through this predicate.
Forward claim. Suppose is continuous on , meaning continuity of the restriction of to ; nothing is assumed about outside . Then for every real that is the greatest element of
there is a function with:
- , and
- ,
where
"Greatest element" means two things: is attained as at some point of , and at every point of . So is the maximum of on . It is unique, and it is at least .
Backward claim. This is the same statement with in place of :
- continuity of on is assumed;
- is the maximum of over , which may differ from the forward ;
- the curve satisfies and , with defined as above.
The curves in the two claims are separate existential witnesses. Nothing says one curve works in both directions.
Degenerate cases.
- The maximum. Since and , both rectangles are nonempty. If a maximum exists, then .
- . This happens exactly when vanishes on the whole rectangle. The time interval is then the full , or backward. No division by zero occurs, because the case is split off before is formed.
- . Then , which lies in , so the interval always has positive length.
- Maximum not attained. If the set of values on the rectangle has no greatest element, the claim for that direction holds vacuously. This happens, for example, when is not continuous there. Under the continuity hypothesis the rectangle is compact, so a maximum always exists.
- . has a single point . Then , the ball is , , and so and . The curve is the constant , and the content reduces to whatever says in that case.
- Outside the interval. Nothing in the code constrains at times outside or , except through the unseen .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.