Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 3.10 — solutions form an n-dimensional space; the principal matrix solution

Proved
TeschlODE.Linear.solution_space_and_principal_matrix

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

linear-systemsordinary-differential-equationsp2o-batch-books5p2o-gran-per-chapterp2o-plan-bookp2o-v1principal-matrix-solution

Let I⊆RI \subseteq \mathbb{R}I⊆R be a nonempty interval and A∈C(I,Rn×n)A \in C(I, \mathbb{R}^{n\times n})A∈C(I,Rn×n). Then the solutions of x˙=A(t)x\dot x = A(t)xx˙=A(t)x on III form an nnn-dimensional vector space, and there is a matrix-valued solution Φ(t,t0)\Phi(t,t_0)Φ(t,t0​) such that the solution with x(t0)=x0x(t_0)=x_0x(t0​)=x0​ is

x(t)=Φ(t,t0) x0,t,t0∈I.x(t) = \Phi(t,t_0)\,x_0, \qquad t, t_0 \in I.x(t)=Φ(t,t0​)x0​,t,t0​∈I.

The matrix Φ\PhiΦ is the principal matrix solution (3.83); it is the object in terms of which the rest of the chapter (variation of constants, Floquet theory) is phrased.

Formalization Note. "Form an nnn-dimensional vector space" is stated as three facts about solutions restricted to III: linear combinations of solutions are solutions; there are nnn solutions ψ1,…,ψn\psi_1,\dots,\psi_nψ1​,…,ψn​ whose restrictions to III are linearly independent; every solution equals ∑jcjψj\sum_j c_j\psi_j∑j​cj​ψj​ on III for some coefficients ccc. The matrix part gives a Φ\PhiΦ satisfying IsPrincipalMatrixSolution A I Φ and representing every solution as x(t)=Φ(t,t0)x(t0)x(t) = \Phi(t,t_0)x(t_0)x(t)=Φ(t,t0​)x(t0​) for t0,t∈It_0, t \in It0​,t∈I. Nonemptiness of III is the book's implicit assumption (for I=∅I = \emptysetI=∅ the space is 000-dimensional).

Preamble
import Mathlib
import Definitions.Def_TeschlODE_Linear_IsSolution
import Definitions.Def_TeschlODE_Linear_IsPrincipalMatrixSolution
Formal statement
namespace TeschlODE.Linear

/-- Teschl, Theorem 3.10 (p. 82): the solutions of (3.79) on the interval `I` form an
`n`-dimensional vector space (closed under linear combinations, with a basis of `n` solutions
whose restrictions to `I` are linearly independent and span every solution on `I`), and there
is a matrix-valued solution `Φ(t, t₀)` (the principal matrix solution) such that the solution
with `x(t₀) = x₀` is `Φ(t, t₀) x₀` on `I`. -/
theorem solution_space_and_principal_matrix {n : ℕ} (A : ℝ → Matrix (Fin n) (Fin n) ℝ)
    (I : Set ℝ) (hI : I.OrdConnected) (hIne : I.Nonempty) (hA : ContinuousOn A I) :
    (∀ (x y : ℝ → Fin n → ℝ) (a b : ℝ), IsSolution A I x → IsSolution A I y →
      IsSolution A I (a • x + b • y)) ∧
    (∃ ψ : Fin n → ℝ → Fin n → ℝ, (∀ j, IsSolution A I (ψ j)) ∧
      LinearIndependent ℝ (fun j (t : I) => ψ j t) ∧
      ∀ x : ℝ → Fin n → ℝ, IsSolution A I x →
        ∃ c : Fin n → ℝ, ∀ t ∈ I, x t = ∑ j, c j • ψ j t) ∧
    (∃ Φ : ℝ → ℝ → Matrix (Fin n) (Fin n) ℝ, IsPrincipalMatrixSolution A I Φ ∧
      ∀ t₀ ∈ I, ∀ x : ℝ → Fin n → ℝ, IsSolution A I x →
        ∀ t ∈ I, x t = Matrix.mulVec (Φ t t₀) (x t₀)) := by sorry

