Skip to Content
You are currently on the new version of our website. Access the old version .
AxiomsAxioms
  • Article
  • Open Access

4 August 2025

20 Pages

Injective Hulls of Infinite Totally Split-Decomposable Metric Spaces †

Department of Mathematics, ETH Zürich, 8092 Zürich, Switzerland
†
This work originated from some of the results of the author’s doctoral dissertation presented at ETH Zürich.
This article belongs to the Section Geometry and Topology

Abstract

We extend the theory of splits in finite metric spaces to infinite ones. Within this more general framework, we investigate the class of spaces having metrics that are integer-valued and totally split-decomposable, as well as the polyhedral complex structure of their injective hulls. For this class, we provide a characterization for the injective hull to be combinatorially equivalent to a CAT(0) cube complex. Intermediate results include the generalization of the decomposition theory introduced by Bandelt and Dress in 1992 as well as results on the tight span of totally split-decomposable metric spaces proved by Huber, Koolen, and Moulton in 2006. Next, using results of Lang from 2013, we obtain proper actions on CAT(0) cube complexes for finitely generated groups endowed with a totally split-decomposable word metric and for which the associated splits satisfy a simple combinatorial property. In the case of Gromov hyperbolic groups, the obtained action is both proper aand co-compact. Finally, we obtain as an application that injective hulls of odd cycles are cell complexes isomorphic to CAT(0) cube complexes.

1. Introduction

