Hubbry Logo
Intrinsic metricIntrinsic metricMain
Open search
Intrinsic metric
Community hub
Intrinsic metric
logo
7 pages, 0 posts
0 subscribers
Be the first to start a discussion here.
Be the first to start a discussion here.
Intrinsic metric
Intrinsic metric
from Wikipedia

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 along a path whose arclength is equal to (or very close to) that distance. The distance between two points of a metric space relative to the intrinsic metric is defined as the infimum of the lengths of all paths from the first point to the second. A metric space is a length metric space if the intrinsic metric agrees with the original metric of the space.

If the space has the stronger property that there always exists a path that achieves the infimum of length (a geodesic) then it is called a geodesic metric space or geodesic space. For instance, the Euclidean plane is a geodesic space, with line segments as its geodesics. The Euclidean plane with the origin removed is not geodesic, but is still a length metric space.

Definitions

[edit]

Let be a metric space, i.e., is a collection of points (such as all of the points in the plane, or all points on the circle) and is a function that provides us with the distance between points . We define a new metric on , known as the induced intrinsic metric, as follows: is the infimum of the lengths of all paths from to .

Here, a path from to is a continuous map

with and . The length of such a path is defined as follows: to each finite partition

of the interval , consider the sum

We then define the length of to be

where is the set of finite partitions of . If the supremum is finite, we call a rectifiable curve. Note that if there is no path from to since the infimum of the empty set within the closed interval [0,+∞] is +∞.

The mapping is idempotent, i.e.

If

for all points and in , we say that is a length space or a path metric space and the metric is intrinsic.

We say that the metric has approximate midpoints if for any and any pair of points and in there exists in such that and are both smaller than

Examples

[edit]
  • Euclidean space with the ordinary Euclidean metric is a path metric space. is as well.
  • The unit circle with the metric inherited from the Euclidean metric of (the chordal metric) is not a path metric space. The induced intrinsic metric on measures distances as angles in radians, and the resulting length metric space is called the Riemannian circle. In two dimensions, the chordal metric on the sphere is not intrinsic, and the induced intrinsic metric is given by the great-circle distance.
  • Every connected Riemannian manifold can be turned into a path metric space by defining the distance of two points as the infimum of the lengths of continuously differentiable curves connecting the two points. (The Riemannian structure allows one to define the length of such curves.) Analogously, other manifolds in which a length is defined included Finsler manifolds and sub-Riemannian manifolds.
  • Any complete and convex metric space is a length metric space (Khamsi & Kirk 2001, Theorem 2.16), a result of Karl Menger. However, the converse does not hold, i.e. there exist length metric spaces that are not convex.

Properties

[edit]
  • In general, we have and the topology defined by is therefore always finer than or equal to the one defined by .
  • The space is always a path metric space (with the caveat, as mentioned above, that can be infinite).
  • The metric of a length space has approximate midpoints. Conversely, every complete metric space with approximate midpoints is a length space.
  • The Hopf–Rinow theorem states that if a length space is complete and locally compact then any two points in can be connected by a minimizing geodesic and all bounded closed sets in are compact.

References

[edit]
Revisions and contributorsEdit on WikipediaRead on Wikipedia
from Grokipedia
In metric geometry, an intrinsic metric on a topological space XX is defined as a metric dd where the d(x,y)d(x, y) between any two points x,yXx, y \in X is the infimum of the lengths of all rectifiable curves joining xx and yy. This construction ensures that distances reflect the internal path structure of the space, making XX a length space where paths can approximate the metric arbitrarily closely. A metric is strictly intrinsic if, for every pair of points, there exists at least one curve whose length exactly equals d(x,y)d(x, y), guaranteeing the realization of shortest paths, or geodesics. Intrinsic metrics arise naturally from length structures on a space, such as those induced by Riemannian or Finsler metrics, where path lengths are measured using integrals along curves. They were formalized in foundational works to study geometric properties independent of external embeddings, enabling analysis of spaces like manifolds or graphs through their own distance functions. Key motivations include characterizing completeness via the , which links metric completeness to the existence of minimizing geodesics in locally compact length spaces. Examples of intrinsic metrics abound in classical : in , the standard metric is intrinsic, as straight lines realize shortest paths; on a , the distance serves as the intrinsic metric. Properties such as locality—where small distances are preserved under restrictions to subsets—and preservation under uniform limits make intrinsic metrics essential for broader theories, including Alexandrov spaces with curvature bounds and Gromov-Hausdorff convergence. In complete length spaces, the existence of midpoints implies the strict intrinsic property, facilitating the study of convexity and homogeneity in spaces like the hyperbolic plane.

Definitions

Formal Definition

In metric geometry, a length space is defined as a (X,d)(X, d) in which the distance d(x,y)d(x, y) between any two points x,yXx, y \in X equals the infimum of the lengths of all rectifiable connecting them. The L(γ)L(\gamma) of a rectifiable curve γ:[a,b]X\gamma: [a, b] \to X is given by L(γ)=sup{i=1nd(γ(ti1),γ(ti))  |  a=t0<t1<<tn=b},L(\gamma) = \sup\left\{ \sum_{i=1}^n d(\gamma(t_{i-1}), \gamma(t_i)) \;\middle|\; a = t_0 < t_1 < \cdots < t_n = b \right\},
Add your contribution
Related Hubs
User Avatar
No comments yet.