Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Pólya for planar annuli (FLPS 2026, Thm 1.1)

Open
PolyaLaplacian.polya_annulus

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

eigenvalueslaplacianspectral-theory

Pólya's conjecture for planar annuli (Filonov–Levitin–Polterovich–Sher 2026, Theorem 1.1).

For every inner radius r∈(0,1)r\in(0,1)r∈(0,1) and every k≥1k\ge1k≥1, the kkk-th Dirichlet eigenvalue of the annulus Ar={x:r<∥x∥<1}A_r=\{x:r<\|x\|<1\}Ar​={x:r<∥x∥<1} satisfies

λk(Ar) ≥ 4πk∣Ar∣  =  4k1−r2.\lambda_k(A_r)\ \ge\ \frac{4\pi k}{|A_r|}\;=\;\frac{4k}{1-r^2}.λk​(Ar​) ≥ ∣Ar​∣4πk​=1−r24k​.

This is the first non-simply-connected planar domain for which the conjecture was verified, and it is directly relevant here because the sought counterexample may have holes. It rules out annuli as counterexamples.

Formalization Note. The annulus is annulus r (outer radius normalized to 111); the bound is written in the uniform Pólya form 4πk/area4\pi k/\text{area}4πk/area, using ∣Ar∣=π(1−r2)|A_r|=\pi(1-r^2)∣Ar​∣=π(1−r2).

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

theorem polya_annulus (r : ℝ) (hr : 0 < r) (hr1 : r < 1) (k : ℕ) (hk : 1 ≤ k) :
    dirichletEigenvalue (annulus r : Set (EuclideanSpace ℝ (Fin 2))) k ≥
      4 * Real.pi * (k : ℝ) / area (annulus r : Set (EuclideanSpace ℝ (Fin 2))) := by sorry

end PolyaLaplacian
Source
Filonov–Levitin–Polterovich–Sher, Pólya's conjecture for Dirichlet eigenvalues of annuli, J. London Math. Soc. 113(2) e70425 (2026), Theorem 1.1, https://arxiv.org/abs/2505.21737
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