In 1992, Bandelt and Dress (cf. [1]) introduced a decomposition theory for finite metric spaces which is canonical, that is, it is the only one which is in a sense compatible with Isbell’s injective hull (see [2] for a gentle introduction). Our first goal is to extend the canonical decomposition theory to the class of infinite metric spaces with an integer-valued totally split-decomposable metric and possessing an injective hull with the structure of a polyhedral complex. For this class, we then provide necessary and sufficient conditions for the injective hull to be combinatorially equivalent to a CAT(0) cube complex.
This work builds a bridge between different worlds; on the one side, our results extend the work of Bandelt, Dress, and Buneman [3] on finite metric spaces and the correspondence with canonical cell complexes as well as the later extension of those ideas by Huber, Koolen, and Moulton [4,5,6]. Our results show that the decomposition theory can be successfully applied to infinite metric spaces. Moreover, the present work establishes connections with the results of Lang [7], which lie in another area of mathematics dealing with applications to geometric group theory. The group actions that are obtained as a consequence of our results offer new tools in the theory of actions on CAT(0) cube complexes and ultimately aim at contributing to advance the general classification of groups, a long-standing and major goal of mathematical research. Finally, we illustrate our results by providing a concise and elegant characterization of the injective hull of odd cycles. In this way, we recover as a special case results from Suter which were obtained using completely different techniques, namely, Hasse diagrams of Young lattices [8].
The basic definitions of the canonical decomposition theory of Bandelt and Dress do not need to be modified to suit our more general situation. A split (also called cut) S = { A , B } of a set X is a pair of non-empty subsets of X such that A ∩ B = ∅ and X = A ∪ B , or in other words, X = A ⊔ B . For x ∈ X , we denote by S ( x ) the element of S that contains x. The split (pseudo-)metric associated with S is then a pseudometric δ S on X such that
δ S ( x , y ) : = 1 if S ( x ) ≠ S ( y ) , 0 if S ( x ) = S ( y ) .
For a pseudometric d on X, we refer to S = { A , B } as a d-split (of X) if the isolation index provided by
a S d : = 1 2 inf a , a ′ ∈ A b , b ′ ∈ B max d ( a , b ) + d ( a ′ , b ′ ) d ( a , a ′ ) + d ( a , b ′ ) d ( b , b ′ ) + d ( a , a ′ ) − d ( a , a ′ ) − d ( b , b ′ )
satisfies α S d > 0 . The pseudometric d is called totally split-decomposable if d = ∑ S ∈ S α S d δ S , where S is the set of all d-splits. A split subsystem S ¯ ⊂ S is called octahedral if and only if there is a partition of X into a disjoint union of six non-empty sets X = Y 1 1 ⊔ Y 1 − 1 ⊔ Y 2 1 ⊔ Y 2 − 1 ⊔ Y 3 1 ⊔ Y 3 − 1 such that S ¯ consists of the following four splits:
S 1 : = { Y 1 1 ⊔ Y 2 1 ⊔ Y 3 1 , Y 1 − 1 ⊔ Y 2 − 1 ⊔ Y 3 − 1 } S 2 : = { Y 1 1 ⊔ Y 2 1 ⊔ Y 3 − 1 , Y 1 − 1 ⊔ Y 2 − 1 ⊔ Y 3 1 } S 3 : = { Y 1 1 ⊔ Y 2 − 1 ⊔ Y 3 1 , Y 1 − 1 ⊔ Y 2 1 ⊔ Y 3 − 1 } S 4 : = { Y 1 1 ⊔ Y 2 − 1 ⊔ Y 3 − 1 , Y 1 − 1 ⊔ Y 2 1 ⊔ Y 3 1 } ,
while S is called octahedral-free if it does not contain any octahedral split subsystem. Two splits S : = { A , B } and S ′ : = { A ′ , B ′ } are said to be compatible if A ′ ⊂ A (and thus B ⊂ B ′ ), or alternatively if A ⊂ A ′ (and thus B ′ ⊂ B ).
We provide an outline of the structure of Isbell’s injective hull and present conditions under which it has the structure of a polyhedral complex, following [7]. Given a pseudometric space ( X , d ) , let us consider the vector space R X of real-valued functions on X and Δ ( X , d ) : = { f ∈ R X : f ( x ) + f ( y ) ≥ d ( x , y ) for all x , y ∈ X } . We refer to f ∈ Δ ( X , d ) as extremal if there is no g ≤ f in Δ ( X , d ) distinct from f. The set E ( X , d ) of extremal functions is equivalently provided by
E ( X , d ) = f ∈ R X : f ( x ) = sup y ∈ X ( d ( x , y ) − f ( y ) ) for all x ∈ X .
In order to be able to describe the structure of E ( X , d ) further, it is possible to assign the undirected graph with vertex set X and edge set A ( f ) : = { x , y } : x , y ∈ X and f ( x ) + f ( y ) = d ( x , y ) to every f ∈ E ( X , d ) , allowing self-loops { x , x } which correspond to zeros of f. Furthermore, we let E ′ ( X , d ) : = f ∈ Δ ( X , d ) : ⋃ A ( f ) = X . Note that if f ∈ E ′ ( X , d ) , then the graph ( X , A ( f ) ) has no isolated vertices (although it may be disconnected). A set A of unordered pairs of (possibly equal) points in X is called admissible if there exists an f ∈ E ′ ( X , d ) with A ( f ) = A , and we denote by A ( X ) the collection of admissible sets. To every A ∈ A ( X ) , we associate the affine subspace H ( A ) of R X provided by H ( A ) : = { g ∈ R X : A ⊂ A ( g ) } = { g ∈ R X : g ( x ) + g ( y ) = d ( x , y ) for all x , y ∈ A } . We define the rank of A by rank ( A ) : = dim ( H ( A ) ) ∈ N ∪ { 0 , ∞ } , which is provided by the number of bipartite components or even A-components of ( X , A ) . As an example, if d x : X → R denotes the distance function to x ∈ X i.e., d x ( y ) : = d ( x , y ) , then rank ( A ( d x ) ) = 0 . We also have another example to show that the rank can be infinite; indeed, if ( S 1 , d ) denotes the unit circle endowed with the intrinsic geodesic metric and if f ∈ E ( S 1 , d ) denotes the function that is constantly equal to diam ( S 1 ) 2 = π 2 , then it is possible to verify that rank ( A ( f ) ) = ∞ . See [9] for a discussion of related examples.
If ( X , d ) is a finite metric space, then E ( X , d ) is a finite polyhedral complex; if ( X , d ) is infinite, then we say that ( X , d ) satisfies the local rank condition (LRC) if and only if for every f ∈ E ( X , d ) there exist ε , N > 0 such that for all g ∈ E ′ ( X , d ) with ∥ f − g ∥ ∞ < ϵ we have rank ( A ( g ) ) ≤ N . Recall (cf. [7], Theorem 4.5) that if ( X , d ) is a metric space with an integer-valued metric and satisfying the (LRC), then E ( X , d ) = E ′ ( X , d ) ; in this case, let P ( A ) : = E ′ ( X , d ) ∩ H ( A ) = E ( X , d ) ∩ H ( A ) = Δ ( X , d ) ∩ H ( A ) . Then, the family { P ( A ) } A ∈ A ( X ) defines a polyhedral structure on E ( X , d ) ; in particular, P ( A ′ ) is a face of P ( A ) if and only if A ⊂ A ′ . This defines a canonical locally finite dimensional polyhedral structure on E ( X , d ) . In the case where d is totally split-decomposable, our goal is to provide necessary and sufficient conditions ensuring that E ( X , d ) is combinatorially equivalent to a CAT ( 0 ) cube complex. Accordingly, we have the following theorem.
Theorem 1.
Let ( X , d ) be a metric space with an integer-valued totally split-decomposable metric satisfying the local rank condition and let S be the set of all d-splits; then, the following are equivalent:
(i) 
S does not contain any octahedral split subsystem S ¯ , satisfying the requirement that for every S = { A , B } ∈ S ∖ S ¯ there is S ′ : = { A ′ , B ′ } ∈ S ¯ such that S and S ′ are compatible.
(ii) 
Each cell of E ( X , d ) is a parallelotope.
  • If (i) or equivalently (ii) in Theorem 1 holds, then there is a CAT(0) cube complex K ( X , d ) and a canonical bijective cell complex isomorphism σ : E ( X , d ) → K ( X , d ) mapping cells affinely to cells.
