Math 2.0

Differential geometry Object

Gromov–Hausdorff space

Description

Let ZZ be a metric space and let A,B⊆ZA, B \subseteq Z be nonempty. The Hausdorff distance dH(A,B)d_H(A, B) is the infimum of the numbers r≥0r \ge 0 with the following property. Each point of AA lies within distance rr of BB, and each point of BB lies within distance rr of AA.

Let XX and YY be nonempty compact metric spaces. Their Gromov–Hausdorff distance is dGH(X,Y)=inf⁡dH(f(X),g(Y)),d_{GH}(X, Y) = \inf d_H(f(X), g(Y)), where the infimum runs over all metric spaces ZZ and all isometric embeddings f ⁣:X→Zf \colon X \to Z and g ⁣:Y→Zg \colon Y \to Z.

The Gromov–Hausdorff space is the set of isometry classes of nonempty compact metric spaces, with the distance dGHd_{GH}.

Remarks

The function dGHd_{GH} is a metric on isometry classes. In particular, dGH(X,Y)=0d_{GH}(X, Y) = 0 for compact XX and YY only when XX and YY are isometric. The Gromov–Hausdorff space is a complete metric space and is separable. Finite metric spaces with rational distances form a countable dense subset.

For a one-point space PP and a compact metric space XX, one has dGH(P,X)=diam⁡(X)/2d_{GH}(P, X) = \operatorname{diam}(X) / 2.

Where this leads

1 page builds on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Gromov%E2%80%93Hausdorff_convergence
About this page
TagETRF2FHAEE
URIm2://ETRF2FHAEE
Kindobject
WritingW0 stub
MSC53C23, 54E35
Changed2 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)
  • field same_as: the identifiers in the databases (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

Used by