Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Asymptotic operators −J0∂t−S-J_0\partial_t - S−J0​∂t​−S on L2(S1,R2n)L^2(S^1,\mathbb{R}^{2n})L2(S1,R2n) and fundamental solutions

Definition
AsymptoticOperator_Setting

by Mazecto · Oct 9, 2026 · Mathlib 0df444a (Lean v4.33.1)

asymptotic-operatorconley-zehnder-indexspectral-theorysymplectic-geometryunbounded-operator

Objects for the spectral theory of asymptotic operators on the circle, following Wendl, Lectures on Symplectic Field Theory, §3.2.

  1. Circle and L2L^2L2. S1=R/ZS^1=\mathbb{R}/\mathbb{Z}S1=R/Z with its Haar probability measure. L2=L2(S1,R2n)L^2=L^2(S^1,\mathbb{R}^{2n})L2=L2(S1,R2n) is the real Hilbert space of square-integrable maps to R2n\mathbb{R}^{2n}R2n with the Euclidean inner product.
  2. Loops of symmetric matrices. S:S1→R2n×2nS:S^1\to\mathbb{R}^{2n\times2n}S:S1→R2n×2n is continuous; it is a symmetric loop if S(t)T=S(t)S(t)^{\mathsf T}=S(t)S(t)T=S(t) for every ttt.
  3. Fourier coefficients. f^k=∫S1e−2πiktf(t) dt∈C2n\hat f_k=\int_{S^1}e^{-2\pi ikt}f(t)\,dt\in\mathbb{C}^{2n}f^​k​=∫S1​e−2πiktf(t)dt∈C2n, k∈Zk\in\mathbb{Z}k∈Z, and (Sf)k∧(Sf)^\wedge_k(Sf)k∧​ is the coefficient of t↦S(t)f(t)t\mapsto S(t)f(t)t↦S(t)f(t).
  4. Sobolev space. W1,2W^{1,2}W1,2 is the set of f∈L2f\in L^2f∈L2 with ∑k(1+k2)∣f^k∣2<∞\sum_k(1+k^2)|\hat f_k|^2<\infty∑k​(1+k2)∣f^​k​∣2<∞.
  5. Asymptotic operator. With
J0=(0−IdId0),J_0=\begin{pmatrix}0&-\mathrm{Id}\\ \mathrm{Id}&0\end{pmatrix},J0​=(0Id​−Id0​),

ASf=gA_Sf=gAS​f=g means f∈W1,2f\in W^{1,2}f∈W1,2 and g^k=−2πik J0f^k−(Sf)k∧\hat g_k=-2\pi ik\,J_0\hat f_k-(Sf)^\wedge_kg^​k​=−2πikJ0​f^​k​−(Sf)k∧​ for all kkk, i.e. AS=−J0∂t−S(t)A_S=-J_0\partial_t-S(t)AS​=−J0​∂t​−S(t) (Wendl (3.4)). ASA_SAS​ is the partially defined linear map on L2L^2L2 with this graph. 6. Eigenspaces and discrete spectrum. The μ\muμ-eigenspace is ker⁡(AS−μ)⊂W1,2\ker(A_S-\mu)\subset W^{1,2}ker(AS​−μ)⊂W1,2. AAA has a discrete eigenbasis if L2L^2L2 has an orthonormal basis (ei)(e_i)(ei​) of vectors in the domain with Aei=λieiAe_i=\lambda_ie_iAei​=λi​ei​, λi∈R\lambda_i\in\mathbb{R}λi​∈R, and ∣λi∣→∞|\lambda_i|\to\infty∣λi​∣→∞ along the cofinite filter (only finitely many iii have ∣λi∣≤c|\lambda_i|\le c∣λi​∣≤c, for every ccc). 7. Fundamental solution. Ψ:R→R2n×2n\Psi:\mathbb{R}\to\mathbb{R}^{2n\times2n}Ψ:R→R2n×2n with Ψ(0)=Id\Psi(0)=\mathrm{Id}Ψ(0)=Id and Ψ′(t)=J0S(t)Ψ(t)\Psi'(t)=J_0S(t)\Psi(t)Ψ′(t)=J0​S(t)Ψ(t) for all t∈Rt\in\mathbb{R}t∈R.

