Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Li–Yau (1983): averaged Dirichlet eigenvalue bound

Open
PolyaLaplacian.li_yau_sum

by LG · Nov 18, 2026 · Mathlib 0df444a (Lean v4.33.1)

eigenvalueslaplacianspectral-theory

The Berezin–Li–Yau averaged eigenvalue bound (1983), the best universal lower bound toward Pólya's conjecture.

For every bounded, nonempty open set Ω⊂R2\Omega\subset\mathbb R^2Ω⊂R2 and every k≥1k\ge1k≥1, the sum of the first kkk Dirichlet eigenvalues satisfies

∑j=1kλj(Ω) ≥ 2π k2∣Ω∣.\sum_{j=1}^{k}\lambda_j(\Omega)\ \ge\ \frac{2\pi\,k^2}{|\Omega|}.j=1∑k​λj​(Ω) ≥ ∣Ω∣2πk2​.

Since λk≥1k∑j=1kλj\lambda_k\ge\frac1k\sum_{j=1}^k\lambda_jλk​≥k1​∑j=1k​λj​, this implies the individual bound λk(Ω)≥2πk/∣Ω∣\lambda_k(\Omega)\ge 2\pi k/|\Omega|λk​(Ω)≥2πk/∣Ω∣ — exactly half of Pólya's conjectured bound — for every domain. Any counterexample to Pólya must therefore lie strictly between the Li–Yau bound and the Pólya bound.

Formalization Note. The sum is over Finset.range k of dirichletEigenvalue Ω (j+1), i.e. λ1+⋯+λk\lambda_1+\cdots+\lambda_kλ1​+⋯+λk​. This is the planar (d=2d=2d=2) instance of the Li–Yau inequality.

Preamble
import Mathlib
import Definitions.Def_PolyaLaplacian_Spectral
open MeasureTheory Set TopologicalSpace
Formal statement
namespace PolyaLaplacian

theorem li_yau_sum (Ω : Set (EuclideanSpace ℝ (Fin 2)))
    (hΩ : IsOpen Ω) (hb : Bornology.IsBounded Ω) (hne : Ω.Nonempty) (k : ℕ) (hk : 1 ≤ k) :
    Finset.sum (Finset.range k) (fun j => dirichletEigenvalue Ω (j + 1)) ≥
      2 * Real.pi * (k : ℝ) ^ 2 / area Ω := by sorry

end PolyaLaplacian
Source
P. Li, S.-T. Yau, On the Schrödinger equation and the eigenvalue problem, Comm. Math. Phys. 88 (1983), 309–318, https://doi.org/10.1007/BF01213210 ; planar case of eq. (10) in Freitas–Lagacé–Payette, Ark. Mat. 59 (2021), https://arxiv.org/abs/1908.08441
Human review
  • Endorsed by Shuze Chen · Nov 18, 2026

    Confirmed by the moderator at approval.

  • Endorsed by LG · Nov 18, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me