Papers
Topics
Authors
Recent
Search
2000 character limit reached

Solvability Complexity Index Classification For Koopman Operator Spectra In $L^p$ For $1<p<\infty$

Published 19 Sep 2025 in math.SP, cs.CC, cs.NA, math.DS, and math.NA | (2509.16016v1)

Abstract: We study the computation of the approximate point spectrum and the approximate point $\varepsilon$-pseudospectrum of bounded Koopman operators acting on $Lp(\mathcal{X},\omega)$ for $1<p<\infty$ and a compact metric space $(\mathcal{X}, d_{\mathcal{X}})$ with finite Borel measure $\omega$. Building on finite sections in a computable unconditional Schauder basis of $Lp(\mathcal{X},\omega)$, we design residual tests that use only finitely many evaluations of the underlying map and produce compact sets on a planar grid, that converge in the Hausdorff metric to the target spectral sets, without spectral pollution. From these constructions we obtain a complete classification, in the sense of the Solvability Complexity Index, of how many limiting procedures are inherently necessary. Also we analyze the sufficiency and existence of a Wold-von Neumann decomposition analog, that was used in the special $L2$-case. The main difficulty in extending from the already analyzed Hilbert setting $(p=2)$ to general $Lp$ is the loss of orthogonality and Hilbertian structure: there is no orthonormal basis with orthogonal coordinate projections in general, the canonical truncations $E_n$ in a computable Schauder dictionary need not be contractive (and may oscillate) and the Wold-von Neumann reduction has no directly computable analog in $Lp$. We overcome these obstacles by working with computable unconditional dictionaries adapted to dyadic/Lipschitz filtrations and proving stability of residual tests under non-orthogonal truncations.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 1 tweet with 1 like about this paper.