Some estimates for the higher eigenvalues of sets close to the ball
Dario Mazzoleni, Aldo Pratelli

TL;DR
This paper studies how the higher eigenvalues of the Dirichlet Laplacian behave for sets close to a ball, providing explicit bounds relating eigenvalues and geometric closeness, with improved estimates in two dimensions.
Contribution
It establishes explicit bounds on higher eigenvalues for sets near a ball, linking spectral and geometric closeness with uniform exponents, including improved results in two dimensions.
Findings
Bounds on eigenvalue differences in terms of eigenvalue gaps.
Explicit exponents for eigenvalue stability.
Enhanced estimates for the 2D case.
Abstract
In this paper we investigate the behavior of the eigenvalues of the Dirichlet Laplacian on sets in whose first eigenvalue is close to the one of the ball with the same volume. In particular in our main Theorem we prove that, for all , there is a positive constant such that for every open set with unit measure and with not excessively large one has \begin{align*} |\lambda_k(\Omega)-\lambda_k(B)|\leq C (\lambda_1(\Omega)-\lambda_1(B))^\beta\,, && \lambda_k(B)-\lambda_k(\Omega)\leq Cd(\Omega)^{\beta'}\,, \end{align*} where is the Fraenkel asymmetry of , and where and are explicit exponents, not depending on nor on ; for the special case , a better estimate holds.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Some estimates for the higher eigenvalues
of sets close to the ball
Dario Mazzoleni
Dipartimento di Matematica F. Casorati, Università degli Studi di Pavia, Via Ferrata, 1 – 27100 Pavia, Italy. [email protected]
and
Aldo Pratelli
Department Mathematik, Friedrich-Alexander Universität Erlangen-Nürnberg, Cauerstrasse, 11 – 91058 Erlangen, Germany. [email protected]
Abstract.
In this paper we investigate the behavior of the eigenvalues of the Dirichlet Laplacian on sets in whose first eigenvalue is close to the one of the ball with the same volume. In particular in our main Theorem 1.1 we prove that, for all , there is a positive constant such that for every open set with unit measure and with not excessively large one has
[TABLE]
where is the Fraenkel asymmetry of , and where and are explicit exponents, not depending on nor on ; for the special case , a better estimate holds.
1. Introduction
The study of eigenvalues of the Dirichlet Laplacian from the point of view of shape optimization and spectral geometry has been strongly investigated in recent years. This is a very beautiful and interesting topic mostly because there are still a lot of rather basic facts that are very hard to prove, although they seem very “natural”.
A classical shape optimization problem is the minimization of the principal frequency (i.e., the first Dirichlet eigenvalue) among sets of given volume. This problem was solved by Faber and Krahn in the 1920s, who independently proved that for every open set of unit measure one has , where is the ball of unit measure centered at the origin and is the -th eigenvalue of the Dirichlet Laplacian; in addition, the inequality is strict unless itself is a ball. In more recent years there have been many studies concerning improvements of the Faber–Krahn inequality in a quantitative direction. This accounts to understand whether sets that are close to optimality (i.e., with ) can be said to be “close” to the ball in some sense. A complete answer to this question was given by Brasco, De Philippis and Velichkov [4] (after several other contributions on this topic, for which we refer to the paper itself, as well as to the survey [6]). They proved that, for every open set with unit measure, one has
[TABLE]
where is the well-known Fraenkel asymmetry, defined as
[TABLE]
It is important to notice that the exponent in (1.1) is sharp.
In this paper we consider a set for which the difference is very small, hence which is close to a suitable unit ball according to (1.1). We are interested in the following question: is it true that also the higher eigenvalues are close to the corresponding eigenvalues of the unit ball? It is simple to guess that it must be so, our aim is to prove this with an estimate which goes like a power. More precisely, our main result is the following.
Theorem 1.1**.**
Let , and let be an open set of unit measure with . Then, for every there exists a constant such that for
[TABLE]
while for the exponents can be made better as follows,
[TABLE]
Let us briefly comment on the result. For a set with unit volume and , the closeness of to is not an obvious consequence of (1.1). Indeed, that estimate says that has a small symmetric difference with a unit ball; nevertheless, a set with small symmetric difference with a unit ball could also have huge eigenvalues, for instance if there are several small holes in the set. On the bright side, it is not hard to guess that the effect of these holes is more important on the small eigenvalues, hence if there is only a small effect on the first eigenvalue, the same should be true also for the higher ones. This rough argument is more or less at the basis of our construction: more precisely, we will use the information that the first eigenvalue is only a little bigger than the one of the ball to infer that the same is true for the following eigenvalues; to do so, we will use the first eigenfunction to construct competitors to the other eigenfunctions.
Another comment has to be done about the sign of : indeed, by the Faber-Krahn inequality we know that , but there is no reason why also should be bigger than , on the contrary it can easily happen to be smaller. In fact, the estimate (1.3) is done by two inequalities, with different exponents, which need completely different approaches.
A last comment has to be done about the constant in Theorem 1.1: our main aim is to obtain a good power, while we are not very interested in the value of . As a consequence, even if the constant is explicitely computable from our construction, we avoid to do so for simplicity; hence, as usual, the letter will be used for a geometrical constant, which can increase from line to line.
The plan of the paper is rather simple: in the short Section 1.1 below, we recall some basic facts about eivenvalues of the Dirichlet Laplacian and we fix the notation. Then, in Section 2 we prove, mainly via a self-improving argument, the estimates (1.4) and (1.4’), from which the left inequality in (1.3) and (1.3’) immediately follows by (1.1). Finally, in Section 3 we prove the right inequality in (1.3) and (1.3’).
Remark 1.2**.**
Bertrand and Colbois, in [3], proved some quantitative estimates for the higher eigenvalues of sets close to the ball, mostly with capacitary methods. Theorem 1.1 improves their estimates [3, Théorème 3.3], whose exponents depend on the dimension.
1.1. Notation and preliminaries
Throughout the paper, we work in the Euclidean space and the generic point is written as . Given an open set with finite Lebesgue measure, we denote by its –th eigenvalue of the Dirichlet Laplacian, counted with due multiplicity. A corresponding eigenfunction will be called , and it will always be taken with unit norm. It is important to recall that the eigenvalues can be characterized through a min-max principle, that is, for all ,
[TABLE]
where the minimum is taken over all the dimensional subspaces of . Moreover, whenever is given, we denote its so called Rayleigh quotient as
[TABLE]
It is well-known, and it directly follows from the min-max principle, that the eigenvalues are monotone with respect to set inclusion, i.e. implies . Moreover, the following scaling property holds,
[TABLE]
Another important property of eigenfunctions is that they are bounded in , only depending on the corresponding eigenvalue; more precisely, one has
[TABLE]
for a proof see for instance [5, Example 2.1.8].
It is also useful to keep in mind that higher eigenvalues cannot be too big if the first eigenvalue is small; more precisely, there exists a constant , depending only on and on , such that for every set one has
[TABLE]
for a simple proof one can refer to [7, Theorem B], more involved estimates are proved in [1]. A special case is given by , in which the ratio is actually maximied by the ball, that is,
[TABLE]
as proved by Ashbaugh and Benguria in [2]. Notice that, as an immediate consequence, for any set we can write
[TABLE]
so the exponent or can be replaced by the exponent in the right inequality in (1.3) and (1.3’) if .
We conclude with a last piece of notation. As already said, by we denote the unit ball centered at the origin, then with radius . For every small number , positive or negative, we will then denote by the ball centered at the origin and with radius , so that . Notice that .
Finally, given two real numbers , we denote minimum between and as .
2. The proof of (1.4) and (1.4’), and the estimate of from below
This section is devoted to prove the estimates (1.4) and (1.4’). Notice that, once having these inequalities, the left inequalities in (1.3) and (1.3’) are obvious by (1.1). Our idea is to try to reduce ourself to the case of a set contained in a ball , where is the Fraenkel asymmetry defined in (1.2), while is a suitable power. The reason to do so is clear: if , then
[TABLE]
thus the searched estimate immediately follows (with exponent ). The main tool we will use to reduce us to this simple case will be the following lemma, which will allow us to perform a bootstrap argument.
Lemma 2.1**.**
Let , let , let be a set of unit measure satisfying , and let and be so that for each it is
[TABLE]
being . Then, there exists some \bar{t}\in\big{(}i\varepsilon^{\alpha},(i+1)\varepsilon^{\alpha}\big{)} such that
[TABLE]
for all , where , is a constant depending only on and where
[TABLE]
Moreover, for every one also has
[TABLE]
Proof.
Let us denote for brevity by the interval \big{(}i\varepsilon^{\alpha},(i+1)\varepsilon^{\alpha}\big{)}, which has length . By (2.1), for every we have
[TABLE]
then the set of all those such that
[TABLE]
for every has length at least . Then, any satisfies the first inequality in (2.2), up to choose .
In addition, since
[TABLE]
then the subset of of all those such that has measure at least . Notice that any satisfies also the second inequality in (2.2), as soon as .
Recalling the rescaling properties (1.6) of the eigenvalues, as well as the Faber-Krahn inequality, there exists a geometrical constant such that, for every , one has
[TABLE]
As a consequence, again by (2.1) we have
[TABLE]
which ensures the existence of some such that
[TABLE]
for every , where the last inequality holds up to define . Hence, any such satisfies also the last estimate in (2.2) if : notice that this number equals if , so we have concluded (2.2) if . Moreover, by (1.7) and (1.8), and since , we have
[TABLE]
for some constant only depending on and . Then, for every one directly has
[TABLE]
up to modify in the obvious way, so the last estimate in (2.2) holds with the choice , which concludes also the case .
Finally, to obtain (2.4) and hence conclude the proof, it is enough to recall that in and to use Divergence Theorem, (2.5), Hölder inequality, and (2.2), getting
[TABLE]
∎
Remark 2.2**.**
As it appears clear from the above proof, the last inequality of (2.2) holds also with when , and it holds also with when . Nevertheless, for the exponents which will be used in this paper, the choice of done in (2.3) is the best one.
Corollary 2.3**.**
For every and every there exist and such that, for every set of unit measure with and , there is such that, for every ,
[TABLE]
Proof.
First of all, we notice that it is enough to find some and a constant , both depending only on and , so that
[TABLE]
Indeed, in this case we have the validity of (2.1) with and , then Lemma 2.1 provides us with some \bar{t}\in\big{(}(n-1)\varepsilon^{\alpha},n\varepsilon^{\alpha}\big{)} satisfying (2.2). The first estimate in (2.6) is directly given by the first estimate in (2.2). Concerning the second one, it follows from the third estimate in (2.2): indeed, if we have to show that , which is true since . Instead, for , we have to show that , which is again true because . Finally, the third estimate in (2.6) follows by (2.7) since . Summarizing, to conclude the thesis we only have to show (2.7).
Let us start with the case . Recall that
[TABLE]
hence (2.1) clearly holds for every with , and . We can then apply Lemma 2.1 to obtain some such that (2.2) and (2.4) hold. In particular, recalling that , (2.4) gives
[TABLE]
hence we have already found (2.7) with if . Otherwise, the last inequality implies anyway that (2.1) holds with and , hence again Lemma 2.1 provides us with some satisfying (2.2) and (2.4), in particular and
[TABLE]
Again, if , then we have obtained (2.7) with ; and otherwise, (2.1) holds true with and . Continuing with the obvious recursion argument, we get the validity of (2.1) with for every such that ; hence, we call the smallest integer such that , thus (2.7) is established. Notice that the final constant depends also on , then actually on . The case is then concluded.
Let us now consider the case , which is slightly trickier. Taken any , we notice that the trivial estimate (2.8) still holds, hence we have again the validity of (2.1) with and . Lemma 2.1 provides then some satisfying (2.2) and (2.4). In particular, since we have for every that
[TABLE]
so (2.7) already follows with if . Otherwise, (2.1) holds with and , which by Lemma 2.1 and again using that gives some satisfying (2.4). Thus we have
[TABLE]
so (2.1) holds also with and \gamma_{2}=\frac{3}{2}\big{(}\frac{1}{2}-\alpha\big{)}, and (2.7) follows with if . This time, the obvious recursion implies that (2.1) holds with any , where is recursively defined by , hence
[TABLE]
Notice that the sequence is monotone increasing, and it converges to , where the last inequality is true since . Hence, we can define the smallest integer such that , and we get then the validity of (2.7) which, as already noticed, is enough to conclude. ∎
In the sequel, we will make use of the following definition.
Definition 2.4**.**
Let , , and let be given. Then, writing the generic point in polar coordinates as , with , we define the sets
[TABLE]
and the functions
[TABLE]
Notice that .
We observe now that can be bounded by plus a suitable power of .
Lemma 2.5**.**
For every and there exist two constants and such that, if is an open set of unit measure with and , and is as in Definition 2.4 with and given by Corollary 2.3, then one has
[TABLE]
Proof.
For the sake of simplicity, we divide the proof in few steps.
Step I.* Estimates about on .*
First of all, we take any and we give the estimates about on . The norm of on can be easily estimated thanks to (2.6) as
[TABLE]
Concerning the norm of on , it is simpler to estimate separately the tangential and the radial part. Using again (2.6), for the first one we get
[TABLE]
while for the second one it is
[TABLE]
recalling that if and if . Hence, putting the two estimates together we have
[TABLE]
Step II.* Estimates about .*
In this step, we prove that for every one has
[TABLE]
while for every it is
[TABLE]
In fact, by (2.5) we have that
[TABLE]
Then, since on while on , and by (2.11) and (2.14), we have
[TABLE]
if is small enough, hence (2.12) already follows. To obtain (2.13), instead, it is enough to recall that and are two orthogonal eigenfunctions in , so they are orthogonal both in and in . Then, we can evaluate
[TABLE]
by Hölder inequality, (2.14) and (2.10), and similarly
[TABLE]
by (2.6) and (2.11). From the last two bounds, (2.13) follows.
Step III.* The space has dimension .*
Let us now prove that the space , generated by the functions with , has maximal dimension in . Were it not so, there would be some and some numbers for every , such that
[TABLE]
As a consequence, by (2.13) it would be
[TABLE]
which, as soon as , is in contradiction with the fact that, by (2.14),
[TABLE]
Step IV.* Conclusion.*
We are now ready to estimate . Let be a generic function; up to rescaling, we can write with . We can now evaluate
[TABLE]
Keeping in mind (2.12), we have
[TABLE]
Moreover, by (2.13) we have that . Finally, (2.15) gives . These estimates ensure that . Since was a generic function, thanks to Step III and to the min-max principle (1.5) we obtain the validity of (2.9).∎
The proof of (1.4) follows now as an easy consequence.
Proof of Theorem 1.1, first part.
Let be any set of unit measure. We will prove now the validity of (1.4) and (1.4’), from which the left inequality in (1.3) and (1.3’) directly follows by (1.1). Up to a translation, we can assume that coincides with . If , there is nothing to prove, so we can assume that . Take then any , if , or , if , and let be given by Lemma 2.5. We can assume that , because otherwise (1.4) is emptily true, up to increase the constant if necessary. We can then apply Lemma 2.5 to the set given by Definition 2.4 with , and we get the validity of (2.9). Moreover, by construction we have that , where is the integer given by Corollary (2.3). Hence,
[TABLE]
so that (1.4) and (1.4’) follow from (2.9) and the proof is concluded. ∎
3. The estimate of from above
In this section we prove the right inequality in (1.3) and (1.3’), thus concluding the proof of our main result. Notice that we cannot bound by some power of the Fraenkel asymmetry; in fact, it is easy to build sets of unit measure with arbitrarily small asymmetry and arbitrarly large eigenvalue . Observe also that we need an upper bound for ; to get it, we have to find functions in which are almost orthogonal and whose Rayleigh quotients are close to the eigenvalues of the ball; of course one has to define these functions starting from the eigenfunctions of the ball, nevertheless these functions must vanish outside , so in particular in , and this is clearly false for the eigenfunctions of the ball. The next lemma, which is the main ingredient of this step, will solve this issue.
Lemma 3.1**.**
For every there exists a constant such that, for any open set with , one has
[TABLE]
Proof.
Let us call a basis of eigenfunctions for . Keep in mind that each is Lipschitz up to boundary, and is also radial and with growth at least linear away from the boundary, that is, there exists a constant such that . Hence, it is easily seen that there exists a constant , only depending on and on , such that
[TABLE]
Let now be a first eigenfunction for . Since , then , thus we can write as
[TABLE]
and since all the eigenfunctions have unit norm we have . Notice that
[TABLE]
Assuming without loss of generality that and calling , we have
[TABLE]
Let us now define the functions
[TABLE]
and notice that each belongs to thanks to (3.2), and that . The key observation is that, roughly speaking, if then it must be , hence . Let us now be more precise. For any two indices , by (2.5) and (3.2) we have
[TABLE]
Moreover, we notice that
[TABLE]
then the very same calculation as in (3.6) give
[TABLE]
Now, keep in mind that our goal is to prove (3.1); hence, recalling (1.8) and up to increase the final constant , we can assume that is as small as we wish, hence that is as small as we wish by (3.3). As a consequence, by a standard argument (identical to what we already did in Lemma 2.5), the estimates (3.6) and (3.8) together with (3.5) and (3.4) imply that the subspace of generated by the functions has dimension , hence recalling also (3.7) we obtain . And finally, by (3.3) this estimate gives (3.1). ∎
Remark 3.2**.**
Obviously, if a set is contained in the ball for some constant with , then (3.1) is still true for and , up to multiply the constant by : to prove that, it is enough to recall the scaling property (1.6) for the eigenvalues.
Lemma 3.3**.**
For every there exist and a constant such that, for every set of unit measure with , calling one has
[TABLE]
Proof.
Let us first consider the case . Then, we can apply Corollary 2.3 with , finding and . Thanks to (2.7), we already have the first estimate in (3.9). Concerning the second one, for we only have to show that , and in fact this follows immediately from the uniform estimate (2.5) and the fact that .
Let us now consider that case . We start again by applying Corollary 2.3 with , and again we obtain , , and some such that (2.6) and (2.7) hold; the latter implies again the first estimate in (3.9). The second one, this time, is more complicate, since we have to show , which is no more obvious from (2.5). Recall that , since has been provided by Lemma 2.1, thus (2.2) holds. We now argue for simplicity under the assumption that is connected, hence a connected arc: in the general case, it suffices to repeat the same argument for any connected component.
Let be the segment joining the two endpoints of , and let be the set whose boundary is given by . We define now the set , and we introduce the following function : assuming without loss of generality that is a horizontal segment, for every there exists a unique such that , and we let
[TABLE]
Since the length of is at most , thus the distance between and is at most , so we can easily estimate
[TABLE]
In addition, we have . Notice now that belongs to , not to ; nevertheless, since is entirely on one of the two parts in which is divided by the line containing , we can let be the union of with its symmetrical copy with respect to this line, and we can extend on by symmetry; in this way, the resulting function belongs by construction to . Since , by (1.6) we have . And in turn, by (3.10) this implies
[TABLE]
which is the second inequality in (3.9). The proof is then concluded also in the planar case. ∎
Corollary 3.4**.**
Let and be as in Lemma 3.3. Calling , one has
[TABLE]
Proof.
Let us define the function as
[TABLE]
and let us define . By (3.9) and the fact that , it is
[TABLE]
Since, on the other hand, , we conclude the validity of (3.11). ∎
We can then easily conclude the proof of Theorem 1.1.
Proof of Theorem 1.1, second part.
We only have to prove the estimate of from above. Let , and let be any set with unit measure such that . Up to a translation, we can assume that , so that by (1.1) we have that . Let us also call , where is given by Lemma 3.3. By Lemma 3.1 (together with Remark 3.2) and Corollary 3.4, and since , we have
[TABLE]
which gives the right inequality in (1.3) and (1.3’). The proof is then concluded. ∎
We conclude with a brief comments on the sharp exponents. We do not believe that the exponents found in (1.3) and (1.4), and in (1.3’) and (1.4’), are sharp. In particular, as already observed at the end of Section 1.1, for the right inequality in (1.3) and (1.3’) holds with exponent . Nonetheless, as far as we know Theorem 1.1 is the first result where it is provided a quantitative estimate for the eigher eigenvalues of sets close to the ball with exponents that do not depend on the dimension.
Acknowledgments.
This work originated from a question suggested to us by Antoine Henrot. The first author has been supported by the ERC advanced grant n. 339958 “COMPAT”.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] M.S. Ashbaugh, The universal eigenvalue bounds of Payne-Pölya-Weinberger, Hile-Protter, and H C Yang, Proc. Indian Acad. Sci. (Math. Sci.) Vol. 112 (2002), No. 1, pp. 3–30.
- 2[2] M. Ashbaugh and R. Benguria, Proof of the Payne–Pòlya–Weinberger conjecture, Bull. Amer. Math. Soc., 25 (1991), 19–29.
- 3[3] J. Bertrand, B. Colbois, Capacité et inégalité de Faber-Krahn dans ℝ n superscript ℝ 𝑛 \mathbb{R}^{n} , Journal of Functional Analysis 232 (2006), 1–28.
- 4[4] L. Brasco, G. De Philippis, B. Velichkov, Faber–Krahn inequalities in sharp quantitative form, Duke Math. J., 164 (9) (2015), 1777–1831.
- 5[5] E. Davies, Heat Kernels and Spectral Theory, Cambridge University Press, (1989).
- 6[6] N. Fusco, The quantitative isoperimetric inequality and related topics, Bull. Math. Sci., 5 (2015) 517–607.
- 7[7] D. Mazzoleni, A. Pratelli, Existence of minimizers for spectral problems, J. Math. Pures Appl., 100 (2013), 433–453.