Formalization Note L2L^2L2 is Lp (EuclideanSpace ℝ (Fin n ⊕ Fin n)) 2 haarAddCircle on UnitAddCircle. Fourier coefficients are Mathlib's fourierCoeff of the componentwise complexification, and J0J_0J0​ (Matrix.J) and S(t)S(t)S(t) act on C2n\mathbb{C}^{2n}C2n by the real-to-complex coercion. asymptoticOperator S is chosen as the LinearPMap whose graph is the set of pairs (f,g)(f,g)(f,g) above and is 000 if no such map exists; a separate theorem shows that it exists. Mat n, J₀, IsSymplectic and SP come from ConleyZehnder_Setting.

Definition code
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
Source
Wendl, Lectures on Symplectic Field Theory, arXiv:1612.01009, https://arxiv.org/abs/1612.01009, Lecture 3: Section 3.2, equation (3.4), p. 46; Section 3.4, Exercise 3.29, p. 61; Hofer-Wysocki-Zehnder, Properties of pseudoholomorphic curves in symplectisations II, GAFA 5 (1995) 270-328, https://doi.org/10.1007/BF01895669, Section 3, pp. 285-288, equation (35)
Read-back

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

Read-back of the definition module (namespace AsymptoticOperator). Throughout, n∈Nn \in \mathbb{N}n∈N is arbitrary, including n=0n = 0n=0. Two notions are imported from the Conley–Zehnder setting: Matn\mathrm{Mat}_nMatn​ is the space of real 2n×2n2n \times 2n2n×2n matrices whose rows and columns are indexed by the disjoint union {1,…,n}⊔{1,…,n}\{1,\dots,n\} \sqcup \{1,\dots,n\}{1,…,n}⊔{1,…,n} (first block, second block), and J0J_0J0​ is the block matrix

J0=(0−InIn0).J_0 = \begin{pmatrix} 0 & -I_n \\ I_n & 0 \end{pmatrix}.J0​=(0In​​−In​0​).

The circle is S1=R/ZS^1 = \mathbb{R}/\mathbb{Z}S1=R/Z; "continuous loop" means a continuous map S1→MatnS^1 \to \mathrm{Mat}_nS1→Matn​ (matrix topology = entrywise topology). The measure on S1S^1S1 is the Haar probability measure λ\lambdaλ (total mass 111; it is Lebesgue measure on [0,1)[0,1)[0,1) under the obvious identification).

Spaces.

  • Vn=R2nV_n = \mathbb{R}^{2n}Vn​=R2n with coordinates indexed by {1,…,n}⊔{1,…,n}\{1,\dots,n\} \sqcup \{1,\dots,n\}{1,…,n}⊔{1,…,n} and the standard Euclidean inner product ⟨u,v⟩=∑iuivi\langle u, v\rangle = \sum_i u_i v_i⟨u,v⟩=∑i​ui​vi​ and norm ∣v∣=(∑ivi2)1/2|v| = (\sum_i v_i^2)^{1/2}∣v∣=(∑i​vi2​)1/2.
  • Ln2=L2(S1,λ;Vn)L^2_n = L^2(S^1, \lambda; V_n)Ln2​=L2(S1,λ;Vn​): equivalence classes (modulo λ\lambdaλ-a.e. equality) of measurable f:S1→Vnf : S^1 \to V_nf:S1→Vn​ with ∫∣f∣2 dλ<∞\int |f|^2\, d\lambda < \infty∫∣f∣2dλ<∞, a real Hilbert space with inner product ⟨f,g⟩L2=∫S1⟨f(t),g(t)⟩ dλ(t)\langle f, g\rangle_{L^2} = \int_{S^1} \langle f(t), g(t)\rangle\, d\lambda(t)⟨f,g⟩L2​=∫S1​⟨f(t),g(t)⟩dλ(t). Whenever a pointwise value of f∈Ln2f \in L^2_nf∈Ln2​ is used below, it is taken from a fixed (arbitrary) measurable representative. For n=0n = 0n=0, V0={0}V_0 = \{0\}V0​={0} and L02={0}L^2_0 = \{0\}L02​={0}.

