lean artifact · pending
Artifact ↗Strict Dirichlet Pólya inequality on simply connected planar domains
Theorem 1.1 of arXiv:2610.13139: for every bounded nonempty simply connected planar domain , with no boundary regularity assumed, for all , equivalently for (eigenvalues counted with multiplicity, endpoint included). This is the strict form of Pólya's Dirichlet inequality on the whole simply connected planar class. Previously it was known for tiling domains (Pólya 1961), disks and sectors (Filonov, Levitin, Polterovich and Sher 2023), annuli and a few further families. Multiply connected planar domains and higher dimensions remain open. The companion strict Neumann result for simply connected Lipschitz domains is a separate entry.
Exact FrontierDelta
Scope and record
Occurred: Oct 9, 2026
Delta type: SOURCE CLAIM
Assumptions: VibeMathed verification: lean-checked. Publication: preprint. AI contribution: ai-assisted. VibeMathed editorial classifications, scores, notes, relations, and dataset structure are CC BY 4.0. Source statements and linked content retain their own rights.
Canonical aliases: Strict Dirichlet Pólya inequality on simply connected planar domains · Strict Dirichlet Pólya inequality
Confidence: Not scored
Registry verification: lean checked · preprint · partial
Attribution
VibeMathed
registry · event recorded by
ChatGPT
model · ai model contributor · maker attribution ambiguous: OpenAI, Harmonic
Aristotle
model · ai model contributor · maker attribution ambiguous: OpenAI, Harmonic
Codex
model · ai model contributor · maker attribution ambiguous: OpenAI, Harmonic
Quanyu Tang
human · human collaborator
Zuoqin Wang
human · human collaborator
Artifacts and verifiers
code · pending
Artifact ↗Compute record
No linked compute attempts recorded.
Lineage and corrections
Theorem 1.1 of arXiv:2610.13139: for every bounded nonempty simply connected planar domain , with no boundary regularity assumed, for all , equivalently for (eigenvalues counted with multiplicity, endpoint included). This is the strict form of Pólya's Dirichlet inequality on the whole simply connected planar class. Previously it was known for tiling domains (Pólya 1961), disks and sectors (Filonov, Levitin, Polterovich and Sher 2023), annuli and a few further families. Multiply connected planar domains and higher dimensions remain open. The companion strict Neumann result for simply connected Lipschitz domains is a separate entry. parent of this event
VibeMathed record: Strict Dirichlet Pólya inequality on simply connected planar domains evidence for this event
This event attributed to ChatGPT
Palomar Registry: PALOMAR-2026-10-09-000003 v1 evidence for this event
This event attributed to Codex
Lean formalization (GitHub) evidence for this event
Companion Dirichlet paper, arXiv:2610.13139 evidence for this event
This event attributed to Aristotle
Strict Dirichlet Pólya inequality on simply connected planar domains parent of this event
This event attributed to Quanyu Tang
This event attributed to Zuoqin Wang
Registered snapshot, commit ba3690b evidence for this event
Act on this frontier