Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Pólya (1961): tiling domains satisfy the Dirichlet bound

Open
PolyaLaplacian.polya_tiling

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

eigenvalueslaplacianspectral-theory

Pólya's own positive result (1961): the conjecture holds for tiling domains.

Let Ω⊂R2\Omega\subset\mathbb R^2Ω⊂R2 be a bounded, nonempty open set that tiles the plane: there is a countable family of isometric copies of Ω\OmegaΩ that are pairwise disjoint and whose union covers the plane up to a set of measure zero. Then for every k≥1k\ge1k≥1,

λk(Ω) ≥ 4πk∣Ω∣.\lambda_k(\Omega)\ \ge\ \frac{4\pi k}{|\Omega|}.λk​(Ω) ≥ ∣Ω∣4πk​.

This is the planar Dirichlet case of Pólya's theorem, as stated in the introduction of Filonov–Levitin–Polterovich–Sher: "domains such that Rd\mathbb R^dRd can be covered, up to a set of measure zero, by a disjoint union of copies of Ω\OmegaΩ." It shows the conjecture holds for a large class of domains (in particular all rectangles and parallelograms), ruling them out as counterexamples.

Formalization Note. The tiling is expressed as a sequence of isometry equivalences whose images of Ω\OmegaΩ are pairwise disjoint with null complement. The eigenvalue and area are the mission's min–max and Lebesgue-measure definitions.

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

theorem polya_tiling (Ω : Set (EuclideanSpace ℝ (Fin 2)))
    (hΩ : IsOpen Ω) (hb : Bornology.IsBounded Ω) (hne : Ω.Nonempty)
    (htile : ∃ f : ℕ → (EuclideanSpace ℝ (Fin 2) ≃ᵢ EuclideanSpace ℝ (Fin 2)),
      (∀ i j : ℕ, i ≠ j → Disjoint (f i '' Ω) (f j '' Ω)) ∧
      volume ((⋃ i : ℕ, f i '' Ω)ᶜ) = 0) :
    ∀ k : ℕ, 1 ≤ k → dirichletEigenvalue Ω k ≥ 4 * Real.pi * (k : ℝ) / area Ω := by sorry

end PolyaLaplacian
Source
G. Pólya, On the eigenvalues of vibrating membranes, Proc. London Math. Soc. (3) 11 (1961), 419–433, https://doi.org/10.1112/plms/s3-11.1.419 ; statement as in FLPS, Pólya's conjecture for Euclidean balls, Invent. Math. 234 (2023), §1, 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