betaFeedback

WorksMathematics

Maximizing the First Positive Neumann Eigenvalue of Simple Pentagons

Abstract

We prove that among all simple pentagons of prescribed area—including non-convex pentagons and pentagons with straight interior angles—the regular pentagon uniquely maximizes the first positive Neumann eigenvalue of the Laplacian up to congruence. The proof separates naturally into two regimes. For pentagons having at least one reflex or straight interior angle, the number of strictly convex vertices is at most four; conformal mapping from the unit disk together with a Schwarz–Christoffel and Blaschke-product estimate yields the uniform bound ∣P∣μ1(P)<10.34|P|\mu_1(P) < 10.34, strictly below the regular-pentagon value ∣R∣μ1(R)>10.35335|R|\mu_1(R) > 10.35335. For strictly convex pentagons, normalizing a maximum-area vertex triangle reduces the problem to a four-dimensional shape chart coupled with a unimodular metric matrix. Combining covariance bounds, explicit polynomial trial functions, conic duality for pairs of trial functions, and Bernstein-basis branch-and-bound, we confine every potential maximizer to an explicit neighborhood of the regular pentagon in vertex Fourier coordinates. Because the first positive eigenspace of the regular pentagon is two-dimensional, we analyze both eigenfunctions simultaneously together with their first-order corrections to show that every nontrivial local deformation of the similarity class strictly decreases ∣P∣μ1(P)|P|\mu_1(P). All finite-dimensional inequalities invoked in the proof are accompanied by independently verifiable rational and interval arithmetic certificates.

The Extremal Problem and Main Result

Among all free planar membranes of equal area shaped like a pentagon, which has the highest fundamental tone? Under homogeneous Neumann boundary conditions, the lowest nonzero frequency of vibration is proportional to μ1(P)\sqrt{\mu_1(P)}, where μ1(P)\mu_1(P) denotes the first positive Neumann eigenvalue of the Laplacian −Δ-\Delta on the bounded planar domain PP. Since a simple polygon is a bounded Lipschitz domain, the embedding H1(P)↪L2(P)H^1(P) \hookrightarrow L^2(P) is compact, so the Neumann spectrum is discrete and the variational infimum is attained. Scaling PP by a factor s>0s>0 multiplies the area by s2s^2 and μ1(P)\mu_1(P) by s−2s^{-2}; we therefore compare the scale-invariant functional

F(P)=∣P∣μ1(P),μ1(P)=inf⁡v∈H1(P),v≠0∫Pv=0∫P∣∇v∣2∫Pv2.F(P)=|P|\mu_1(P), \qquad\mu_1(P)=\inf_{\substack{v\in H^1(P),\,v\ne0\\ \int_P v=0}}\frac{\int_P|\nabla v|^2}{\int_Pv^2}.

Laugesen posed the problem of maximizing F(P)F(P) among nn-gons for arbitrary n≥3n\ge3 [1]. The triangular case was settled by Laugesen and Siudeja, who proved that the equilateral triangle is the unique maximizer [2]. Among convex quadrilaterals, Endo and Osting established the optimality of the square by combining a local variational analysis near the square with a computer-assisted certificate covering the complement [3].

In this paper we resolve the pentagonal case in full generality, without restricting to convex domains. Throughout, a simple pentagon means a bounded open set enclosed by a simple closed polygonal curve of five edges; we permit interior angles equal to π\pi (straight vertices) as well as interior angles strictly exceeding π\pi (reflex vertices). A vertex whose interior angle is strictly less than π\pi is called strictly convex. We denote the regular pentagon by RR.

Theorem 1. For every simple pentagon PP of positive area,

∣P∣μ1(P)≤∣R∣μ1(R),|P|\mu_1(P) \le|R|\mu_1(R),

with equality if and only if PP is similar to RR. Consequently, among simple pentagons of prescribed area, the maximizer is unique up to congruence.

Proof. A non-convex pentagon has at least one interior angle strictly greater than π\pi, while a pentagon with a straight vertex has at most four remaining interior angles. In either case, PP possesses at most four strictly convex vertices. By Theorem 2 and Proposition 5,

F(P)<10.34<10.35335<F(R).F(P) < 10.34 < 10.35335 < F(R).

The remaining polygons are convex pentagons with all five interior angles strictly less than π\pi, for which the inequality and the equality characterization are established in Theorem 18. Finally, two similar pentagons of equal area must have similarity ratio 11, yielding uniqueness up to congruence. □

Overview of the Proof and Organization

