The Gromov–Hausdorff distance between spheres

Расстояние Громова—Хаусдорфа между сферами
Sunhyuk Lim, Facundo Mémoli, Zane Smith
2023-12-05

Borsuk–Ulam theoremGromov–Hausdorff distancemetric geometryoptimal correspondencesround spheres
We provide general upper and lower bounds for the Gromov-Hausdorff distance d GH .S m ; S n / between spheres S m and S n (endowed with the round metric) for 0 m < n 1. Some of these lower bounds are based on certain topological ideas related to the Borsuk-Ulam theorem. Via explicit constructions of (optimal) correspondences, we prove that our lower bounds are tight in the cases of d GH .S 0 ; S n /, d GH .S m ; S 1 /, d GH .S 1 ; S 2 /, d GH .S 1 ; S 3 / and d GH .S 2 ; S 3 /. We also formulate a number of open questions. 53C23 1. Introduction 3734 2. Preliminaries 3746 3. Some general lower bounds 3748 4. The proof of Theorem A 3751 5. A Borsuk-Ulam theorem and the proof of Theorem B 3756 6. The proofs of Propositions 1.16 and 1.20 3760 7. The proof of Proposition 1.18 3767 8. The proof of Proposition 1.19 3775 9. The Gromov-Hausdorff distance between spheres 3784 Appendix A. A succinct proof of Theorem G 3793 Appendix B. The distance between a sphere and an interval 3795
1
Explicit optimal correspondences show that the lower bounds are tight for sphere pairs (S⁰, Sⁿ), (Sᵐ, S¹), (S¹, S²), (S¹, S³), and (S², S³).
2
Several lower bounds use topological arguments related to the Borsuk–Ulam theorem.
3
The paper establishes general upper and lower bounds for the Gromov–Hausdorff distance between round spheres of dimensions m and n, with 0 ≤ m < n.
4
The paper formulates multiple open questions concerning Gromov–Hausdorff distances between spheres.

Round metric spheres S^m and S^n

Upper and lower bounds, tightness, and topological mechanisms governing the Gromov–Hausdorff distance between the spheres

Publication Details
Publication Date
2023-12-05
Journal
Publisher
ISSN
Cited by
16
Access Type
Author Information
Authors
Sunhyuk Lim
Facundo Mémoli
Zane Smith
Explore further
Open the scid.ai AI chat with a ready-made request: it will find papers on a similar topic and help build a literature review.
Find similar papers in the chat
Make a presentation
100%