Sharp Computational Bounds for Spectral Types of Schrödinger Operators

We prove sharp bounds for determining the spectral-type decomposition of Schrödinger operators in the spirit of Smale's program on the foundations of computation. For explicit one-dimensional self-adjoint Schrödinger operators $H=-{\mathrm d^2}/{\mathrm dx^2}+V$ on $L^2(\mathbb R)$, where $V\in C^\infty(\mathbb R;\mathbb R)$ is given by a finite description of all derivatives and derivative bounds, the pure point and absolutely continuous spectral sets cannot, in general, be recovered by any single limiting procedure. The singular continuous spectral set is strictly harder: it cannot, in general, be recovered by two nested limiting procedures. Analytic constructions of dichotomies realize the lower bounds: Gordon-type repetitions for pure point spectrum, high barriers for absolutely continuous spectrum, and an inverse spectral construction for singular continuous spectrum based on Riesz products, moment-killing perturbations, and a computational Gelfand--Levitan scheme. The finite-description framework also implies corresponding limitations on what can be certified in fixed formal systems (e.g., when used in computer-assisted proofs). Conversely, using wavelet-based certified computation, we prove matching upper bounds for broad classes of self-adjoint differential operators on $\mathbb R^d$ with coefficients of locally bounded variation and quantitative local variation control: two limits suffice for the pure point and absolutely continuous parts, and three for the singular continuous part. This provides a sharp hierarchy for spectral types.

Source: arXiv:2609.08945v1 - http://arxiv.org/abs/2609.08945v1 PDF: https://arxiv.org/pdf/2609.08945v1 Original Link: http://arxiv.org/abs/2609.08945v1