The proof proceeds along four main stages:

  1. Pentagons with reflex or straight angles (§ 2). Reflex or straight angles reduce the number pp of strictly convex vertices. Pulling back via a conformal map f:D→Pf:\mathbb{D}\to P, we derive a circular-mean lower bound controlled solely by pp via the Schwarz–Christoffel formula and Jensen’s formula for finite Blaschke products (Lemma 3). Summing the Rayleigh inequalities for a radially weighted pair g(r)cos⁡θg(r)\cos\theta, g(r)sin⁡θg(r)\sin\theta and taking a positive linear combination of circular-mean bounds at three radii yields a uniform upper bound for every simple polygon with p≤4p\le4 (Theorem 2).

  1. Spectral gap and high-precision benchmark for RR (§ 3). Because convex pentagons can approach RR arbitrarily closely, no uniform spectral margin exists in the convex class. Using Crouzeix–Raviart nonconforming finite elements on a symmetric triangulation together with exact matrix inertia and an explicit edge-average interpolation bound, we certify lower bounds for μ1(R)\mu_1(R) and μ3(R)\mu_3(R) (Lemma 4), confirming that the first positive eigenspace EE of RR is two-dimensional and carries the standard irreducible representation of the dihedral group D5D_5. An equilibrated flux construction combined with a spectral variance bound then encloses μ1(R)\mu_1(R) and F(R)F(R) to sixteen decimal digits (Proposition 5).

  1. Local and annular comparison in vertex Fourier coordinates (§ 4–§ 5). Near RR, similarity classes of pentagons are parametrized by three complex vertex Fourier coordinates (ξ2,ξ3,ξ4)(\xi_2,\xi_3,\xi_4) with radius r=(∑k=24∣ξk∣2)1/2r=\left(\sum_{k=2}^{4}|\xi_k|^2\right)^{1/2} vanishing precisely at RR. Because μ1(R)\mu_1(R) has multiplicity two, the first-order variation operator degenerates along a kernel KK. We construct a polynomial approximation to EE (Lemma 6) and determine KK together with the linear splitting rate on its orthogonal complement (Lemma 7). On 0<r≤1/1000<r\le1/100, deformations away from KK are governed directly by the lower first-order branch (Lemma 8), whereas near KK we perturb both basis eigenfunctions simultaneously and bound the sum of their comparison forms, obtaining the quantitative deficit F(R)−F(P)≥F(R)r2/50F(R)-F(P)\ge F(R)r^2/50 (Theorem 9). On the surrounding annulus 1/100≤r≤47/2001/100\le r\le47/200, explicit piecewise-linearly transplanted polynomial trial functions and Bernstein certification establish F(P)<F(R)F(P)<F(R) (Theorem 10).

  1. Global reduction in affine coordinates (§ 6). To close the argument, every convex pentagon satisfying F(P)≥F(R)F(P)\ge F(R) must lie within the outer annular radius 47/200=0.23547/200=0.235. Selecting a maximum-area vertex triangle TT and mapping it affinely to a reference right triangle moves the affine distortion into a unimodular positive definite

metric HH inside the Rayleigh quotient. Recursive subdivision eliminates both the same-arc configuration (Theorem 11) and the outer boundary of the two-ear configuration (Theorem 12). To tighten the remaining parameter box without subdividing the metric space, we prove a fourth-moment and variance–eigenvalue bound for convex polygons (Proposition 13), deduce a covariance condition-number bound (Corollary 14), and apply a conic duality lemma for pairs of trial functions (Lemma 15) to exclude the remaining fringe (Theorem 16). On the compact core that remains, a harmonic-bridge estimate (Proposition 17) forces r<231/1000<47/200r < 231/1000 < 47/200, linking seamlessly with the annular bound and completing the proof of Theorem 18.

Pentagons with Reflex or Straight Angles

Reflex and straight angles decrease the count of strictly convex vertices. The estimate below depends only on this count and therefore holds for simple polygons with any number of sides.

Theorem 2. Let PP be a simple polygon with at most four interior angles strictly less than π\pi. Then

∣P∣μ1(P)<39332962938041250<51750=10.34.|P|\mu_1(P) < \frac{393329629}{38041250} < \frac{517}{50} = 10.34.

Normalize the area of PP to ∣P∣=π|P| = \pi, and let f:D→Pf : \mathbb{D} \to P be a conformal bijection rotated so that f′(0)=α>0f'(0) = \alpha> 0. Setting

