Theorem 3.9 — global existence and uniqueness for ẋ = A(t)x
ProvedTeschlODE.Linear.exists_unique_solutionLet be an interval, , and . Then the linear system
has a solution defined on all of , and any two solutions on with the same initial value agree on .
This is the linear case of the Picard–Lindelöf theory of Chapter 2; the point of the theorem is that no blow-up occurs, so the solution lives on the whole interval on which is continuous.
Formalization Note. "Interval" is Set.OrdConnected I (any kind of interval, bounded or not, open, closed or half-open); continuity is ContinuousOn A I. Existence on all of and uniqueness are stated together: existence of an IsSolution A I x with x t₀ = x₀, and every other such solution coincides with it on (Set.EqOn).
import Mathlib import Definitions.Def_TeschlODE_Linear_IsSolution
namespace TeschlODE.Linear
/-- Teschl, Theorem 3.9 (p. 81): for `A ∈ C(I, ℝ^{n×n})` on an interval `I` and `t₀ ∈ I`, the
system (3.79) has a unique solution with `x(t₀) = x₀`, and it is defined on all of `I`. -/
theorem exists_unique_solution {n : ℕ} (A : ℝ → Matrix (Fin n) (Fin n) ℝ) (I : Set ℝ)
(hI : I.OrdConnected) (hA : ContinuousOn A I) (t₀ : ℝ) (ht₀ : t₀ ∈ I) (x₀ : Fin n → ℝ) :
∃ x : ℝ → Fin n → ℝ, IsSolution A I x ∧ x t₀ = x₀ ∧
∀ y : ℝ → Fin n → ℝ, IsSolution A I y → y t₀ = x₀ → Set.EqOn y x I := by sorry
end TeschlODE.Linear
Read-back
What the Lean code literally says, in plain math · claude-opus-5-5
Setting. Let , let be a matrix-valued function, and let . The theorem assumes:
- is order-connected: whenever , every point between and lies in . This makes an interval of any kind (open, closed, half-open, unbounded, a single point, or empty).
- is continuous on , with respect to the relative topology of .
- and are given.
Claim. There exists a function such that:
- is a solution on . That is, for every , has derivative at relative to (limits taken only along points of , so one-sided at an endpoint of that belongs to ).
- .
- Every function that is a solution on in the same sense and satisfies agrees with at every point of :
Uniqueness is asserted only on ; values outside are unconstrained.
Degenerate cases. cannot be empty, because it contains .
- : every function is a solution, since the derivative condition relative to a single point is automatic. The claim then reduces to the existence of some with , and uniqueness at the single point .
- : has one element, and the statement holds trivially.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.