The Gromov–Hausdorff distance was introduced by David Edwards in 1975,[1][2] and it was later rediscovered and generalized by Mikhail Gromov in 1981.[3][4] This distance measures how far two compact metric spaces are from being isometric. If X and Y are two compact metric spaces, then dGH (X, Y) is defined to be the infimum of all numbers dH(f(X), g(Y)) for all (compact) metric spaces M and all isometric embeddings f : X → M and g : Y → M. Here dH denotes Hausdorff distance between subsets in M and the isometric embedding is understood in the global sense, i.e. it must preserve all distances, not only infinitesimally small ones; for example no compact Riemannian manifold admits such an embedding into Euclidean space of the same dimension.
The Gromov–Hausdorff distance turns the set of all isometry classes of compact metric spaces into a metric space, called Gromov–Hausdorff space, and it therefore defines a notion of convergence for sequences of compact metric spaces, called Gromov–Hausdorff convergence. A metric space to which such a sequence converges is called the Gromov–Hausdorff limit of the sequence.
Some properties of Gromov–Hausdorff space
The Gromov–Hausdorff space is path-connected, complete, and separable.[5] It is also geodesic, i.e., any two of its points are the endpoints of a minimizing geodesic.[6][7] In the global sense, the Gromov–Hausdorff space is totally heterogeneous, i.e., its isometry group is trivial,[8] but locally there are many nontrivial isometries.[9]
Pointed Gromov–Hausdorff convergence
The pointed Gromov–Hausdorff convergence is an analog of Gromov–Hausdorff convergence appropriate for non-compact spaces. A pointed metric space is a pair (X,p) consisting of a metric space X and point p in X. A sequence (Xn, pn) of pointed metric spaces converges to a pointed metric space (Y, p) if, for each R > 0, the sequence of closed R-balls around pn in Xn converges to the closed R-ball around p in Y in the usual Gromov–Hausdorff sense.[10]
Applications
The notion of Gromov–Hausdorff convergence was used by Gromov to prove that
any discrete group with polynomial growth is virtually nilpotent (i.e. it contains a nilpotent subgroup of finite index). See Gromov's theorem on groups of polynomial growth. (Also see D. Edwards for an earlier work.)
The key ingredient in the proof was the observation that for the
Cayley graph of a group with polynomial growth a sequence of rescalings converges in the pointed Gromov–Hausdorff sense.
The Gromov–Hausdorff distance metric has been applied in the field of computer graphics and computational geometry to find correspondences between different shapes.[12] It also has been applied in the problem of motion planning in robotics.[13]
The Gromov–Hausdorff distance has been used by Sormani to prove the stability of the Friedmann model in Cosmology. This model of cosmology is not stable with respect to smooth variations of the metric.[14]
In a special case, the concept of Gromov–Hausdorff limits is closely related to large-deviations theory.[15]
^D. Burago, Yu. Burago, S. Ivanov, A Course in Metric Geometry, AMS GSM 33, 2001.
^Ivanov, A. O.; Nikolaeva, N. K.; Tuzhilin, A. A. (2016). "The Gromov–Hausdorff metric on the space of compact metric spaces is strictly intrinsic". Mathematical Notes. 100 (5–6): 883–885. arXiv:1504.03830. doi:10.1134/S0001434616110298. S2CID39754495.
^For explicit construction of the geodesics, see Chowdhury, Samir; Mémoli, Facundo (2016). "Explicit Geodesics in Gromov-Hausdorff Space". arXiv:1603.02385 [math.MG].
^Ivanov, Alexander; Tuzhilin, Alexey (2018). "Isometry Group of Gromov--Hausdorff Space". arXiv:1806.02100 [math.MG].
^Ivanov, Alexander O.; Tuzhilin, Alexey A. (2016). "Local Structure of Gromov-Hausdorff Space near Finite Metric Spaces in General Position". arXiv:1611.04484 [math.MG].
^Bellaïche, André (1996). "The tangent space in sub-Riemannian geometry". In André Bellaïche; Jean-Jacques Risler (eds.). Sub-Riemannian Geometry. Progress in Mathematics. Vol. 44. Basel: Birkhauser. pp. 1–78 [56]. doi:10.1007/978-3-0348-9210-0_1. ISBN978-3-0348-9946-8.
^Mémoli, Facundo; Sapiro, Guillermo (2004). "Comparing point clouds". Proceedings of the 2004 Eurographics/ACM SIGGRAPH symposium on Geometry processing - SGP '04. p. 32. doi:10.1145/1057432.1057436. ISBN3905673134. S2CID207156533.
^Sukkar, Fouad; Wakulicz, Jennifer; Lee, Ki Myung Brian; Fitch, Robert (2022-09-11). "Motion planning in task space with Gromov-Hausdorff approximations". arXiv:2209.04800 [cs.RO].
^Kotani, Motoko; Sunada, Toshikazu (2006). "Large deviation and the tangent cone at infinity of a crystal lattice". Mathematische Zeitschrift. 254 (4): 837–870. doi:10.1007/s00209-006-0951-9. S2CID122531716.
M. Gromov. Metric structures for Riemannian and non-Riemannian spaces, Birkhäuser (1999). ISBN0-8176-3898-9 (translation with additional content).