q(z)=f′(z)α=1+∑k≥1γkzk,wk=∣γk∣2k+1,q(z) = \frac{f'(z)}{\alpha} = 1 + \sum_{k\geq1} \gamma_k z^k, \qquad w_k = \frac{|\gamma_k|^2}{k+1},

the area formula ∣P∣=∫D∣f′(z)∣2 dA(z)|P| = \int_{\mathbb{D}} |f'(z)|^2\,dA(z) and orthogonality of angular Fourier modes yield

α2(1+∑k≥1wk)=1.\alpha^2\left(1+\sum_{k\geq1}w_k\right)=1.

Below we choose the conformal center f(0)f(0) so that our Neumann trial functions have zero mean; at this center, the first coefficient γ1\gamma_1 need not vanish. We therefore formulate Wang’s circular-mean estimate [4 Lemma 3.3] while retaining the k=1k=1 mode.

Lemma 3. Suppose the simple polygon PP has exactly pp strictly convex vertices. Then for all 0<ρ<10<\rho<1 and b≥0b\geq0,

∑k≥1wk(k+1)(k2−b)2ρk≥(1+b)2ρp−b2.(1)\sum_{k\geq1} w_k(k+1)\left(\frac{k}{2}-b\right)^2\rho^k \geq(1+b)^2\rho^p-b^2. \tag*{(1)}

Proof. Discard all straight vertices, leaving NN vertices with interior angles θi∈(0,2π)∖{π}\theta_i\in(0,2\pi)\setminus\{\pi\} and preimages ξi∈∂D\xi_i\in\partial\mathbb{D}. Set νi=(π−θi)/(2π)\nu_i=(\pi-\theta_i)/(2\pi); then νi>0\nu_i>0 precisely at strictly convex vertices, and the exterior-angle sum of a simple polygon gives ∑i=1Nνi=1\sum_{i=1}^{N}\nu_i=1. By the Schwarz–Christoffel formula on D\mathbb{D},

q(z)=∏i=1N(1−ξi‾z)−2νi.q(z)=\prod_{i=1}^{N}(1-\overline{\xi_i}z)^{-2\nu_i}.

Define the rational functions

H(z)=zq′(z)2q(z)=∑i=1Nνi1−ξi‾z−1,L(z)=H(z)−b1+b+H(z).H(z)=\frac{zq'(z)}{2q(z)}=\sum_{i=1}^{N}\frac{\nu_i}{1-\overline{\xi_i}z}-1,\qquad L(z)=\frac{H(z)-b}{1+b+H(z)}.

For every z∈∂D∖{ξ1,…,ξN}z \in\partial D \setminus\{\xi_1,\ldots,\xi_N\}, we have Re⁡((1−ξi‾z)−1)=1/2\operatorname{Re}\left((1-\overline{\xi_i}z)^{-1}\right)=1/2, hence

Re⁡H(z)=12∑i=1Nνi−1=−12.\operatorname{Re} H(z)=\frac{1}{2}\sum_{i=1}^{N}\nu_i-1=-\frac{1}{2}.

Thus H(z)−bH(z)-b and 1+b+H(z)1+b+H(z) have opposite real parts and equal imaginary parts on each boundary arc, so ∣L(z)∣=1|L(z)|=1 on ∂D\partial D.

Moreover, L(z)=1L(z)=1 occurs precisely at the simple poles ξi\xi_i of HH. Near ξi\xi_i, H(z)∼νi/(1−ξi‾z)H(z)\sim\nu_i/(1-\overline{\xi_i}z), so L(z)−1∼−(1+2b)(1−ξi‾z)/νiL(z)-1\sim-(1+2b)(1-\overline{\xi_i}z)/\nu_i, giving

ξiL′(ξi)=1+2bνi.\xi_iL'(\xi_i)=\frac{1+2b}{\nu_i}.

References

  1. [1]R. S. Laugesen, Problem on polygonal Neumann eigenvalues, in Low Eigenvalues of Laplace and Schrödinger Operators, Oberwolfach Report 6/2009, p. 405. Workshop report.
  2. [2]R. S. Laugesen and B. A. Siudeja, Maximizing Neumann fundamental tones of triangles, J. Math. Phys. 50 (2009), 112903. doi:10.1063/1.3246834.DOI
  3. [3]R. Endo and B. Osting, Maximizing the fundamental Laplace–Neumann eigenvalue on quadrilaterals, preprint (2026). arXiv:2609.02784.arxiv.org/abs/2609.02784
  4. [4]H. Wang, The Pólya–Szegő inequalities for polygons, preprint, (2026). arXiv:2611.22305.
  5. [5]L. E. Payne and H. F. Weinberger, An optimal Poincaré inequality for convex domains, Arch. Rational Mech. Anal. 5 (1960), 286–292. doi:10.1007/BF00252910.DOI
  6. [6]L. Dong and H. Wang, The first positive Neumann eigenvalue of simple pentagons and the large-side limit, Zenodo, version 1 (18 November 2026). doi:10.5281/zenodo.24356848.

Paper details

vlnc:W_dbdn8b2y
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 3

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Not recorded for this paper

View statement
Looking for related papers…
Contents