Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The asymptotic operator has compact resolvent

Proved
AsymptoticOperator.compact_resolvent

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

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

Let S:S1→R2n×2nS:S^1\to\mathbb{R}^{2n\times2n}S:S1→R2n×2n be continuous with S(t)T=S(t)S(t)^{\mathsf T}=S(t)S(t)T=S(t) for all ttt, and let μ∈R\mu\in\mathbb{R}μ∈R be such that ASf=μfA_Sf=\mu fAS​f=μf has no solution f≠0f\ne0f=0 in W1,2W^{1,2}W1,2. Then there is a compact bounded operator RRR on L2(S1,R2n)L^2(S^1,\mathbb{R}^{2n})L2(S1,R2n) with R(L2)⊂W1,2R(L^2)\subset W^{1,2}R(L2)⊂W1,2, (AS−μ)Rg=g(A_S-\mu)Rg=g(AS​−μ)Rg=g for all g∈L2g\in L^2g∈L2, and R(AS−μ)f=fR(A_S-\mu)f=fR(AS​−μ)f=f for all f∈W1,2f\in W^{1,2}f∈W1,2.

So AS−μ:W1,2→L2A_S-\mu:W^{1,2}\to L^2AS​−μ:W1,2→L2 is bijective with compact inverse.

Preamble
import Definitions.Def_AsymptoticOperator_Setting
Formal statement
namespace AsymptoticOperator

open ConleyZehnder

/-- Hofer–Wysocki–Zehnder (GAFA 1995), §3, p. 285 for `n = 1`: if `μ ∈ ℝ` is not an eigenvalue of `A_S`, then `A_S - μ : W^{1,2} → L²` is a
bijection whose inverse is a compact operator on `L²(S¹, ℝ²ⁿ)`. -/
theorem compact_resolvent {n : ℕ} (S : C(UnitAddCircle, Mat n)) (hS : IsSymLoop S) (μ : ℝ)
    (hμ : eigenspace (asymptoticOperator S) μ = ⊥) :
    ∃ R : L2 n →L[ℝ] L2 n, IsCompactOperator R ∧
      (∀ g : L2 n, ∃ h : R g ∈ (asymptoticOperator S).domain,
        (asymptoticOperator S) ⟨R g, h⟩ - μ • R g = g) ∧
      ∀ f : (asymptoticOperator S).domain,
        R ((asymptoticOperator S) f - μ • (f : L2 n)) = f := by sorry

end AsymptoticOperator
Source
Wendl, Lectures on Symplectic Field Theory, arXiv:1612.01009, https://arxiv.org/abs/1612.01009, §3.2, p. 46 and Lemma 3.16 (the compact resolvent is not stated there explicitly); Hofer-Wysocki-Zehnder, Properties of pseudoholomorphic curves in symplectisations II, GAFA 5 (1995) 270-328, https://doi.org/10.1007/BF01895669, Section 3, p. 285, after equation (35) (n = 1)
Read-back

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

Setting. Let n∈Nn \in \mathbb{N}n∈N be arbitrary (n=0n = 0n=0 is allowed). Let I={1,…,n}⊔{1,…,n}I = \{1,\dots,n\} \sqcup \{1,\dots,n\}I={1,…,n}⊔{1,…,n} (a first and a second copy), Vn=RI≅R2nV_n = \mathbb{R}^I \cong \mathbb{R}^{2n}Vn​=RI≅R2n with the standard Euclidean inner product, and Matn\mathrm{Mat}_nMatn​ the real I×II \times II×I (i.e. 2n×2n2n \times 2n2n×2n) matrices. In block form with respect to the two copies, J0=(0−IdnIdn0)J_0 = \begin{pmatrix} 0 & -\mathrm{Id}_n \\ \mathrm{Id}_n & 0 \end{pmatrix}J0​=(0Idn​​−Idn​0​). Let T=R/Z\mathbb{T} = \mathbb{R}/\mathbb{Z}T=R/Z with its Haar probability measure dtdtdt (total mass 111), and let H=L2(T,Vn)H = L^2(\mathbb{T}, V_n)H=L2(T,Vn​) be the real Hilbert space of a.e.-classes of square-integrable functions, with ⟨f,g⟩=∫T⟨f(t),g(t)⟩ dt\langle f, g \rangle = \int_{\mathbb{T}} \langle f(t), g(t) \rangle \, dt⟨f,g⟩=∫T​⟨f(t),g(t)⟩dt and the associated norm topology. For n=0n = 0n=0, V0={0}V_0 = \{0\}V0​={0} and H={0}H = \{0\}H={0}.

