HOME

TheInfoList



OR:

In
mathematics Mathematics is a field of study that discovers and organizes methods, Mathematical theory, theories and theorems that are developed and Mathematical proof, proved for the needs of empirical sciences and mathematics itself. There are many ar ...
, convex metric spaces are, intuitively,
metric space In mathematics, a metric space is a Set (mathematics), set together with a notion of ''distance'' between its Element (mathematics), elements, usually called point (geometry), points. The distance is measured by a function (mathematics), functi ...
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 (mathematics), set together with a notion of ''distance'' between its Element (mathematics), elements, usually called point (geometry), points. The distance is measured by a function (mathematics), functi ...
(''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 In mathematics, the triangle inequality states that for any triangle, the sum of the lengths of any two sides must be greater than or equal to the length of the remaining side. This statement permits the inclusion of Degeneracy (mathematics)#T ...
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, in Euclid's ''Elements'', it was the three-dimensional space of Euclidean geometry, but in modern mathematics there are ''Euclidean spaces ...
(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 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 line (mathematics), straight line that is bounded by two distinct endpoints (its extreme points), and contains every Point (geometry), point on the line that is between its endpoints. It is a special c ...
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 set of points is convex if it contains every line segment between two points in the set. For example, a solid cube (geometry), cube is a convex set, but anything that is hollow or has an indent, for example, a crescent shape, is n ...
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 (mathematics), set whose complement (set theory), complement is an open set. In a topological space, a closed set can be defined as a set which contains all its lim ...
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 point (geometry), points in a plane (mathematics), plane that are at a given distance from a given point, the Centre (geometry), centre. The distance between any point of the circle and the centre is cal ...
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 z in X, if there exists a closed interval , c/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'' me ...
: \gamma: , c\to X,\, such that \gamma( , c=S, \gamma(a)=x and \gamma(c)=z. Any point ''y'' in a metric segment S, except its endpoints x and z, is between x and z. ''Proof'': since ''y'' is on ''S'', which is the image of ,c there must be some point b in ,csuch that \gamma(b)=y. By the properties of an isometry, d(x,y) = b-a and d(y,z) = c-b. Therefore, d(x,y)+d(y,z) = c-a, which equals d(x,z) by the properties of an isometry. 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 (for example, The set of all ...
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, 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) 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 a ...


References

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