end TeschlODE.Linear
Source
Teschl, Ordinary Differential Equations and Dynamical Systems (author's preliminary version of AMS GSM 140, 2012), p. 82, Theorem 3.10
Read-back

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

Terminology. Throughout, "xxx is a solution on III" means: 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 are taken only along points of III, so the derivative is one-sided at an endpoint of III that belongs to III.

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, and let I⊆RI \subseteq \mathbb{R}I⊆R. The theorem assumes:

  • III is order-connected (an interval: with any two points it contains every point between them);
  • III is nonempty;
  • AAA is continuous on III.

Claim. Three statements hold together.

(a) Closure under linear combinations. For all functions x,y:R→Rnx, y : \mathbb{R} \to \mathbb{R}^nx,y:R→Rn and all real numbers a,ba, ba,b: if xxx and yyy are solutions on III, then the pointwise combination t↦a x(t)+b y(t)t \mapsto a\,x(t) + b\,y(t)t↦ax(t)+by(t) is a solution on III.

(b) A basis of nnn solutions. There exist nnn functions ψ1,…,ψn:R→Rn\psi_1, \dots, \psi_n : \mathbb{R} \to \mathbb{R}^nψ1​,…,ψn​:R→Rn such that:

  • each ψj\psi_jψj​ is a solution on III;
  • the restrictions ψ1∣I,…,ψn∣I\psi_1|_I, \dots, \psi_n|_Iψ1​∣I​,…,ψn​∣I​, viewed as functions from III to Rn\mathbb{R}^nRn, are linearly independent over R\mathbb{R}R. That is, if ∑jcjψj(t)=0\sum_j c_j \psi_j(t) = 0∑j​cj​ψj​(t)=0 for all t∈It \in It∈I, then all cj=0c_j = 0cj​=0;
  • for every solution xxx on III there are real coefficients c1,…,cnc_1, \dots, c_nc1​,…,cn​ with
x(t)=∑j=1ncj ψj(t)for all t∈I.x(t) = \sum_{j=1}^n c_j\,\psi_j(t) \quad \text{for all } t \in I.x(t)=j=1∑n​cj​ψj​(t)for all t∈I.

(c) A principal matrix solution. There exists Φ:R×R→Rn×n\Phi : \mathbb{R}\times\mathbb{R} \to \mathbb{R}^{n\times n}Φ:R×R→Rn×n such that two things hold.

First, Φ\PhiΦ is a principal matrix solution for AAA on III. That is, for every t0∈It_0 \in It0​∈I:

  • Φ(t0,t0)\Phi(t_0,t_0)Φ(t0​,t0​) is the identity matrix;
  • for every t∈It \in It∈I and all indices i,ji,ji,j, the function s↦Φ(s,t0)ijs \mapsto \Phi(s,t_0)_{ij}s↦Φ(s,t0​)ij​ has derivative (A(t)Φ(t,t0))ij\bigl(A(t)\Phi(t,t_0)\bigr)_{ij}(A(t)Φ(t,t0​))ij​ at ttt relative to III.

Second, for every t0∈It_0 \in It0​∈I, every solution xxx on III, and every t∈It \in It∈I:

x(t)=Φ(t,t0) x(t0).x(t) = \Phi(t, t_0)\, x(t_0).x(t)=Φ(t,t0​)x(t0​).

Degenerate cases.

  • Part (a) and the hypotheses: part (a) does not depend on any of the hypotheses.
  • I={a}I = \{a\}I={a} (a single point): every function is a solution, because a derivative relative to a single point imposes no condition. Then:
    • (b) asks for nnn functions whose values ψj(a)\psi_j(a)ψj​(a) are linearly independent and span Rn\mathbb{R}^nRn;
    • (c) asks for Φ\PhiΦ with Φ(a,a)=1\Phi(a,a) = \mathbb{1}Φ(a,a)=1, and then reads x(a)=x(a)x(a) = x(a)x(a)=x(a).
  • n=0n = 0n=0: the family ψ\psiψ is empty. The empty family is linearly independent, the empty sum is 000, which is the only element of R0\mathbb{R}^0R0, and all 0×00\times00×0 matrices coincide with the identity. So all three parts hold 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