The Gromov--Ros conjecture for rank-one symmetric spaces of noncompact type

David Kalaj

Abstract

We prove the Gromov--Ros conjecture for every rank-one symmetric space of noncompact type: finite-perimeter isoperimetric regions are precisely the geodesic balls, up to ambient isometry and null sets. The proof is organized uniformly in the root multiplicities $(p,q)$. We introduce the volume radius \[ R(r)^n=n\int_0^r\sinh^{n-1}s\,\cosh^q s\,ds, \] which converts the polar volume form into $R^{n-1}dR\,dσ$. Hence radial--angular stretches $R\mapsto e^{t\varphi(θ)}R$ have the exact Jacobian $e^{nt\varphi}$. Starting from a volume geometric median, a log-partition correction produces an exactly volume-preserving family of global bi-Lipschitz stretches. The reduced-boundary area formula and the ambient cofactor yield a universal pointwise trace identity depending only on $(p,q)$ and the horizontal and vertical components of the measure-theoretic normal. Its specializations for $q=1,3,7$ admit explicit strict sign certificates, forcing the normal of an isoperimetric region to be radial almost everywhere. Isotropy invariance in BV and a one-dimensional weighted endpoint comparison then force a single ball. For complex hyperbolic space we additionally prove that every smooth bounded fixed-volume stable critical domain is a geodesic ball. The resulting complex-hyperbolic isoperimetric theorem removes the geometric hypothesis in several sharp weighted-Bergman contraction, Faber--Krahn, and Lieb--Wehrl inequalities, and their high-weight scaling limit recovers holomorphic Gaussian hypercontractivity.

Disclosure

“ns needed to audit the formulas by hand have been displayed above. Statements and declarations Competing interests. The author has no relevant financial or non-financial interests to disclose. Declaration of generative AI use During the preparation of this manuscript, the author used OpenAI’s ChatGPT (GPT-5.6 Sol) as an auxiliary tool for linguistic and stylistic editing, exploratory algebra, symbolic consistency checks, development and exposition of the”

PDF page 56
Classification
Rewriting existing author-written text
Multiplier
4
Verified

Structural counts

Pages 58 pdf
Theorems 17 source
Lemmas 15 source
Propositions 4 source
Corollaries 8 source
Definitions 2 source
Displayed equations 698 source
Bibliography entries 27 source
Appendix pages 11 estimated

Count notes

  • Source counts use the expanded primary TeX file main.tex.
  • Appendix pages include the first PDF page with an explicit Appendix heading through the final page.