Some novel constructions of optimal Gromov-Hausdorff-optimal correspondences between spheres
Pith reviewed 2026-05-23 21:11 UTC · model grok-4.3
The pith
Explicit correspondences establish the Gromov-Hausdorff distance between the 3-sphere and 4-sphere as half arccos of negative one fourth.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
By constructing explicit optimal correspondences, the paper shows that the Gromov-Hausdorff distance between S^3 and S^4 equals one half arccos of negative one fourth and supplies alternative proofs that the distance between S^1 and S^n equals one half arccos of one over n plus one for each n.
What carries the argument
Explicit constructions of correspondences between spheres that realize the infimum defining the Gromov-Hausdorff distance.
If this is right
- The n=3 case of the Lim-Mémoli-Smith conjecture is settled.
- Alternative proofs now exist for the distances between the circle and all higher spheres.
- The same style of explicit maps works for both the circle cases and the three-to-four sphere case.
- These distances supply exact benchmark values for metric comparisons among spheres.
Where Pith is reading between the lines
- The constructions may extend to compute distances between other pairs of spheres such as S^4 and S^5.
- The explicit maps could serve as test cases for numerical algorithms that approximate Gromov-Hausdorff distances on manifolds.
- The pattern of optimal distortion might reveal a general formula across all pairs of spheres.
Load-bearing premise
The correspondences constructed in the paper achieve the infimum that defines the Gromov-Hausdorff distance.
What would settle it
Either a proof of a strictly larger lower bound or the exhibition of any correspondence whose distortion is strictly smaller than one half arccos of negative one fourth.
Figures
read the original abstract
In this article, as a first contribution, we provide alternative proofs of recent results by Harrison and Jeffs which determine the precise value of the Gromov-Hausdorff (GH) distance between the circle $\mathbb{S}^1$ and the $n$-dimensional sphere $\mathbb{S}^n$ (for any $n\in\mathbb{N}$) when endowed with their respective geodesic metrics. Additionally, we prove that the GH distance between $\mathbb{S}^3$ and $\mathbb{S}^4$ is equal to $\frac{1}{2}\arccos\left(\frac{-1}{4}\right)$, thus settling the case $n=3$ of a conjecture by Lim, M\'emoli and Smith.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The manuscript provides alternative proofs of results by Harrison and Jeffs on the exact Gromov-Hausdorff distance between S^1 and S^n (n any natural number) under geodesic metrics, and proves that d_GH(S^3, S^4) equals ½ arccos(−1/4), thereby settling the n=3 case of the conjecture of Lim, Mémoli and Smith.
Significance. If the optimality of the constructed correspondences is rigorously established, the work supplies concrete exact values for GH distances between spheres and independent proofs, strengthening the body of explicit computations in metric geometry.
major comments (2)
- [S^3–S^4 construction and lower-bound argument] The central claim that d_GH(S^3, S^4) = ½ arccos(−1/4) rests on the constructed correspondence R ⊂ S^3 × S^4 having distortion exactly equal to the claimed value and on a matching lower bound that holds for every correspondence. The manuscript must isolate the lower-bound argument (likely in the section treating the S^3–S^4 case) and verify that it does not tacitly rely on equivariance or radiality properties satisfied only by the particular R.
- [Abstract and the S^3–S^4 optimality proof] The abstract asserts that the constructed correspondences achieve the infimum defining the GH distance; however, without an explicit verification that the distortion of R equals the claimed constant and that no smaller distortion is possible, the exact equality does not follow. This verification is load-bearing and must be supplied with error bounds or exhaustive case analysis if the construction is finite.
minor comments (2)
- Clarify the notation for the distortion function and the precise definition of the correspondence R early in the text so that the upper-bound calculation can be followed without ambiguity.
- Add a short comparison table or statement contrasting the new proofs with those of Harrison–Jeffs to highlight the technical differences.
Simulated Author's Rebuttal
We thank the referee for the careful reading and constructive suggestions. We address the two major comments below and will revise the manuscript to improve the isolation and independence of the lower-bound argument for the S^3–S^4 case.
read point-by-point responses
-
Referee: [S^3–S^4 construction and lower-bound argument] The central claim that d_GH(S^3, S^4) = ½ arccos(−1/4) rests on the constructed correspondence R ⊂ S^3 × S^4 having distortion exactly equal to the claimed value and on a matching lower bound that holds for every correspondence. The manuscript must isolate the lower-bound argument (likely in the section treating the S^3–S^4 case) and verify that it does not tacitly rely on equivariance or radiality properties satisfied only by the particular R.
Authors: We agree that the lower-bound argument should be presented in a self-contained manner. The existing proof derives the lower bound from the general definition of distortion and the geometry of the spheres without invoking equivariance or radiality of the specific R; however, to address the concern we will isolate this argument in a dedicated subsection of the S^3–S^4 section and add an explicit statement confirming that the bound applies to arbitrary correspondences. revision: yes
-
Referee: [Abstract and the S^3–S^4 optimality proof] The abstract asserts that the constructed correspondences achieve the infimum defining the GH distance; however, without an explicit verification that the distortion of R equals the claimed constant and that no smaller distortion is possible, the exact equality does not follow. This verification is load-bearing and must be supplied with error bounds or exhaustive case analysis if the construction is finite.
Authors: The body of the paper already contains both the explicit computation that the distortion of R equals ½ arccos(−1/4) and the matching lower bound that rules out smaller values. The construction is continuous rather than finite, so error bounds are not applicable. We will nevertheless revise the abstract to note that both the upper and lower bounds are established in the text, and we will add a short concluding remark in the S^3–S^4 section that summarizes the equality. revision: yes
Circularity Check
No circularity; explicit constructions and proofs are self-contained
full rationale
The paper provides alternative proofs for the GH distance between S^1 and S^n and an explicit construction settling the S^3-S^4 case at ½ arccos(-1/4). These are standard mathematical arguments: a concrete correspondence yields an upper bound on d_GH by definition of the infimum, while any matching lower bound must be shown independently (e.g., via distortion inequalities that do not presuppose the form of the constructed map). No equations, fitted parameters, or self-citations reduce the claimed equality to its own inputs by construction. The derivation chain is therefore self-contained against external benchmarks.
Axiom & Free-Parameter Ledger
axioms (1)
- standard math Geodesic metric on spheres is the standard shortest-path distance
Reference graph
Works this paper leans on
-
[1]
Henry Adams, Johnathan Bush, Nate Clause, Florian Frick, Mario Gómez, Michael Harrison, R. Amzi Jeffs, Evgeniya Lagoda, Sunhyuk Lim, Facundo Mémoli, Michael Moy, Nikola Sadovek, Matt Superdock, Daniel Vargas, Qingsong Wang, and Ling Zhou. Gromov- H ausdorff distances, B orsuk- U lam theorems, and V ietoris- R ips complexes, 2022
work page 2022
-
[2]
Dmitri Burago, Yuri Burago, and Sergei Ivanov. A course in metric geometry. American Mathematical Society , 2001
work page 2001
-
[3]
Efficient computation of isometry-invariant distances between surfaces
Alexander M Bronstein, Michael M Bronstein, and Ron Kimmel. Efficient computation of isometry-invariant distances between surfaces. SIAM Journal on Scientific Computing , 28(5):1812--1836, 2006
work page 2006
-
[4]
On the structure of spaces with R icci curvature bounded below
Jeff Cheeger and Tobias H Colding. On the structure of spaces with R icci curvature bounded below. I . Journal of Differential Geometry , 46(3):406--480, 1997
work page 1997
-
[5]
Gromov- Hausdorff stable signatures for shapes using persistence
Fr \'e d \'e ric Chazal, David Cohen-Steiner, Leonidas J Guibas, Facundo M \'e moli, and Steve Y Oudot. Gromov- Hausdorff stable signatures for shapes using persistence. In Computer Graphics Forum , volume 28, pages 1393--1403. Wiley Online Library, 2009
work page 2009
-
[6]
Persistence stability for geometric complexes
Fr \'e d \'e ric Chazal, Vin De Silva, and Steve Oudot. Persistence stability for geometric complexes. Geometriae Dedicata , 173(1):193--214, 2014
work page 2014
-
[7]
Differentiability of lipschitz functions on metric measure spaces
Jeff Cheeger. Differentiability of lipschitz functions on metric measure spaces. Geometric & Functional Analysis GAFA , 9:428--517, 1999
work page 1999
-
[8]
On the optimal covering of equal metric balls in a sphere
Min-Shik Cho. On the optimal covering of equal metric balls in a sphere. The Pure and Applied Mathematics , 4(2):137--144, 1997
work page 1997
-
[9]
Large manifolds with positive ricci curvature
Tobias H Colding. Large manifolds with positive ricci curvature. Inventiones mathematicae , 124(1):193--214, 1996
work page 1996
-
[10]
Shape of manifolds with positive R icci curvature
Tobias H Colding. Shape of manifolds with positive R icci curvature. Inventiones mathematicae , 124(1):175--191, 1996
work page 1996
-
[11]
David A Edwards. The structure of superspace. In Studies in topology , pages 121--133. Elsevier, 1975
work page 1975
-
[12]
Structures m \'e triques pour les vari \'e t \'e s riemanniennes
Mikhael Gromov. Structures m \'e triques pour les vari \'e t \'e s riemanniennes. Textes Math. , 1, 1981
work page 1981
-
[13]
Quantitative upper bounds on the G romov- H ausdorff distance between spheres
Michael Harrison and R Amzi Jeffs. Quantitative upper bounds on the G romov- H ausdorff distance between spheres. arXiv preprint arXiv:2309.11237 , 2023
-
[14]
Modulus and the poincar \'e inequality on metric measure spaces
Stephen Keith. Modulus and the poincar \'e inequality on metric measure spaces. Mathematische Zeitschrift , 245:255--292, 2003
work page 2003
-
[15]
The G romov-- H ausdorff distance between spheres
Sunhyuk Lim, Facundo M \'e moli, and Zane Smith. The G romov-- H ausdorff distance between spheres. Geometry & Topology , 27(9):3733--3800, 2023
work page 2023
-
[16]
Embedding-projection correspondences for the estimation of the G romov- H ausdorff distance
Facundo M \'e moli and Zane T Smith. Embedding-projection correspondences for the estimation of the G romov- H ausdorff distance. arXiv preprint arXiv:2407.03295 , 2024
-
[17]
A finiteness theorem for metric spaces
Peter Petersen. A finiteness theorem for metric spaces. Journal of Differential Geometry , 31(2):387--395, 1990
work page 1990
-
[18]
Discrete homotopies and the fundamental group
Conrad Plaut and Jay Wilkins. Discrete homotopies and the fundamental group. Advances in Mathematics , 232(1):271--294, 2013
work page 2013
-
[19]
Gromov- H ausdorff distances from simply connected geodesic spaces to the circle
Saúl Rodríguez - Martín. Gromov- H ausdorff distances from simply connected geodesic spaces to the circle. Proceedings of the American Mathematical Society, Series B (Accepted for publication) , 2024
work page 2024
-
[20]
Saúl Rodríguez - Martín. Pythonpaperghdistancesspheres. https://github.com/saulingo/PythonPaperGHDistancesSpheres, 2024. GitHub Repository
work page 2024
-
[21]
Convex regions on the n-dimensional spherical surface
Luis A Santal \'o . Convex regions on the n-dimensional spherical surface. Annals of Mathematics , 47(3):448--459, 1946
work page 1946
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.