The optimal eigenvalue count in Aubry's spectral sphere theorem for dimensions at least four

29 September 2026, Version 2
This content is an early or alternative research output and has not been peer-reviewed by Cambridge University Press at the time of posting.

Abstract

For every n≥4, we determine the least number of positive Laplace eigenvalues whose pinching to n, under Ric_g≥(n−1)g, forces a closed connected n-manifold to be homeomorphic or diffeomorphic to Sⁿ. This number is n, also within the simply connected class. The examples are defined on a fixed simply connected manifold Mₙ with H₂(Mₙ;ℤ)≅ℤ². At every sufficiently small prescribed volume V>0, it admits a smooth family with λ₁,…,λₙ₋₁→n and λₙ≥n+cₙ, where cₙ>0 is an Aubry constant. The proof uses the fixed-volume degeneration theorem for core-admissible doubles from a companion preprint. Applying that theorem also to Sⁿ gives two families, on nonhomeomorphic manifolds, with the same volume, Ricci lower bound, and metric-measure limit S^(n−2)*S¹_(2πq), where q=V/Vol(Sⁿ,g_(Sⁿ)). Spectral convergence gives the same limit for every fixed eigenvalue index. For q=1/m, the known spectrum of the corresponding cyclic spherical quotient makes these limits explicit. In particular, for all sufficiently large integers m≥3, the nth positive eigenvalue of both families tends to 2(n+1). Each family has constant volume density and, for fixed V, a uniform positive lower bound for the volumes of unit balls.

Keywords

Spectral geometry
Ricci curvature
MSC 2020: 58J50
MSC 2020: 53C20
MSC 2020: 53C21
MSC 2020: 53C23

Supplementary weblinks

Comments

Comments are not moderated before they are posted, but they can be removed by the site moderators if they are found to be in contravention of our Commenting and Discussion Policy [opens in a new tab] - please read this policy before you post. Comments should be used for scholarly discussion of the content in question. You can find more information about how to use the commenting feature here [opens in a new tab] .
This site is protected by reCAPTCHA and the Google Privacy Policy [opens in a new tab] and Terms of Service [opens in a new tab] apply.