TOPICS
Search

Pólya Eigenvalue Conjecture


The Pólya eigenvalue conjecture asserts that the Dirichlet and Neumann eigenvalues of the negative Laplacian on a bounded domain Omega subset= R^d satisfy

 mu_k<=4pi^2(k/(omega_d|Omega|))^(2/d)<=lambda_k
(1)

for k>=1, where omega_d is the volume of the unit ball, |Omega| is the volume of the domain, 0=mu_0<=mu_1<=... are the eigenvalues for Neumann boundary conditions, and lambda_1<=lambda_2<=... are the eigenvalues for Dirichlet boundary conditions, counted with multiplicity (Dai and Sun 2026).

Dai and Sun (2026) proved the Neumann inequality for every circular annulus A_(r,R)={x in R^2:r<||x||<R} with 0<r<R,

 mu_k<=(4k)/(R^2-r^2)
(2)

for all k>=1. Their proof combines analytic estimates with computer-assisted interval certificates covering the remaining parameter ranges.

Tang and Wang (2026a) reported the strict Dirichlet inequality

 |Omega|lambda_j(Omega)>4pij
(3)

for every nonempty bounded, simply connected planar domain Omega and every j>=1. Their proof and accompanying formalization have not been independently checked here.

Tang and Wang (2026b) separately reported the strict Neumann inequality

 |Omega|mu_j(Omega)<4pij
(4)

for every nonempty bounded, simply connected planar domain Omega with Lipschitz boundary and every j>=1. The indexing begins with mu_0=0. The general conjecture remains open.

Tang and Wang (2026a,b) acknowledge ChatGPT assistance with technical arguments and Aristotle and Codex assistance with Lean formalizations. The registered Neumann development passed machine checks, but independent specialist review of the complete argument had not been reported as of Oct. 15, 2026.


See also

Dirichlet Boundary Conditions, Eigenvalue, Laplacian, Neumann Boundary Conditions

Explore with Wolfram|Alpha

References

Dai, G. and Sun, Y. "Pólya's Conjecture for Neumann Eigenvalues of Annuli." 4 Oct 2026. https://arxiv.org/abs/2610.05146.Tang, Q. and Wang, Z. "Strict Dirichlet Pólya Inequality for Simply Connected Planar Domains." 9 Oct 2026a. https://arxiv.org/abs/2610.13139.Tang, Q. and Wang, Z. "The Neumann Pólya Inequality on Simply Connected Planar Domains." 2026b. https://github.com/QuanyuTang/polya-neumann-simply-connected-formalization-Palomar-version-v2/tree/f07f1c7051862ba146429db6eda5dc4e8b020f74.

Cite this as:

Weisstein, Eric W. "Pólya Eigenvalue Conjecture." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/PolyaEigenvalueConjecture.html

Subject classifications