In mathematics, a metric space is a set where a notion of distance between elements of the set is defined. The metric space which most closely corresponds to our intuitive understanding of space is the 3dimensional Euclidean space. The Euclidean metric of this space defines the distance between two points as the length of the straight line connecting them. The geometry of the space depends on the metric chosen and by using a different metric we can construct interesting nonEuclidean geometries which are used in the general relativity.
A metric space induces topological properties like open and closed sets which leads to the study of even more abstract topological spaces.
History
Maurice Fréchet introduced metric spaces in his work Sur quelques points du calcul fonctionnel, Rendic. Circ. Mat. Palermo 22(1906) 174.
Definition
A metric space is a 2tuple (X,d) where X is a set and d is a metric on X.
We often omit d and just write X for a metric space if it is clear from the context what metric we are using.
Examples
 The real numbers with the distance function d(x, y) = y  x given by the absolute value, and more generally Euclidean nspace with the Euclidean distance, are complete metric spaces.

Hyperbolic plane.
 Any normed vector space is a metric space by defining d(x, y) = y  x, see also distances based on norms. (If such a space is complete, we call it a Banach space). Example:
 the Manhattan norm gives rise to the Manhattan distance, where the distance between any two points, or vectors, is the sum of the distances between corresponding coordinates.
 The British Rail metric (also called the Post Office metric) on a normed vector space, given by d(x, y)=x + y for distinct points x and y, and d(x, x) = 0. The name alludes to the tendency of railway journeys (or letters) to proceed via London, which is identified with the origin.
 The Chessboard distance, the number of moves a chess king would take to travel from x to y.
 If X is some set and M is a metric space, then the set of all bounded functions f : X > M (i.e. those functions whose image is a bounded subset of M) can be turned into a metric space by defining d(f, g) = sup_{x in X} d(f(x), g(x)) for any bounded functions f and g. If M is complete, then this space is complete as well.
 The Levenshtein distance, also called character edit distance, is a measure of the similarity between two strings u and v. The distance is the minimal number of deletions, insertions, or substitutions required to transform u into v.
 If X is a topological (or metric) space and M is a metric space, then the set of all bounded continuous functions from X to M forms a metric space if we define the metric as above: d(f, g) = sup_{x in X} d(f(x), g(x)) for any bounded continuous functions f and g. If M is complete, then this space is complete as well.
 If M is a connected Riemannian manifold, then we can turn M into a metric space by defining the distance of two points as the infimum of the lengths of the paths (continuously differentiable curves) connecting them.
 If G is an undirected connected graph, then the set V of vertices of G can be turned into a metric space by defining d(x, y) to be the length of the shortest path connecting the vertices x and y.
 If M is a metric space, we can turn the set K(M) of all compact subsets of M into a metric space by defining the Hausdorff distance d(X, Y) = inf{r : for every x in X there exists a y in Y with d(x, y) < r and for every y in Y there exists an x in X such that d(x, y) < r)}. In this metric, two elements are close to each other if every element of one set is close to some element of the other set. One can show that K(M) is complete if M is complete.
 The set of all (isometry classes of) compact metric spaces form a metric space with respect to GromovHausdorff distance.
Metric spaces as topological spaces
In any metric space M we can define the open balls as the sets of the form

 B(x; r) = {y in M : d(x,y) < r},
where x is in M and r is a positive real number, called the radius of the ball. A subset of M which is a union of (finitely or infinitely many) open balls is called an open set. The complement of an open set is called closed. Every metric space is automatically a topological space, the topology being the set of all open sets. A topological space which can arise in this way from a metric space is called a metrizable space; see the article on metrization theorems for further details.
Since metric spaces are topological spaces, one has a notion of continuous function between metric spaces. Without referring to the topology, this notion can also be directly defined using limits of sequences; this is explained in the article on continuous functions.
Boundedness and compactness
A metric space M is called bounded if there exists some number r, such that d(x,y) ≤ r for all x and y in M. The smallest possible such r is called the diameter of M. The space M is called precompact or totally bounded if for every r > 0 there exist finitely many open balls of radius r whose union equals M. Since the set of the centres of these balls is finite, it has finite diameter, from which it follows (using the triangle inequality) that every totally bounded space is bounded. The converse does not hold, since any infinite set can be given the discrete metric (the first example above) under which it is bounded and yet not totally bounded. A useful characterisation of compactness for metric spaces is that a metric space is compact if and only if it is complete and totally bounded.
Note that in the context of Intervals in the space of real numbers and occasionally regions in a Euclidean space R^{n} a bounded set is referred to as "a finite interval" or "finite region". However boundedness should not in general be confused with "finite", which refers to the number of elements, not to how far the set extends; finiteness implies boundedness, but not conversely.
By restricting the metric, any subset of a metric space is a metric space itself. We call such a subset complete, bounded, totally bounded or compact if it, considered as a metric space, has the corresponding property.
Separation properties and extension of continuous functions
Metric spaces are paracompact Hausdorff spaces and hence normal (indeed they are perfectly normal). An important consequence is that every metric space admits partitions of unity and that every continuous realvalued function defined on a closed subset of a metric space can be extended to a continuous map on the whole space (Tietze extension theorem). It is also true that every realvalued Lipschitzcontinuous map defined on a subset of a metric space can be extended to a Lipschitzcontinuous map on the whole space.
Distance between points and sets
A simple way to construct a function separating a point from a closed set (as required for a completely regular space) is to consider the distance between the point and the set. If (M,d) is a metric space, S is a subset of M and x is a point of M, we define the distance from x to S as

d(x,S) = inf {d(x,s) : s ∈ S}
Then d(x, S) = 0 if and only if x belongs to the closure of S. Furthermore, we have the following generalization of the triangle inequality:
 d(x,S) ≤ d(x,y) + d(y,S)
which in particular shows that the map x > d(x,S) is continuous.
Equivalence of metric spaces
It is often necessary to compare two metric spaces and decide in what sense they are equivalent or to analyze how the structure of a metric spaces changes when changing the metric. Metric spaces are sets with additional topological structure induced by the metric. So to decide in what sense two metrics spaces are equivalent we have to discuss continuous functions between them (morphisms preserving the topology of the metric spaces).
Topological isomorphism
Given two metric spaces (M_{1}, d_{1}) and (M_{2}, d_{2}) we call them topologically isomorphic (or homeomorphic) if there exists a homeomorphism between them.
Uniform isomorphism
They are called uniformly isomorphic if there exists a uniform isomorphism between them.
Isometric isomorphism
They are called isometrically isomorphic if there exists a bijective isometry between them. In this case, the two spaces are essentially identical. An isometry is a function f : M_{1} → M_{2} which preserves distances: d_{2}(f(x), f(y)) = d_{1}(x, y) for all x, y in M_{1}. Isometries are necessarily injective.
Similarity
They are called similar if there exists a postive constant k > 0 and a bijective function f, called similarity such that f : M_{1} → M_{2} and d_{2}(f(x), f(y)) = k d_{1}(x, y) for all x, y in M_{1}.
See also
External link
Last updated: 10172005 17:03:56