For general facts regarding injective hulls, we refer to [7]. Injective hulls can be characterized in several different ways. In the sequelae, the injective hull refers to Isbell’s injective hull construction ( X , d ) ↦ E ( X , d ) . The difference between two elements of E ( X , d ) has a finite · ∞ -norm, and E ( X , d ) is endowed with the metric d ∞ ( f , g ) : = f − g ∞ . It is easy to see that for f ∈ E ( X , d ) , if d ( x , x ′ ) = 0 , then f ( x ) = f ( x ′ ) ; hence, if ( X , d ) is a pseudometric space and ( Y , d ′ ) is the associated metric space obtained by collapsing every maximal set of diameter zero to a single point, then E ( X , d ) and E ( Y , d ′ ) are isometric. Accordingly, statements involving the injective hull will be stated for metric spaces instead of for pseudometric spaces.
We use the word parallelotope for a Minkowski sum of a finite collection of linearly independent closed segments (for instance, see [10]). Whenever condition (i) in Theorem 1 holds, we say that the family of all d-splits of X has no compatibly octahedral decomposition. If the diameters of the cells of E ( X , d ) are uniformly bounded, then σ in Theorem 1 can be chosen to be bi-Lipschitz. For a metric space ( X , d ) , let I ( x , y ) : = { z ∈ X : d ( x , z ) + d ( z , y ) = d ( x , y ) } denote the interval between x and y, and for x , v ∈ X let the cone determined by the directed pair ( x , v ) be provided by C ( x , v ) : = { y ∈ X : v ∈ I ( x , y ) } . For a subset B of X, we denote by C ( B ) the set of all pointed cones ( v , C ( x , v ) ) with v ∈ B and x ∈ X . In addition, ( X , d ) is called discretely geodesic if the metric is integer-valued and for every pair of points x , y ∈ X there exists an isometric embedding γ : { 0 , 1 , … , d ( x , y ) } → X such that γ ( 0 ) = x and γ ( d ( x , y ) ) = y . Moreover, we say that a discretely geodesic metric space X has β-stable intervals for some constant β ≥ 0 if, for every triple of points x , y , y ′ ∈ X such that d ( y , y ′ ) = 1 , we have d H ( I ( x , y ) , I ( x , y ′ ) ) ≤ β , where d H denotes the Hausdorff distance in X.
Among its other features, the injective hull has applications to geometric group theory. Let Γ be a finitely generated group and G a finite generating set, and let Γ be equipped with the word metric d G with respect to the alphabet G ∪ G − 1 . Note that the metric d G is integer-valued.
Theorem 2.
Let ( Γ , d G ) be a metric space where Γ is a finitely generated group and G a finite generating set, and let d G denote the word metric defined on Γ with respect to the alphabet G ∪ G − 1 . Assume that d G is totally split-decomposable and that (i) or equivalently (ii) in Theorem 1 holds. Then, the following hold:
(i) 
If ( Γ , d G ) has β-stable intervals, then there is a proper action of Γ (a CAT(0) cube complex K ( X , d ) K ( Γ , d G ) ) provided by
( x , y ) ↦ ( σ ∘ L ¯ x ∘ σ − 1 ) ( y ) .
(ii) 
If ( Γ , d G ) is δ-hyperbolic, then the action of Γ on K ( Γ , d G ) is also co-compact.
To prove Theorem 1, and consequently Theorem 2, we need to decompose any pseudometric d on a set X in a way that is coherent with the structure of E ( X , d ) . The isolation index of a pair S : = { A , B } of non-empty subsets with respect to a pseudometric d on X is the non-negative number α S d (equivalently α { A , B } d , or simply α S ) provided by (1). We then refer to a pseudometric d 0 on X as split-prime if α S d 0 = 0 for any split S of X. Note that per Lemma 1, for any integer-valued pseudometric there are only finitely many d-splits separating any pair of points.
Theorem 3.
Let ( X , d ) be a pseudometric space with an integer-valued pseudometric, let S X be the set of all splits of X, and let S be the set all d-splits. Letting
λ S ∈ [ 0 , α S d ] if S ∈ S , λ S = 0 if S ∈ S X ∖ S ,
d ˜ : = d − ∑ S ∈ S λ S δ S is a pseudometric such that for every split S ∈ S X we have α S d ˜ = α S d − λ S ; in particular, there is a split-prime pseudometric d 0 such that
d = d 0 + ∑ S ∈ S α S d δ S .
The decomposition provided by Theorem 3 can be characterized uniquely in a corollary to Theorem 6 which relates to the structure of general cellular graphs; see [11] (Section 8.3).
Corollary 1.
Let ( X , d ) be a metric space with an integer-valued metric satisfying the LRC. Let S be the family of all d-splits of X such that d = d 0 + ∑ S ∈ S α S δ S , and let λ S ∈ [ 0 , α S ] for every S ∈ S . Then, setting d 1 : = d − ∑ S ∈ S λ S δ S , we have
E ( X , d ) ⊂ R X ∩ E ( X , d 1 ) + ∑ S ∈ S λ S E ( X , δ S ) .
Moreover, for any split S = { A , B } of X and any λ S > 0 such that d = d 1 + λ S δ S , if E ( X , d ) ⊂ E ( X , d 1 ) + λ S E ( X , δ S ) , then the following hold:
(i) 
S is a d-split of X.
(ii) 
λ S ≤ α S .
We conclude with a discussion of the future research directions that can build on the present work. The results presented here echo the discussion in [12], where interest in infinite metric spaces and CAT(0) complexes were highlighted. The conclusions of our work suggest that other ideas which are originally developed for finite metric spaces, for instance in phylogenetics, can be successfully generalized to the infinite case. Subsequently, such correspondence can be leveraged to infer results about abstract metric spaces in order to provide links to other areas of mathematics with a novel perspective, such as geometric group theory. Finally, splits in metric spaces are not only relevant in the case of tight spans; there has also been recent work on links with Vietoris–Rips complexes [13] with applications to topological data analysis (TDA), which is an exciting direction for further research.

2. Decomposition Theory

