Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 3.9 — global existence and uniqueness for ẋ = A(t)x

Proved
TeschlODE.Linear.exists_unique_solution

by mikedeng1 · Sep 28, 2026 · Mathlib 0df444a (Lean v4.33.1)

existencelinear-systemsordinary-differential-equationsp2o-batch-books5p2o-gran-per-chapterp2o-plan-bookp2o-v1uniqueness

Let I⊆RI \subseteq \mathbb{R}I⊆R be an interval, A∈C(I,Rn×n)A \in C(I, \mathbb{R}^{n\times n})A∈C(I,Rn×n), t0∈It_0 \in It0​∈I and x0∈Rnx_0 \in \mathbb{R}^nx0​∈Rn. Then the linear system

x˙(t)=A(t)x(t),x(t0)=x0,\dot x(t) = A(t)x(t), \qquad x(t_0) = x_0,x˙(t)=A(t)x(t),x(t0​)=x0​,

has a solution defined on all of III, and any two solutions on III with the same initial value agree on III.

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 AAA 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 III 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 III (Set.EqOn).

Preamble
import Mathlib
import Definitions.Def_TeschlODE_Linear_IsSolution
Formal statement
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
Source
Teschl, Ordinary Differential Equations and Dynamical Systems (author's preliminary version of AMS GSM 140, 2012), p. 81, Theorem 3.9
Read-back

What the Lean code literally says, in plain math · claude-opus-5-5

Setting. Let n∈Nn \in \mathbb{N}n∈N, let A:R→Rn×nA : \mathbb{R} \to \mathbb{R}^{n\times n}A:R→Rn×n be a matrix-valued function, and let I⊆RI \subseteq \mathbb{R}I⊆R. The theorem assumes:

  • III is order-connected: whenever a,b∈Ia, b \in Ia,b∈I, every point between aaa and bbb lies in III. This makes III an interval of any kind (open, closed, half-open, unbounded, a single point, or empty).
  • AAA is continuous on III, with respect to the relative topology of III.
  • t0∈It_0 \in It0​∈I and x0∈Rnx_0 \in \mathbb{R}^nx0​∈Rn are given.

Claim. There exists a function x:R→Rnx : \mathbb{R} \to \mathbb{R}^nx:R→Rn such that:

  1. xxx is a solution on III. That is, for every t∈It \in It∈I, xxx has derivative A(t) x(t)A(t)\,x(t)A(t)x(t) at ttt relative to III (limits taken only along points of III, so one-sided at an endpoint of III that belongs to III).
  2. x(t0)=x0x(t_0) = x_0x(t0​)=x0​.
  3. Every function y:R→Rny : \mathbb{R} \to \mathbb{R}^ny:R→Rn that is a solution on III in the same sense and satisfies y(t0)=x0y(t_0) = x_0y(t0​)=x0​ agrees with xxx at every point of III:
y(t)=x(t)for all t∈I.y(t) = x(t) \quad \text{for all } t \in I.y(t)=x(t)for all t∈I.

Uniqueness is asserted only on III; values outside III are unconstrained.

Degenerate cases. III cannot be empty, because it contains t0t_0t0​.

  • I={t0}I = \{t_0\}I={t0​}: 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 xxx with x(t0)=x0x(t_0) = x_0x(t0​)=x0​, and uniqueness at the single point t0t_0t0​.
  • n=0n = 0n=0: R0\mathbb{R}^0R0 has one element, and the statement holds trivially.
Human review
  • Endorsed by Shuze Chen · Oct 2, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 2, 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