Asymptotic operators on and fundamental solutions
DefinitionAsymptoticOperator_SettingObjects for the spectral theory of asymptotic operators on the circle, following Wendl, Lectures on Symplectic Field Theory, §3.2.
- Circle and . with its Haar probability measure. is the real Hilbert space of square-integrable maps to with the Euclidean inner product.
- Loops of symmetric matrices. is continuous; it is a symmetric loop if for every .
- Fourier coefficients. , , and is the coefficient of .
- Sobolev space. is the set of with .
- Asymptotic operator. With
means and for all , i.e. (Wendl (3.4)). is the partially defined linear map on with this graph. 6. Eigenspaces and discrete spectrum. The -eigenspace is . has a discrete eigenbasis if has an orthonormal basis of vectors in the domain with , , and along the cofinite filter (only finitely many have , for every ). 7. Fundamental solution. with and for all .
Formalization Note is Lp (EuclideanSpace ℝ (Fin n ⊕ Fin n)) 2 haarAddCircle on UnitAddCircle. Fourier coefficients are Mathlib's fourierCoeff of the componentwise complexification, and (Matrix.J) and act on by the real-to-complex coercion. asymptoticOperator S is chosen as the LinearPMap whose graph is the set of pairs above and is if no such map exists; a separate theorem shows that it exists. Mat n, J₀, IsSymplectic and SP come from ConleyZehnder_Setting.
import Definitions.Def_ConleyZehnder_Setting
import Mathlib.Analysis.Fourier.AddCircle
import Mathlib.Analysis.InnerProductSpace.LinearPMap
import Mathlib.Analysis.InnerProductSpace.PiL2
import Mathlib.Analysis.Normed.Operator.Compact.Basic
import Mathlib.MeasureTheory.Function.L2Space
/-!
# Asymptotic operators on the circle
Wendl, *Lectures on Symplectic Field Theory*, arXiv:1612.01009, §3.2, equation (3.4):
for a loop `S : S¹ → ℝ^{2n×2n}` of symmetric matrices, the asymptotic operator
`A_S = -J₀ ∂ₜ - S(t)` acts on `L²(S¹, ℝ²ⁿ)` with domain `W^{1,2}(S¹, ℝ²ⁿ)`.
Conventions. `S¹ = ℝ/ℤ` (`UnitAddCircle`) with its Haar probability measure. `ℝ²ⁿ` is
`EuclideanSpace ℝ (Fin n ⊕ Fin n)` and `J₀ = Matrix.J`, as in `ConleyZehnder_Setting`.
The `k`-th Fourier coefficient of `f : S¹ → ℝ²ⁿ` is `f̂ₖ = ∫ e^{-2πikt} f(t) dt ∈ ℂ²ⁿ`,
computed componentwise on the complexification. `W^{1,2}` is the set of `f ∈ L²` with
`∑ₖ (1 + k²) |f̂ₖ|² < ∞`, and `A_S f = g` means `ĝₖ = -2πik J₀ f̂ₖ - (S f)^ₖ` for all `k`,
i.e. `g = -J₀ f' - S f` with the derivative taken in `L²`.
The fundamental solution of `S` is `Ψ : ℝ → ℝ^{2n×2n}` with `Ψ(0) = Id` and
`Ψ' = J₀ S Ψ`; these are the solutions of `(-J₀ ∂ₜ - S) Ψ = 0`.
-/
namespace AsymptoticOperator
noncomputable section
open MeasureTheory Matrix Classical ConleyZehnder
/-- `ℝ²ⁿ` with its Euclidean inner product, coordinates indexed by `Fin n ⊕ Fin n`. -/
abbrev Vec (n : ℕ) := EuclideanSpace ℝ (Fin n ⊕ Fin n)
/-- `L²(S¹, ℝ²ⁿ)` for `S¹ = ℝ/ℤ` with the Haar probability measure. -/
abbrev L2 (n : ℕ) := Lp (Vec n) 2 (AddCircle.haarAddCircle : Measure UnitAddCircle)
variable {n : ℕ}
/-- A loop `S : S¹ → ℝ^{2n×2n}` of symmetric matrices. -/
def IsSymLoop (S : C(UnitAddCircle, Mat n)) : Prop := ∀ t, (S t).IsSymm
/-- The complexification `ℝ²ⁿ → ℂ²ⁿ` of a vector. -/
def complexify (v : Vec n) : Fin n ⊕ Fin n → ℂ := fun i => ((v i : ℝ) : ℂ)
/-- The `k`-th Fourier coefficient `f̂ₖ = ∫ e^{-2πikt} f(t) dt ∈ ℂ²ⁿ`. -/
def coeff (f : UnitAddCircle → Vec n) (k : ℤ) : Fin n ⊕ Fin n → ℂ :=
fourierCoeff (fun t => complexify (f t)) k
/-- The `k`-th Fourier coefficient of `t ↦ S(t) f(t)`. -/
def coeffMul (S : C(UnitAddCircle, Mat n)) (f : UnitAddCircle → Vec n) (k : ℤ) :
Fin n ⊕ Fin n → ℂ :=
fourierCoeff (fun t => (S t).map (fun x : ℝ => (x : ℂ)) *ᵥ complexify (f t)) k
/-- `f ∈ W^{1,2}(S¹, ℝ²ⁿ)`: `∑ₖ (1 + k²) |f̂ₖ|² < ∞`. -/
def InW12 (f : L2 n) : Prop :=
Summable fun k : ℤ => (1 + (k : ℝ) ^ 2) * ∑ i, ‖coeff f k i‖ ^ 2
/-- `A_S f = g`: `f ∈ W^{1,2}` and `ĝₖ = -2πik J₀ f̂ₖ - (S f)^ₖ` for every `k ∈ ℤ`,
that is, `g = -J₀ f' - S f`. -/
def IsAsymptoticAction (S : C(UnitAddCircle, Mat n)) (f g : L2 n) : Prop :=
InW12 f ∧ ∀ k : ℤ, coeff g k =
-((2 * Real.pi * k : ℝ) * Complex.I) • ((J₀ n).map (fun x : ℝ => (x : ℂ)) *ᵥ coeff f k) -
coeffMul S f k
/-- The graph `{(f, A_S f)}` of the asymptotic operator, as a set of pairs. -/
def graphSet (S : C(UnitAddCircle, Mat n)) : Set (L2 n × L2 n) :=
{p | IsAsymptoticAction S p.1 p.2}
/-- Wendl (3.4): the asymptotic operator `A_S = -J₀ ∂ₜ - S` as an unbounded operator on
`L²(S¹, ℝ²ⁿ)`: the partially defined linear map whose graph is `graphSet S` (chosen,
with fallback `0` if no such map exists). -/
def asymptoticOperator (S : C(UnitAddCircle, Mat n)) : L2 n →ₗ.[ℝ] L2 n :=
if h : ∃ A : L2 n →ₗ.[ℝ] L2 n, (A.graph : Set (L2 n × L2 n)) = graphSet S then h.choose
else 0
/-- `A` has an orthonormal basis of eigenvectors in its domain with real eigenvalues
`ev i`, and `|ev i| → ∞` along the cofinite filter (each bounded set of eigenvalues is
attained by finitely many basis vectors). -/
def HasDiscreteEigenbasis (A : L2 n →ₗ.[ℝ] L2 n) : Prop :=
∃ (ι : Type) (b : HilbertBasis ι ℝ (L2 n)) (ev : ι → ℝ),
(∀ i, ∃ h : b i ∈ A.domain, A ⟨b i, h⟩ = ev i • b i) ∧
Filter.Tendsto (fun i => |ev i|) Filter.cofinite Filter.atTop
/-- The eigenspace `ker(A - μ)`, as a subspace of the domain of `A`. -/
def eigenspace (A : L2 n →ₗ.[ℝ] L2 n) (μ : ℝ) : Submodule ℝ A.domain :=
LinearMap.ker (A.toFun - μ • A.domain.subtype)
/-- `Ψ : ℝ → ℝ^{2n×2n}` is the fundamental solution of `S`: `Ψ(0) = Id` and
`Ψ'(t) = J₀ S(t) Ψ(t)` for all `t`. -/
def IsFundamentalSolution (S : C(UnitAddCircle, Mat n)) (Ψ : ℝ → Mat n) : Prop :=
Ψ 0 = 1 ∧ ∀ t : ℝ, HasDerivAt Ψ (J₀ n * S (t : UnitAddCircle) * Ψ t) t
end
end AsymptoticOperator
Read-back
What the Lean code literally says, in plain math · claude-opus-5-5
Read-back of the definition module (namespace AsymptoticOperator). Throughout, is arbitrary, including . Two notions are imported from the Conley–Zehnder setting: is the space of real matrices whose rows and columns are indexed by the disjoint union (first block, second block), and is the block matrix
The circle is ; "continuous loop" means a continuous map (matrix topology = entrywise topology). The measure on is the Haar probability measure (total mass ; it is Lebesgue measure on under the obvious identification).
Spaces.
- with coordinates indexed by and the standard Euclidean inner product and norm .
- : equivalence classes (modulo -a.e. equality) of measurable with , a real Hilbert space with inner product . Whenever a pointwise value of is used below, it is taken from a fixed (arbitrary) measurable representative. For , and .
Definitions.
-
Symmetric loop. For a continuous , " is a symmetric loop" means for every .
-
Complexification. For , is the vector with the same entries viewed as complex numbers.
-
Fourier coefficients. For any function and ,
a Bochner integral of a -valued function (here is well defined on ). By the Bochner-integral convention, if the integrand is not integrable the value is . For this is applied to a representative of (the value does not depend on the choice).
- Fourier coefficients of . For continuous and ,
where is with entries viewed in (same junk convention: if not integrable). For ( is a probability measure) and continuous , the integrands in 3 and 4 are integrable, so the junk value does not arise for elements of .
- The space . is "in " iff the family of nonnegative reals
is summable over , where is the complex modulus and runs over all coordinates. (For every qualifies.)
- The action relation. For continuous and , "" means: (as in 5) and for every ,
as an identity in , with the complexified matrix . No condition is imposed on other than these coefficient identities, and no symmetry of is assumed.
-
The graph set. , a plain subset of .
-
The asymptotic operator. is a partially defined real-linear operator on (a linear subspace , its domain, together with a linear map ). It is defined by cases: if there exists a partially defined linear operator whose graph equals as a set, then is one such operator picked by the axiom of choice; otherwise (fallback / junk value) is the zero operator, whose domain is all of and which sends every element to . (Remark: a partially defined operator is determined by its graph.)
-
Discrete eigenbasis. For a partially defined linear operator on , " has a discrete eigenbasis" means: there exist an index set , a Hilbert (complete orthonormal) basis of the real Hilbert space , and real numbers such that
- every lies in the domain of and ; and
- along the cofinite filter on , i.e. for every only finitely many have (if is finite this condition holds automatically; for , is admissible).
-
Eigenspace. For as in 9 and , is the kernel of on the domain of , i.e. , regarded as a linear subspace of (not of ).
-
Fundamental solution. For continuous and any function , " is a fundamental solution of " means and, for every real , is differentiable at with
where is the class of in (so is evaluated -periodically) and the products are matrix products.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.