Definitions.

  1. Symmetric loop. For a continuous S:S1→MatnS : S^1 \to \mathrm{Mat}_nS:S1→Matn​, "SSS is a symmetric loop" means S(t)T=S(t)S(t)^{\mathsf T} = S(t)S(t)T=S(t) for every t∈S1t \in S^1t∈S1.

  2. Complexification. For v∈Vnv \in V_nv∈Vn​, vC∈C2nv^{\mathbb C} \in \mathbb{C}^{2n}vC∈C2n is the vector with the same entries viewed as complex numbers.

  3. Fourier coefficients. For any function f:S1→Vnf : S^1 \to V_nf:S1→Vn​ and k∈Zk \in \mathbb{Z}k∈Z,

f^k=∫S1e−2πikt f(t)C dλ(t)∈C2n,\hat f_k = \int_{S^1} e^{-2\pi i k t}\, f(t)^{\mathbb C}\, d\lambda(t) \in \mathbb{C}^{2n},f^​k​=∫S1​e−2πiktf(t)Cdλ(t)∈C2n,

a Bochner integral of a C2n\mathbb{C}^{2n}C2n-valued function (here e−2πikte^{-2\pi i k t}e−2πikt is well defined on R/Z\mathbb{R}/\mathbb{Z}R/Z). By the Bochner-integral convention, if the integrand is not integrable the value is 0∈C2n0 \in \mathbb{C}^{2n}0∈C2n. For f∈Ln2f \in L^2_nf∈Ln2​ this is applied to a representative of fff (the value does not depend on the choice).

  1. Fourier coefficients of SfSfSf. For continuous S:S1→MatnS : S^1 \to \mathrm{Mat}_nS:S1→Matn​ and f:S1→Vnf : S^1 \to V_nf:S1→Vn​,
(Sf)^k=∫S1e−2πikt S(t)Cf(t)C dλ(t)∈C2n,\widehat{(Sf)}_k = \int_{S^1} e^{-2\pi i k t}\, S(t)^{\mathbb C} f(t)^{\mathbb C}\, d\lambda(t) \in \mathbb{C}^{2n},(Sf)​k​=∫S1​e−2πiktS(t)Cf(t)Cdλ(t)∈C2n,

where S(t)CS(t)^{\mathbb C}S(t)C is S(t)S(t)S(t) with entries viewed in C\mathbb{C}C (same junk convention: 000 if not integrable). For f∈Ln2f \in L^2_nf∈Ln2​ (λ\lambdaλ is a probability measure) and continuous SSS, the integrands in 3 and 4 are integrable, so the junk value does not arise for elements of Ln2L^2_nLn2​.

  1. The space W1,2W^{1,2}W1,2. f∈Ln2f \in L^2_nf∈Ln2​ is "in W1,2W^{1,2}W1,2" iff the family of nonnegative reals
k↦(1+k2)∑i∣(f^k)i∣2,k∈Z,k \mapsto (1 + k^2) \sum_{i} \big|(\hat f_k)_i\big|^2, \qquad k \in \mathbb{Z},k↦(1+k2)i∑​​(f^​k​)i​​2,k∈Z,

is summable over Z\mathbb{Z}Z, where ∣⋅∣|\cdot|∣⋅∣ is the complex modulus and iii runs over all 2n2n2n coordinates. (For n=0n = 0n=0 every fff qualifies.)

  1. The action relation. For continuous SSS and f,g∈Ln2f, g \in L^2_nf,g∈Ln2​, "ASf=gA_S f = gAS​f=g" means: f∈W1,2f \in W^{1,2}f∈W1,2 (as in 5) and for every k∈Zk \in \mathbb{Z}k∈Z,
g^k=−(2πk i) J0C f^k  −  (Sf)^k\hat g_k = -(2\pi k\, i)\, J_0^{\mathbb C}\, \hat f_k \;-\; \widehat{(Sf)}_kg^​k​=−(2πki)J0C​f^​k​−(Sf)​k​

