SearcharxivSearch

arXiv · 2601.12044

Endpoint Koopman Spectral Computation: $L^1$ Residual Bounds, $L^\infty$ Instability, and Point-Spectral SCI Calibration Families

Abstract

We study endpoint Koopman spectral computation from the viewpoint of the Solvability Complexity Index (SCI). Let \((\mathcal X,d)\) be a compact metric space with finite Borel measure \(\omega\), and let \(\mathcal K_F\) be the Koopman operator associated with a continuous nonsingular map \(F:\mathcal X\to\mathcal X\). First, on \(L^1(\mathcal X,\omega)\), we record the endpoint residual upper-bound in the target-split form. The regularized compact fixed-\(\varepsilon\) target $R_{\mathrm{ap},\varepsilon}(\mathcal K_F)$ is separated from the closed fixed-\(\varepsilon\) target $C_{\mathrm{ap},\varepsilon}(\mathcal K_F)$ and from the exact approximate point spectrum $\sigma_{\mathrm{ap}}(\mathcal K_F).$ This endpoint statement uses the same point-evaluation plus fixed-quadrature information model as the \(1<p<\infty\) residual theory. Second, we isolate two obstructions at the nonseparable endpoint \(L^\infty\). Fixed quadrature schemes do not discretize the full \(L^\infty\) unit sphere, and even inside measure-preserving Cantor homeomorphisms the map $F\mapsto \sigma_{\mathrm{ap}}(\mathcal K_F:L^\infty\to L^\infty)$ is maximally discontinuous in Hausdorff distance under arbitrarily small uniform perturbations of \(F\). We also show that finite-period Silver-tree block constructions cannot yield analytic hardness for the \(L^\infty\) approximate point spectrum: for a fixed non-torsion \(z_0\in\mathbb T\), the condition $z_0\in\sigma_{\mathrm{ap}}(\mathcal K_{F}:L^\infty\to L^\infty)$ collapses to a Borel unbounded-period condition. In addition, fixed \(L^\infty\) point-eigenvalue membership is Borel in the measure-preserving continuous class, so one fixed eigenvalue cannot encode a non-Borel tree predicate. Third, we construct Koopman point-spectrum calibration families on the Cantor space.

Explore related subjects

Keep this discovery

BibTeXRIS

Christopher Sorg. 2026-01-17. Endpoint Koopman Spectral Computation: $L^1$ Residual Bounds, $L^\infty$ Instability, and Point-Spectral SCI Calibration Families. https://arxiv.org/abs/2601.12044

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

There is no maximal $K$-degree

The Kolmogorov complexity of a string characterize how complex it is to describe the string. If every prefix of a real $x$ is more complex to describe than every prefix (of the same length) of real $y$, then it is seen as $x$ is more complex to describe than $y$. It is wondered if there is a real $x$ so that no other reals are strictly more complex (to describe) than $x$. The behavior of Kolmogorov complexity functions generated by reals (namely $n\mapsto$ the minimal description length of the real) is quite chaos. Therefore, it is widely believed that there are many reals that are maximally complex to describe. For instance, it is conjectured that all random enough reals have maximal $K$-degree. In this paper, it is shown that there is no real with maximal $K$-degree. Actually, for almost all real $x$, we can uniformly computably find another real whose $K$-degree is strictly above $x$.

math.LO

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO