# Difference between revisions of "Metric"

(TeX encoding is done) |
(links and references) |
||

(One intermediate revision by one other user not shown) | |||

Line 1: | Line 1: | ||

− | + | {{TEX|done}} | |

− | + | ''distance on a [[set]] $X$ '' | |

− | + | A function $\rho$ with non-negative real values, defined on the [[Cartesian product]] $X\times X$ and satisfying for any $x, y\in X$ the conditions: | |

+ | # $\rho(x,y)=0$ if and only if $x = y$ (the identity axiom); | ||

+ | # $\rho(x,y) + \rho(y,z) \geq \rho(x,z)$ (the triangle axiom); | ||

+ | # $\rho(x,y) = \rho(y,x)$ (the symmetry axiom). | ||

− | + | A set $X$ on which it is possible to introduce a metric is called metrizable (cf. [[Metrizable space]]). A set $X$ provided with a metric is called a [[metric space]]. | |

− | |||

− | |||

===Examples.=== | ===Examples.=== | ||

− | |||

1) On any set there is the discrete metric | 1) On any set there is the discrete metric | ||

Line 32: | Line 32: | ||

here $\{x_i\}, \{y_i\} \in \mathbb{R}^n$. | here $\{x_i\}, \{y_i\} \in \mathbb{R}^n$. | ||

− | 3) In a Riemannian space a metric is defined by a [[ | + | 3) In a [[Riemannian space]] a metric is defined by a [[metric tensor]], or a quadratic differential form (in some sense, this is an analogue of the first metric of example 2)). For a generalization of metrics of this type see [[Finsler space]]. |

− | 4) In function spaces on a (countably) compact space $X$ there are also various metrics; for example, the uniform metric | + | 4) In function spaces on a (countably) [[compact space]] $X$ there are also various metrics; for example, the uniform metric |

\begin{equation} | \begin{equation} | ||

\rho(f,g)=\sup\limits_{x\in X}|f(x)-g(x)| | \rho(f,g)=\sup\limits_{x\in X}|f(x)-g(x)| | ||

\end{equation} | \end{equation} | ||

− | |||

(an analogue of the second metric of example 2)), and the integral metric | (an analogue of the second metric of example 2)), and the integral metric | ||

\begin{equation} | \begin{equation} | ||

Line 44: | Line 43: | ||

\end{equation} | \end{equation} | ||

− | 5) In normed | + | 5) In [[normed space]]s over $\mathbb R$ a metric is defined by the norm $\|\cdot\|$: |

\begin{equation} | \begin{equation} | ||

\rho(x,y) = \|x-y\|. | \rho(x,y) = \|x-y\|. | ||

\end{equation} | \end{equation} | ||

− | 6) In the space of closed subsets of a metric space there is the [[ | + | 6) In the space of closed subsets of a metric space there is the [[Hausdorff metric]]. |

If, instead of 1), one requires only: | If, instead of 1), one requires only: | ||

− | 1') $\rho(x,y)=0$ if $x=y$ (so that from $\rho(x,y)=0$ it does not always follows that $x=y$), the function $\rho$ is called a [[ | + | 1') $\rho(x,y)=0$ if $x=y$ (so that from $\rho(x,y)=0$ it does not always follows that $x=y$), the function $\rho$ is called a [[pseudo-metric]] <ref name="Kelley" /><ref name="Kuratowski" />, or finite écart <ref name="Bourbaki" />. |

+ | |||

+ | A metric (and even a pseudo-metric) makes the definition of a number of additional structures on the set $X$ possible. First of all a topology (see [[Topological space]]), and in addition a uniformity (see [[Uniform space]]) or a proximity (see [[Proximity space]]) structure. The term metric is also used to denote more general notions which do not have all the properties 1)–3); such are, for example, an [[indefinite metric]], a [[symmetry on a set]], etc. | ||

+ | |||

− | |||

− | ==== | + | ====Comments==== |

− | |||

