WorksMathematics
The Square Maximizes the First Nonzero Steklov Eigenvalue Among Convex Quadrilaterals
Abstract
We show that among all convex planar polygons of prescribed perimeter with at most four sides, the square uniquely maximizes the first positive Steklov eigenvalue. If denotes the unique root of , then , with equality if and only if is a square. By the quadrilateral isoperimetric inequality, the square also uniquely maximizes the area-normalized eigenvalue in the same class. Our proof splits the four-dimensional moduli space of convex quadrilaterals into a neighborhood of the square and its complement. Near the square, a weighted combination of the two first Steklov eigenfunctions of the square produces a negative definite Rayleigh defect; its sign on an explicit parameter box is established via an exact degree- Taylor expansion in ball arithmetic together with an analytic Cauchy remainder estimate. Far from the square, a boundary-variance inequality along a diagonal reduces the remaining shapes to a compact region, which we cover by closed subboxes using affine and harmonic quadratic trial functions checked in outward-rounded integer interval arithmetic.
Introduction and main results
Let be a bounded convex polygon of positive area and perimeter . The Steklov eigenvalue problem on asks for nonzero functions and real numbers satisfying
in the weak sense, where is the outward normal derivative along . Because is a bounded Lipschitz domain, the trace operator is compact, and the Steklov spectrum forms an unbounded sequence
counted with multiplicity; we refer to the surveys [7, 5] for background on the spectral geometry of this problem. Writing for normalized arclength measure on and for the Dirichlet energy of , the scale-invariant functional admits the variational characterization
and is invariant under Euclidean similarities.
By Weinstock’s classical inequality [9], every simply connected planar Lipschitz domain satisfies , with equality only for disks. In higher dimensions, the perimeter-normalized bound extends to convex domains [3], whereas the volume-normalized inequality is due to Brock [2] and holds for all bounded Lipschitz domains; in dimension two, the area-normalized bound follows directly from Weinstock’s theorem and the isoperimetric inequality.
2020 Mathematics Subject Classification. Primary 35P15; Secondary 49R05, 52A10, 52A40, 65G20.
Key words and phrases. Steklov eigenvalue problem, convex quadrilaterals, Weinstock inequality, polygonal shape optimization, interval arithmetic. A natural polygonal counterpart, analogous to the Pólya–Szegő conjecture for the first Dirichlet eigenvalue and Laugesen’s problem for the first positive Neumann eigenvalue, asks whether the regular -gon maximizes among convex polygons of given perimeter with at most sides. Unlike the Dirichlet problem for triangles and quadrilaterals, where Steiner symmetrization settles the sharp bounds, symmetrization does not preserve the boundary -norm and perimeter in a way compatible with (1). The polygonal Steklov problem was raised by Oudet in the 2018 AIM Steklov problem list [1] and formulated explicitly for convex polygons with at most sides by Cheng, Gui, Hu, Li, and Yao [4 Conjecture 1.1], who also established that increases monotonically along the sequence of regular -gons [4 Theorem 1.1].
Using separation of variables and careful estimates for the resulting transcendental equations, Girouard, Lagacé, Polterovich, and Savo [6] proved that the square maximizes among rectangles of fixed perimeter or fixed area. For , a preprint by Davies gives a computer-assisted proof that the equilateral triangle uniquely maximizes among all triangles. Here we prove the case . For each triangular competitor , Lemma 3 gives the independent bound , strictly below the value for the square.
Theorem 1. Let be a convex polygon of positive area with at most four sides, and let be the unique root of . Then
with equality if and only if is a square.
Combining Theorem 1 with the quadrilateral isoperimetric inequality gives the corresponding bound at fixed area.
Corollary 2. Among all convex planar polygons of positive area with at most four sides,
with equality if and only if is a square.
Proof. Let be the successive side lengths of , inserting a fourth collinear vertex if is a triangle. Splitting along each diagonal in turn yields and . Adding these inequalities gives
so , with equality precisely for squares. Multiplying Theorem 1 by and checking equality on a square completes the proof. □
Two features distinguish the general quadrilateral problem from the rectangular and triangular cases. First, the space of similarity classes of convex quadrilaterals is four-dimensional: beyond the two affine shape parameters governing parallelograms, two nonaffine parameters control trapezoidal and kite-like distortions. Second, the first positive Steklov eigenvalue of the square has multiplicity two, so is not smooth at the square and a single trial function cannot detect all perturbation directions simultaneously.
Our argument proceeds in three stages. In § 2, we parametrize convex quadrilaterals up to similarity as bilinear images of the reference square in four coordinates , and we prove an elementary diagonal variance bound (Lemma 3) that excludes all triangles together with all quadrilaterals satisfying or . In § 3, we form a weighted combination of the two first Steklov eigenfunctions of whose Rayleigh defect is invariant under the symmetries of the square and has a negative definite Hessian at the origin; an exact degree-22 Taylor expansion in ball arithmetic combined with an analytic Cauchy tail bound shows that throughout the central box , , , . In § 4, we treat the remaining compact region by partitioning it into 940 closed subboxes on which explicit affine or harmonic quadratic trial functions yield , completing the proof of Theorem 1. § 5 gathers several concluding remarks on quantitative stability, possible extensions, and computational details.
Shape coordinates and a diagonal estimate
Let . Bilinear interpolation of the four positively ordered vertices of a convex quadrilateral represents as the image of under
where, after applying a suitable Euclidean similarity,
To reach this normalization, translate the arithmetic mean of the four vertices to the origin. The columns of the linear part of are then two consecutive semidiagonals of the Varignon midpoint parallelogram (Figure 1, left), and positive vertex ordering ensures . Applying the orthogonal factor from the polar decomposition of rotates the linear part into a symmetric positive definite matrix, and a dilation rescales its trace to 2.

