Open Research Index

Strict Neumann Polya inequality on simply connected planar domains

Quanyu Tang, Zuoqin Wang

Palomar Registrypalomar/PALOMAR-2026-10-09-000007Oct 9, 2026math.SPscore 0

A Lean 4 / Mathlib formalization of the strict Neumann Pólya inequality for bounded simply connected Lipschitz domains in the plane. The plane is identified with ℂ; the Neumann eigenvalues μ_0 ≤ μ_1 ≤ ... are defined by the Courant–Fischer min–max formula for the form ∫|∇u|² on H¹(Ω) (weak gradients in L²), indexed from 0 and repeated according to multiplicity, and N_N(E) = #{j ≥ 0 : μ_j |Ω| E / (4π) for every E > 0. The proof development (about 100,000 lines, namespace PolyaNeumann) also identifies the variational eigenvalues with the spectrum of the constructed self-adjoint Neumann…

SourceRepositoryJSON

Comments and reviews

No comments yet.

Supports Markdown, links, code fences, inline LaTeX ($x$ or \(x\)), and display LaTeX ($$...$$ or \[...\]).

Drafts stay in this tab.

API

curl /api/v1/records/palomar/PALOMAR-2026-10-09-000007
curl -X POST /api/v1/records/palomar/PALOMAR-2026-10-09-000007/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/palomar/PALOMAR-2026-10-09-000007/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"body": "…", "review": true}'