For f∈Hf \in Hf∈H (any representative) and k∈Zk \in \mathbb{Z}k∈Z, the Fourier coefficient is the vector f^k=∫Te−2πiktf(t) dt∈CI\hat f_k = \int_{\mathbb{T}} e^{-2\pi i k t} f(t)\, dt \in \mathbb{C}^If^​k​=∫T​e−2πiktf(t)dt∈CI, where f(t)f(t)f(t) is regarded as a complex vector componentwise; for a continuous map S:T→MatnS : \mathbb{T} \to \mathrm{Mat}_nS:T→Matn​, (Sf)^k=∫Te−2πiktS(t)f(t) dt∈CI\widehat{(Sf)}_k = \int_{\mathbb{T}} e^{-2\pi i k t} S(t) f(t)\, dt \in \mathbb{C}^I(Sf)​k​=∫T​e−2πiktS(t)f(t)dt∈CI (with S(t)S(t)S(t) regarded as a complex matrix). These are Bochner integrals (which by convention are 000 when the integrand is not integrable). Say f∈W1,2f \in W^{1,2}f∈W1,2 if the family ((1+k2)∑i∈I∣(f^k)i∣2)k∈Z\big((1 + k^2) \sum_{i \in I} |(\hat f_k)_i|^2\big)_{k \in \mathbb{Z}}((1+k2)∑i∈I​∣(f^​k​)i​∣2)k∈Z​ is summable. Let GS⊆H×HG_S \subseteq H \times HGS​⊆H×H be the set of pairs (f,g)(f, g)(f,g) with f∈W1,2f \in W^{1,2}f∈W1,2 and

g^k=−2πik J0f^k−(Sf)^kfor all k∈Z.\hat g_k = -2\pi i k \, J_0 \hat f_k - \widehat{(Sf)}_k \quad \text{for all } k \in \mathbb{Z}.g^​k​=−2πikJ0​f^​k​−(Sf)​k​for all k∈Z.

The operator ASA_SAS​ is defined as follows: if there exists a partially defined linear map on HHH (a linear subspace D⊆HD \subseteq HD⊆H and a linear map T:D→HT : D \to HT:D→H) whose graph {(x,Tx):x∈D}\{(x, Tx) : x \in D\}{(x,Tx):x∈D} equals GSG_SGS​, then ASA_SAS​ is such a map, chosen by the axiom of choice (its domain D(AS)D(A_S)D(AS​) is then {f:∃g, (f,g)∈GS}\{f : \exists g,\ (f,g) \in G_S\}{f:∃g, (f,g)∈GS​} and ASfA_S fAS​f is the corresponding ggg); if no such map exists, ASA_SAS​ is the zero map with domain all of HHH. The statement does not itself assert which case occurs.

For μ∈R\mu \in \mathbb{R}μ∈R, the eigenspace Eμ(AS)E_\mu(A_S)Eμ​(AS​) is the real linear subspace {f∈D(AS):ASf=μf}\{ f \in D(A_S) : A_S f = \mu f \}{f∈D(AS​):AS​f=μf} of D(AS)D(A_S)D(AS​); "Eμ(AS)=0E_\mu(A_S) = 0Eμ​(AS​)=0" means it contains only the zero vector.

Statement. Let n∈Nn \in \mathbb{N}n∈N, let S:T→MatnS : \mathbb{T} \to \mathrm{Mat}_nS:T→Matn​ be continuous with S(t)S(t)S(t) symmetric for every t∈Tt \in \mathbb{T}t∈T, and let μ∈R\mu \in \mathbb{R}μ∈R be such that Eμ(AS)={0}E_\mu(A_S) = \{0\}Eμ​(AS​)={0}, i.e. the only f∈D(AS)f \in D(A_S)f∈D(AS​) with ASf=μfA_S f = \mu fAS​f=μf is f=0f = 0f=0. Then there exists a bounded (continuous) real-linear operator R:H→HR : H \to HR:H→H such that

  1. RRR is a compact operator (it maps some neighbourhood of 000 into a set with compact closure);
  2. for every g∈Hg \in Hg∈H, Rg∈D(AS)Rg \in D(A_S)Rg∈D(AS​) and AS(Rg)−μ Rg=gA_S(Rg) - \mu\, Rg = gAS​(Rg)−μRg=g;
  3. for every f∈D(AS)f \in D(A_S)f∈D(AS​), R(ASf−μf)=fR\big(A_S f - \mu f\big) = fR(AS​f−μf)=f.

No other hypotheses are assumed. For n=0n = 0n=0, H={0}H = \{0\}H={0} and R=0R = 0R=0 satisfies the conclusion.

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