+ | Potentially, any metric space $(X,\rho)$ has a second metric $\sigma \geq \rho$ naturally associated: the intrinsic or [[internal metric]]. Potentially, because the definition may give $\sigma(x,y)=\infty$ for some pairs of points $x, y$. One defines the length (which may be $\infty$) of a continuous path $f:[0,1]\to X$ by $L(f)=\lim\limits_{\epsilon\to 0}\sup L_{\epsilon}(f)$, where $L_{\epsilon}(f)$ is the infimum of all finite sums $\sum \rho(x_i,x_{i+1})$ with $\{x_i\}$ a finite subset of $[0,1]$ which is an $\epsilon$-net (cf. [[Metric space]]) and is listed in the natural order. Then $\sigma(x,y)$ is the infimum of the lengths of paths $f$ with $f(0)=x$, $f(1)=y$, but $\sigma(x,y)=\infty$ if there is no such path of finite length. | ||

+ | No reasonable topological restriction on $(X,\rho)$ suffices to guarantee that the intrinsic "metric" (or écart) $\sigma$ will be finite-valued. If $\sigma$ is finite-valued, suitable compactness conditions will assure that minimum-length paths, i.e. paths from $x$ to $y$ of length $\sigma(x,y)$, exist. When every pair of points $x, y$ is joined by a path (non-unique, in general) of length $\sigma(x,y)$, the metric is often called convex. (This is much weaker than the surface theorists' [[Convex metric|convex metric]].) The main theorem in this area is that every locally connected metric [[continuum]] admits a convex metric <ref name="Bing" /><ref name="Moïse" />. | ||

− | |||

− | |||

− | |||

====References==== | ====References==== | ||

− | < | + | |

+ | <references> | ||

+ | <ref name="Kelley">J.L. Kelley, "General topology" , Springer (1975)</ref> | ||

+ | <ref name="Kuratowski">K. Kuratowski, "Topology" , '''1''' , PWN & Acad. Press (1966) (Translated from French)</ref> | ||

+ | <ref name="Bourbaki">N. Bourbaki, "Elements of mathematics. General topology" , Addison-Wesley (1966) (Translated from French)</ref> | ||

+ | <ref name="Bing">R.H. Bing, "Partitioning a set" ''Bull. Amer. Math. Soc.'' , '''55''' (1949) pp. 1101–1110</ref> | ||

+ | <ref name="Moïse">E.E. Moïse, "Grille decomposition and convexification" ''Bull. Amer. Math. Soc.'' , '''55''' (1949) pp. 1111–1121</ref> | ||

+ | </references> | ||

+ | <ol start="6"> | ||

+ | <li>P.S. Aleksandrov, "Einführung in die Mengenlehre und die allgemeine Topologie" , Deutsch. Verlag Wissenschaft. (1984) (Translated from Russian)</li> | ||

+ | </ol> |

## Latest revision as of 11:16, 7 June 2016

*distance on a set $X$ *

A function $\rho$ with non-negative real values, defined on the Cartesian product $X\times X$ and satisfying for any $x, y\in X$ the conditions:

- $\rho(x,y)=0$ if and only if $x = y$ (the identity axiom);
- $\rho(x,y) + \rho(y,z) \geq \rho(x,z)$ (the triangle axiom);
- $\rho(x,y) = \rho(y,x)$ (the symmetry axiom).

A set $X$ on which it is possible to introduce a metric is called metrizable (cf. Metrizable space). A set $X$ provided with a metric is called a metric space.

### Examples.

1) On any set there is the discrete metric \begin{equation} \rho(x,y) = 0 \text{ if } x=y \quad \text{and} \quad \rho(x,y) = 1 \text{ if } x\ne y. \end{equation}

2) In the space $\mathbb R^n$ various metrics are possible, among them are: \begin{equation} \rho(x,y) = \sqrt{\sum(x_i-y_i)^2}; \end{equation} \begin{equation} \rho(x,y)=\sup\limits_i|x_i-y_i|; \end{equation} \begin{equation} \rho(x,y)=\sum|x_i-y_i|; \end{equation}

