Convex metric space
   HOME

TheInfoList



OR:

In
mathematics Mathematics is an area of knowledge that includes the topics of numbers, formulas and related structures, shapes and the spaces in which they are contained, and quantities and their changes. These topics are represented in modern mathematics ...
, convex metric spaces are, intuitively,
metric space In mathematics, a metric space is a set together with a notion of '' distance'' between its elements, usually called points. The distance is measured by a function called a metric or distance function. Metric spaces are the most general setti ...
s with the property any "segment" joining two points in that space has other points in it besides the endpoints. Formally, consider a
metric space In mathematics, a metric space is a set together with a notion of '' distance'' between its elements, usually called points. The distance is measured by a function called a metric or distance function. Metric spaces are the most general setti ...
(''X'', ''d'') and let ''x'' and ''y'' be two points in ''X''. A point ''z'' in ''X'' is said to be ''between'' ''x'' and ''y'' if all three points are distinct, and : d(x, z)+d(z, y)=d(x, y),\, that is, the triangle inequality becomes an equality. A convex metric space is a metric space (''X'', ''d'') such that, for any two distinct points ''x'' and ''y'' in ''X'', there exists a third point ''z'' in ''X'' lying between ''x'' and ''y''. Metric convexity: * does not imply convexity in the usual sense for subsets of
Euclidean space Euclidean space is the fundamental space of geometry, intended to represent physical space. Originally, that is, in Euclid's ''Elements'', it was the three-dimensional space of Euclidean geometry, but in modern mathematics there are Euclidea ...
(see the example of the rational numbers) * nor does it imply path-connectedness (see the example of the rational numbers) * nor does it imply
geodesic convexity In mathematics — specifically, in Riemannian geometry — geodesic convexity is a natural generalization of convexity for sets and functions to Riemannian manifolds. It is common to drop the prefix "geodesic" and refer simply to "conv ...
for Riemannian manifolds (consider, for example, the Euclidean plane with a closed disc removed).


Examples

* Euclidean spaces, that is, the usual three-dimensional space and its analogues for other dimensions, are convex metric spaces. Given any two distinct points x and y in such a space, the set of all points z satisfying the above "triangle equality" forms the
line segment In geometry, a line segment is a part of a straight line that is bounded by two distinct end points, and contains every point on the line that is between its endpoints. The length of a line segment is given by the Euclidean distance between i ...
between x and y, which always has other points except x and y, in fact, it has a continuum of points. * Any
convex set In geometry, a subset of a Euclidean space, or more generally an affine space over the reals, is convex if, given any two points in the subset, the subset contains the whole line segment that joins them. Equivalently, a convex set or a convex ...
in a Euclidean space is a convex metric space with the induced Euclidean norm. For
closed set In geometry, topology, and related branches of mathematics, a closed set is a set whose complement is an open set. In a topological space, a closed set can be defined as a set which contains all its limit points. In a complete metric space, a ...
s the converse is also true: if a closed subset of a Euclidean space together with the induced distance is a convex metric space, then it is a convex set (this is a particular case of a more general statement to be discussed below). * A
circle A circle is a shape consisting of all points in a plane that are at a given distance from a given point, the centre. Equivalently, it is the curve traced out by a point that moves in a plane so that its distance from a given point is cons ...
is a convex metric space, if the distance between two points is defined as the length of the shortest arc on the circle connecting them.


Metric segments

Let (X, d) be a metric space (which is not necessarily convex). A subset S of X is called a metric segment between two distinct points x and y in X, if there exists a closed interval , b/math> on the real line and an
isometry In mathematics, an isometry (or congruence, or congruent transformation) is a distance-preserving transformation between metric spaces, usually assumed to be bijective. The word isometry is derived from the Ancient Greek: ἴσος ''isos'' ...
: \gamma: , b\to X,\, such that \gamma( , b=S, \gamma(a)=x and \gamma(b)=y. It is clear that any point in such a metric segment S except for the "endpoints" x and y is between x and y. As such, if a metric space (X, d) admits metric segments between any two distinct points in the space, then it is a convex metric space. The converse is not true, in general. The
rational number In mathematics, a rational number is a number that can be expressed as the quotient or fraction of two integers, a numerator and a non-zero denominator . For example, is a rational number, as is every integer (e.g. ). The set of all ra ...
s form a convex metric space with the usual distance, yet there exists no segment connecting two rational numbers which is made up of rational numbers only. If however, (X, d) is a convex metric space, and, in addition, it is
complete Complete may refer to: Logic * Completeness (logic) * Completeness of a theory, the property of a theory that every formula in the theory's language or its negation is provable Mathematics * The completeness of the real numbers, which implies t ...
, one can prove that for any two points x\ne y in X there exists a metric segment connecting them (which is not necessarily unique).


Convex metric spaces and convex sets

As mentioned in the examples section, closed subsets of Euclidean spaces are convex metric spaces if and only if they are convex sets. It is then natural to think of convex metric spaces as generalizing the notion of convexity beyond Euclidean spaces, with usual linear segments replaced by metric segments. It is important to note, however, that metric convexity defined this way does not have one of the most important properties of Euclidean convex sets, that being that the intersection of two convex sets is convex. Indeed, as mentioned in the examples section, a circle, with the distance between two points measured along the shortest arc connecting them, is a (
complete Complete may refer to: Logic * Completeness (logic) * Completeness of a theory, the property of a theory that every formula in the theory's language or its negation is provable Mathematics * The completeness of the real numbers, which implies t ...
) convex metric space. Yet, if x and y are two points on a circle diametrically opposite to each other, there exist two metric segments connecting them (the two arcs into which these points split the circle), and those two arcs are metrically convex, but their intersection is the set \ which is not metrically convex.


See also

*
Intrinsic metric In the mathematical study of metric spaces, one can consider the arclength of paths in the space. If two points are at a given distance from each other, it is natural to expect that one should be able to get from the first point to the second al ...


References

* * {{Convex analysis and variational analysis Convex geometry Metric geometry