5
$\begingroup$

I'm interested in conditions on a metric space $X$ which imply that boundedness is equivalent to total boundedness (or, assuming that $X$ is complete, that compactness is equivalent to precompactness). If $X$ is a normed space, then we know that this is true if and only if $X$ is finite-dimensional. Is there some suitable concept of dimension for general metric spaces such that boundedness implies total boundedness if and only if the space has finite dimension in this sense? You may assume any reasonable hypotheses on $X$ (e.g. that $X$ is a Polish metric space).

$\endgroup$

2 Answers 2

5
$\begingroup$

If $X$ is locally compact, then it has this Heine-Borel-property. For topological vector spaces locally compactness is equivalent to finite dimension if I remember correctly.

But there are other examples even vector spaces that have the Heine-Borel-property without being locally compact. The space $H(U)$ of holomorphic functions on an open set $U\subseteq\mathbb{C}$ with the topology of locally uniform convergence of all derivatives. This is Montel's theorem and therefore such spaces are called Montel spaces (well a certain additional condition is needed, but that's not the point) Another example is the Schwartz-Space $\mathcal{S}(\mathbb{R}^n)$ of rapidly decreasing functions. Because being Montel is stable under taking strong duals, the space of tempered distributions $\mathcal{S}'(\mathbb{R}^n)$ has the Heine-Borel-property too (but is not metrizable).

$\endgroup$
1
  • $\begingroup$ Thanks. In case anyone is interested, I came across the following article on the subject: jstor.org/stable/2046449 (thanks to Google). $\endgroup$
    – Mark
    Aug 28, 2010 at 21:17
6
$\begingroup$

Doubling metric spaces, which are studied a lot, have this property. A metric space is doubling provided there exists $n$ so that for every $r>0$, a ball of radius $2r$ is covered by $n$ balls of radius $r$. Google "doubling metric spaces"; some of the half million hits should be useful.

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

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