here $\{x_i\}, \{y_i\} \in \mathbb{R}^n$.

3) In a Riemannian space a metric is defined by a metric tensor, or a quadratic differential form (in some sense, this is an analogue of the first metric of example 2)). For a generalization of metrics of this type see Finsler space.

4) In function spaces on a (countably) compact space $X$ there are also various metrics; for example, the uniform metric \begin{equation} \rho(f,g)=\sup\limits_{x\in X}|f(x)-g(x)| \end{equation} (an analogue of the second metric of example 2)), and the integral metric \begin{equation} \rho(f,g)=\int\limits_X|f-g|\, dx. \end{equation}

5) In normed spaces over $\mathbb R$ a metric is defined by the norm $\|\cdot\|$: \begin{equation} \rho(x,y) = \|x-y\|. \end{equation}

6) In the space of closed subsets of a metric space there is the Hausdorff metric.

If, instead of 1), one requires only:

1') $\rho(x,y)=0$ if $x=y$ (so that from $\rho(x,y)=0$ it does not always follows that $x=y$), the function $\rho$ is called a pseudo-metric ^{[1]}^{[2]}, or finite écart ^{[3]}.

A metric (and even a pseudo-metric) makes the definition of a number of additional structures on the set $X$ possible. First of all a topology (see Topological space), and in addition a uniformity (see Uniform space) or a proximity (see Proximity space) structure. The term metric is also used to denote more general notions which do not have all the properties 1)–3); such are, for example, an indefinite metric, a symmetry on a set, etc.

#### Comments

Potentially, any metric space $(X,\rho)$ has a second metric $\sigma \geq \rho$ naturally associated: the intrinsic or internal metric. Potentially, because the definition may give $\sigma(x,y)=\infty$ for some pairs of points $x, y$. One defines the length (which may be $\infty$) of a continuous path $f:[0,1]\to X$ by $L(f)=\lim\limits_{\epsilon\to 0}\sup L_{\epsilon}(f)$, where $L_{\epsilon}(f)$ is the infimum of all finite sums $\sum \rho(x_i,x_{i+1})$ with $\{x_i\}$ a finite subset of $[0,1]$ which is an $\epsilon$-net (cf. Metric space) and is listed in the natural order. Then $\sigma(x,y)$ is the infimum of the lengths of paths $f$ with $f(0)=x$, $f(1)=y$, but $\sigma(x,y)=\infty$ if there is no such path of finite length.

No reasonable topological restriction on $(X,\rho)$ suffices to guarantee that the intrinsic "metric" (or écart) $\sigma$ will be finite-valued. If $\sigma$ is finite-valued, suitable compactness conditions will assure that minimum-length paths, i.e. paths from $x$ to $y$ of length $\sigma(x,y)$, exist. When every pair of points $x, y$ is joined by a path (non-unique, in general) of length $\sigma(x,y)$, the metric is often called convex. (This is much weaker than the surface theorists' convex metric.) The main theorem in this area is that every locally connected metric continuum admits a convex metric ^{[4]}^{[5]}.

#### References

- ↑ J.L. Kelley, "General topology" , Springer (1975)
- ↑ K. Kuratowski, "Topology" ,
**1**, PWN & Acad. Press (1966) (Translated from French) - ↑ N. Bourbaki, "Elements of mathematics. General topology" , Addison-Wesley (1966) (Translated from French)
- ↑ R.H. Bing, "Partitioning a set"
*Bull. Amer. Math. Soc.*,**55**(1949) pp. 1101–1110 - ↑ E.E. Moïse, "Grille decomposition and convexification"
*Bull. Amer. Math. Soc.*,**55**(1949) pp. 1111–1121

- P.S. Aleksandrov, "Einführung in die Mengenlehre und die allgemeine Topologie" , Deutsch. Verlag Wissenschaft. (1984) (Translated from Russian)

**How to Cite This Entry:**

Metric.

*Encyclopedia of Mathematics.*URL: http://www.encyclopediaofmath.org/index.php?title=Metric&oldid=29409