Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Pólya for the disk (FLPS 2023, Thm 1.2)

Open
PolyaLaplacian.polya_disk

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

eigenvalueslaplacianspectral-theory

Pólya's conjecture for the disk (Filonov–Levitin–Polterovich–Sher 2023, Theorem 1.2, planar Dirichlet case).

For every radius R>0R>0R>0 and every k≥1k\ge1k≥1, the kkk-th Dirichlet eigenvalue of the disk DR={x:∥x∥<R}D_R=\{x:\|x\|<R\}DR​={x:∥x∥<R} satisfies

λk(DR) ≥ 4πk∣DR∣  =  4kR2.\lambda_k(D_R)\ \ge\ \frac{4\pi k}{|D_R|}\;=\;\frac{4k}{R^2}.λk​(DR​) ≥ ∣DR​∣4πk​=R24k​.

This was the first non-tiling planar domain for which the conjecture was verified. The paper proves the Dirichlet case for balls in all dimensions d≥2d\ge2d≥2; this milestone is the planar instance. It rules out disks as counterexamples.

Formalization Note. The disk is disk R and the bound is written in the uniform Pólya form 4πk/area4\pi k/\text{area}4πk/area; the equality with 4k/R24k/R^24k/R2 uses ∣DR∣=πR2|D_R|=\pi R^2∣DR​∣=πR2.

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

theorem polya_disk (R : ℝ) (hR : 0 < R) (k : ℕ) (hk : 1 ≤ k) :
    dirichletEigenvalue (disk R : Set (EuclideanSpace ℝ (Fin 2))) k ≥
      4 * Real.pi * (k : ℝ) / area (disk R : Set (EuclideanSpace ℝ (Fin 2))) := by sorry

end PolyaLaplacian
Source
Filonov–Levitin–Polterovich–Sher, Pólya's conjecture for Euclidean balls, Invent. Math. 234 (2023), 129–169, Theorem 1.2 (planar Dirichlet case), https://arxiv.org/abs/2203.07696
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