Theorem 3.15 (Floquet) — Π(t, t₀) = P(t, t₀) exp((t − t₀)Q(t₀)) with P periodic
ProvedTeschlODE.Linear.floquetLet be periodic, with , and let be the principal matrix solution of (the book's ). Then for every there are a matrix and a matrix function such that
where has the same period as , , and .
Floquet's theorem says that a periodic linear system is, up to a periodic change of variables, a system with constant coefficients: the long-time behaviour of all solutions is governed by the eigenvalues of (the Floquet exponents), equivalently of the monodromy matrix (the Floquet multipliers).
Formalization Note. and are complex: the book notes (p. 92) that "will be complex even if is real unless all real eigenvalues of are positive"; the real version with period is Corollary 3.16, which is a different statement and not part of this item. is real and is compared with the complex product after coercing its entries (Matrix.map by ℝ → ℂ). The periodicity of uses the same as ; without it the statement would be trivial (, ).
import Mathlib import Definitions.Def_TeschlODE_Linear_IsPrincipalMatrixSolution
namespace TeschlODE.Linear
/-- Teschl, Theorem 3.15 (Floquet), p. 92: let `A ∈ C(ℝ, ℝ^{n×n})` be periodic with period
`T > 0` (3.117) and let `Φ` be the principal matrix solution of `ẋ = A(t) x`. Then for every
`t₀` there are a complex matrix `Q(t₀)` and a complex matrix function `P(·, t₀)` with the same
period `T` as `A` and `P(t₀, t₀) = I` such that `Φ(t, t₀) = P(t, t₀) exp((t − t₀) Q(t₀))`
for all `t` (3.125), `Φ(t, t₀)` being regarded as a complex matrix. -/
theorem floquet {n : ℕ} (A : ℝ → Matrix (Fin n) (Fin n) ℝ) (hA : Continuous A) (T : ℝ)
(hT : 0 < T) (hper : ∀ t, A (t + T) = A t) (Φ : ℝ → ℝ → Matrix (Fin n) (Fin n) ℝ)
(hΦ : IsPrincipalMatrixSolution A Set.univ Φ) (t₀ : ℝ) :
∃ (P : ℝ → Matrix (Fin n) (Fin n) ℂ) (Q : Matrix (Fin n) (Fin n) ℂ),
(∀ t, P (t + T) = P t) ∧ P t₀ = 1 ∧
∀ t, (Φ t t₀).map (fun r : ℝ => (r : ℂ)) =
P t * NormedSpace.exp (((t - t₀ : ℝ) : ℂ) • Q) := by sorry
end TeschlODE.Linear
Read-back
What the Lean code literally says, in plain math · claude-opus-5-5
Here is a natural number and is the set of matrices over , with rows and columns indexed by . The statement takes the following data and hypotheses:
- a function that is continuous. Continuity is with respect to the entrywise (product) topology on matrices, so each entry is continuous.
- a real number with , such that is -periodic:
- a two-argument function , written . It is assumed to satisfy the predicate " is a principal matrix solution for on the whole real line". This predicate comes from the imported file
Def_TeschlODE_Linear_IsPrincipalMatrixSolution. Its definition is not shown in the code given to me, so this read-back cannot say exactly what it requires of . It can only report that this named predicate, applied to , the set and , is a hypothesis. - a real number .
The conclusion is that there exist a function and a single matrix with all three of these properties:
- is -periodic: for every .
- , the identity matrix.
- For every ,
Here is the real matrix read as a complex matrix, entry by entry. The product on the right is ordinary matrix multiplication. The factor is a real number used as a complex scalar. is the matrix exponential, i.e. the sum of the power series in .
and are chosen after , so they may depend on . The statement requires nothing else of them:
- need not be continuous, differentiable or invertible.
- has no required relation to or beyond what the equations above force.
- Neither nor is claimed to be unique.
- Nothing is said about for a second argument .
Degenerate cases:
- : every matrix is the empty matrix. Every matrix equation, including , then holds automatically, so the conclusion is trivially true for any and .
- The hypothesis on : the statement is vacuous for any for which no satisfies the principal-matrix-solution predicate. Since that definition is not visible here, I cannot say whether this happens.
- : this rules out the trivial period . A constant is allowed, because it is -periodic for every .
- Total functions: no division, subtraction of natural numbers, integral or supremum appears in the statement itself. The only subtraction is of real numbers, and the matrix exponential series converges for every complex matrix. So no default value from a total function arises in the displayed statement. Any such values inside the imported predicate are not visible here.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.