Pólya (1961): tiling domains satisfy the Dirichlet bound
OpenPolyaLaplacian.polya_tilingPólya's own positive result (1961): the conjecture holds for tiling domains.
Let be a bounded, nonempty open set that tiles the plane: there is a countable family of isometric copies of that are pairwise disjoint and whose union covers the plane up to a set of measure zero. Then for every ,
This is the planar Dirichlet case of Pólya's theorem, as stated in the introduction of Filonov–Levitin–Polterovich–Sher: "domains such that can be covered, up to a set of measure zero, by a disjoint union of copies of ." 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 are pairwise disjoint with null complement. The eigenvalue and area are the mission's min–max and Lebesgue-measure definitions.
import Mathlib import Definitions.Def_PolyaLaplacian_Spectral open MeasureTheory Set TopologicalSpace
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 PolyaLaplacianConfirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.