Bounded multiplicity for eigenvalues of a circular vibrating clamped plate
Yuri Lvovsky, Dan Mangoubi

TL;DR
This paper establishes an upper bound of six on the multiplicity of eigenvalues for a clamped circular plate, using a novel recursion formula, linear algebra, and transcendence theory.
Contribution
It introduces a new recursion formula and applies advanced mathematical tools to bound eigenvalue multiplicities in a classical PDE problem.
Findings
Eigenvalue multiplicity of the clamped disk is at most six.
New recursion formula for eigenvalue analysis.
Application of Siegel-Shidlovskii transcendence theorem.
Abstract
We prove that no eigenvalue of the clamped disk can have multiplicity greater than six. Our method of proof is based on a new recursion formula, linear algebra arguments and a transcendency theorem due to Siegel and Shidlovskii.
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.
Taxonomy
TopicsAdvanced Differential Equations and Dynamical Systems · Spectral Theory in Mathematical Physics · Quantum chaos and dynamical systems
Bounded multiplicity for eigenvalues of a circular vibrating clamped plate
Yuri Lvovsky and Dan Mangoubi
The Einstein Institute of Mathematics, Edmond J. Safra Campus, The Hebrew University of Jerusalem, Jerusalem 91904, Israel
Abstract.
We prove that no eigenvalue of the clamped disk can have multiplicity greater than six. Our method of proof is based on a new recursion formula, linear algebra arguments and a transcendency theorem due to Siegel and Shidlovskii.
1. Introduction and background
1.1. The vibrating membrane
Recall the Dirichlet eigenvalue problem on the unit disk, .
[TABLE]
where is the (analyst’s) Laplacian. The eigenfunctions and the corresponding eigenvalues are given in terms of Bessel functions of the first kind and their positive zeros . Indeed, it is straightforward to check that
[TABLE]
is an eigenfunction of eigenvalue . Fourier expansion shows that any eigenfunction is a linear combination of functions [courant-hilbert-I]*Ch. V§5. On the other hand, to determine which linear combinations of the basic eigenfunctions in (1) still remain eigenfunctions had been a difficult problem, until it was resolved by Siegel [sieg-1929] in his celebrated theorem showing that the multiplicity of the eigenvalue is either one (in case ) or two (in case ). This was coined as Bourget’s Hypothesis before Siegel’s Theorem.
We recall the line of proof of Bourget’s hypothesis. First, (see [wats]*Ch. 15.28) using a well known (length two) recursion formula for Bessel functions and their second order ODEs it was shown that if , then either or is algebraic. In a second much deeper step it was shown by Siegel [sieg-1929] (see also [sieg-1949]) that all positive zeros of Bessel functions are transcendental.
1.2. The vibrating clamped plate
In this paper we are interested in the vibrating clamped circular plate ([courant-hilbert-I]*Ch. V§6). This is the following fourth order eigenvalue problem.
[TABLE]
Similarly to the vibrating circular membrane, it is readily checked that
[TABLE]
is an eigenfunction of eigenvalue , where is a zero of the cross product
[TABLE]
and where is the modified Bessel function.
As in Problem (VM), it is natural to ask whether multiplicities occur. There is extensive literature studying the vibrating clamped plate problem in general domains. The main questions studied are the isoperimetric problem, eigenvalues inequalities, asymptotic distribution of eigenvalues and the positivity of the ground state (see e.g. \citelist[nad95][talenti][ashb-beng][ashbaugh-laugesen][levine-protter][cheng-wei][pleijel-plates][payne-polya-weinb][garabedian-conformal][duffin][hedenmalm][hadamard]). It seems that the question of multiplicity of eigenvalues for the circular plate has not been addressed so far, and it is still not known whether eigenvalues are of multiplicity at most two (see in this context Theorem 4.1). From Weyl’s law [courant-hilbert-I]*Ch. VI§7.4 readily it follows that the multiplicity of the -th eigenvalue as . In this paper we follow the line of proof for the bounded multiplicity of the eigenvalues of the vibrating membrane, and we adapt it to deal with the eigenvalues of the clamped plate problem. The main new ingredient is a recursion formula for the sequence of cross products . Although this sequence was extensively studied [lorch-monotonicity] we could not find this recursion in the existing literature. Further, it turns out that this recursion (of length four) has nice grading and non-cancellation properties which allow to adjust the linear algebra and ODE arguments in the proof for the vibrating membrane case to our case. When combined with Siegel-Shidlovskii Theory (see [shid-book]) it yields
Theorem 1.1**.**
Let be four distinct non-negative integers. There is no for which .
As a main corollary we obtain
Corollary 1.2**.**
Let be an eigenvalue of Problem . Then, is of multiplicity at most six.
Remark 1.3**.**
One can check that the ground state of the disk is of multiplicity one (see [lorch-monotonicity]).
1.3. Acknowledgements
We first learned about the clamped plate problem from Iosif Polterovich. We are very grateful to Iosif for introducing us to this problem, and explaining to us the beauty and subtle points of several surrounding questions. We would like to thank Enrico Bombieri, who explained to us some ideas of transcendental number theory. This manuscript also benefited from several interesting discussions with Lev Buhovski, Aleksandr Logunov, Eugenia Malinnikova, Guillaume Roy-Fortin, and Mikhail Sodin. This paper is part of the PhD thesis of the first author. The support of the Israel Science Foundation through grants nos. 753/14 and 681/18 is gratefully acknowledged. Part of this work was written while the second author was an invited researcher of the LabEx Mathématiques Hadamard project in Paris-Sud XI and a Chateaubriand France-Israel fellow. The financial supports of the LMH and the french government are gratefully acknowledged.
2. Classical facts about Bessel functions
Let be a non-negative integer. The Bessel function can be defined as the entire function satisfying
[TABLE]
and normalized by
[TABLE]
The modified Bessel function is the entire solution of
[TABLE]
normalized so that
[TABLE]
It is easily verified that , where is a square root of .
Proposition 2.1** ([wats]*Ch. II.12).**
The Bessel functions satisfy the following rules:
[TABLE]
The next positivity statement (which can be readily seen from the Taylor series expansion) will also be useful.
Proposition 2.2**.**
The function is positive in .
3. A recursion formula for a cross product of Bessel functions
As explained in the introduction, the eigenvalues of the clamped plate problem are given in terms of zeros of the functions defined in (2). In this section we study this sequence and we present a length four rational recursion relation satisfied by it. We prove
Theorem 3.1**.**
The following recursion formula holds.
[TABLE]
For the proof we need some convenient formulas given in the next lemma, proved at the end of this section.
Lemma 3.2**.**
The following formulas hold.
- (a)
** 2. (b)
** 3. (c)
** 4. (d)
** 5. (e)
** 6. (f)
**
Proof of Theorem 3.1.
For convenience we denote the formula to be proved as where is the left hand side and correspond respectively to the two terms in the right hand side. By Lemma 3.2 we have
[TABLE]
Hence, the statement is equivalent to
[TABLE]
The last identity can be easily validated by expressing , , and in terms of , , and with the rules given in Proposition 2.1. ∎
Proof of Lemma 3.2.
To prove (a) we use the rules in Proposition 2.1 to obtain
[TABLE]
Formula (b) is proved similarly. To prove (c) we express using formula (a), while using formula (b). Then, we get
[TABLE]
At the next step we express , , and in terms of the functions , , and using Proposition 2.1. The proof of (d) is similar. To prove (e) and (f) one uses (a) and (b). ∎
4. Forbidden joint zeros
In this section we observe some forbidden patterns of joint zeros in the sequence . Observe that the forbidden patterns in Theorem 4.1 are not covered by Theorem 1.1.
Theorem 4.1**.**
The patterns of joint zeros below are forbidden.
- (a)
The functions and have no joint positive zeros. 2. (b)
The functions and have no joint positive zeros.
Proof.
Since is a positive function in , we can deduce from Lemma 3.2(a) and (b) that if then . This is impossible as it implies , which is forbidden by the second order ODE satisfied by . To prove (b) we use Lemma 3.2(c) and (d) and the fact that is a positive function in to deduce a similar contradiction. ∎
5. A joint zero is algebraic
In this section we show that the recursion given in Theorem 3.1 combined with the fact that the four functions do not have a joint positive zero (as follows from Theorem 4.1) implies that a joint zero of four distinct ’s must be algebraic. We emphasize that this implication is independent of the specific nature of functions (for example, it does not depend on the non-trivial fact that the are linearly independent - see Appendix).
Proposition 5.1**.**
Let be a linear subspace of meromorphic functions in . Let be any sequence in which satisfies the recursion relation given in Theorem 3.1 and assume that and have no common positive zero. Let be distinct non-negative integers. Let be such that . Then is algebraic.
The heart of the proof of Proposition 5.1 is a linear independence property implied by the recursion of Theorem 3.1.
Lemma 5.2**.**
Let be a four dimensional linear space over the field of rational functions with rational coefficients . Let be a basis of , and define a sequence in by the recursion of Theorem 3.1. Let be distinct non-negative integers. Then, the set of vectors is linearly independent.
The proof of Lemma 5.2 is based on nice grading and non-cancellation properties of the recursion in Theorem 3.1. We give its proof below the proof of Proposition 5.1.
Proof of Proposition 5.1.
Consider a space and a sequence as in Lemma 5.2. According to Lemma 5.2 we can uniquely express
[TABLE]
where is an invertible matrix. Since the sequence satisfies the same recursion we conclude that (not necessarily uniquely)
[TABLE]
Taking a least common denominator for all s we get
[TABLE]
where and are polynomials in . Evaluation of this identity at the point results in
[TABLE]
The left hand side is the zero vector by our assumption, while the vector is not zero by our assumption. We conclude that is non-invertible. Hence, , and since is invertible, is a non-zero polynomial in and we can conclude that is algebraic. ∎
Proof of Lemma 5.2.
Assume that and define the parameters by
[TABLE]
Let us refine the statement in the Lemma. Consider the unique anti-symmetric four-linear form defined on for which . We need to show that . Keeping track of the leading term in these determinant-like expressions we prove
Claim**.**
There exist constants such that
[TABLE]
where is of degree smaller than .
The proof of the preceding claim is by induction on . The base case is trivial. For the sake of shortly written expressions we introduce some notations to expressions appearing as coefficients in the recursion of Theorem 3.1.
[TABLE]
We now unroll the determinant by applying the recursion given in Theorem 3.1.
[TABLE]
After a slight rearrangement we obtain
[TABLE]
We denote the expression obtained in (5) by . In order to apply the induction hypothesis, we distinguish several cases:
- Case 1:
. In this case one gets by the induction hypothesis that for some polynomial (of controlled degree)
[TABLE]
where is a polynomial of degree smaller than . 2. Case 2:
. In this case the anti-symmetry of the determinant is used to get
[TABLE]
By induction we have
[TABLE]
where is of degree smaller than . 3. Case 3:
.
[TABLE]
By induction,
[TABLE]
where is of degree smaller than . 4. Case 4:
.
[TABLE]
where by induction
[TABLE]
and is of degree smaller than . 5. Case 5:
.
[TABLE]
Hence, by hypothesis
[TABLE]
Now it becomes a bit trickier to tell which the leading term is. If is even then it is the second one, so we take . If is odd then the first two terms contribute to the leading term and are of the same sign, so we take . In any case, we obtain
[TABLE]
where is of degree smaller than . 6. Case 6:
.
[TABLE]
The induction gives
[TABLE]
where is of degree smaller than . 7. Case 7:
.
[TABLE]
leading to
[TABLE]
where is of degree smaller than . 8. Case 8:
.
[TABLE]
This simple expression gives by our hypothesis
[TABLE] 9. Case 9:
.
[TABLE]
We are led to the tricky expression
[TABLE]
If is even then the leading term is the first one with . If is odd, then the three first terms are of the same degree . So, we let In any case we obtain
[TABLE]
where is of degree smaller than . 10. Case 10:
.
[TABLE]
[TABLE]
where is of degree smaller than . 11. Case 11:
.
[TABLE]
The last expression gives
[TABLE]
with of degree smaller than . 12. Case 12:
.
[TABLE]
This is simply a positive constant (by induction)
[TABLE] 13. Case 13:
.
[TABLE]
Hence,
[TABLE]
where is of degree smaller than . 14. Case 14:
.
[TABLE]
Thus,
[TABLE] 15. Case 15:
.
[TABLE]
By induction this is a constant
[TABLE]
∎
6. Some elements from Siegel-Shidlovskii Theory - a zero is transcendental
We recall the notion of a Siegel -function. Let be a power series.
[TABLE]
Definition 6.1** ([sieg-1949]*Ch. II.1).**
is called an -function if the following two conditions hold
- (a)
for all . 2. (b)
If , where are coprime, then , and as for all .
We remark that any -function is entire and functions constitute a ring. The examples we are interested in are the functions . It is readily verified that these are all -functions.
Siegel-Shidlovskii theory is concerned with transcendental properties of values of -functions which satisfy a linear ODE system. The following theorem is one of the corner stones of the theory. It was proved for second order ODEs in [sieg-1929] and [sieg-1949], and then it was simplified and extended to linear systems by Shidlovskii.
Theorem 6.2** (\citelist[shid1959][shid-book]*Ch. 3§13, Second Fundamental Theorem).**
Let be algebraically independent -functions over the field of rational functions . Let satisfy a linear ODE system of the form
[TABLE]
where . Let be algebraic and distinct from the poles of . Then, the set of numbers is algebraically independent over .
The assumptions in Theorem 6.2 are verified in the case relevant to this paper by an earlier theorem of Siegel.
Theorem 6.3** ([sieg-1929], see also [shid-book]*Ch. 9, §5, Lemma 6).**
The four -functions are algebraically independent over .
As a corollary we have
Corollary 6.4**.**
Let . If then is transcendental.
Proof of Corollary 6.4.
The vector of functions satisfies an ODE of the form (6) with
[TABLE]
Let be a positive algebraic number. By Theorems 6.3 and 6.2 the four values are algebraically independent. In particular, as a polynomial in these numbers is not [math]. ∎
7. Proof of the main Theorem 1.1
The main theorem now follows easily.
Proof of Theorem 1.1.
Let be a common zero of and . The functions and have no common zero by Theorem 4.1. Hence, we can apply proposition 5.1 to conclude that the positive number must be algebraic. On the other hand, by Corollary 6.4 it must be transcendental. This is a contradiction. ∎
Remark 7.1**.**
The full power of Theorem 4.1 was not used in the proof of Theorem 1.1. The weaker statement that and have no common zero follows also by computing a fourth order ODE for and showing that is obtained from by an invertible transformation. We leave the details to the reader.
8. Appendix-Shortest recursion possible
We explain how our arguments for the proof of Theorem 1.1 also show that any four distinct ’s are algebraically independent over the field of rational functions . In particular, it follows that the linear recursion in Theorem 3.1 cannot be shortened while keeping rational coefficients.
Claim 8.1** (base case).**
The four functions are algebraically independent over the field .
Proof.
We may express the function as a linear combination of the four functions and over the field simply by expanding the defining formula (2) by means of the classical recursions in Proposition 2.1. One calculates
[TABLE]
By Theorem 6.3 the four functions , , , are algebraically independent over the field . Since the linear system (7) is invertible and due to the simple fact that the set of non-zero polynomials is preserved by linear transformations we obtain that , , , are algebraically independent over too. ∎
Theorem 8.2**.**
Let be four distinct non-negative integers. Then, and are algebraically independent over the field .
Proof.
By equation (4) we can express
[TABLE]
with . By Claim 8.1 it follows that and are algebraically independent. ∎
References
