MathOverflow is a question and answer site for professional mathematicians. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top


For which pairs $M,N$ of compact metric spaces does there exist a metric space $K$ along with isometric embeddings $i:M \to K$ and $j:N \to K$ so that the Hausdorff distance between $i(M)$ and $j(N)$ in $K$ equals the Gromov-Hausdorff distance between $M$ and $N$ exactly?

We always have $d_\text{GH}(M,N) \leq d_\text{H}(i(M),j(N))$ by definition, so it suffices to decide if there exist any constraints intrinsic to $M$ and $N$ which force the reverse inequality to also hold for some judicious choice of $i,j,K$.


Bill Johnson's nice answer appears to settle the question for compact $M$ and $N$ affirmatively: the Gromov-Hausdorff distance can always be realized by an ultraproduct construction. In light of that answer -- and also in light of the fact that I did not intend to assume compactness in the original question but stupidly wrote it down anyway -- here is a modified question:

Can the GH-distance be similarly achieved if we only assume that $M$ and $N$ are bounded, rather than compact?

In general, I am interested in the weakest hypotheses on $M$ and $N$ which are known to guarantee embeddings into a common target space $K$ so that the Gromov-Hausdorff distance between $M$ and $N$ equals the Hausdorff distance of their isometric images in $K$. It is not clear to me that a modification of Bill's argument works when we drop compactness.


Given a compact metric space $M$ and two subspaces $A, B \subset M$, their Hausdorff distance -- denoted $d_\text{H}(A,B)$ -- is defined to be the smallest $\epsilon > 0$ so that $B$ is contained in $A$ thickened by $\epsilon$ and vice-versa.

The Gromov-Hausdorff distance $d_\text{GH}(M,N)$ between two compact metric spaces $M$ and $N$ is defined to be the infimum over triples $(i,j,K)$ of $d_\text{H}(i(M),j(N))$ where $K$ is a metric space and $i,j$ are isometric embeddings of $M, N$ into $K$. The question asks when this infimum can be explicitly realized.

share|cite|improve this question
Do you, or anybody here, know when did the G-H distance appear in a publication for the first time? – Włodzimierz Holsztyński Jun 29 '13 at 6:49
@Wlodzimierz Holsztynski: GH distance first explicitly appeared in Gromov's green book "Structures métriques pour les variétés riemanniennes". The term "Gromov-Hausdorff distance" was coined (I think) by Karsten Grove. An idea of GH distance goes back to Gromov's paper on groups of polynomial growth. – Igor Belegradek Jun 29 '13 at 12:25
Thank you, @Igor. Thus it was 1981 (the date od publishing the original French edition). – Włodzimierz Holsztyński Jun 29 '13 at 20:03
up vote 4 down vote accepted

Unless I am missing something, the distance is achieved for compact metric spaces. Take isometries $i_n :M \to K_n$ and $j_n : N \to K_n$ that give you the Gromov-Hausdorff distance up to $1/n$. Let $K$ be an ultraproduct of the $K_n$ and $i$, $j$ the isometries from $M$, $N$ into $K$ induced by $i_n$, $j_n$. This achieves the distance, I think, when $M$ and $N$ are compact. To see that, given $x$ in $M$ take $y_n$ in $N$ s.t. the distance of $i_n(x) $ to $j_n(y_n)$ is less than the Hausdorff distance from $i_n(M)$ to $j_n(N)$. Let $y$ be the ultralimit of $y_n$ in $N$ (this is where compactness is used). Then the distance from $i(x)$ to $j(y)$ is at most the Gromov-Hausdorff distance from $M$ to $N$.

This is a pretty obvious argument, so I guess it is either written somewhere or is complete nonsense.

share|cite|improve this answer
Aargh, I have no idea why I wrote compact everywhere. Thank you for this answer though, and please let me also know if there is a similar result if, say, M and N have finite measures of noncompactness. – Vidit Nanda Jun 29 '13 at 0:56
Please state precisely what you want. Maybe I'll think about; maybe not. – Bill Johnson Jun 29 '13 at 1:32

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.