arXiv · 2608.21587
Tight upper bound on $d_{GH}(S^1,S^{2k+1})$: GPT's short proof
Abstract
We describe GPT-5.6 Sol Pro's short proof that $2\cdot d_{GH}(S^1,S^{2k+1}) \le \tfrac{2πk}{2k+1}$. This is the odd-dimensional case of a tight upper bound by Harrison and Jeffs on the Gromov--Hausdorff distance between the circle and spheres.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Henry Adams. 2026-09-17. Tight upper bound on $d_{GH}(S^1,S^{2k+1})$: GPT's short proof. https://arxiv.org/abs/2608.21587
Cite the original work for its findings. Save a collection to share your selection of sources.