Theorem 2.2 (Picard–Lindelöf) — local existence, uniqueness, and existence time T₀ = min{T, δ/M}
ProvedTeschlODE.IVP.picard_lindelofLet be open, continuous on , , and suppose is locally Lipschitz continuous in the second argument, uniformly with respect to the first, on . Then:
- (local existence) there is and a solution of on with graph in and ;
- (uniqueness) on every interval , any two solutions on with graph in and value at coincide on ;
- (existence time) if , and , then there is a solution with on whose graph stays in (so ), where
- the analogous statement holds on with .
Together with uniqueness, item 3 says the unique solution exists at least on .
Formalization Note. The book writes with the open ball and "the maximum of on ", 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. , , , ). The statement therefore uses the closed ball , as the book's own proof on p. 37 does (). is given as the greatest element of . is written if M = 0 then T else min T (δ / M), the book's convention . The book's final sentence says ""; the statement uses , the evident intended reading. "Some interval around " is read as with the open interval ; "unique" is read as uniqueness on every interval containing (sets that are order-connected).
import Mathlib import Definitions.Def_TeschlODE_IVP_IsSolutionOn import Definitions.Def_TeschlODE_IVP_LocallyLipschitzSecond
namespace TeschlODE.IVP
theorem picard_lindelof {n : ℕ} (U : Set (ℝ × EuclideanSpace ℝ (Fin n))) (hU : IsOpen U)
(f : ℝ × EuclideanSpace ℝ (Fin n) → EuclideanSpace ℝ (Fin n)) (hf : ContinuousOn f U)
(t₀ : ℝ) (x₀ : EuclideanSpace ℝ (Fin n)) (h₀ : (t₀, x₀) ∈ U)
(hLip : LocallyLipschitzSecond U f) :
-- local existence on an open interval around `t₀`
(∃ ε : ℝ, 0 < ε ∧ ∃ x : ℝ → EuclideanSpace ℝ (Fin n), x t₀ = x₀ ∧
IsSolutionOn U f (Set.Ioo (t₀ - ε) (t₀ + ε)) x) ∧
-- uniqueness on every interval containing `t₀`
(∀ I : Set ℝ, I.OrdConnected → t₀ ∈ I →
∀ x y : ℝ → EuclideanSpace ℝ (Fin n), x t₀ = x₀ → y t₀ = x₀ →
IsSolutionOn U f I x → IsSolutionOn U f I y → Set.EqOn x y I) ∧
-- existence time `T₀ = min {T, δ / M}` forward in time
(∀ T δ M : ℝ, 0 < T → 0 < δ →
Set.Icc t₀ (t₀ + T) ×ˢ Metric.closedBall x₀ δ ⊆ U →
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) ∧
-- and backward in time
(∀ T δ M : ℝ, 0 < T → 0 < δ →
Set.Icc (t₀ - T) t₀ ×ˢ Metric.closedBall x₀ δ ⊆ U →
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
Setting. Let and let carry the Euclidean norm. The hypotheses are:
- is open;
- is continuous on ;
- ;
- satisfies the local Lipschitz condition on in the following sense. For every compact there is a real with whenever .
Solution notion. Below, " solves the equation on with graph in " means the following, for :
- for every , ;
- for every , has derivative at relative to . At an endpoint of that belongs to , this derivative is one-sided. At an isolated point of it holds automatically.
Conclusion. The theorem asserts all four of the following.
-
Local existence. There are and such that and solves the equation on the open interval with graph in .
-
Uniqueness. Let be any order-connected set containing : an interval of any type, open, closed, half-open or unbounded, including the single point . Let satisfy , and suppose both solve the equation on with graph in . Then for all .
-
Forward existence time. Let be reals with and . Write for the closed Euclidean ball of radius around , and define the box
Assume , and assume is the maximum of on : is attained at some point of and bounds on all of . Set
Then there is with that solves the equation on with graph in the box (not merely in ).
- Backward existence time. The same statement holds with the box in place of . Assume and , and define by the same formula. Then there is with that solves the equation on with graph in .
Degenerate cases.
- Value of : in parts 3 and 4, is a value of a norm, so . The case is handled separately, so no division occurs.
- Uniqueness on a single point: with , uniqueness is immediate from . The empty is excluded because is assumed.
- Values outside the interval: the solutions produced in parts 1, 3 and 4 are arbitrary outside their intervals.
- : is one point, so every derivative condition holds automatically. The statement then concerns only membership of the graph in , or .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.