It is easy to see that E ( X , d ) as defined at the beginning of the introduction is a subset of Δ 1 ( X , d ) : = { f ∈ Δ ( X , d ) : f is 1 - Lipschitz } . Note that a function f ∈ R X belongs to Δ 1 ( X , d ) if and only if
∥ f − d x ∥ ∞ = f ( x ) for all x ∈ X ,
where d x : X → R denotes the distance function to x ∈ X , i.e., d x ( y ) : = d ( x , y ) . The metric d ∞ ( f , g ) : = ∥ f − g ∥ ∞ on Δ 1 ( X , d ) is thus well-defined and E ( X , d ) is equipped with the induced metric. We have the canonical isometric mapping e : ( X , d ) → E ( X , d ) , provided by e ( x ) = d x . Let ( X , d ) be any pseudometric space. A partial split S = { A , B } of X is a pair of non-empty subsets of X such that A ∩ B = ∅ . If X = A ∪ B also holds, then S = { A , B } is a split of X. A partial d-split is a partial split S = { A , B } for which α S d > 0 . Note now that if ( X , d ) is a pseudometric space with integer-valued pseudometric, then for any split S we have
α S ∈ [ 0 , ∞ ) ∩ 1 2 Z .
The proof of the next lemma is very similar to the proof of its finite analogue, except that we cannot use induction on the set of all d-splits [14] (IV.2 Theorem 2.3). Instead, we use the fact that for every ε > 0 there are { a , a ′ } ⊂ A 0 and { b , b ′ } ⊂ B 0 , such that α { A 0 , B 0 } + ε ≥ α { { a , a ′ } , { b , b ′ } } (if x = y , we still use { x , y } to denote { x } ). Moreover, if Y ⊂ X satisfies Y ∩ A 0 , Y ∩ B 0 ≠ ∅ , then we have α { A 0 , B 0 } d ≤ α { Y ∩ A 0 , Y ∩ B 0 } d | Y × Y .
Theorem 4.
Let ( X , d ) be a pseudometric space such that, for every x , y ∈ X , there are only finitely many distinct d-splits S satisfying S ( x ) ≠ S ( y ) . Moreover, let { A 0 , B 0 } be a partial d-split. Then,
∑ α { A , B } : { A , B } is a d - s p l i t e x t e n d i n g { A 0 , B 0 } ≤ α { A 0 , B 0 } .
The next lemma enables us to use several arguments of [1] by examining the pointwise behavior of pseudometrics. The approach of [15], which generalizes [1], has a global nature which causes obstructions to any direct adaptation to the case with | X | = ∞ .
Lemma 1.
Let ( X , d ) be a pseudometric space with an integer-valued pseudometric. For every x , y ∈ X , there are at most 2 d ( x , y ) distinct d-splits S satisfying S ( x ) ≠ S ( y ) .
Proof. 
Assume by contradiction that we can find m : = 2 d ( x , y ) + 1 distinct d-splits S i such that S i ( x ) ≠ S i ( y ) . For every 1 ≤ i < j ≤ m , choose z i j ∈ X such that either z i j ∈ S i ( x ) ∩ S j ( y ) or z i j ∈ S i ( y ) ∩ S j ( x ) . Furthermore, setting Z : = { x , y } ∪ { z i j : 1 ≤ i < j ≤ m } , we have S i ( x ) ∩ Z ≠ S j ( x ) ∩ Z if i ≠ j ; hence
d ( x , y ) + 1 2 ≤ ∑ i ∈ { 1 , … , m } α S i d ≤ ∑ i ∈ { 1 , … , m } α { S i ( x ) ∩ Z , S i ( y ) ∩ Z } d | Z × Z ,
and per the special case ([1], Theorem 1) of Theorem 4 applied to the partial split A 0 : = { x } and B 0 : = { y } of the finite set Z, the right-hand side is less than or equal to α { { x } , { y } } d | Z × Z = d ( x , y ) , which is a contradiction. This concludes the proof. □
It is possible to prove the next lemma by a direct modification of ([1], Theorem 2).
Lemma 2.
Let ( X , d ) be a pseudometric space with an integer-valued pseudometric. Let S be the set of all d-splits of X and let S ˜ ⊂ S be any finite subset. If λ S ∈ ( 0 , α S d ] for every S ∈ S ˜ and λ S : = 0 for every other split, then d ˜ : = d − ∑ S ∈ S ˜ λ S δ S is a pseudometric such that for every split S of X we have
α S d ˜ = α S d − λ S .
The next definition is taken from [1], where it is introduced for finite metric spaces. The same definition extends to the infinite case without modification.
Definition 1.
We refer to a collection S of splits of a set X as weakly compatible if there are no four points { x 0 , x 1 , x 2 , x 3 } ⊂ X and three splits { S 1 , S 2 , S 3 } ⊂ S such that for any i , j ∈ { 1 , 2 , 3 } one has S i ( x 0 ) = S i ( x j ) ⟺ i = j .
It follows immediately from the above definition that the collection of all d-splits with respect to any pseudometric d on X is weakly compatible. This is part of the next theorem.
Theorem 5.
Let ( X , d ) denote any pseudometric space with an integer-valued metric; then, the d-splits of X are weakly compatible. Conversely, let S 0 denote any collection of weakly compatible splits of X and choose for each S ∈ S 0 some λ S ∈ ( 0 , ∞ ) such that
d : = ∑ S ∈ S 0 λ S δ S : X × X → Z ∩ [ 0 , ∞ ) .
It follows that S 0 is the set of all d-splits and that for each S ∈ S 0 , the isolation index α S : = α S d coincides with λ S .
The proof of Theorem 5 is a close analogue to the proof of ([1], Theorem 3); see [14]. The assumptions in the next lemma ensure that E ( X , d ) is a polyhedral complex. We denote by Σ 0 ( E ( X , d ) ) the set of vertices of the polyhedral complex E ( X , d ) ; equivalently, it is the set of all functions f ∈ E ( X , d ) such that rank ( A ( f ) ) = 0 . The idea of considering this set of functions is inspired by [15] (Lemma 2.2). Both Lemma 5 and Theorem 6 highlight differences that arise when extending the theory of finite metric spaces to infinite ones.
Lemma 3.
Let ( X , d ) be a metric space with an integer-valued metric satisfying the LRC, and let f ∈ Σ 0 ( E ( X , d ) ) . Let S < ∞ be any finite subset of the set S of all d-splits of X. If we pick λ S ∈ [ 0 , α S d ] for every S ∈ S < ∞ , then we have functions f S ∈ E ( X , δ S ) such that
f − ∑ S ∈ S < ∞ λ S f S ∈ Δ X , d − ∑ S ∈ S < ∞ λ S δ S .
Proof. 
Let S : = { A , B } ∈ S < ∞ , where S < ∞ is any finite subset S . Note that f ∈ Σ 0 ( E ( X , d ) ) means that f is a vertex of the polyhedral complex E ( X , d ) , which is equivalent to rank ( A ( f ) ) = 0 by definition. Thus, A ( f ) is in particular not bipartite, meaning that there are a , a ′ ∈ X such that { a , a ′ } ∈ A ( f ) and either a , a ′ ∈ A or a , a ′ ∈ B . Assume without loss of generality that a , a ′ ∈ A . Note also that if there are b , b ′ ∈ B such that we have { b , b ′ } ∈ A ( f ) , then α S d = 0 , which contradicts our assumption. Hence, for any b , b ′ ∈ B , we have { b , b ′ } ∉ A ( f ) . Now, setting
f S ( x ) = 0 if x ∈ A , 1 if x ∈ B ,
it readily follows that f ( 1 ) : = f − λ S f S and d ( 1 ) : = d − λ S f S satisfy f ( 1 ) ∈ Δ X , d ( 1 ) . Furthermore, note that if { x , y } ∈ A d ( f ) , then either x , y ∈ A or x ∈ A and y ∈ B . In both cases, it is evident that { x , y } ∈ A d ( 1 ) ( f ( 1 ) ) (noting that A d ( 1 ) ( f ( 1 ) ) refers to those pairs { x , y } satisfying f ( 1 ) ( x ) + f ( 1 ) ( y ) = d ( 1 ) ( x , y ) ). Thus,
A d ( f ) ⊂ A d ( 1 ) ( f ( 1 ) ) ;
hence, in particular, f ( 1 ) ∈ Σ 0 ( E ( X , d ( 1 ) ) ) . For S ′ : = { A ′ , B ′ } ∈ S ∖ { S } , we can proceed as above and find c , c ′ ∈ A ′ such that { c , c ′ } ∈ A d ( 1 ) ( f ( 1 ) ) . Now, by Theorem 3, it follows that α S ′ d ( 1 ) = α S ′ d > 0 . This implies that for any e , e ′ ∈ B ′ , we have { e , e ′ } ∉ A d ( 1 ) ( f ( 1 ) ) . Now, setting
f S ′ ( 1 ) ( x ) = 0 if x ∈ A ′ , 1 if x ∈ B ′
we obtain f ( 1 ) − λ S ′ f S ′ ( 1 ) ∈ Δ X , d ( 1 ) − λ S ′ δ S ′ , as before. Per (7), it follows that f S ′ = f S ′ ( 1 ) . It then follows as a result that
f − λ S f S − λ S ′ f S ′ = f ( 1 ) − λ S ′ f S ′ ( 1 ) ∈ Δ X , d ( 1 ) − λ S ′ δ S ′ = Δ X , d ( 2 ) ,
where d ( 2 ) = d − λ S δ S − λ S ′ δ S ′ . Proceeding by induction, we get the desired result. □
For an infinite split system S , we generally have Δ ( X , d 0 ) + ∑ S ∈ S α S Δ ( X , δ S ) ⊂ [ 0 , ∞ ] X and cannot replace [ 0 , ∞ ] X by R X .
Theorem 6.
Let ( X , d ) be a metric space with an integer-valued metric satisfying the LRC. Let S be the family of all d-splits of X such that d = d 0 + ∑ S ∈ S α S δ S and let λ S ∈ [ 0 , α S ] for every S ∈ S , setting d 1 : = d − ∑ S ∈ S λ S δ S . Then,
Δ ( X , d ) = R X ∩ Δ ( X , d 1 ) + ∑ S ∈ S λ S Δ ( X , δ S ) .
Proof. 
Let S be the set of all d-splits and let S ∈ S . As in the proof of Lemma 3, f ∈ Σ 0 ( E ( X , d ) ) means that f is a vertex of the polyhedral complex E ( X , d ) , which by definition is equivalent to rank ( A ( f ) ) = 0 . Thus, A ( f ) is not bipartite, which means that there are a , a ′ ∈ X such that { a , a ′ } ∈ A ( f ) . Without loss of generality, we assume that a , a ′ ∈ A . Then, for any b , b ′ ∈ B , we have { b , b ′ } ∉ A ( f ) . Now, setting
f S ( x ) = 0 if x ∈ A , 1 if x ∈ B ,
we first show that for every x ∈ X , we have ∑ S ∈ S λ S f S ( x ) ≠ ∞ . Note that for every x ∈ X there exists x ′ ∈ X such that { x , x ′ } ∈ A d ( f ) . Furthermore, we have
d ( x , x ′ ) = d 0 ( x , x ′ ) + ∑ S ∈ S S ( x ) ≠ S ( x ′ ) α S d δ S ( x , x ′ ) .
Because α S d ∈ [ 0 , ∞ ) ∩ 1 2 Z , we deduce that the set
S x x ′ : = { S ∈ S : S ( x ) ≠ S ( x ′ ) }
is finite. Moreover, for every S : = { A , B } ∈ S ∖ S x x ′ , because { x , x ′ } ∈ A d ( f ) , by definition we have x , x ′ ∈ A and f S ( x ) = 0 = f S ( x ′ ) . It then follows that ∑ S ∈ S λ S f S ∈ R X as well as that
f 1 : = f − ∑ S ∈ S λ S f S ∈ R X .
For d 1 : = d − ∑ S ∈ S λ S δ S , it now remains to show that f 1 ∈ Δ ( X , d 1 ) . For every x , y ∈ X , there are x ′ , y ′ ∈ X such that { x , x ′ } , { y , y ′ } ∈ A d ( f ) . Because for every S ∈ S x y we have f S ( x ) + f S ( y ) = 1 , it follows that S x y ⊂ S x x ′ ∪ S y y ′ = : S < ∞ , where | S < ∞ | < ∞ . By Lemma 3 and setting d 1 < ∞ : = d − ∑ S ∈ S < ∞ λ S δ S , it follows that
f 1 < ∞ : = f − ∑ S ∈ S < ∞ λ S f S ∈ Δ X , d 1 < ∞ ,
and thus that f 1 ( x ) + f 1 ( y ) = f 1 < ∞ ( x ) + f 1 < ∞ ( y ) ≥ d 1 ( x , y ) . This shows that Σ 0 ( E ( X , d ) ) ⊂ Δ ( X , d 1 ) + ∑ S ∈ S λ S Δ ( X , δ S ) . Now, using the fact that ( X , d ) satisfies the LRC, we can consider for each cell of E ( X , d ) all finite convex combinations of its vertices, and by convexity of Δ ( X , d 1 ) and Δ ( X , δ S ) , for every S ∈ S we can deduce that E ( X , d ) ⊂ Δ ( X , d 1 ) + ∑ S ∈ S λ S Δ ( X , δ S ) . Finally, adding [ 0 , ∞ ) X on both sides and intersecting with R X , we get
Δ ( X , d ) ⊂ R X ∩ Δ ( X , d 1 ) + ∑ S ∈ S λ S Δ ( X , δ S ) .
Because the other inclusion is easy to see, we obtain the desired result. □
Hence, we obtain the first part of the statement of Corollary 1. By virtue of Remark 1 below, the proof of the second part of the statement of the corollary is similar to the proof of the corresponding assertion for the set Δ ( X , d ) in ([1], (Theorem 7).
Remark 1.
Properties (4) and (8) are equivalent. It is shown in the proof of Theorem 6 that (4) implies (8). To see that the other implication holds, remember that by [7] (Proposition 3.1) there is a 1-Lipschitz map p : Δ ( X , d ) → E ( X , d ) such that one has g : = p ( f ) ≤ f for every f ∈ Δ ( X , d ) . From (4), we obtain a decomposition of g as g : = g 1 + ∑ S ∈ S λ S g S . Moreover, f − g ∈ [ 0 , ∞ ) X ; hence,
f = g 1 + ( f − g ) + ∑ S ∈ S λ S g S ∈ R X ∩ Δ ( X , d 1 ) + ∑ S ∈ S λ S Δ ( X , δ S ) ,
which is the desired result.

5. Examples

We conclude with two examples to illustrate our results and concepts.
Example 1.
Let ( X , d ) denote an infinite connected bipartite ( 4 , 4 ) -graph as defined in [11], endowed with the shortest-path metric. From the finite case, it readily follows that d is totally split-decomposable, that is, d = ∑ S ∈ S α S , where every S is an alternating split on X (cf. [11]). Furthermore, ( X , d ) satisfies the LRC. This can be seen by noting that the isometric cycles in ( X , d ) are gated (cf. [11], Theorem 8.7), it follows that ( X , d ) has 1-stable intervals; thus, by the proof of ([7], Theorem 1.1), we obtain the desired result. It is easy to see that by bipartiteness, the set of d-splits is octahedral-free. Hence, ( X , d ) satisfies all assumptions of Theorem 1. Examples of such infinite bipartite ( 4 , 4 ) -graphs are provided for m ≥ 4 , for σ any element of the symmetric group S m , and for { r σ ( i ) σ ( i + 1 ) } i ∈ { 1 , … , m } ⊂ ( N ∩ [ 2 , ∞ ) ) ∪ { ∞ } by the Cayley graph of Coxeter groups of the form
C = s 1 , … , s m | ( s σ ( 1 ) s σ ( 2 ) ) r σ ( 1 ) σ ( 2 ) = 1 , … , ( s σ ( m − 1 ) s σ ( m ) ) r σ ( m − 1 ) σ ( m ) = 1 , ( s σ ( m ) s σ ( 1 ) ) r σ ( m ) σ ( 1 ) = 1 .
The restriction on the number of relations ensures that the Cayley graph is planar, m ≥ 4 ensures that the degree is at least four, and the condition r σ ( i ) σ ( i + 1 ) ≥ 2 for every i ensures that each face contains at least four vertices.
Before moving on to the last and main example, we note that two splits S : = { A , B } and S ′ = { A ′ , B ′ } of X are called incompatible if A ∩ A ′ ,   A ∩ B ′ ,   B ∩ A ′ ,   B ∩ B ′ ≠ ∅ . A split system S is then called incompatible if any pair of splits in S is incompatible.
Example 2.
For n ∈ N , let
C 2 n + 1 : = { x 1 , … , x 2 n + 1 } , { { x i , x i + 1 } } i ∈ { 1 , … , 2 n + 1 } where x 2 n + 2 : = x 1 .
The graph C 2 n + 1 is the odd cycle with 2 n + 1 vertices, and we endow it with the shortest path metric d. We now provide an explicit description of the injective hull E ( C 2 n + 1 , d ) . It can be easily verified that d = 1 2 ∑ S ∈ S δ S , where S is the set of all d-splits of X; hence, α : S → ( 0 , ∞ ) is constantly equal to 1 2 . We have S = { S 1 , … , S 2 n + 1 } , where the split S i is provided by { A i , B i } = { { x i + 1 , … , x i + n } , { x i + n + 1 , … , x i } } for i ∈ { 1 , … , 2 n + 1 } , with the indices taken modulo 2 n + 1 . Now, it is not difficult to prove that the assumptions of Theorem 1 are fulfilled for ( X , d ) = ( C 2 n + 1 , d ) . Because we are in the case of a finite metric space, the LRC is trivially satisfied. Moreover, d is totally split-decomposable, and it is not difficult to see that S is octahedral-free. Thus, (i) in Theorem 1 holds.
Because ( C 2 n + 1 , d ) is finite, we have B ( S , α ) = T ¯ ( S , α ) (cf. [22], Proposition 7.3), and by (iii) in Remark 2, the map κ : T ¯ ( S , α ) → E ( C 2 n + 1 , d ) is in particular an isomorphism of cell complexes. Thus, the family of maximal cells of E ( C 2 n + 1 , d ) is in bijection with the family of maximal cells of B ( S , α ) , which in turn bijectively corresponds with the family M of maximal incompatible split subsystems M ⊂ S . To compute | M | , it is easier to describe the split system S in a different way. For i ∈ { 1 , … , n + 1 } , we assign to every edge { x i , x i + 1 } of C 2 n + 1 the pair of splits S i 1 = { A i 1 , B i 1 } and S i − 1 = { A i − 1 , B i − 1 } which cut the edge { x i , x i + 1 } (i.e., S i 1 ( x i ) ≠ S i 1 ( x i + 1 ) and S i − 1 ( x i ) ≠ S i − 1 ( x i + 1 ) ) and which are determined by the requirements x i ∈ A i 1 and | A i 1 | = n + 1 along with x i ∈ A i − 1 and | A i − 1 | = n ; moreover, S 1 1 = S n + 1 − 1 . We divide the family M of maximal incompatible split subsystems of S into three subfamilies
M = M a ∪ M b ∪ M c ,
so that for M : = { S j 1 σ 1 , … , S j k σ k } ∈ M with 1 ≤ j 1 < j 2 < … < j k − 1 < j k ≤ 2 n + 1 we have three cases for each of the three subsets of M .
First, M ∈ M a if and only if S j 1 σ 1 = S 1 1 . In this case, we have
| M a | = Σ ( n − 1 , n − 1 ) a + Σ ( n − 1 , n ) a ,
where Σ ( n − 1 , n − 1 ) : = Σ ( n − 1 , n − 1 ) a stands for the case in which S j k σ k = S n 1 and Σ ( n − 1 , n ) : = Σ ( n − 1 , n ) a for the case in which S j k σ k = S n − 1 . The notation Σ ( n − 1 , n − 1 ) refers to the fact that | B j 1 σ 1 ∩ A j k σ k | = n − 1 and | A j 1 σ 1 ∩ B j k σ k | = n − 1 (i.e., starting with x 2 and going counterclockwise, we count n − 1 points until we hit the line representing S j k σ k ; similarly, when starting with x n + 2 , we count n − 1 points until we hit the line representing S j k σ k ). This case is depicted in Figure 1.
Figure 1. The integer Σ ( n − 1 , n − 1 ) a corresponds to the count of maximal incompatible split systems { S j 1 σ 1 , … , S j k σ k } with S j 1 σ 1 = S 1 1 and S j k σ k = S n 1 , while Σ ( n − 1 , n ) a is the count of splits with S j 1 σ 1 = S 1 1 and S j k σ k = S n − 1 .
Second, M ∈ M b if and only if S j 1 σ 1 = S 1 − 1 . In this case, we have
| M b | = Σ ( n − 1 , n − 1 ) b + Σ ( n , n − 1 ) b ,
where by symmetry Σ ( n − 1 , n − 1 ) b = Σ ( n − 1 , n − 1 ) stands for the case in which S j k σ k = S n − 1 and Σ ( n , n − 1 ) b = Σ ( n − 1 , n ) for the case in which S j k σ k = S n + 1 1 .
Third, M ∈ M c if and only if S j 1 σ 1 = S 2 1 . In this case, we have
| M c | = Σ ( n − 1 , n − 1 ) c ,
and by symmetry Σ ( n − 1 , n − 1 ) c = Σ ( n − 1 , n − 1 ) stands for the case in which S j k σ k = S n + 1 1 .
Summing up, we obtain the formula
| M | = Θ n = 3 Σ ( n − 1 , n − 1 ) + 2 Σ ( n − 1 , n ) ,
and it is easy to see that we also have the following recurrence relations Σ ( n − 1 , n − 1 ) = Σ ( n − 2 , n − 2 ) + Σ ( n − 3 , n − 2 ) and Σ ( n − 1 , n ) = Σ ( n − 2 , n − 1 ) + Σ ( n − 2 , n − 2 ) along with the initial conditions Σ ( 0 , 0 ) : = 1 , Σ ( 0 , 1 ) : = 0 , and Σ ( 1 , 1 ) : = 1 . The first values of Θ n for n ≥ 1 are listed in the following table.
n12345678910
C 2 n + 1 C 3 C 5 C 7 C 9 C 11 C 13 C 15 C 17 C 19 C 21
Θ n 35712223968119209367
The numbers Θ n can also be proved (see e.g., [23]) to correspond to the coefficient of z n in the power series expansion in a neighborhood of the origin of the analytic function
z ↦ 3 z − z 2 1 − 2 z + z 2 − z 3 .

Funding

This research was funded in part by the Swiss National Science Foundation grant number 153309.

Data Availability Statement

Data are contained within the article.

Acknowledgments

I am very grateful to Urs Lang for numerous stimulating conversations about the topics of this work.

Conflicts of Interest

The author declares no conflicts of interest.

References

  1. Bandelt, H.-J.; Dress, A.W.M. A Canonical Decomposition Theory for Metrics on a Finite Set. Adv. Math. 1992, 92, 47–105. [Google Scholar] [CrossRef] [Scilit]
  2. Petrunin, A. Pure Metric Geometry, 1st ed.; Springer Briefs in Mathematics; Springer: Cham, Switzerland, 2023. [Google Scholar]
  3. Buneman, P. The recovery of trees from measures of dissimilarity. In Mathematics in the Archaeological and Historical Sciences; Hodson, F.R., Kendall, D.G., Eds.; Edinburgh University Press: Edinburgh, UK, 1971; pp. 387–395. [Google Scholar]
  4. Huber, K.T.; Koolen, J.; Moulton, V. On the structure of the tight-span of a totally split-decomposable metric. Eur. J. Comb. 2006, 27, 461–479. [Google Scholar] [CrossRef] [Scilit]
  5. Huber, K.T.; Koolen, J.; Moulton, V. The tight-span of an antipodal metric space: Part I-combinatorial properties. Discret. Math. 2005, 303, 65–79. [Google Scholar] [CrossRef] [Scilit]
  6. Huber, K.T.; Koolen, J.; Moulton, V. The tight-span of an antipodal metric space: Part II-geometrical properties. Discret. Comput. Geom. 2004, 31, 567–586. [Google Scholar] [CrossRef] [Scilit]
  7. Lang, U. Injective hulls of certain discrete metric spaces and groups. J. Topol. Anal. 2013, 5, 297–331. [Google Scholar] [CrossRef] [Scilit]
  8. Suter, R. Injective hulls of odd cycles. arXiv 2013, arXiv:1302.1329. [Google Scholar] [CrossRef] [Scilit]
  9. Lim, S.; Memoli, F.; Wan, Z.; Wang, Q.; Zhou, L. Some results about the Tight Span of spheres. arXiv 2021, arXiv:2112.12646. [Google Scholar] [CrossRef] [Scilit]
  10. Grünbaum, B. Convex Polytopes, 2nd ed.; Graduate Texts in Mathematics; Springer: New York, NY, USA, 2003; Volume 221. [Google Scholar]
  11. Bandelt, H.-J.; Chepoi, V. Metric graph theory and geometry: A survey. Contemp. Math. 2008, 453, 49–86. [Google Scholar]
  12. Huber, K.T.; Koolen, J.; Moulton, V. The polytopal structure of the tight-span of a totally split-decomposable metric. Discret. Math. 2019, 342, 868–878. [Google Scholar] [CrossRef] [Scilit]
  13. Gómez, M. Vietoris-Rips Complexes of Split-Decomposable Spaces. arXiv 2025, arXiv:2403.15655. [Google Scholar]
  14. Pavón, M. Geometry and Structure of Metric Injective Hulls. Doctoral Thesis, ETH-Zürich, Zürich, Switzerland, 2016. Nr. 23120. [Google Scholar] [CrossRef] [Scilit]
  15. Herrmann, S.; Joswig, M. Splitting polytopes. Münster J. Math. 2008, 1, 109–141. [Google Scholar]
  16. Dress, A.; Huber, K.T.; Moulton, V. An explicit computation of the injective hull of certain finite metric spaces in terms of their associated Buneman complex. Adv. Math. 2002, 168, 1–28. [Google Scholar] [CrossRef] [Scilit]
  17. Dress, A.; Huber, K.T.; Moulton, V. A comparison between two distinct continuous models in projective cluster theory: The median and the tight-span construction. Ann. Comb. 1998, 2, 299–311. [Google Scholar] [CrossRef] [Scilit]
  18. Mankiewicz, P. On Extension of Isometries in Normed Linear Spaces. Bull. Acad. Polon. Sci. Sér. Sci. Math. Astronom. Phys. 1972, 20, 367–371. [Google Scholar]
  19. Chatterji, I.; Niblo, G. From wall space to CAT(0) cube complexes. Int. J. Algebra Comput. 2005, 15, 875–885. [Google Scholar] [CrossRef] [Scilit]
  20. Chepoi, V. Graphs of some CAT(0) complexes. Adv. Appl. Math. 2000, 24, 125–179. [Google Scholar] [CrossRef] [Scilit]
  21. Bridson, M.R.; Haefliger, A. Metric Spaces of Non-Positive Curvature; Grundlehren der Mathematischen Wissenschaften; Springer: Berlin/Heidelberg, Germany, 1999; Volume 319. [Google Scholar]
  22. Dress, A.; Huber, K.T.; Moulton, V. Some variations on a theme by Buneman. Ann. Comb. 1997, 1, 339–352. [Google Scholar] [CrossRef] [Scilit]
  23. Graham, R.L.; Knuth, D.E.; Patashnik, O. Concrete Mathematics. A Foundation for Computer Science, 2nd ed.; Addison-Wesley Publishing Company: Reading, MA, USA, 1994. [Google Scholar]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Article Metrics

Citations

Article Access Statistics

Multiple requests from the same IP address are counted as one view.