Figure 1. Left: the bilinear chart and the inscribed midpoint parallelogram (dashed) with semidiagonals . Right: the boundary arc decomposition along a normalized diagonal in Lemma 3.
Setting
we see that for a quadrilateral with four strictly convex corners, consecutive edges make positive turns, so is positive at all four corners of and hence throughout by affinity. The map has topological degree 1 at every interior point of and degree 0 outside ; since every interior preimage has positive Jacobian, maps diffeomorphically onto the interior of . In particular, nonnegativity of at the corners of reads
Since , this convexity condition says precisely that . The remaining discrete symmetries of the square act on as follows: exchanging the two coordinate axes sends ; reflecting across one axis sends ; and inversion through the origin sends . Composing these symmetries allows us to assume without loss of generality that , , and . Whenever and , the inclusion bounds the components of by
Lemma 3. Let be the length of either diagonal of a convex quadrilateral . Then
The same inequality holds when is a triangle and is the length of any of its sides.
Proof. Align the chosen diagonal with the horizontal axis and rescale so that its endpoints lie at and $(1,0)) (Figure 1, right). Each of the two polygonal arcs of joining these endpoints consists of two line segments meeting at an intermediate vertex , whose lengths satisfy . Under normalized arclength on this arc, set , so the two segments carry weights and . Conditional on each segment, the horizontal coordinate is uniform on or , with conditional variances and and conditional means and differing by $1$. By the law of total variance, the variance of the horizontal coordinate along this arc equals
Because by the triangle inequality, the identity implies that has the same sign as and . Thus , so the variance on each arc is at least . Since the variance of a mixture of two probability distributions is at least the average of their component variances, the boundary variance over all of is also at least . Restoring the length scale gives for the unit-slope linear projection , whose Dirichlet energy is . Inserting into (1) establishes the claim. For a triangle, subdividing the chosen side at its midpoint yields two arcs of the same two-segment type. □
For a triangle , choosing to be its longest side forces the third vertex to lie in the intersection of the two disks of radius centered at the endpoints of that side, so its altitude is at most and . Lemma 3 then gives
For a convex quadrilateral in the chart (2) with , the longer diagonal has length , where . Applying Lemma 3 yields
whenever . In particular, (5) holds whenever or .
Local analysis near the square
On the reference square , let be the unique solution of , and put . By [6 Theorem 1.6 and Proposition 4.2], the first positive Steklov eigenvalue of is , with multiplicity , and the corresponding eigenspace is spanned by the harmonic functions
In the coordinates (2), write for the perimeter of , put , and define for
Whenever , testing the centered function in (1) yields . To probe both modes of the double eigenspace at once, we form the weighted Rayleigh defect
whose weights remain positive throughout the region considered below. The three discrete symmetries of the square act on by
leaving invariant. At the origin we have , since and are zero-mean Steklov eigenfunctions on and . Inversion eliminates every monomial of odd total degree in (in particular in degrees 1 and 2); reflection across one axis eliminates ; and coordinate exchange removes the linear term in while equating the coefficients of and . Consequently, the quadratic Taylor polynomial of at the origin takes the diagonal form . Evaluating these second-order coefficients via the exact formulas of § 3.1 gives
Thus the square is a strict local maximizer of across all four shape coordinates, including both nonaffine directions . We now turn this local negativity into an explicit neighborhood of the origin.
Exact Taylor coefficients
For , the constant boundary speeds along the horizontal edges and vertical edges of are
and the normalized perimeter is . The area Jacobian (3) expands as
For , trigonometric and hyperbolic identities give
while the corresponding formulas for follow by replacing with . Every area or boundary integral entering , , is a linear combination of integrals of exponentials with , where . Writing
the coefficient of in the Taylor series of is
Each resulting one-dimensional integral of reduces either to an endpoint evaluation (along an edge) or to the elementary integral , which obeys the recurrence
with for even and for odd $n. Combining these exact integrals with the finite binomial expansions of the four edge speeds through degree determines every Taylor coefficient of algebraically, without numerical quadrature. Isolating by bisection on and evaluating the recurrences and series products in outward-rounded Arb ball arithmetic [8] yields rigorous enclosures for all coefficients.
Cauchy remainder and the local box
Write , let be prescribed box half-widths (also denoted ), and define the positive definite quadratic form
From the enclosures on above, the degree-2 part of is bounded above by . For any monomial of total degree , if every exponent is even and its Taylor coefficient is nonpositive, the term is nonpositive throughout the box and may be dropped; otherwise, factoring out either (when ) or (when ) and estimating the remaining factors by gives
To control the Taylor tail of degree , write with and for at least one index , so that and . Set and choose a radius satisfying
Each squared edge speed factors as with real obeying , so the principal square roots (positive at ) extend holomorphically to the closed disk . Every other term in is entire in . On the circle , define
and
For every and , the complexified coordinates satisfy and . Since , the bounds and give , and the analytically continued energy densities have moduli at most . Likewise, on and each continued edge speed has modulus at most . Therefore,
whence on . By Cauchy’s estimate, the Taylor tail of degree divided by is bounded uniformly by
Whenever the sum of the relative bounds from degrees 3 through and this Cauchy remainder is less than 1, it follows that for every nonzero in the box.
We choose the parameters
Evaluating the Taylor coefficients and remainder estimate in Arb ball arithmetic shows that terms of degrees 3 through 22 contribute at most , that , and that the Cauchy tail contributes at most 0.2140 . Their sum lies below 0.7693 , yielding
at every nonzero point of the central box. The same enclosure for verifies that .
Exterior region: affine and harmonic quadratic trial functions
Retaining and combining the symmetry reduction of § 2 with (5), it remains to consider convex quadrilaterals in the parameter rectangle
lying outside the central box , . On this complement, it suffices to exhibit a trial function satisfying
for then (1) implies .
Under the bilinear map (2), the four edges of are parametrized by for (), where the pairs are (up to orientation)
Set and , so that .
Affine trial functions
For a constant vector , the linear function has Dirichlet energy .
Given a scalar shift , put and . Since , condition (7) is equivalent to
because the difference between the left- and right-hand sides equals .
Harmonic quadratic trial functions
Let and let be a traceless symmetric matrix, and consider the harmonic quadratic polynomial
Its gradient is , and . Integrating (3) over the symmetric square yields the three physical area moments
from which the Dirichlet energy follows explicitly as
Along edge , write , where
Put and . Direct integration over shows that the edge averages of and equal and , respectively. Clearing denominators in (7) yields the equivalent polynomial inequality
whose left-hand side minus its right-hand side equals .
Subdivision of the exterior region
We decompose the exterior of the central box inside into six closed root boxes sharing the same intervals (Table 1): the first three cover the complement of in the rectangle, and the remaining three cover the portion of outside . Because every box in the partition is closed, all shared boundary faces are accounted for.
A subbox is eliminated if outward-rounded interval enclosures establish either throughout the subbox (so that it contains no admissible convex quadrilateral), or one of the spectral inequalities (5), (8), or (9). All interval endpoints are integer multiples of , with rational root endpoints rounded outward; interval products use integer floor and ceiling, and square roots use integer square roots rounded outward. On each subbox, a midpoint covariance computation or generalized eigenproblem in floating point suggests candidate affine or harmonic quadratic coefficients, which are rounded to integers (with rounded to ). Once these explicit trial parameters are fixed, the verification of and (8), or and (9), is carried out entirely in integer interval arithmetic and does not rely on the accuracy of the floating-point step.
When none of the four criteria succeeds on a subbox, we bisect the coordinate of largest weighted width using weights on , keeping the midpoint in both closed child subboxes. Across the six root boxes, 934 bisections suffice, yielding a closed cover of 940 subboxes (Table 1) on every one of which an elimination criterion holds.
Completion of the proof of Theorem 1. Every triangle satisfies (4), and . For a convex quadrilateral , pass to the normalized chart (2) with . If or , inequality (5) yields . Otherwise, convexity restricts to . On the central box , , inequality (6) gives and hence whenever . Every remaining admissible tuple lies in at least one of the 940 closed subboxes of Table 1, where again . At , the domain is the reference square with . Undoing the similarity normalization shows that equality holds precisely for squares.
| Affine | Diagonal | Infeasible | Quadratic | Total | ||
| 65 | 0 | 8 | 0 | 73 | ||
| 60 | 9 | 0 | 0 | 69 | ||
| 187 | 36 | 1 | 0 | 224 | ||
| 37 | 0 | 0 | 180 | 217 | ||
| 19 | 1 | 0 | 107 | 127 | ||
| 19 | 3 | 0 | 208 | 230 | ||
| Total | 387 | 49 | 9 | 495 | 940 |
Table 1. Subboxes in the exterior partition, classified by elimination criterion. All six root boxes share and .
Concluding remarks
We close with three observations concerning stability, possible extensions, and the computational implementation.
Quantitative stability. Although Theorem 1 is stated as a sharp inequality with equality characterization, the proof yields a quantitative stability estimate near the square. Indeed, for any we have
so (6) implies that
throughout the central box. Because the denominator is continuous and bounded above on the compact central box, while outside it and is uniformly bounded across all convex quadrilaterals (since and ), the Steklov deficit controls in the normalized chart (2) up to an explicit positive constant.
Nonconvex quadrilaterals and higher polygons. Convexity enters our proof in two places: the bilinear diffeomorphism (2) and the interior-diagonal decomposition of Lemma 3. It is natural to ask whether Theorem 1 remains valid for nonconvex simple quadrilaterals. Note that reflecting the two edges incident to a reflex vertex across the line joining its neighbors strictly increases the area while preserving the perimeter, so the quadrilateral isoperimetric bound still holds for all nonconvex simple quadrilaterals; consequently, any extension of Theorem 1 to nonconvex quadrilaterals would automatically carry Corollary 2 along with it. For convex -gons with , two new obstacles arise: the dimension of the moduli space grows with , and explicit closed-form Steklov eigenfunctions are no longer available for regular -gons when , so a local analysis near the regular -gon would require rigorous approximations to the first Steklov eigenfunctions together with a lower bound on the spectral gap .
Computational details. The finite calculations of § 3 and § 4 are performed by compact, self-contained Python programs. For the local box, the recurrences of § 3.1 and the Cauchy tail estimate of § 3.2 are evaluated using Arb ball arithmetic [8] at 200-bit working precision, isolating to an interval of width at most . For the exterior region, the subdivision of § 4.3 uses exact integer interval arithmetic on . All analytic steps connecting these finite inequalities to the Steklov spectrum are contained in § 2–§ 4. Soochow University, Suzhou, China
Nanjing University of Information Science and Technology, Nanjing, China
Xiamen University, Xiamen, China
References
- [1]American Institute of Mathematics, Steklov eigenproblems, 2018 workshop problem list, Section 4, Problem 4.6 (É. Oudet).
- [2]F. Brock, An isoperimetric inequality for eigenvalues of the Steklov problem, Z. Angew. Math. Mech. 81 (2001), no. 1, 69–71.doi.org/10.1002/1521-4001(200101)81:1<69::aid-zamm69>3.0.co;2-#
- [3]D. Bucur, V. Ferone, C. Nitsch, and C. Trombetti, Weinstock inequality in higher dimensions, J. Differential Geom. 118 (2021), no. 1, 1–21.arxiv.org/abs/1710.04587
- [4]Z. Cheng, C. Gui, Y. Hu, Q. Li, and R. Yao, Global strict monotonicity and asymptotics of the first Steklov eigenvalue for regular polygons, preprint (2026), arXiv:2603.25116v2.arxiv.org/abs/2603.25116
- [5]B. Colbois, A. Girouard, C. Gordon, and D. Sher, Some recent developments on the Steklov eigenvalue problem, Rev. Mat. Complut. 37 (2024), no. 1, 1–161.arxiv.org/abs/2212.12528
- [6]A. Girouard, J. Lagacé, I. Polterovich, and A. Savo, The Steklov spectrum of cuboids, Mathematika 65 (2019), no. 2, 272–310. arXiv:1711.03075.DOI
- [7]A. Girouard and I. Polterovich, Spectral geometry of the Steklov problem, J. Spectr. Theory 7 (2017), no. 2, 321–359.
- [8]F. Johansson, Arb: efficient arbitrary-precision midpoint-radius interval arithmetic, IEEE Trans. Comput. 66 (2017), no. 8, 1281–1292. doi:10.1109/TC.2017.2690633.DOI
- [9]R. Weinstock, Inequalities for a classical eigenvalue problem, J. Rational Mech. Anal. 3 (1954), 745–753.