Search arXivSearch

arXiv · 1104.3502

Spectral gap lower bound for the one-dimensional fractional Schr\"odinger operator in the interval

Abstract

We prove the uniform lower bound for the difference $\lambda_2 - \lambda_1$ between first two eigenvalues of the fractional Schr\"odinger operator, which is related to the Feynman-Kac semigroup of the symmetric $\alpha$-stable process killed upon leaving open interval $(a,b) \in \R $ with symmetric differentiable single-well potential $V$ in the interval $(a,b)$, $\alpha \in (1,2)$. "Uniform" means that the positive constant appearing in our estimate $\lambda_2 - \lambda_1 \geq C_{\alpha} (b-a)^{-\alpha}$ is independent of the potential $V$. In general case of $\alpha \in (0,2)$, we also find uniform lower bound for the difference $\lambda_{*} - \lambda_1$, where $\lambda_{*}$ denotes the smallest eigenvalue related to the antisymmetric eigenfunction $\phi_{*}$. We discuss some properties of the corresponding ground state eigenfunction $\phi_1$. In particular, we show that it is symmetric and unimodal in the interval $(a,b)$. One of our key argument used in proving the spectral gap lower bound is some integral inequality which is known to be a consequence of the Garsia-Rodemich-Rumsey-Lemma.

Explore related subjects

Keep this discovery

BibTeXRIS

Kamil Kaleta. 2011-04-18. Spectral gap lower bound for the one-dimensional fractional Schr\"odinger operator in the interval. https://doi.org/10.4064/sm209-3-5

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

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR