Transverse sphere theorems for Riemannian foliations
Francisco C. Caramello Jr., Francisco A. Neubauer

TL;DR
This paper extends classical sphere theorems to the transverse geometry of Riemannian foliations, establishing new curvature and diameter conditions that lead to spherical orbifold models and convergence results.
Contribution
It introduces transverse analogues of key sphere theorems, linking curvature, diameter, and foliation structures with orbifold and limit space models.
Findings
Transverse curvature > 1 and diameter > π/2 imply leaf space is a spherical orbifold.
The space of leaf closures is a Gromov-Hausdorff limit of orbifolds.
Under quarter-pinching, convergence is non-collapsing, leading to spherical fibrations.
Abstract
We extend the classical theory of sphere theorems to the transverse geometry of Riemannian foliations. In this setting, we establish transverse analogues of the Grove-Shiohama diameter sphere theorem and of the Berger-Klingenberg quarter-pinched sphere theorem. First, we prove that if a Killing foliation of a compact, connected manifold has transverse sectional curvature greater than 1 and transverse diameter greater than , then, after an arbitrarily small deformation, the resulting foliation has leaf space homeomorphic to a good spherical orbifold. Moreover, the space of leaf closures of the original foliation is realized as a further quotient of this spherical model by a torus action. Using this deformation theory we also prove that the space of leaf closures of a Killing foliation of a compact manifold is the Gromov-Hausdorff limit of a sequence of orbifolds. Under transverse…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGeometric Analysis and Curvature Flows · Elasticity and Material Modeling · Structural Analysis and Optimization
