Tight span
In metric geometry, the metric envelope or tight span of a metric space M is an injective metric space into which M can be embedded. In some sense it consists of all points "between" the points of M, analogous to the convex hull of a point set in a Euclidean space. The tight span is also sometimes known as the injective envelope or hyperconvex hull of M. It has also been called the injective hull, but should not be confused with the injective hull of a module in algebra, a concept with a similar description relative to the category of R-modules rather than metric spaces. The tight span was first described by , and it was studied and applied by Holsztyński in the 1960s. It was later independently rediscovered by  and ; see  for this history. The tight span is one of the central constructions of T-theory. Definition
The tight span of a metric space can be defined as follows. Let (X,d) be a metric space, and let T(X) be the set of extremal functions on X, where we say an extremal function on X to mean a function f from X to R such that
 For any x, y in X, d(x,y) ≤ f(x) + f(y), and
 For each x in X, f(x) = sup{d(x,y) - f(y):y in X}. In particular (taking x = y in property 1 above) f(x) ≥ 0 for all x. One way to interpret the first requirement above is that f defines a set of possible distances from some new point to the points in X that must satisfy the triangle inequality together with the distances in (X,d). The second requirement states that none of these distances can be reduced without violating the triangle inequality. The tight span of (X,d) is the metric space (T(X),δ), where