as an identity in C2n\mathbb{C}^{2n}C2n, with J0CJ_0^{\mathbb C}J0C​ the complexified matrix J0J_0J0​. No condition is imposed on ggg other than these coefficient identities, and no symmetry of SSS is assumed.

  1. The graph set. ΓS={(f,g)∈Ln2×Ln2:ASf=g in the sense of 6}\Gamma_S = \{(f, g) \in L^2_n \times L^2_n : A_S f = g \text{ in the sense of } 6\}ΓS​={(f,g)∈Ln2​×Ln2​:AS​f=g in the sense of 6}, a plain subset of Ln2×Ln2L^2_n \times L^2_nLn2​×Ln2​.

  2. The asymptotic operator. AS\mathcal A_SAS​ is a partially defined real-linear operator on Ln2L^2_nLn2​ (a linear subspace D⊆Ln2D \subseteq L^2_nD⊆Ln2​, its domain, together with a linear map D→Ln2D \to L^2_nD→Ln2​). It is defined by cases: if there exists a partially defined linear operator AAA whose graph {(x,Ax):x∈dom⁡A}\{(x, Ax) : x \in \operatorname{dom} A\}{(x,Ax):x∈domA} equals ΓS\Gamma_SΓS​ as a set, then AS\mathcal A_SAS​ is one such operator picked by the axiom of choice; otherwise (fallback / junk value) AS\mathcal A_SAS​ is the zero operator, whose domain is all of Ln2L^2_nLn2​ and which sends every element to 000. (Remark: a partially defined operator is determined by its graph.)

  3. Discrete eigenbasis. For a partially defined linear operator AAA on Ln2L^2_nLn2​, "AAA has a discrete eigenbasis" means: there exist an index set ι\iotaι, a Hilbert (complete orthonormal) basis (bi)i∈ι(b_i)_{i\in\iota}(bi​)i∈ι​ of the real Hilbert space Ln2L^2_nLn2​, and real numbers (evi)i∈ι(\mathrm{ev}_i)_{i\in\iota}(evi​)i∈ι​ such that

    • every bib_ibi​ lies in the domain of AAA and Abi=evi biA b_i = \mathrm{ev}_i\, b_iAbi​=evi​bi​; and
    • ∣evi∣→∞|\mathrm{ev}_i| \to \infty∣evi​∣→∞ along the cofinite filter on ι\iotaι, i.e. for every RRR only finitely many iii have ∣evi∣≤R|\mathrm{ev}_i| \le R∣evi​∣≤R (if ι\iotaι is finite this condition holds automatically; for n=0n = 0n=0, ι=∅\iota = \varnothingι=∅ is admissible).
  4. Eigenspace. For AAA as in 9 and μ∈R\mu \in \mathbb{R}μ∈R, Eμ(A)E_\mu(A)Eμ​(A) is the kernel of x↦Ax−μxx \mapsto Ax - \mu xx↦Ax−μx on the domain of AAA, i.e. {x∈dom⁡A:Ax=μx}\{x \in \operatorname{dom} A : Ax = \mu x\}{x∈domA:Ax=μx}, regarded as a linear subspace of dom⁡A\operatorname{dom} AdomA (not of Ln2L^2_nLn2​).

  5. Fundamental solution. For continuous S:S1→MatnS : S^1 \to \mathrm{Mat}_nS:S1→Matn​ and any function Ψ:R→Matn\Psi : \mathbb{R} \to \mathrm{Mat}_nΨ:R→Matn​, "Ψ\PsiΨ is a fundamental solution of SSS" means Ψ(0)=I2n\Psi(0) = I_{2n}Ψ(0)=I2n​ and, for every real ttt, Ψ\PsiΨ is differentiable at ttt with

Ψ′(t)=J0 S([t]) Ψ(t),\Psi'(t) = J_0\, S([t])\, \Psi(t),Ψ′(t)=J0​S([t])Ψ(t),

where [t][t][t] is the class of ttt in R/Z\mathbb{R}/\mathbb{Z}R/Z (so SSS is evaluated 111-periodically) and the products are matrix products.

Human review
  • Endorsed by Shuze Chen · Oct 10, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Mazecto · Oct 10, 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