Counting eigenvalues of Schrödinger operators using the landscape function

From MaRDI portal



Abstract: We prove an upper and a lower bound on the rank of the spectral projections of the Schr"odinger operator −Delta+V in terms of the volume of the sublevel sets of an effective potential frac1u. Here, u is the `landscape function' of (David, G., Filoche, M., & Mayboroda, S. (2021) Advances in Mathematics, 390, 107946) namely the solution of (−Delta+V)u=1 in mathbbRd. We prove the result for non-negative potentials satisfying a Kato and doubling condition, in all spatial dimensions, in infinite volume, and show that no coarse graining is required. Our result yields in particular a necessary and sufficient condition for discreteness of the spectrum.


Summary: We prove an upper and a lower bound on the rank of the spectral projections of the Schrödinger operator \(-\Delta +V\) in terms of the volume of the sublevel sets of an effective potential \(\frac{1}{u}\). Here, \(u\) is the `landscape function' of G. David, M. Filoche, and S. Mayboroda [Adv. Math. 390 (2021), article no. 107946], namely a solution of \((-\Delta +V)u=1\) in \(\mathbb{R}^d\). We prove the result for non-negative potentials satisfying a Kato-type and a doubling condition, in all spatial dimensions, in infinite volume, and show that no coarse-graining is required. Our result yields in particular a necessary and sufficient condition for discreteness of the spectrum. In the case of nonnegative polynomial potentials, we prove that the spectrum is discrete if and only if no directional derivative vanishes identically.



Cites work









This page was built for publication: Counting eigenvalues of Schrödinger operators using the landscape function

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6203845)