Search arXiv⌕ Search

arXiv · 1703.09425

Effective perturbation theory for linear operators

Abstract

We propose a new approach to the spectral theory of perturbed linear operators , in the case of a simple isolated eigenvalue. We obtain two kind of results: ''radius bounds'' which ensure perturbation theory applies for perturbations up to an explicit size, and ''regularity bounds'' which control the variations of eigendata to any order. Our method is based on the Implicit Function Theorem and proceeds by establishing differential inequalities on two natural quantities: the norm of the projection to the eigendirection, and the norm of the reduced resolvent. We obtain completely explicit results without any assumption on the underlying Banach space. In companion articles, on the one hand we apply the regularity bounds to Markov chains, obtaining non-asymptotic concentration and Berry-Ess{é}en inequalities with explicit constants, and on the other hand we apply the radius bounds to transfer operator of intermittent maps, obtaining explicit high-temperature regimes where a spectral gap occurs.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Benoît Kloeckner. 2025-04-07. Effective perturbation theory for linear operators. https://doi.org/10.7900/jot.2017dec22.2179

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

KEEP EXPLORING

Related papers

A Weighted Discretization of Riemannian Manifolds with Lower Ricci Bounds

Let $(M,g)$ be a connected, compact, $n$-dimensional Riemannian manifold with $\operatorname{Ric}(M,g)\geq-(n-1)κg$. We introduce a weighted combinatorial Laplacian on $\varepsilon$-discretizations of $M$ and prove a spectral comparison theorem between the weighted graph Laplacian and the Laplace-Beltrami operator. More precisely, the eigenvalues of the two operators are uniformly comparable with constants depending only on $n,κ,\varepsilon$, independently of the injectivity radius. As an application, we prove spectral stability under measured Gromov-Hausdorff convergence. We also recover the Schoen-Wolpert-Yau inequality using the weighted discretization on families of pinching genus-$2$ hyperbolic surfaces.

math.SP↗

Zero measure Cantor spectrum for aperiodic metric tiling graphs

We study a family of aperiodic metric graphs generated by one-dimensional tilings. We prove that, generically, the spectrum of the associated Kirchhoff Laplacian has Lebesgue measure zero and, apart from a discrete set of isolated eigenvalues, is a generalized Cantor set. For a large subclass of these graphs, we further show that isolated eigenvalues are generically absent. This extends several well-known results from the setting of discrete ergodic Schrödinger operators on $\mathbb{Z}$ to a large family of metric graphs. Earlier results of this kind for metric graphs typically assume equilateral edges and exploit symmetries that reduce the analysis to a Sturm-Liouville operator on the real line. By contrast, the graph families considered here need not have equilateral edges or the symmetries needed for such a reduction and therefore require a different analytical approach.

math.SP↗

Recursive determinantal framework for testing D-stability

The concept of matrix $D$-stability, introduced in 1958 by Arrow and McManus, is of major importance across a wide variety of applications in economic modeling, ecology, and control systems. However, an exact algebraic characterization of $D$-stability for dimensions $n > 4$ has remained a notoriously intractable open problem for over sixty years. In this paper, we establish a novel, systematic recursive framework that decomposes the structural check of $D$-stability into an analytical tree of parameter-dependent determinants. By applying a recursive delete/zero reduction strategy, we derive exact recurrence relations for the real and imaginary parts of the characteristic polynomial components. These algebraic relations uncover a structured hierarchy of new sufficient conditions for $D$-stability, expressed explicitly in terms of the matrix's principal minors. We show that while general numerical methods face unavoidable conservatism near the topological boundaries of the stable manifold, our deterministic framework provides sharp, absolute certification for low-order boundary matrices.

math.SP↗