Theorem 3.10 — solutions form an n-dimensional space; the principal matrix solution
ProvedTeschlODE.Linear.solution_space_and_principal_matrixLet be a nonempty interval and . Then the solutions of on form an -dimensional vector space, and there is a matrix-valued solution such that the solution with is
The matrix 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 -dimensional vector space" is stated as three facts about solutions restricted to : linear combinations of solutions are solutions; there are solutions whose restrictions to are linearly independent; every solution equals on for some coefficients . The matrix part gives a satisfying IsPrincipalMatrixSolution A I Φ and representing every solution as for . Nonemptiness of is the book's implicit assumption (for the space is -dimensional).
import Mathlib import Definitions.Def_TeschlODE_Linear_IsSolution import Definitions.Def_TeschlODE_Linear_IsPrincipalMatrixSolution
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
Read-back
What the Lean code literally says, in plain math · claude-opus-5-5
Terminology. Throughout, " is a solution on " means: for every , has derivative at relative to . Limits are taken only along points of , so the derivative is one-sided at an endpoint of that belongs to .
Setting. Let , let , and let . The theorem assumes:
- is order-connected (an interval: with any two points it contains every point between them);
- is nonempty;
- is continuous on .
Claim. Three statements hold together.
(a) Closure under linear combinations. For all functions and all real numbers : if and are solutions on , then the pointwise combination is a solution on .
(b) A basis of solutions. There exist functions such that:
- each is a solution on ;
- the restrictions , viewed as functions from to , are linearly independent over . That is, if for all , then all ;
- for every solution on there are real coefficients with
(c) A principal matrix solution. There exists such that two things hold.
First, is a principal matrix solution for on . That is, for every :
- is the identity matrix;
- for every and all indices , the function has derivative at relative to .
Second, for every , every solution on , and every :
Degenerate cases.
- Part (a) and the hypotheses: part (a) does not depend on any of the hypotheses.
- (a single point): every function is a solution, because a derivative relative to a single point imposes no condition. Then:
- (b) asks for functions whose values are linearly independent and span ;
- (c) asks for with , and then reads .
- : the family is empty. The empty family is linearly independent, the empty sum is , which is the only element of , and all matrices coincide with the identity. So all three parts hold trivially.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.