metric space
set equipped with a metric (distance function)
≈ 9 min read
metric space. encyclopegia.org, snapshot metric-space-021644-256d11877eac0b3c. /a/metric-space
Names in other languages
- Polskiprzestrzeń metryczna
- pmsSpassi métrich
- Englishmetric space
- 中文度量空间
- 简体中文度量空间
- 繁體中文度量空間
- 中文度量空間
- 中文度量空间
- 中文度量空間
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
s are a subset of normed vector spaces, which are a subset of metric spaces, which in turn are a subset of topological spaces. (a set of points) can be equipped with different metrics. In the taxicab metric the red, yellow and blue paths have the same length (12), and are all shortest paths.
In the Euclidean metric, the green path has length 6 \sqrt{2} \approx 8.49 , and is the unique shortest path, whereas the red, yellow, and blue paths still have length 12. In mathematics, a metric space is a set together with a notion of distance between its points. The distance is measured by a function called a metric or distance function.
Metric spaces are a general setting for studying many of the concepts of mathematical analysis and geometry. The most familiar example of a metric space is 3-dimensional Euclidean space with its usual notion of distance. Other well-known examples are a sphere equipped with the angular distance and the hyperbolic plane.
A metric may correspond to a metaphorical, rather than physical, notion of distance. For example, the set of 100-character Unicode strings can be equipped with the Hamming distance, which measures the number of characters that need to be changed to get from one string to another. Metric spaces appear in many different branches of mathematics.
For example, Riemannian manifolds, normed vector spaces, and graphs may be viewed as metric spaces. In abstract algebra, the field of p-adic numbers is the completion of the field of rational numbers with respect to a certain metric. Metric spaces are also studied in their own right in metric geometry and analysis on metric spaces.
Many notions of analysis, including balls, completeness, as well as uniform, Lipschitz, and Hölder continuity can be defined for metric spaces. Other notions, such as continuity, compactness, and open and closed sets can be defined for metric spaces, but also in the even more general setting of topological spaces.
Formally, a metric space is an ordered pair where is a set (whose elements are called points), and is a metric on , i.e., a function d\,\colon M \times M \to \mathbb{R} satisfying the following axioms for all points x,y,z \in M : The distance from a point to itself is zero: d(x, x) = 0 (Positivity) The distance between two distinct points is always positive: \text{If }x \neq y\text{, then }d(x, y)>0 (Symmetry) The distance from to is always the same as the distance from to : d(x, y) = d(y, x) The triangle inequality holds: d(x, z) \leq d(x, y) + d(y, z) This is a natural property of both physical and metaphorical notions of distance: you can arrive at from by taking a detour through , but this will not make your journey any shorter than the direct path. It is traditional to write as an abbreviation for when it is understood what is.
The real numbers
The real numbers with the distance function d(x,y) = | y - x | given by the absolute difference form a metric space. Many properties of metric spaces and functions between them are generalizations of concepts in real analysis and coincide with those concepts when applied to the real line.
Metrics on Euclidean spaces
The Euclidean plane \R^2 can be equipped with many different metrics. The Euclidean distance familiar from school mathematics can be defined by d_2((x_1,y_1),(x_2,y_2))=\sqrt{(x_2-x_1)^2+(y_2-y_1)^2}.
The taxicab or Manhattan distance is defined by d_1((x_1,y_1),(x_2,y_2))=|x_2-x_1|+|y_2-y_1| and can be thought of as the distance you need to travel along horizontal and vertical lines to get from one point to the other, as illustrated at the top of the article. The maximum, L^\infty , or Chebyshev distance is defined by d_\infty((x_1,y_1),(x_2,y_2))=\max\ The ρ-inframetric inequality implies the ρ-relaxed triangle inequality (assuming the first axiom), and the ρ-relaxed triangle inequality implies the 2ρ-inframetric inequality.
Semimetrics satisfying these equivalent conditions have sometimes been referred to as quasimetrics, nearmetrics or inframetrics. The ρ-inframetric inequalities were introduced to model round-trip delay times in the internet. The triangle inequality implies the 2-inframetric inequality, and the ultrametric inequality is exactly the 1-inframetric inequality.
Premetrics
Relaxing the last three axioms leads to the notion of a premetric, i.e. a function satisfying the following conditions: d(x,y)\geq 0 d(x,x)=0 This is not a standard term. Sometimes it is used to refer to other generalizations of metrics such as pseudosemimetrics or pseudometrics; in translations of Russian books it sometimes appears as "prametric".
A premetric that satisfies symmetry, i.e. a pseudosemimetric, is also called a distance. Any premetric gives rise to a topology as follows. For a positive real r , the centered at a point p is defined as B_r(p)=\{ x | d(x,p) A set is called open if for any point p in the set there is an centered at p which is contained in the set.
Every premetric space is a topological space, and in fact a sequential space. In general, the themselves need not be open sets with respect to this topology. As for metrics, the distance between two sets A and B , is defined as d(A,B)=\underset{x\in A, y\in B}\inf d(x,y). This defines a premetric on the power set of a premetric space.
If we start with a (pseudosemi-)metric space, we get a pseudosemimetric, i.e. a symmetric premetric. Any premetric gives rise to a preclosure operator cl as follows: cl(A)=\{ x | d(x,A) = 0 \}.
Pseudoquasimetrics
The prefixes pseudo-, quasi- and semi- can also be combined, e.g., a pseudoquasimetric (sometimes called hemimetric) relaxes both the indiscernibility axiom and the symmetry axiom and is simply a premetric satisfying the triangle inequality. For pseudoquasimetric spaces the open form a basis of open sets.
A very basic example of a pseudoquasimetric space is the set \{0,1\} with the premetric given by d(0,1) = 1 and d(1,0) = 0. The associated topological space is the Sierpiński space. Sets equipped with an extended pseudoquasimetric were studied by William Lawvere as "generalized metric spaces".
From a categorical point of view, the extended pseudometric spaces and the extended pseudoquasimetric spaces, along with their corresponding nonexpansive maps, are the best behaved of the metric space categories. One can take arbitrary products and coproducts and form quotient objects within the given category. If one drops "extended", one can only take finite products and coproducts.
If one drops "pseudo", one cannot take quotients. Lawvere also gave an alternate definition of such spaces as enriched categories. The ordered set (\mathbb{R},\geq) can be seen as a category with one morphism a\to b if a\geq b and none otherwise.
Using as the tensor product and 0 as the identity makes this category into a monoidal category R^* . Every (extended pseudoquasi-)metric space (M,d) can now be viewed as a category M^* enriched over R^* : The objects of the category are the points of . For every pair of points and such that d(x,y) , there is a single morphism which is assigned the object d(x,y) of R^* .
The triangle inequality and the fact that d(x,x)=0 for all points derive from the properties of composition and identity in an enriched category. Since R^* is a poset, all diagrams that are required for an enriched category commute automatically.
Metrics on multisets
The notion of a metric can be generalized from a distance between two elements to a number assigned to a multiset of elements. A multiset is a generalization of the notion of a set in which an element can occur more than once. Define the multiset union U=XY as follows: if an element occurs times in and times in then it occurs times in .
A function on the set of nonempty finite multisets of elements of a set is a metric if d(X)=0 if all elements of are equal and d(X) > 0 otherwise (positive definiteness) d(X) depends only on the (unordered) multiset (symmetry) d(XY) \leq d(XZ)+d(ZY) (triangle inequality) By considering the cases of axioms 1 and 2 in which the multiset has two elements and the case of axiom 3 in which the multisets , , and have one element each, one recovers the usual axioms for a metric. That is, every multiset metric yields an ordinary metric when restricted to sets of two elements.
A simple example is the set of all nonempty finite multisets X of integers with d(X)=\max (X)- \min (X) . More complex examples are information distance in multisets; and normalized compression distance (NCD) in multisets.
See also
Generalized metric space
Text derived from https://en.wikipedia.org/w/index.php?oldid=1369272972 under CC BY-SA 4.0; modifications have been made.