is analogous to the metric induced by the  norm. (If d is bounded, then δ is the subspace metric induced by the metric induced by the  norm. If d is not bounded, then every extremal function on X is unbounded and so  Regardless, it will be true that for any f,g in T(X), the difference  belongs to , i.e., is bounded.) Equivalent definitions of extremal functions
For a function f from X to R satisfying the first requirement, the following versions of the second requirement are equivalent:
 For each x in X, f(x) = sup{d(x,y) - f(y):y in X}. f is pointwise minimal with respect to the aforementioned first requirement, i.e., for any function g from X to R such that d(x,y) ≤ g(x) + g(y) for all x,y in X, if g≤f pointwise, then f=g. Basic properties and examples
 For all x in X, 
 For each x in X,  is extremal. (Proof: Use symmetry and the triangle inequality.) If X is finite, then for any function f from X to R that satisfies the first requirement, the second requirement is equivalent to the condition that for each x in X, there exists y in X such that f(x) + f(y) = d(x,y). (If  then both conditions are true. If  then the supremum is achieved, and the first requirement implies the equivalence.) Say |X|=2, and choose distinct a, b such that X={a,b}. Then  is the convex hull of {{(a,1),(b,0)},{(a,0),(b,1)}}. [Add a picture. Caption: If X={0,1}, then  is the convex hull of {(0,1),(1,0)}.] Every extremal function f on X is Katetov: f satisfies the first requirement and  or equivalently, f satisfies the first requirement and  (is 1-Lipschitz), or equivalently, f satisfies the first requirement and 
 T(X)⊆C(X). (Lipschitz functions are continuous.) T(X) is equicontinuous. (Follows from every extremal function on X being 1-Lipschitz; cf. Equicontinuity#Examples.) Not every Katetov function on X is extremal. For example, let a, b be distinct, let X = {a,b}, let d = ([x≠y])x,y in X be the discrete metric on X, and let f = {(a,1),(b,2)}. Then f is Katetov but not extremal. (It is almost immediate that f is Katetov. f is not extremal because it fails the property in the third bullet of this section.) If d is bounded, then every f in T(X) is bounded. In fact, for every f in T(X),  (Note ) (Follows from the third equivalent property in the above section.) If d is unbounded, then every f in T(X) is unbounded. (Follows from the first requirement.) is closed under pointwise limits. For any pointwise convergent  
 If (X,d) is compact, then (T(X),δ) is compact. (Proof: The extreme-value theorem implies that d, being continuous as a function  is bounded, so (see previous bullet)  is a bounded subset of C(X). We have shown T(X) is equicontinuous, so the Arzelà–Ascoli theorem implies that T(X) is relatively compact. However, the previous bullet implies T(X) is closed under the  norm, since  convergence implies pointwise convergence. Thus T(X) is compact.) For any function g from X to R that satisfies the first requirement, there exists f in T(X) such that f≤g pointwise. For any extremal function f on X, 
 For any f,g in T(X), the difference  belongs to , i.e., is bounded. (Use the above bullet.) The Kuratowski map  is an isometry. (When X=∅, the result is obvious. When X≠∅, the reverse triangle inequality implies the result.) Let f in T(X). For any a in X, if f(a)=0, then f=e(a). (For every x in X we have  From minimality (second equivalent characterization in above section) of f and the fact that  satisfies the first requirement it follows that )
(X,d) is hyperbolic if and only if (T(X),δ) is hyperbolic. Hyperconvexity properties
 (T(X),δ) and  are both hyperconvex. For any Y such that   is not hyperconvex. ("(T(X),δ) is a hyperconvex hull of (X,d).") Let  be a hyperconvex metric space with  and . If for all I with   is not hyperconvex, then  and (T(X),δ) are isometric. ("Every hyperconvex hull of (X,d) is isometric with (T(X),δ).") Examples
 Say |X|=3, choose distinct a, b, c such that X={a,b,c}, and let i=d(a,b), j=d(a,c), k=d(b,c). Then  where  [Add a picture. Caption: If X={0,1,2}, then T(X)=conv{(,,),(,,)} u conv{(,,),(,,)} u conv{(,,),(,,)} is shaped like the letter Y.] (Cf. ) The figure shows a set X of 16 points in the plane; to form a finite metric space from these points, we use the Manhattan distance ( distance). The blue region shown in the figure is the orthogonal convex hull, the set of points z such that each of the four closed quadrants with z as apex contains a point of X. Any such point z corresponds to a point of the tight span: the function f(x) corresponding to a point z is f(x) = d(z,x). A function of this form satisfies property 1 of the tight span for any z in the Manhattan-metric plane, by the triangle inequality for the Manhattan metric. To show property 2 of the tight span, consider some point x in X; we must find y in X such that f(x)+f(y)=d(x,y). But if x is in one of the four quadrants having z as apex, y can be taken as any point in the opposite quadrant, so property 2 is satisfied as well. Conversely it can be shown that every point of the tight span corresponds in this way to a point in the orthogonal convex hull of these points. However, for point sets with the Manhattan metric in higher dimensions, and for planar point sets with disconnected orthogonal hulls, the tight span differs from the orthogonal convex hull. Dimension of the tight span when X is finite
The definition above embeds the tight span T(X) of a set of n () points into RX, a real vector space of dimension n. On the other hand, if we consider the dimension of T(X) as a polyhedral complex,  showed that, with a suitable general position assumption on the metric, this definition leads to a space with dimension between n/3 and n/2. Alternative definitions
An alternative definition based on the notion of a metric space aimed at its subspace was described by , who proved that the injective envelope of a Banach space, in the category of Banach spaces, coincides (after forgetting the linear structure) with the tight span. This theorem allows to reduce certain problems from arbitrary Banach spaces to Banach spaces of the form C(X), where X is a compact space. attempted to provide an alternative definition of the tight span of a finite metric space as the tropical convex hull of the vectors of distances from each point to each other point in the space. However, later the same year they acknowledged in an Erratum  that, while the tropical convex hull always contains the tight span, it may not coincide with it. Applications
 describe applications of the tight span in reconstructing evolutionary trees from biological data. The tight span serves a role in several online algorithms for the K-server problem. uses the tight span to classify metric spaces on up to six points. uses the tight span to prove results about packing cut metrics into more general finite metric spaces. See also
Kuratowski embedding, an embedding of any metric space into a Banach space defined similarly to the Kuratowski map
Injective metric space

Notes

References

. . . . . . . . . . External links
. Metric geometry