The equilateral triangle maximises the first Steklov eigenvalue among triangles

Contributed by Jason Davies ↗

Version 1 / Nov 19, 2026 / CC BY 4.0

Abstract

Let σ1(T)\sigma_1(T) be the first nonzero Steklov eigenvalue of a triangle TT and L(T)L(T) its perimeter. Among triangles the equilateral triangle EE uniquely maximises σ1L\sigma_1 L. If the shortest and longest sides of TT have lengths a≤ba\le b, then σ1(E)L(E)−σ1(T)L(T)≥(b−a)/(2b)\sigma_1(E)L(E)-\sigma_1(T)L(T)\ge (b-a)/(2b). Since ∣T∣/L(T)2|T|/L(T)^2 is also maximal at EE, the equilateral triangle uniquely maximises σ1∣T∣\sigma_1\sqrt{|T|} as well. This settles the case n=3n=3 of the Steklov analogue of the Pólya–Szegő conjecture for nn-gons, for both normalisations. The extremal value satisfies 3.8724615957722≤σ1(E)L(E)≤3.87246159577343.8724615957722\le \sigma_1(E)L(E)\le 3.8724615957734. For side length one, σ1(E)=σ2(E)<σ3(E)=23<σ4(E)\sigma_1(E)=\sigma_2(E)<\sigma_3(E)=2\sqrt3<\sigma_4(E). Under displacement of the apex over a fixed unit base, the first two perimeter-normalised eigenvalues split linearly with equal and opposite slopes independent of direction. The proof is computer-assisted. Near EE we transplant the first eigenspace of EE affinely; away from EE the trial function cos⁡(πx)\cos(\pi x) suffices. We verify the finite matrix and interval inequalities in ball arithmetic.

Provenance statement

The result, its computer-assisted proof, the code, the partial Lean formalisation and the manuscript were produced by AI systems directed by the author. During a broader investigation of open problems from the AIM problem lists, Claude Opus 5.5 (Anthropic), used through Claude Code, identified this problem as a candidate, found the proof, wrote the certified ball-arithmetic computations (Arb via python-flint) and the Lean 4/Mathlib formalisation of the elementary steps, and wrote the manuscript. OpenAI Codex subsequently revised the proof and computational certificates for stability, spectral isolation and splitting, and incorporated the thin-domain corollary. The author wrote no part of the text and has not checked the arguments.

Tools used

Anthropic
Claude CodeVersion Claude Opus 5.5
OpenAI
CodexVersion GPT-6.2-Astra
Lean
LeanVersion 4

References

  1. AIM Problem Lists, Steklov eigenproblems , Section 4 (Shape optimisation for Steklov), Problem 4.6 (É. Oudet), http://aimpl.org/stekloveigen/4.link
  2. F. Johansson, Arb: efficient arbitrary-precision midpoint-radius interval arithmetic , IEEE Trans.\ Comput.\ 66 (2017), 1281--1292. doi:10.1109/TC.2017.2690633 (https://doi.org/10.1109/TC.2017.2690633).DOI
  3. M. Bebendorf, A note on the Poincaré inequality for convex domains , Z. Anal.\ Anwend.\ 22 (2003), 751--756. doi:10.4171/ZAA/1170 (https://doi.org/10.4171/ZAA/1170).DOI
  4. Z. Cheng, C. Gui, Y. Hu, Q. Li, R. Yao, Global strict monotonicity and asymptotics of the first Steklov eigenvalue for regular polygons , arXiv:2603.25116v2 (2026). doi:10.48550/arXiv.2603.25116 (https://doi.org/10.48550/arXiv.2603.25116).arXivDOI
  5. M. Crouzeix, P.-A. Raviart, Conforming and nonconforming finite element methods for solving the stationary Stokes equations I , RAIRO Anal.\ Numér.\ 7 (1973), 33--75. doi:10.1051/m2an/197307R300331 (https://doi.org/10.1051/m2an/197307R300331).DOI
  6. C. Davis, W. M. Kahan, The rotation of eigenvectors by a perturbation. III , SIAM J.\ Numer.\ Anal.\ 7 (1970), 1--46. doi:10.1137/0707001 (https://doi.org/10.1137/0707001).DOI
  7. S. Dominguez, N. Nigam, B. Shahriari, A combined finite element and Bayesian optimization framework for shape optimization in spectral geometry , Comput.\ Math.\ Appl.\ 74 (2017), no. 11, 2874--2896. doi:10.1016/j.camwa.2017.08.044 (https://doi.org/10.1016/j.camwa.2017.08.044).DOI
  8. E. B. Dryden, C. Gordon, J. Moreno, J. Rowlett, C. Villegas-Blas, The Steklov spectrum of convex polygonal domains I: spectral finiteness , J.\ Geom.\ Anal.\ 35 (2025), no. 3, Paper No. 91. doi:10.1007/s12220-025-01922-8 (https://doi.org/10.1007/s12220-025-01922-8).DOI
  9. A. Girouard, J. Lagacé, I. Polterovich, A. Savo, The Steklov spectrum of cuboids , Mathematika 65 (2019), no. 2, 272--310. doi:10.1112/S0025579318000414 (https://doi.org/10.1112/S0025579318000414).DOI
  10. A. Girouard, I. Polterovich, Spectral geometry of the Steklov problem , J.\ Spectr.\ Theory 7 (2017), 321--359. doi:10.4171/JST/164 (https://doi.org/10.4171/JST/164).DOI
Show all 17 referencesShow fewer references
  1. R. S. Laugesen, B. A. Siudeja, Maximizing Neumann fundamental tones of triangles , J.\ Math.\ Phys.\ 50 (2009), 112903. doi:10.1063/1.3246834 (https://doi.org/10.1063/1.3246834).DOI
  2. A. Henrot and M. Michetti, A comparison between Neumann and Steklov eigenvalues , J. Spectr. Theory 12 (2022), 1405--1442, doi:10.4171/JST/429 (https://doi.org/10.4171/JST/429).DOI
  3. N. Nigam, Open Problem 8 in Open problems from the miniconference on sharp eigenvalue estimates for partial differential operators (2020), problem list (https://publish.illinois.edu/eigenvalues2020/files/2020/04/Open-problems.pdf).link
  4. X. Liu, A framework of verified eigenvalue bounds for self-adjoint differential operators , Appl.\ Math.\ Comput.\ 267 (2015), 341--355. doi:10.1016/j.amc.2015.03.048 (https://doi.org/10.1016/j.amc.2015.03.048).DOI
  5. L. E. Payne, H. F. Weinberger, An optimal Poincaré inequality for convex domains , Arch.\ Rational Mech.\ Anal.\ 5 (1960), 286--292. doi:10.1007/BF00252910 (https://doi.org/10.1007/BF00252910).DOI
  6. R. Weinstock, Inequalities for a classical eigenvalue problem , J.\ Rational Mech.\ Anal.\ 3 (1954), 745--753. doi:10.1512/iumj.1954.3.53036 (https://doi.org/10.1512/iumj.1954.3.53036).DOI
  7. C. You, H. Xie, X. Liu, Guaranteed eigenvalue bounds for the Steklov eigenvalue problem , SIAM J.\ Numer.\ Anal.\ 57 (2019), 1395--1410. doi:10.1137/18M1189592 (https://doi.org/10.1137/18M1189592).DOI

Version history

  1. v1 · 14 pagesSubmitted by Jason DaviesInitial depositCurrentNov 19, 2026