Abstract
Generalizing Courant's nodal domain theorem, the "Extended Courant property" is the statement that a linear combination of the first $n$ eigenfunctions has at most $n$ nodal domains. A related question is to estimate the number of connected components of the (super) level sets of a Neumann eigenfunction $u$. Indeed, in this case, the first eigenfunction is constant, and looking at the level sets of $u$ amounts to looking at the nodal sets $\{u-a=0\}$, where $a$ is a real constant. In the first part of the paper, we prove that the Extended Courant property is false for the subequilateral triangle and for regular $N$-gons ($N$ large), with the Neumann boundary condition. More precisely, we prove that there exists a Neumann eigenfunction $u_k$ of the $N$-gon, with labelling $k$, $4 \le k \le 6$, such that the set $\{u_k \not = 1\}$ has $(N+1)$ connected components. In the second part, we prove that there exists a metric $g$ on $\mathbb{T}^2$ (resp. on $\mathbb{S}^2$), which can be chosen arbitrarily close to the flat metric (resp. round metric), and an eigenfunction $u$ of the associated Laplace-Beltrami operator, such that the set $\{u \not = 1\}$ has infinitely many connected components. In particular the Extended Courant property is false for these closed surfaces. These results are strongly motivated by a recent paper by Buhovsky, Logunov and Sodin. As for the positive direction, in Appendix~B, we prove that the Extended Courant property is true for the isotropic quantum harmonic oscillator in $\mathbb{R}^2$.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.