An intrinsic characterization of five points in a $\mathrm{CAT}(0)$ space
Tetsu Toyoda

TL;DR
This paper characterizes five-point metric spaces that can be isometrically embedded into CAT(0) spaces using inequalities derived from four-point configurations, extending previous results for fewer points.
Contribution
It introduces a new set of necessary and sufficient conditions for embedding small metric spaces into CAT(0) spaces, generalizing Gromov's inequalities and cycle conditions.
Findings
Characterization of five-point spaces via $oxtimes$-inequalities.
Equivalence of these inequalities to embeddability into CAT(0) spaces.
Extension of Gromov's four-point inequalities to five points.
Abstract
Gromov (2001) and Sturm (2003) proved that any four points in a space satisfy a certain family of inequalities. We call those inequalities the -inequalities, following the notation used by Gromov. In this paper, we prove that a metric space containing at most five points admits an isometric embedding into a space if and only if any four points in satisfy the -inequalities. To prove this, we introduce a new family of necessary conditions for a metric space to admit an isometric embedding into a space by modifying and generalizing Gromov's cycle conditions. Furthermore, we prove that if a metric space satisfies all those necessary conditions, then it admits an isometric embedding into a space. This work presents a new approach to characterizing those metric spaces that admit an isometric…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPoint processes and geometric inequalities · Geometric Analysis and Curvature Flows · Geometric and Algebraic Topology
An intrinsic characterization of
five points in a space
Tetsu Toyoda
Kogakuin University, 2665-1, Nakano, Hachioji, Tokyo, 192-0015 Japan
Abstract.
Gromov (2001) and Sturm (2003) proved that any four points in a space satisfy a certain family of inequalities. We call those inequalities the -inequalities, following the notation used by Gromov. In this paper, we prove that a metric space containing at most five points admits an isometric embedding into a space if and only if any four points in satisfy the -inequalities. To prove this, we introduce a new family of necessary conditions for a metric space to admit an isometric embedding into a space by modifying and generalizing Gromov’s cycle conditions. Furthermore, we prove that if a metric space satisfies all those necessary conditions, then it admits an isometric embedding into a space. This work presents a new approach to characterizing those metric spaces that admit an isometric embedding into a space.
Key words and phrases:
space, the -inequalities, the weighted quadruple inequalities, quadratic metric inequality, the condition
2010 Mathematics Subject Classification:
Primary 53C23; Secondary 51F99
This work is supported in part by JSPS KAKENHI Grant Number JP16K17602
1. Introduction
Under the assumption that a metric space is geodesic, many simple conditions for that are equivalent to the condition that is a space have been known. For example, Berg and Nikolaev [3] proved that a metric space is if and only if is geodesic, and any satisfy
[TABLE]
(see also Sato [16]). The inequality (1.1) was called the quadrilateral inequality in [3], and the roundness inequality by Enflo [7] in connection with the geometry of Banach spaces.
On the other hand, when we characterize those metric spaces that admit an isometric embedding into a space, we have to omit such a non-intrinsic assumption that the ambient space is geodesic. Omitting the assumption that a metric space is geodesic changes the situation drastically. To see this, we recall the following family of inequalities.
Definition 1.1**.**
We say that a metric space satisfies the -inequalities if for any and any , we have
[TABLE]
Gromov [10] and Sturm [17] introduced these inequalities independently, and proved that every space satisfies them. The name “-inequalities” is based on a notation used in [10], and was used in [12] and [18]. In [17], they were called the weighted quadruple inequalities. When , the -inequality becomes the quadrilateral inequality (1.1), and therefore a geodesic space satisfies the -inequalities if and only if it is . The following example shows that there exists even a four-point metric space that satisfies the quadrilateral inequality (1.1) but does not admit an isometric embedding into any space.
Example 1.2**.**
Let . Define by
[TABLE]
Then it is easily observed that is a metric space, and satisfies the quadrilateral inequality (1.1). However, does not satisfy the -inequality for , and therefore does not admit an isometric embedding into any space because every space satisfies the -inequalities.
To find a characterization of those metric spaces that admit an isometric embedding into a space is a longstanding open problem stated by Gromov in [10, §15] and [9, Section 1.19+] (see also [2, Section 1.4]). Every metric space containing at most three points admits an isometric embedding into a space because it admits an isometric embedding into the Euclidean plane. Gromov stated in [10, §7] that a four-point metric space admits an isometric embedding into a space if and only if it satisfies the -inequalities (see Theorem 1.7 below). In this paper, we find, for the first time, a characterization of those five-point metric spaces that admit an isometric embedding into a space. The following theorem is our main result.
Theorem 1.3**.**
A metric space that contains at most five points admits an isometric embedding into a space if and only if it satisfies the -inequalities.
Our proof of Theorem 1.3 also gives another proof of Gromov’s characterization of those four-point metric spaces that admit an isometric embedding into a space whose detailed proof was omitted in [10].
1.1. Gromov’s cycle conditions and their generalizations
To prove Theorem 1.3, we introduce new necessary conditions for a metric space to admit an isometric embedding into a space by slightly modifying and generalizing Gromov’s cycle conditions defined in [10]. First we briefly recall some definitions and facts established mainly in [10]. In this paper, graphs are always assumed to be simple and undirected.
Definition 1.4** (Gromov [10]).**
Fix an integer . Let be the -vertex cycle graph with vertex set and edge set . A metric space is said to satisfy the * condition* if for any map , there exists a map such that
[TABLE]
for any .
Gromov [10] proved that every space satisfies the condition for every integer . He also stated the following fact in [10, §7].
Theorem 1.5** (Gromov [10]).**
A metric space satisfies the condition if and only if it satisfies the -inequalities.
For a detailed proof of this theorem, see [18, §7]. Because a geodesic space satisfies the -inequalities if and only if it is , it follows from Theorem 1.5 that a geodesic space satisfies the condition if and only if it is . This implies in particular that the condition implies the conditions for all integers under the assumption that the metric space is geodesic. Recently, the present author [18] proved that this implication is true even without assuming that the metric space is geodesic.
Theorem 1.6** ([18]).**
If a metric space satisfies the condition, or equivalently, if satisfies the -inequalities, then satisfies the condition for every integer .
Moreover, it was also stated in [10, §7] that any four-point metric space embeds isometrically into a three-dimensional Riemannian space form of constant curvature at most [math] or a metric tree whenever it satisfies the condition. Thus the following theorem holds.
Theorem 1.7** (Gromov [10]).**
A four-point metric space admits an isometric embedding into a space if and only if it satisfies the condition.
Theorem 1.6 and Theorem 1.7 tell us that the condition implies many necessary conditions for a metric space to admit an isometric embedding into a space. Therefore, it seems natural to ask whether the condition (or the validity of the -inequalities) implies the isometric embeddability into a space or not. However, the answer of this question turned out to be false. Recently, Eskenazis, Mendel and Naor [8] proved that there exists a metric space that does not admit a coarse embedding into any space. On the other hand, it was proved in [12, Proposition 3.1] that for any and any metric space , the metric space satisfies the condition. Therefore, if we choose a metric space that does not admit a coarse embedding into any space and a constant , then the metric space satisfies the condition but does not admit a coarse embedding into any space because is coarsely equivalent to .
In this paper, to examine further to what extent the condition implies necessary conditions for a metric space to admit an isometric embedding into a space, we define the following new conditions.
Definition 1.8**.**
Let be a graph with vertex set and edge set . A metric space is said to satisfy the * condition* if for any map , there exist a space and a map such that
[TABLE]
for any .
Recently, Lebedeva, Petrunin and Zolotov [14] also introduced a similar condition. In the definition of their condition in [14, Section 8], a space in Definition 1.8 is replaced with a Hilbert space. It is easily observed that every space satisfies the condition for every graph . Therefore, for every graph , the condition is a necessary condition for a metric space to admit an isometric embedding into a space. In Section 4, we will prove the following proposition, which states that the conditions for all graphs form a necessary and sufficient condition for a metric space to admit an isometric embedding into a space.
Proposition 1.9**.**
Fix a positive integer . An -point metric space admits an isometric embedding into a space if and only if it satisfies the condition for every graph with vertices.
Clearly, for each integer , the condition implies the condition for the cycle graph with vertices. Therefore, it follows from Theorem 1.6 that the condition (or the validity of the -inequalities) implies the conditions for all cycle graphs . In Sections 5, 6, 8 and 9, we will prove that the condition also implies the conditions for many finite graphs including all graphs containing at most five vertices. Together with Proposition 1.9, this proves Theorem 1.3, and also gives another proof of Theorem 1.7 whose detailed proof was omitted in [10].
1.2. Quadratic metric inequalities that hold true in every space
Homogeneous linear inequalities on the squares of distances among finite points like the -inequalities were called quadratic metric inequalities by Andoni, Naor, and Neiman [2]. In this paper, by slightly modifying their notation, we use the following notation to denote a quadratic metric inequality. For any positive integer , we denote , and for any set , we denote by the set of all two-element subsets of .
Definition 1.10**.**
Fix a positive integer . Let , and let be a family of real numbers indexed by . A metric space is said to satisfy the -quadratic metric inequality if any points satisfy
[TABLE]
The following theorem was proved in [2].
Theorem 1.11** (Andoni, Naor, and Neiman [2]).**
Let be a positive integer. An -point metric space admits an isometric embedding into a space if and only if satisfies the -quadratic metric inequality for every family of real numbers indexed by such that every space satisfies the -quadratic metric inequality.
For the original statement of Theorem 1.11 in full generality, see [2, Proposition 3]. Theorem 1.11 tells us that characterizations of those metric spaces that admit an isometric embedding into a space follow from characterizations of those quadratic metric inequalities that hold true in every space. We will prove the following lemma in Section 4.
Lemma 1.12**.**
Fix a positive integer . Let , and let . Suppose is a family of real numbers indexed by such that every space satisfies the -quadratic metric inequality. Let be the set of all with , and let be the graph with vertex set and edge set . If a metric space satisfies the condition, then it satisfies the -quadratic metric inequality.
We call the graph as in the statement of Lemma 1.12 the graph associated to the -quadratic metric inequality. Proposition 1.9 follows immediately from Lemma 1.12 and Theorem 1.11. It also follows from Lemma 1.12 that if every metric space satisfies the condition for the graph associated to the -quadratic metric inequality, then the -quadratic metric inequality holds true in every metric space whenever it holds true in every space. In Section 5, we will prove that every metric space satisfies the conditions for many graphs (including all trees for example).
1.3. Some questions
We pose the following questions.
Question 1.13**.**
Find a graph such that there exists a metric space such that satisfies the condition, but does not satisfy the condition.
Question 1.14**.**
Find a quadratic metric inequality that satisfies the following two conditions
Every space satisfies . 2.
There is a metric space that satisfies the -inequalities but that does not satisfy .
Question 1.15**.**
Find a characterization of those graphs such that every metric space satisfies the condition.
1.4. Organization of the paper
The paper is organized as follows. In Section 2, we recall some definitions and results from metric geometry. In Section 3, we recall and establish some properties of metric spaces that satisfy the -inequalities. In Section 4, we prove Lemma 1.12 and Proposition 1.9. In Section 5, we prove that the validity of the -inequalities implies the condition for every graph containing at most four vertices. Combining this with Proposition 1.9, we obtain another proof of Theorem 1.7. In Section 5, we also specify several graphs such that every metric space satisfies the condition. Combining this with Lemma 1.12, we obtain a criterion for a quadratic metric inequality to hold true in every metric space whenever it holds true in every space. In Section 6, we prove that the validity of the -inequalities implies the condition for any graph with five vertices except two special graphs. In Section 7, we introduce certain concepts concerning the isometric embeddability of a four-point metric space into a Euclidean space. In Section 8 and Section 9, we prove that the validity of the -inequalities implies the conditions for the remaining two graphs with five vertices by using the concepts introduced in Section 7. Together with Proposition 1.9, this completes the proof of Theorem 1.3.
2. Preliminaries
In this section, we set up some notations, and review some definitions and results in metric geometry. Throughout this paper, for every positive integer , is always equipped with the Euclidean metric. For distinct points , we denote by the straight line through and . For with and , we denote by the interior angle measure at of the (possibly degenerate) triangle with vertices , and .
A geodesic in a metric space is an isometric embedding of an interval of the real line into . For , we call the image of a geodesic with and a geodesic segment with endpoints and . A metric space is called geodesic if for any , there exists a geodesic segment with endpoints and .
Definition 2.1**.**
A metric space is called a * space* if is geodesic, and any and any geodesic with and satisfy
[TABLE]
for any .
In , the inequality (2.1) always holds with equality. A subset of a geodesic space is called convex if any geodesic segment in with endpoints and is contained in whenever . Clearly, a convex subset of a space equipped with the induced metric is a space. A geodesic space is called uniquely geodesic if for any , a geodesic segment in with endpoints and is unique. It is easily observed that every space is uniquely geodesic. For any points and in a uniquely geodesic space, we denote the geodesic segment with endpoints and by . We also denote the sets , and by , and , respectively. For a subset of a uniquely geodesic space , the convex hull of is the intersection of all convex subsets of containing , or equivalently, the minimal convex subset of that contains . We denote the convex hull of by .
For a family of metric spaces , we equip the disjoint union
[TABLE]
with the metric defined by
[TABLE]
We usually identify each set with its image under the natural inclusion into .
Suppose is a metric space with possibly infinite metrics, and is an equivalence relation on such that every equivalence class of by is closed. Let be the set of all equivalence classes by . For , we define
[TABLE]
where the infimum is taken over all sequences in such that , , and for every . Then becomes a metric on , which is called the quotient metric on .
Suppose that and are metric spaces, and that and are closed subsets of and , respectively. Suppose further that and are isometric via an isometry . Define to be the equivalence relation on the disjoint union generated by the relations for all . Let be the set of all equivalence classes by the equivalence relation , and let be the quotient metric on . Then is the metric space called the gluing of and along the isometry . We note that the natural inclusions of and into are both isometric embeddings. Assume in addition that and are complete locally compact spaces, and that and are convex subsets of and , respectively. Then by Reshetnyak’s gluing theorem, the gluing of and along is a space. For a proof of this fact, see [15] or [5, Theorem 9.1.21]. A more general statement is in [4, Chapter II.11, Theorem 11.1]. When two geodesic segments and are isometric, we mean by “the metric space obtained by gluing and by identifying with ” the gluing of and along the isometry with and .
A large number of important examples of spaces arise as piecewise Euclidean metric simplicial complexes. For detailed expositions of piecewise Euclidean metric simplicial complexes, see [4, Chapter I.7]. For our purposes, it suffices to keep in mind the following simple example.
Example 2.2**.**
Suppose are distinct points such that
[TABLE]
Equip the subsets
[TABLE]
of with the induced metrics, and regard them as disjoint metric spaces. Suppose
[TABLE]
are the isometries such that
[TABLE]
Let be the quotient of the disjoint union by the equivalence relation generated by the relations , and for all , and , and let be the quotient metric on . Then is a metric space, and we call it the piecewise Euclidean metric simplicial complex constructed from , and by identifying with , with , and with . It follows from a general criterion [4, p.207, Lemma 5.6] that becomes a space if and only if
[TABLE]
We claim that it is easily observed that the above criterion holds true even if , or is degenerate, or equivalently, even if some of the angles in the right-hand side of (2.2) take values in . It is also easily observed that under the condition (2.2), the natural inclusions of , and into are all isometric embeddings although a simplex in a metric simplicial complex is generally not embedded isometrically into the complex.
Let be a metric space, and let be points with and . Then there exist such that
[TABLE]
We define the comparison angle measure to be . Clearly the comparison angle measure does not depend on the choice of .
Definition 2.3**.**
A geodesic space is said to have nonnegative Alexandrov curvature if, for any , there exists a neighborhood of such that any distinct four points satisfy
[TABLE]
There are many equivalent definitions of metric spaces with nonnegative Alexandrov curvature. We refer [5] and [6] for detailed expositions of metric spaces with nonnegative Alexandrov curvature. For our purpose, it suffices to keep in mind the following two examples.
Example 2.4**.**
Let be the boundary of a convex bounded subset of . Let be the induced length metric on . In other words, for any , coincides with the infimum of the lengths of all paths such that and . It is known that has nonnegative Alexandrov curvature.
Example 2.5**.**
Suppose , and are points in that are not collinear. Let and be two isometric copies of . We denote the points in corresponding to , and by , and , respectively, and the points in corresponding to , and by , and , respectively. Suppose
[TABLE]
are the isometries such that
[TABLE]
Let be the quotient of the disjoint union by the equivalence relation generated by the relations , and for all , and , and let be the quotient metric on . It is known that is a complete geodesic space with nonnegative Alexandrov curvature. Clearly the natural inclusions of and into are both isometric embeddings. We call the metric space defined above the piecewise Euclidean simplicial complex obtained by gluing and along their boundaries.
In [13], Lang and Schroeder generalized the classical Kirszbraun’s extension theorem (see also [1]). The following is a part of their result, which we will use in Section 9. For the original statement in full generality, see [13, Theorem A].
Theorem 2.6** (Lang and Schroeder [13]).**
Suppose that is a complete geodesic space with nonnegative Alexandrov curvature and is a complete space. Suppose that is a subset of and is a -Lipschitz map. Then there exists a -Lipschitz map such that for any .
Fix a positive integer . Let be the set of all two-element subsets of . Define to be the set of all such that there exist a space and points such that for every . Then is a closed convex cone in . This follows immediately from the fact that the property is closed under taking Pythagorean product, taking dilation by a positive constant, and taking ultraproduct (see [17, Lemma 3.9] and [11, Section 2.4]). For completeness, we recall Andoni, Naor, and Neiman’s proof of Theorem 1.11.
Proof of Theorem 1.11.
Fix a positive integer . The case in which is trivial, so we assume that . If an -point metric space embeds isometrically into a space, then clearly satisfies every quadratic metric inequality that holds true in every space. We prove the converse direction by contrapositive. Assume that an -point metric space does not embed isometrically into a space. Then because is a closed convex cone, and , the separation theorem implies that there exists such that
[TABLE]
The first inequality in (2.3) means that the -quadratic metric inequality holds true in every space, and the second inequality means that does not satisfy the -quadratic metric inequality, which completes the proof. ∎
3. Comparison Quadrangles in the Euclidean plane
In this section, we recall and establish some properties of metric spaces that satisfy the -inequalities. First, we recall the following fact, which was established by Sturm when he proved in [17, Theorem 4.9] that a geodesic space is whenever it satisfies the -inequalities.
Proposition 3.1**.**
Let be a metric space that satisfies the -inequalities. Suppose are points such that , and
[TABLE]
Set . Then we have
[TABLE]
for any .
For the proof of Proposition 3.1, see [18, Proposition 7.1]. The following two lemmas will be used throughout this paper.
Lemma 3.2**.**
Let be a metric space that satisfies the -inequalities. Suppose and are points such that
[TABLE]
and . Then .
For the proof of Lemma 3.2, see [18, Corollary 5.2, Lemma 7.2].
Lemma 3.3**.**
Let be a metric space that satisfies the -inequalities, and let be a metric space. Suppose and are points such that
[TABLE]
Assume that there exist subsets and of that satisfy the following conditions:
* and are isometric to convex subsets of Euclidean spaces.* 2.
* and .* 3.
There is a geodesic segment in with endpoints and such that . 4.
There exists a point such that .
Then .
For the proof of Lemma 3.3, see [18, Corollary 5.3, Lemma 7.2].
Remark 3.4**.**
Clearly we may replace the condition in the statement of Lemma 3.3 with the following condition:
There is a geodesic segment in with endpoints and such that .
We will also use the following lemma.
Lemma 3.5**.**
Let be a metric space that satisfies the -inequalities. Suppose and are points with such that
[TABLE]
and . Then .
Proof.
We consider three cases.
Case 1: . In this case, there exist and such that
[TABLE]
It follows from this equality and the hypotheses of the lemma that
[TABLE]
On the other hand,
[TABLE]
because satisfies the -inequalities. Comparing these yields
[TABLE]
Case 2: , and . In this case, or because by hypothesis. We assume without loss of generality that . Then
[TABLE]
which implies that
[TABLE]
The second equality in (3.1) implies that
[TABLE]
Hence we can write
[TABLE]
where
[TABLE]
Because by hypothesis, and . We have
[TABLE]
On the other hand, (3.1), (3.2) and Proposition 3.1 imply that
[TABLE]
Comparing these yields
[TABLE]
Case 3: * or *. In this case, we may assume without loss of generality that . Then because . Therefore,
[TABLE]
The above three cases exhaust all possibilities. ∎
Remark 3.6**.**
If we omit the condition that from the hypothesis of Lemma 3.5, then the statement becomes false. For example, suppose and are real numbers such that , and define points by
[TABLE]
Then
[TABLE]
However,
[TABLE]
4. A criterion for isometric embeddability into a space
In this section, we prove Lemma 1.12 and Proposition 1.9. We first prove Lemma 1.12.
Proof of Lemma 1.12.
Let be a metric space that satisfies the condition, and let . Then there exist a space and points such that
[TABLE]
for any . Because satisfies the -quadratic metric inequality by hypothesis, we have
[TABLE]
which proves that satisfies the -quadratic metric inequality. ∎
Proposition 1.9 follows from Lemma 1.12 and Theorem 1.11.
Proof of Proposition 1.9.
Let be an -point metric space. If admits an isometric embedding into a space, then satisfies the condition for every graph with vertices because every space satisfies the condition. Conversely, suppose that satisfies the condition for every graph with vertices. Let , and let . Fix a family of real numbers indexed by such that every space satisfies the -quadratic metric inequality. Let be the set of all such that , and let be the graph with vertex set and edge set . Then satisfies the condition, and therefore satisfies the -quadratic metric inequality by Lemma 1.12. Thus it follows from Theorem 1.11 that admits an isometric embedding into a space. ∎
5. Four points in a space
In this section, we prove that if a metric space satisfies the -inequalities, then it satisfies the condition for every graph with four vertices. Together with Proposition 1.9, this gives another proof of Theorem 1.7. We first observe that there are many graphs such that every metric space satisfies the condition. As we declared before, graphs are always assumed to be simple and undirected.
Proposition 5.1**.**
Let be a finite graph. Assume that there exists a vertex such that for any with . Then every metric space satisfies the condition.
Proof.
Let be a metric space. For each map , define a map by . Then
[TABLE]
for any , and
[TABLE]
for any . Therefore,
[TABLE]
for any . Thus satisfies the condition. ∎
Proposition 5.1 implies in particular that every metric space satisfies the condition for every complete graph .
Proposition 5.2**.**
Let and be finite graphs, and let be the graph sum of and . In other words, the vertex and edge sets of are the disjoint union of the vertex sets of and and that of the edge sets of and , respectively. Suppose is a metric space that satisfies the and conditions. Then satisfies the condition.
Proof.
Suppose , and are finite graphs such that is the disjoint union of and , and is the disjoint union of and . Suppose is a metric space that satisfies the and conditions. Fix . Then for each , there exist a space and a map such that
[TABLE]
for any . Choose vertices and . Let
[TABLE]
Define to be the metric space obtained by gluing and the closed interval in by identifying with . Then is a space by Reshetnyak’s gluing theorem. We denote by the point in represented by for each , and by the point in represented by . Define to be the metric space obtained by gluing and by identifying with . Then is a space by Reshetnyak’s gluing theorem. Define a map by sending each to the point in represented by , and each the point in represented by . Then
[TABLE]
for any and any . It follows that
[TABLE]
for any . Thus satisfies the condition. ∎
Corollary 5.3**.**
Every metric space satisfies the condition for any disconnected graph with four vertices.
Proof.
Let be a disconnected graph with four vertices. Then there exist graphs and such that is the graph sum of and , and contains at most three vertices for each . Because every metric space that contains at most three points admits an isometric embedding into , every metric space satisfies the and conditions clearly. Therefore, it follows from Proposition 5.2 that every metric space satisfies the condition. ∎
Proposition 5.4**.**
Let be a finite graph. Assume that there exist and such that , , and there are no edges with and . Suppose is a metric space such that every subset with admits an isometric embedding into a space. Then satisfies the condition.
Proof.
Fix a map . By hypothesis, both and admit isomeric embeddings into spaces. Hence for each , there exist a space and a map such that for any . Define to be the metric space obtained by gluing and by identifying with . Then is a space by Reshetnyak’s gluing theorem. Define a map by sending each to the point in represented by , and each to the point in represented by . Then
[TABLE]
for any and . It follows that
[TABLE]
for any . Thus satisfies the condition. ∎
For a finite graph and a vertex , the degree of , denoted by , is the number of edges such that .
Corollary 5.5**.**
Suppose is a graph such that , and there exists a vertex with . Then every metric space satisfies the condition.
Proof.
Let be the vertex such that . Let , and let . Then , , and there are no edges with and . Furthermore, , and every metric space containing at most three points admits an isometric embedding into . Therefore, it follows from Proposition 5.4 that every metric space satisfies the condition. ∎
Recall that there are eleven simple undirected graphs on four vertices up to graph isomorphism, which are listed in Figure 5.1. We call them , respectively as in Figure 5.1.
All graphs listed in Figure 5.1 except the cycle graph satisfy the hypothesis of Proposition 5.1, Corollary 5.3 or Corollary 5.5. Thus every metric space satisfies the conditions for all graphs with four vertices that is not isomorphic to the cycle graph. The following proposition follows from this observation and Lemma 1.12.
Proposition 5.6**.**
Let , and let . Suppose is a family of real numbers indexed by such that every space satisfies the -quadratic metric inequality. Define to be the set of all with . If the graph is not isomorphic to the cycle graph, then every metric space satisfies the -quadratic metric inequality.
Proof.
If is not isomorphic to the cycle graph , then every metric space satisfies the condition as we observed above. Therefore, it follows from Lemma 1.12 that every metric space satisfies the -quadratic metric inequality. ∎
It follows from the above observation and Proposition 1.9 that a four-point metric space admits an isometric embedding into a space if and only if it satisfies the condition. This implies in particular that not every metric space satisfies the condition because not every four-point metric space admits an isometric embedding into a space as we observed in Example 1.2. The following proposition is an immediate consequence of Theorem 1.6.
Proposition 5.7**.**
If a metric space satisfies the -inequalities, then satisfies the condition.
Proof.
If a metric space satisfies the -inequalities, then satisfies the condition by Theorem 1.6, which clearly implies that satisfies the condition. ∎
The facts that we have proved so far give another proof of Theorem 1.7.
Proof of Theorem 1.7.
Assume that a four-point metric space admits an isometric embedding into a space. Then satisfies the -inequalities because every space satisfies the -inequalities. Conversely, assume that a four-point metric space satisfies the -inequalities. Then it follows from Proposition 5.1, Corollary 5.3, Corollary 5.5 and Proposition 5.7 that satisfies the conditions for all graphs with four vertices, which implies that admits an isometric embedding into a space by Proposition 1.9. ∎
The following facts are worth noting although they are not necessary for our purposes.
Proposition 5.8**.**
Every metric space satisfies the condition for every tree .
Proof.
Let be a metric space and let be a tree. For any , define to be the metric tree obtained by assigning the length to each edge of . Then becomes a space, and the triangle inequality for ensures that the natural inclusion satisfies that
[TABLE]
for any . Thus satisfies the condition. ∎
The following corollary follows immediately from Proposition 5.8 and Lemma 1.12.
Corollary 5.9**.**
Let be a positive integer, let , and let . Suppose is a family of real numbers indexed by . Let be the set of all with . If every space satisfies the -quadratic metric inequality, and if the graph is isomorphic to a tree, then every metric space satisfies the -quadratic metric inequality.
6. Five points in a space
In this section, we prove that if a metric space satisfies the -inequalities, then satisfies the conditions for all graphs with five vertices except two special graphs. We start with the following two propositions.
Proposition 6.1**.**
If a metric space satisfies the -inequalities, then satisfies the condition for every disconnected graph with five vertices.
Proof.
Let be a metric space that satisfies the -inequalities, and let be a disconnected graph with five vertices. Then there exist graphs and such that is the graph sum of and , and the number of vertices of is at most four for each . Because every subset with admits an isometric embedding into a space by Theorem 1.7, satisfies the and conditions clearly. Thus it follows from Proposition 5.2 that satisfies the condition. ∎
Proposition 6.2**.**
Let be a metric space that satisfies the -inequalities. Suppose is a graph such that , and there exists a vertex with . Then satisfies the condition.
Proof.
Let be the vertex with , let , and let . Then , , and there are no edges with and . Because satisfies the -inequalities, every subset with admits an isometric embedding into a space by Theorem 1.7. Thus it follows from Proposition 5.4 that satisfies the condition. ∎
It follows from Proposition 6.1 and Proposition 6.2 that if a five-vertex graph has a vertex with , then a metric space satisfies the condition whenever satisfies the -inequalities. Up to graph isomorphism, there are eleven five-vertex graphs such that every vertex of satisfies , which are listed in Figure 6.1. As in Figure 6.1, we call these graphs , respectively.
Proposition 6.3**.**
If a metric space satisfies the -inequalities, then satisfies the condition.
Proof.
If a metric space satisfies the -inequalities, then satisfies the condition by Theorem 1.6, which clearly implies that satisfies the condition. ∎
Proposition 6.4**.**
Every metric space satisfies the condition.
Proof.
Let and be the vertex set and the edge set of , respectively. We set
[TABLE]
as shown in Figure 6.2. Set
[TABLE]
Then , , and there are no edges with and . Because every metric space containing at most three points admits an isometric embedding into , it follows from Proposition 5.4 that every metric space satisfies the condition. ∎
Before proving that the validity of the -inequalities implies the condition, we prove the following lemma.
Lemma 6.5**.**
Let be a metric space that satisfies the -inequalities, and let be a metric space. Suppose and are points such that
[TABLE]
Assume that there exist subsets , and of that satisfy the following conditions:
, and are isometric to convex subsets of Euclidean spaces. 2.
, and . 3.
There exists a geodesic segment in with endpoints and such that
[TABLE] 4.
There exists a geodesic segment in with endpoints and such that
[TABLE] 5.
There exist and such that
[TABLE]
Then .
Proof.
Choose such that
[TABLE]
Equip the subsets
[TABLE]
of with the induced metrics, and regard them as disjoint metric spaces. Define to be the metric space obtained by gluing and by identifying with . Then is a space by Reshetnyak’s gluing theorem. We denote the points in represented by and by , , and , respectively. Define to be the metric space obtained by gluing and by identifying with . Then is a space by Reshetnyak’s gluing theorem, which is pictured in Figure 6.3.
We denote the points in represented by and by , , , and , respectively. For each , the natural inclusion of into is clearly an isometric embedding. Let be the image of under the natural inclusion for each . It is clear from the definition of that , and . Hence Lemma 3.3 implies that
[TABLE]
because it follows from the hypothesis of the lemma and the definition of that
[TABLE]
Similarly, Lemma 3.3 also implies that
[TABLE]
Next, we will prove that
[TABLE]
To prove this, we first observe that (6.3) holds whenever one of the following equalities holds:
[TABLE]
If , then by definition of , so
[TABLE]
If , then we obtain (6.3) similarly. If , then by definition of , so it follows from (6.2) that
[TABLE]
If , then (6.3) follows from (6.1) similarly. If or , then by definition of , so
[TABLE]
Finally, if , then
[TABLE]
by definition of , so Lemma 3.3 implies (6.3) because it follows from the hypothesis of the lemma and the definition of that
[TABLE]
So henceforth we assume that any equality in (6.4) does not hold. We consider four cases.
Case 1: * and *. In this case, the subset of is isometric to a convex subset of the Euclidean plane, and it is clear from the definition of that and . Therefore, Lemma 3.3 implies the desired inequality (6.3) because it follows from the hypothesis of the lemma, the definition of and (6.1) that
[TABLE]
Case 2: * and *. In this case, the subset is isometric to a convex subset of the Euclidean plane, and it is clear from the definition of that and . Therefore, Lemma 3.3 implies the desired inequality (6.3) in the same way as in Case 1.
Case 3: . In this case, we clearly have
[TABLE]
and hence
[TABLE]
Case 4: Neither the assumption of Case 1, Case 2 nor Case 3 holds. In this case,
[TABLE]
because the assumption of Case 3 does not hold. Because neither the assumption of Case 1 nor Case 2 holds, it follows from (6.5) that
[TABLE]
It clearly follows from (6.6) that
[TABLE]
and hence
[TABLE]
which completes the proof of (6.3).
It follows from the conditions and in the statement of the lemma that there exist isometric embeddings , and such that
[TABLE]
Then is a geodesic segment with endpoints and contained in , and is a geodesic segment with endpoints and contained in . Since and are both uniquely geodesic, it follows that , and thus and agree on . Similarly, and agree on . Suppose and are the points such that and . Then
[TABLE]
Combining this with (6.3) yields . ∎
Proposition 6.6**.**
If a metric space satisfies the -inequalities, then satisfies the and conditions.
Proof.
Let be a metric space that satisfies the -inequalities. Suppose the graphs and have a common vertex set , and edge sets and , respectively. We set
[TABLE]
as shown in Figure 6.4. Fix a map , and set
[TABLE]
for any . By Theorem 1.7, if for some with , then there exist a space and a map such that for any . Hence we assume for any with .
Choose such that
[TABLE]
Equip the subsets
[TABLE]
of with the induced metrics, and regard them as disjoint metric spaces. Define to be the metric space obtained by gluing and by identifying with . Then is a space by Reshetnyak’s gluing theorem. We denote by the point in represented by for each , and by the point in represented by . Define to be the metric space obtained by gluing and by identifying with . Then is a space by Reshetnyak’s gluing theorem, and for each , the natural inclusion of into is clearly an isometric embedding. Let be the map that assigns the point in represented by to for each , and the point in represented by to . Then Lemma 3.3 implies that
[TABLE]
and Lemma 6.5 implies that
[TABLE]
It follows from (6.7), (6.8) and the definition of that any satisfy
[TABLE]
for each . Thus satisfies the and conditions. ∎
Proposition 6.7**.**
If a metric space satisfies the -inequalities, then satisfies the and conditions.
Proof.
Let be a metric space that satisfies the -inequalities. Suppose the graphs and have a common vertex set , and edge sets and , respectively. We set
[TABLE]
as shown in Figure 6.5. Fix a map , and set
[TABLE]
for any . By Theorem 1.7, if for some with , then there exist a space and a map such that for any . Hence we assume for any with .
Choose such that
[TABLE]
Equip the subsets
[TABLE]
of with the induced metrics, and regard them as disjoint metric spaces. We define to be the metric space obtained by gluing and by identifying with . Then is a space by Reshetnyak’s gluing theorem. We denote by the point in represented by for each , and by the point in represented by . Define to be the metric space obtained by gluing and by identifying with . Then is a space by Reshetnyak’s gluing theorem, and the natural inclusion of into is clearly an isometric embedding for each . Let be the map that assigns the point in represented by to each , and the point in represented by to . Then it is clear from the definition of that the geodesic segment is shared by the images of , and under the natural inclusions. Because it is also clear from the definition of that , Lemma 3.3 implies that
[TABLE]
Similarly, Lemma 3.3 also implies that
[TABLE]
It follows from (6.9), (6.10) and the definition of that any satisfy
[TABLE]
for each . Thus satisfies the and conditions. ∎
The following proposition follows immediately from Proposition 5.1.
Proposition 6.8**.**
Every metric space satisfies the , and conditions.
Proof.
For each , the graph has a vertex such that for any with . Therefore, Proposition 5.1 implies that every metric space satisfies the condition for each . ∎
By Propositions 6.1, 6.2, 6.3, 6.4, 6.6, 6.7 and 6.8, to prove that the validity of the -inequalities implies the condition for every graph with five vertices, it only remains to prove that it implies the and conditions.
7. Embeddability of four points into a Euclidean space
In this section, we introduce certain concepts concerning isometric embeddability of four-point subsets of metric spaces into the three dimensional Euclidean space, and by using those concepts, discuss several properties of metric spaces that satisfy the -inequalities. Those properties will be used to prove that the validity of the -inequalities implies the and conditions.
Definition 7.1**.**
Let be a metric space, and let be four distinct points. We say that is under-distance (resp. over-distance) with respect to if any satisfy (resp. ) whenever
[TABLE]
It is easily observed that for any four distinct points , and in any metric space , there exist satisfying (7.1). Therefore, does not become under-distance and over-distance with respect to simultaneously.
Proposition 7.2**.**
Let be a metric space, and let be four distinct points. Then one and only one of the following conditions holds true.
The subset admits an isometric embedding into . 2.
* is under-distance with respect to .* 3.
* is over-distance with respect to .*
Proof.
Define by
[TABLE]
Suppose and are the points in such that
[TABLE]
Clearly, such and exist uniquely. For each , define by
[TABLE]
Then it is easily seen that
[TABLE]
for any , and the function is non-decreasing on . To prove the proposition, it suffices to prove the following three statements:
admits an isometric embedding into if and only if
[TABLE] 2.
is under-distance with respect to if and only if
[TABLE] 3.
is over-distance with respect to if and only if
[TABLE]
Let be arbitrary points that satisfy the equalities (7.1) in Definition 7.1. Then there exists a point such that
[TABLE]
by definition of the points , and . Then
[TABLE]
because
[TABLE]
Since , these equalities imply that
[TABLE]
It follows from the second equality in (7.3) that
[TABLE]
Using (7.3), we compute that
[TABLE]
Together with (7.4), this implies that
[TABLE]
because
[TABLE]
The statements and follow immediately from the fact that the inequality (7.5) holds true for arbitrary satisfying (7.1). It also follows immediately from this fact that if admits an isometric embedding into , then (7.2) holds true. If (7.2) holds true, then there exists that satisfies
[TABLE]
because the function is continuous on , and therefore the map defined by
[TABLE]
is an isometric embedding. Thus is also true. ∎
Before discussing properties of metric spaces that satisfy the -inequalities by using the concepts introduced above, we recall the following two basic facts. Both of them hold clearly, so we omit their proofs.
Lemma 7.3**.**
Suppose are points such that
[TABLE]
Then if and only if . Moreover, if and only if .
Lemma 7.4**.**
Suppose are points such that . Then
[TABLE]
if and only if and are not on the same side of , and .
In the rest of this section, we discuss several properties of metric spaces that satisfy the -inequalities by using the concepts introduced above.
Lemma 7.5**.**
Let be a metric space that satisfies the -inequalities. Suppose are four distinct points such that is under-distance with respect to . Suppose are points such that
[TABLE]
Then
[TABLE]
and the points , , and are not collinear.
Proof.
If we had , then Lemma 3.5 would imply that
[TABLE]
contradicting the hypothesis that is under-distance with respect to . Hence we have
[TABLE]
Similarly, we also have
[TABLE]
To prove that , , and are not collinear, suppose to the contrary that there exists a straight line containing , , and . Choose an isometric embedding such that . Define maps , and by
[TABLE]
Then
[TABLE]
and is continuous on . Hence there exists such that . In the case in which , we have
[TABLE]
and in the case in which , we have
[TABLE]
This contradicts (7.6) or (7.7). Thus , , and are not collinear. ∎
The following corollary follows immediately from Lemma 7.5.
Corollary 7.6**.**
Let be a metric space that satisfies the -inequalities. Suppose are four distinct points such that is under-distance with respect to . Suppose are points such that
[TABLE]
and is not on the opposite side of from . Then
[TABLE]
or
[TABLE]
Moreover, (7.8) and (7.9) do not hold simultaneously.
Proof.
It follows from Lemma 7.5 that
[TABLE]
and , , and are not collinear, which clearly implies that (7.8) or (7.9) holds. By (7.10), we have . Together with the fact that , , and are not collinear, this implies that (7.8) and (7.9) do not hold simultaneously. ∎
Lemma 7.7**.**
Let be a metric space that satisfies the -inequalities. Suppose are four distinct points such that is over-distance with respect to . Then or .
Proof.
Define by
[TABLE]
Suppose and are the points in such that
[TABLE]
Then
[TABLE]
because is over-distance with respect to . It follows that
[TABLE]
because otherwise Lemma 3.2 would imply that . We consider four cases.
Case 1: * and .* In this case, (7.11) implies that the region determined by the quadrilateral is not convex, and therefore at least one of the interior angle measures of the quadrilateral is greater than . It follows that
[TABLE]
or
[TABLE]
Case 2: * and *. In this case, (7.11) implies that one of the following inequalities holds:
[TABLE]
If , then
[TABLE]
If , then
[TABLE]
Case 3: * and *. In this case, we can prove that or holds in exactly the same way as in Case 2.
Case 4: * and *. In this case, (7.11) implies that one of the following inequalities holds:
[TABLE]
If , then
[TABLE]
If , then
[TABLE]
The above four cases exhaust all possibilities. ∎
Lemma 7.8**.**
Let be a metric space that satisfies the -inequalities, and let be four distinct points such that is under-distance with respect to and . Suppose are points such that
[TABLE]
Suppose is a point such that
[TABLE]
and is not on the opposite side of from . Suppose is a point such that
[TABLE]
and is not on the opposite side of from . Then
[TABLE]
Proof.
Because is under-distance with respect to and ,
[TABLE]
The first inequality implies that
[TABLE]
which ensures that . Let be the perpendicular bisector of the line segment . Then is on the same side of as , is on the same side of as , and because
[TABLE]
It follows that
[TABLE]
and
[TABLE]
Because is under-distance with respect to and , (7.12) and Corollary 7.6 imply that
[TABLE]
which completes the proof. ∎
Corollary 7.9**.**
Let be a metric space that satisfies the -inequalities, and let be four distinct points such that is under-distance with respect to and . Suppose are points such that
[TABLE]
Then , and are not collinear.
Proof.
Choose a point such that
[TABLE]
and is not on the opposite side of from . Then Lemma 7.8 implies that because is under-distance with respect to and . Therefore, if , and were collinear, then , , and would be collinear, contradicting Lemma 7.5. ∎
Lemma 7.10**.**
Let be a metric space that satisfies the -inequalities. Suppose are four distinct points such that is over-distance with respect to and . Then
[TABLE]
Proof.
Choose such that
[TABLE]
Suppose is a point such that
[TABLE]
and is not on the same side of as . Suppose is a point such that
[TABLE]
and is not on the same side of as . Then because is over-distance with respect to and ,
[TABLE]
The first inequality implies that
[TABLE]
which ensures that . Let be the perpendicular bisector of the line segment . Then is on the same side of as , is on the same side of as , and because
[TABLE]
It follows that
[TABLE]
We prove that
[TABLE]
and
[TABLE]
by contradiction. If (7.14) were not true, then Lemma 7.7 would imply that
[TABLE]
because is over-distance with respect to , and therefore Lemma 7.4 and the hypothesis that is not on the same side of as would imply that
[TABLE]
contradicting (7.13). Similarly, if (7.15) were not true, then we would obtain
[TABLE]
contradicting (7.13), which completes the proof. ∎
Corollary 7.11**.**
Let be a metric space that satisfies the -inequalities. Suppose are four distinct points such that is over-distance with respect to and . Then is not over-distance with respect to .
Proof.
Suppose to the contrary that is over-distance with respect to , and . Then Lemma 7.10 implies that
[TABLE]
contradicting the fact that
[TABLE]
which proves the corollary. ∎
Lemma 7.12**.**
Let be a metric space that satisfies the -inequalities. Suppose are five distinct points such that is under-distance with respect to and , and is under-distance with respect to and . Then
[TABLE]
Proof.
Choose such that
[TABLE]
Suppose is a point such that
[TABLE]
and is not on the opposite side of from . Suppose is a point such that
[TABLE]
and is not on the opposite side of from . Then because is under-distance with respect to and , Lemma 7.8 implies that
[TABLE]
Suppose is a point such that
[TABLE]
and is not on the opposite side of from . Suppose is a point such that
[TABLE]
and is not on the opposite side of from . Then because is under-distance with respect to and , Lemma 7.8 implies that
[TABLE]
We define four vectors by
[TABLE]
Then
[TABLE]
Because is under-distance with respect to and , Corollary 7.9 implies that , and are not collinear, and therefore and are linearly independent. Because is under-distance with respect to and , Corollary 7.9 implies that , and are not collinear, and therefore and are linearly independent. Because by (7.16) and (7.17), and are linearly independent. Because by (7.18) and (7.19), and are also linearly independent. By (7.16), there exist such that , and . Because
[TABLE]
we have
[TABLE]
By (7.18), there exist such that , and
[TABLE]
Hence
[TABLE]
where denotes the zero vector in . By (7.20), we have
[TABLE]
Because and are linearly independent, it follows from (7.21) and (7.22) that
[TABLE]
Because and are linearly independent, it follows from (7.21) and (7.22) that
[TABLE]
We have
[TABLE]
by (7.21), (7.22) and (7.23), and therefore and are linearly independent, which implies in particular that
[TABLE]
We also have
[TABLE]
by (7.21), (7.22), (7.23) and (7.24), and therefore the ray from through is between that from through and that from through . Hence
[TABLE]
Because is under-distance with respect to , we have
[TABLE]
and therefore Lemma 7.3 implies that
[TABLE]
Combining (7.25), (7.26) and (7.27) yields
[TABLE]
Clearly the inequality
[TABLE]
is proved in the same way, which completes the proof. ∎
The following corollary follows from Lemma 7.10 and Lemma 7.12, which will play an important role when we prove that the validity of the -inequalities implies the condition in Section 9.
Corollary 7.13**.**
Let be a metric space that satisfies the -inequalities. Suppose are five distinct points such that is under-distance with respect to and , and is over-distance with respect to and . Assume that neither nor admits an isometric embedding into . Then is over-distance with respect to or , and is over-distance with respect to or .
Proof.
Suppose to the contrary that is neither over-distance with respect to nor , or is neither over-distance with respect to nor . We may assume without loss of generality that is neither over-distance with respect to nor . Then Proposition 7.2 implies that is under-distance with respect to and because does not admit an isometric embedding into . Combining this with the hypothesis that is under-distance with respect to and , Lemma 7.12 implies that
[TABLE]
On the other hand, because is over-distance with respect to and , Lemma 7.10 implies that
[TABLE]
contradicting (7.28). ∎
We define some notations, which will be used several times in the next two sections.
Let be a metric space, and let be four distinct points. Choose points such that
[TABLE]
Equip the subsets
[TABLE]
of with the induced metrics, and regard them as disjoint metric spaces. We denote by the piecewise Euclidean metric simplicial complex constructed from , and by identifying with , with , and with . We denote the images of , and under the natural inclusions into by , and , respectively. When there is no risk of confusion, we abbreviate these notations by , and , respectively. The map from to sending , , and to the points in represented by and , respectively is called the natural inclusion of into . Clearly, up to isometry, , , , and the natural inclusion of into are independent of the choice of the points .
Lemma 7.14**.**
Let be a metric space that satisfies the -inequalities. Suppose are four distinct points such that is over-distance with respect to , and
[TABLE]
Then is a space, and for each , the natural inclusion of a (possibly degenerate) triangular region as in (7.30) into is an isometric embedding. In particular, , and are closed convex subsets of . Moreover, the natural inclusion of into is an isometric embedding.
Proof.
Suppose are points satisfying (7.29). By transforming , and if necessary, we may assume that , , and is not on the same side of as , as shown in Figure 7.4. By (7.31),
[TABLE]
which implies that
[TABLE]
Because is over-distance with respect to ,
[TABLE]
Hence we have
[TABLE]
and therefore Lemma 7.3 implies that
[TABLE]
Combining this with (7.33) yields
[TABLE]
For each , let be the (possibly degenerate) triangular region defined by (7.30). As we mentioned in Example 2.2, (7.34) ensures that is a space, and that for each , the natural inclusion of into is an isometric embedding. In particular, the natural inclusion is an isometric embedding because for any , both and are represented by elements of for some . ∎
Remark 7.15**.**
Suppose is a metric space that satisfies the -inequalities, and are four distinct points such that is over-distance with respect to . Then Lemma 7.7 implies that
[TABLE]
or
[TABLE]
Thus renaming the points if necessary, the points , , and always satisfy the condition (7.31), and therefore becomes a space, and the natural inclusion of into becomes an isometric embedding by Lemma 7.14.
8. The condition
In this section, we prove that the validity of the -inequalities implies the condition. We start with the following three simple facts. All of them hold clearly, so we omit their proofs.
Lemma 8.1** (cf. [4, p.25, 2.16(1)]).**
Let . If , then
[TABLE]
If in addition , , and are distinct, and , then strict inequality holds in (8.1).
Lemma 8.2**.**
Let . Suppose are points such that and are not on opposite sides of , and . Then and are not on the same side of , and .
Lemma 8.3**.**
Suppose are points that are not collinear. Suppose are points such that neither nor is on the same side of as , and is not on the same side of as . Then .
We use these facts to prove the following lemma, which will play a key role to prove that the validity of the -inequalities implies the condition.
Lemma 8.4**.**
Suppose are four distinct points such that . Suppose are points such that
[TABLE]
If , then .
Proof.
Suppose are four distinct points such that , and are points satisfying (8.2). To prove the lemma by contrapositive, we assume that
[TABLE]
Then because . Choose a point such that
[TABLE]
and is not on the opposite side of from . If and are not on opposite sides of , we may choose . Otherwise, is the point obtained by reflecting orthogonally across . Clearly,
[TABLE]
Because , Lemma 8.1 implies that
[TABLE]
If were less than , and were less than , then would lie in , and therefore Lemma 8.1 would imply that
[TABLE]
contradicting (8.6). Thus or . We may assume without loss of generality that . Then Lemma 8.2 implies that
[TABLE]
because is not on the opposite side of from by definition. We consider two cases.
Case 1: , and are not collinear. Suppose is the point such that
[TABLE]
and is not on the opposite side of from , as shown in Figure 8.1.
Then the triangle with vertices , and is congruent to that with vertices , and . Hence
[TABLE]
Because and , (8.3) and Lemma 7.3 imply that
[TABLE]
Because is not on the opposite side of from by definition, (8.9) and Lemma 8.2 imply that
[TABLE]
Because , Lemma 7.4 implies that
[TABLE]
Combining this with (8.10) yields . Furthermore, and are not on opposite sides of because neither nor is on the same side of as by Lemma 8.2 and Lemma 7.4, respectively, and by the assumption of Case 1. Therefore, Lemma 8.2 implies that
[TABLE]
Because by (8.9) and (8.10), it follows that
[TABLE]
Because by definition of , this implies that
[TABLE]
by Lemma 7.3. Because , and by (8.8), it follows from (8.11) and Lemma 7.3 that
[TABLE]
As we mentioned above, neither nor is on the same side of as . Furthermore, and are not on the same side of because is not on the opposite side of from by definition of , is not on the same side of as by Lemma 7.4, and by the assumption of Case 1. Therefore, Lemma 8.3 implies that
[TABLE]
By (8.7), (8.8), (8.12) and (8.13),
[TABLE]
Hence Lemma 7.3 implies that
[TABLE]
because and . Combining this with (8.5) yields
[TABLE]
Case 2: , and are collinear. In this case, , because otherwise we would have
[TABLE]
contradicting (8.3). Because , it follows that
[TABLE]
which implies in particular that
[TABLE]
To prove that equality does not hold in the inequality in (8.15), suppose to the contrary that . Then (8.14) implies that
[TABLE]
and thus
[TABLE]
On the other hand, we have and , because otherwise we would have
[TABLE]
contradicting (8.3). Hence
[TABLE]
Combining this with (8.16) yields . Therefore,
[TABLE]
Because , these equalities imply that , contradicting the hypothesis that . Thus equality does not hold in the inequality in (8.15), which completes the proof of the lemma. ∎
We are ready to prove the following proposition.
Proposition 8.5**.**
If a metric space satisfies the -inequalities, then satisfies the condition.
Proof.
Let be a metric space that satisfies the -inequalities. Let and be the vertex set and the edge set of , respectively. We set
[TABLE]
as shown in Figure 8.2. Fix a map , and set
[TABLE]
for any . By Theorem 1.7, if for some with , then there exist a space and a map such that for any . Therefore, we assume that for any with . Choose such that
[TABLE]
Equip the subset of with the induced metric, and regard it as a metric space in its own right. We consider three cases.
Case 1: The subset of admits an isometric embedding into . Let be an isometric embedding. Define to be the metric space obtained by gluing and by identifying with . Then is a space by Reshetnyak’s gluing theorem. Define a map by sending to the point in represented by for each , and to the point in represented by . Then
[TABLE]
for any and any . It is clear from the definitions of and that
[TABLE]
for each , and is isometric to a convex subset of the Euclidean plane for each . Therefore, for each , Lemma 3.3 implies that
[TABLE]
because
[TABLE]
by (8.17) and (8.18). By (8.17), (8.18) and (8.19),
[TABLE]
for any . Thus is a map from to a space with the desired properties.
Case 2: * is under-distance with respect to *. Choose such that
[TABLE]
Suppose is a point such that
[TABLE]
and is not on the opposite side of from . Then the assumption of Case 2 implies that
[TABLE]
and Corollary 7.6 implies that or . By the symmetry of the graph , we may assume without loss of generality that
[TABLE]
Choose such that
[TABLE]
and choose such that
[TABLE]
Then because
[TABLE]
by (8.20) and (8.21), Lemma 8.4 implies that
[TABLE]
Define to be the metric space obtained by gluing and by identifying with . Then is a space by Reshetnyak’s gluing theorem. Define a map by sending to the point in represented by for each , and to the point in represented by . Then
[TABLE]
for any and any with . By (8.22),
[TABLE]
It is clear from the definitions of and that
[TABLE]
for each , and is isometric to a convex subset of the Euclidean plane for each . Therefore, for each , Lemma 3.3 implies that
[TABLE]
because
[TABLE]
by (8.23) and (8.24). By (8.23), (8.24), (8.25) and (8.26),
[TABLE]
for any . Thus is a map from to a space with the desired properties.
Case 3: * is over-distance with respect to *. In this case, Lemma 7.7 implies that
[TABLE]
or
[TABLE]
By the symmetry of the graph , we may assume without loss of generality that the former inequality holds. Let , and let
[TABLE]
be the natural inclusion. Then is a space, and is an isometric embedding by Lemma 7.14. It also follows from Lemma 7.14 that
[TABLE]
are closed convex subsets of , all of which are isometric to convex subsets of the Euclidean plane. Define to be the metric space obtained by gluing and by identifying with . Then is a space by Reshetnyak’s gluing theorem. Define a map by sending to the point in represented by for each , and to the point in represented by . Then
[TABLE]
for any and any . Let , and be the images of , and , respectively under the natural inclusion of into , and let be the image of under the natural inclusion of into . Then it is clear from the definition of that , , and are all isometric to convex subsets of the Euclidean plane, and
[TABLE]
It is also clear from the definition of that there exist such that
[TABLE]
Therefore, (8.29) and Lemma 3.3 imply that
[TABLE]
because
[TABLE]
by (8.27) and (8.28). Clearly, the point is represented by a point , and by definition of , there exists such that
[TABLE]
It follows from (8.30) and (8.32) that
[TABLE]
where is the point represented by . If , then clearly , and therefore (8.33) and Lemma 6.5 imply that
[TABLE]
because
[TABLE]
by (8.27) and (8.28). If , then we obtain (8.34) in the same way. By (8.27), (8.28), (8.31) and (8.34),
[TABLE]
for any . Thus is a map from to a space with the desired properties.
By Proposition 7.2, Case 1, Case 2 and Case 3 exhaust all possibilities. ∎
9. The condition
In this section, we prove that the validity of the -inequalities implies the condition. First we prove several lemmas.
Lemma 9.1**.**
Let be a metric space that satisfies the -inequalities, and let . Suppose there exist a complete geodesic space with nonnegative Alexandrov curvature and a map such that
[TABLE]
for any . Then there exist a space and a map such that
[TABLE]
for any .
Proof.
Because satisfies the -inequalities, Theorem 1.7 implies that there exist a space and an isometric embedding . Define a map by . Then is -Lipschitz because
[TABLE]
for any . Hence Theorem 2.6 implies that there exists a -Lipschitz map such that for every . Define a map by . Then
[TABLE]
for any , which proves the lemma. ∎
Lemma 9.2**.**
Let be a metric space that satisfies the -inequalities. Suppose are five distinct points such that both and admit isometric embeddings into . Then there exist a space and a map such that
[TABLE]
for any with .
Proof.
Let be the plane in consisting of all points with . Choose such that
[TABLE]
Then because both and admit isometric embeddings into , there exist points and in such that
[TABLE]
Let be the convex hull of in . Then , and the triangle
[TABLE]
forms the boundary of as a subset of . Define by
[TABLE]
We consider three cases.
Case 1: . Choose . Equip the subsets and of with the induced metrics, and regard them as disjoint metric spaces. Define to be the metric space obtained by gluing and by identifying with naturally. Then is a space by Reshetnyak’s gluing theorem, and the natural inclusions of and into are isometric embeddings. We denote by and the images of and , respectively under the natural inclusions into . Define a map by sending , , , and to the points in represented by and , respectively. Then
[TABLE]
for any with . By definition of , there exists a point such that
[TABLE]
Because is the boundary of as a subset of , there exists a point . Then , and therefore Lemma 8.1 implies that
[TABLE]
where is the point in represented by (or ). Combining this with (9.2) and the triangle inequality for yields
[TABLE]
If , then clearly lies on the geodesic segment in , and therefore (9.1), (9.3) and Lemma 3.3 imply that
[TABLE]
because , and and are isometric to convex subsets of Euclidean spaces. If or , then we obtain (9.4) in the same way. Thus (9.4) always holds in Case 1. By (9.1) and (9.4), is a map from to a space with the desired properties.
Case 2: * and .* In this case, . Hence the subset of is not contained in any plane, and . It follows that is a convex subset of , and therefore the boundary of in equipped with the induced length metric is a complete geodesic space with nonnegative Alexandrov curvature as we mentioned in Example 2.4. Clearly is the union of six subsets , , , , and of . On each of these six subsets, coincides with the Euclidean metric on . In particular, these six subsets are all isometric to convex subsets of the Euclidean plane even as subsets of . Define a map by . Then
[TABLE]
for any with . Fix a geodesic segment in with endpoints and . Then clearly has a nonempty intersection with the union of three line segments . If has a nonempty intersection with , then (9.5) and Lemma 3.3 imply that
[TABLE]
because is a geodesic segment even in . If has a nonempty intersection with or , then we obtain (9.6) in the same way. Thus (9.6) always holds in Case 2. By (9.5) and (9.6), the map satisfies that
[TABLE]
for any . Therefore, Lemma 9.1 implies that there exist a space and a map such that
[TABLE]
for any . Thus is a map from to a space with the desired properties.
Case 3: * and .* In this case, , which ensures in particular that , and are not collinear. Let and be two isometric copies of . We denote the points in corresponding to , , , and by , , , and , respectively, and the points in corresponding to , , , and by , , , and , respectively. Define to be the piecewise Euclidean simplicial complex constructed from the two simplices and by identifying with , with , and with . In other words, is the piecewise Euclidean simplicial complex obtained by gluing and along their boundaries. As we mentioned in Example 2.5, is a complete geodesic space with nonnegative Alexandrov curvature, and the natural inclusions of and into are both isometric embeddings. In particular, for each , the image of under the natural inclusion into is isometric to a convex subset of the Euclidean plane. Define a map by sending , , , and to the points in represented by and , respectively. Then
[TABLE]
for any with . It follows from the definition of that there exists a point such that
[TABLE]
Hence
[TABLE]
where is the point in represented by the point in (or ) corresponding to . Let be the image of the line segment (or ) under the natural inclusion into . If , then , and therefore (9.7), (9.8) and Lemma 3.3 imply that
[TABLE]
because it is clear from the definition of that is a geodesic segment in with endpoints and , and . If or , then we obtain (9.9) in the same way. Thus (9.9) always holds in Case 3. By (9.7) and (9.9),
[TABLE]
for any . Therefore, Lemma 9.1 implies that there exist a space and a map such that
[TABLE]
for any . Thus is a map from to a space with the desired properties.
Case 1, Case 2 and Case 3 exhaust all possibilities. ∎
Lemma 9.3**.**
Let be a metric space that satisfies the -inequalities. Suppose are five distinct points such that is over-distance with respect to , or , and is over-distance with respect to , or . Then there exist a space and a map such that
[TABLE]
for any with .
Proof.
By the hypothesis, we can choose with
[TABLE]
such that is over-distance with respect to , and is over-distance with respect to . Then Lemma 7.7 implies that , or , and that , or . Therefore, renaming the points if necessary, we may assume further that
[TABLE]
Let , and let . Suppose and are the natural inclusions. Then Lemma 7.14 implies that and are spaces, and and are isometric embeddings. It also follows from Lemma 7.14 that
[TABLE]
are closed convex subsets of , all of which are isometric to convex subsets of the Euclidean plane. Similarly,
[TABLE]
are convex subsets of of , all of which are isometric to convex subsets of the Euclidean plane. By (9.10), and are isometric via the isometry such that
[TABLE]
We define a metric space to be the gluing of and along . Then is a space by Reshetnyak’s gluing theorem, and the natural inclusions of and into are both isometric embeddings. In particular, the images , and of , and , respectively under the natural inclusion of into , and the images , and of , and , respectively under the natural inclusion of into are all isometric to convex subsets of the Euclidean plane. Define a map by sending each to the point in represented by , and to the point in represented by . Then clearly
[TABLE]
for any with . By definition of , there exists such that
[TABLE]
It is clear from the definitions of and that there exist , and such that
[TABLE]
It follows from (9.12), (9.13), (9.14) and the triangle inequality for that
[TABLE]
where , and are the points in represented by and , respectively. Because the geodesic segments and in are clearly the image of under the natural inclusion of into and that of under the natural inclusion of into , respectively,
[TABLE]
Let
[TABLE]
Then is a convex subset of , and therefore is isometric to convex subset of the Euclidean plane. Clearly
[TABLE]
By (9.10), we have . In other words, at least one of the following equalities holds:
[TABLE]
If , then (9.15), (9.16), (9.17) and Lemma 6.5 imply that
[TABLE]
because the subsets , and of are all isometric to convex subsets of the Euclidean plane, and
[TABLE]
by (9.11). If , or , then we obtain (9.18) in the same way. Thus (9.18) always holds. By (9.11) and (9.18), is a map from to a space with the desired properties. ∎
Lemma 9.4**.**
Let be a metric space that satisfies the -inequalities. Suppose are five distinct points such that is under-distance with respect to or , and is under-distance with respect to or . Then there exist a space and a map such that
[TABLE]
for any with .
Proof.
Choose such that
[TABLE]
Suppose is a point such that
[TABLE]
and is not on the opposite side of from . Suppose is a point such that
[TABLE]
and is not on the opposite side of from . Suppose is a point such that
[TABLE]
and is not on the opposite side of from . Such points , and are uniquely determined whenever , and are not collinear. We consider four cases.
Case 1: * is under-distance with respect to , and is under-distance with respect to .* According to Corollary 7.6, we divide Case 1 into the following four subcases.
Subcase 1a: * and .* In this subcase, , and are not collinear, because otherwise , , and would be collinear, contradicting Lemma 7.5. Let and be two isometric copies of . For each and each , we denote by the point in corresponding to . Define to be the piecewise Euclidean simplicial complex constructed from the two simplices and by identifying with , with , and with . In other words, is the piecewise Euclidean simplicial complex obtained by gluing and along their boundaries. As we mentioned in Example 2.5, is a complete geodesic space with nonnegative Alexandrov curvature, and the natural inclusions of and into are both isometric embeddings. In particular, for each , the image of under the natural inclusion into is isometric to a convex subset of the Euclidean plane. Define a map by sending , , , and to the points in represented by and , respectively. Then clearly
[TABLE]
for any with . By the assumption of Case 1,
[TABLE]
It follows from the definition of that there exists such that
[TABLE]
Hence
[TABLE]
where is the point in represented by (or ). Let be the image of under the natural inclusion of into , which clearly coincides with the image of under the natural inclusion of into . Then it is clear from the definition of that is a geodesic segment in with endpoints and , and . If , then , and therefore (9.22) and Lemma 3.3 imply that
[TABLE]
because
[TABLE]
by (9.19), (9.20) and (9.21). If or , then we obtain (9.23) in the same way. Thus (9.23) always holds in Subcase 1a. By (9.19), (9.20), (9.21) and (9.23),
[TABLE]
for any . Therefore, Lemma 9.1 implies that there exist a space and a map such that
[TABLE]
for any . Thus is a map from to a space with the desired properties.
Subcase 1b: * and .* In this subcase, we define a map by
[TABLE]
Then
[TABLE]
for any with . By the assumption of Case 1,
[TABLE]
It follows from the assumption of Subcase 1b that the line segment has a nonempty intersection with or . If has a nonempty intersection with , then Lemma 3.2 implies that
[TABLE]
because
[TABLE]
by (9.24), (9.25) and (9.26). If has a nonempty intersection with , then we obtain (9.27) in the same way. Thus (9.27) always holds in Subcase 1b. By (9.24), (9.25), (9.26) and (9.27),
[TABLE]
for any . Therefore, because is a complete geodesic space with nonnegative Alexandrov curvature, Lemma 9.1 implies that there exist a space and a map such that
[TABLE]
for any . Thus is a map from to a space with the desired properties.
Subcase 1c: * and .* In this subcase, the existence of a map from to a space with the desired properties is proved in exactly the same way as in Subcase 1b.
Subcase 1d: * and .* In this subcase, Corollary 7.6 implies that
[TABLE]
It follows that is not under-distance with respect to , because otherwise Lemma 7.8 and the assumption that is under-distance with respect to would imply that , contradicting (9.28). Hence is over-distance with respect to by Proposition 7.2. Similarly, is over-distance with respect to . Therefore, Lemma 9.3 implies that there exist a space and a map such that
[TABLE]
for any with . Thus is a map from to a space with the desired properties.
By Corollary 7.6, the above four subcases exhaust all possibilities in Case 1.
Case 2: * is under-distance with respect to and is under-distance with respect to .* According to Corollary 7.6, we divide Case 2 into the following four subcases.
Subcase 2a: * and .* In this subcase, , and are not collinear, because otherwise , , and would be collinear, contradicting Lemma 7.5. Let , , , and be as in Subcase 1a. Define a map by sending , , , and to the points in represented by and , respectively. Then a similar argument as in Subcase 1a yields
[TABLE]
for any . Therefore, because is a complete geodesic space with nonnegative Alexandrov curvature, Lemma 9.1 implies that there exist a space and a map such that
[TABLE]
for any . Thus is a map from to a space with the desired properties.
Subcase 2b: * and .* In this subcase, we define a map by
[TABLE]
Then a similar argument as in Subcase 1b implies that
[TABLE]
for any . Therefore, because is a complete geodesic space with nonnegative Alexandrov curvature, Lemma 9.1 implies that there exist a space and a map such that
[TABLE]
for any . Thus is a map from to a space with the desired properties.
Subcase 2c: * and .* In this subcase, the existence of a map from to a space with the desired properties is proved in exactly the same way as in Subcase 2b.
Subcase 2d: * and .* In this subcase, it follows from the same argument as in Subcase 1d that is over-distance with respect to , and is over-distance with respect to . Therefore, Lemma 9.3 implies that there exist a space and a map such that
[TABLE]
for any with . Thus is a map from to a space with the desired properties.
By Corollary 7.6, the above four subcases exhaust all possibilities in Case 2.
Case 3: * is under-distance with respect to , and is under-distance with respect to .* In this case, the existence of a map from to a space with the desired properties is proved in exactly the same way as in Case 2.
Case 4: * is under-distance with respect to , and is under-distance with respect to .* In this case, the existence of a map from to a space with the desired properties is proved in exactly the same way as in Case 1.
Case 1, Case 2, Case 3 and Case 4 exhaust all possibilities. ∎
Lemma 9.5**.**
Let be a metric space that satisfies the -inequalities. Suppose are five distinct points such that admits an isometric embedding into , and does not admit an isometric embedding into . Then there exist a space and a map such that
[TABLE]
for any with .
Proof.
Let be an isometric embedding, and let
[TABLE]
We consider two cases.
Case 1: * is over-distance with respect to or .* In this case, we may assume without loss of generality that is over-distance with respect to . Then Lemma 7.7 implies that or . We may assume further without loss of generality that the former inequality holds. Let , and let be the natural inclusion. Then is a space, and is an isometric embedding by Lemma 7.14. We set
[TABLE]
By Lemma 7.14, , and are closed convex subsets of , all of which are isometric to convex subsets of the Euclidean plane. It also follows from Lemma 7.14 that there exists an isometry such that
[TABLE]
Define a metric space to be the gluing of and along . Then is a space by Reshetnyak’s gluing theorem, and the natural inclusions of and into are both isometric embeddings. In particular, for each , the image of under the natural inclusion of into is isometric to a convex subset of the Euclidean plane. Define a map by sending , , , and to the points in represented by and , respectively. Then
[TABLE]
for any and any . It follows from the definition of that there exists such that
[TABLE]
It is clear from the definition of that there exists
[TABLE]
such that
[TABLE]
By (9.31), (9.32) and the triangle inequality for ,
[TABLE]
where and are the points in represented by and , respectively. Let be the image of under the natural inclusion of into . If , then lies on the geodesic segment in clearly, and therefore (9.29), (9.30), (9.33) and Lemma 3.3 imply that
[TABLE]
because . If , then we obtain (9.34) in the same way. Thus (9.34) always holds in Case 1. By (9.29), (9.30), and (9.34), is a map from to a space with the desired properties.
Case 2: * is under-distance with respect to and .* In this case, we choose such that
[TABLE]
and is not on the opposite side of from . Then Lemma 7.8, Corollary 7.9 and the assumption of Case 2 imply that , and that , and are not collinear. Set . Then there exists an isometry such that
[TABLE]
We divide Case 2 into three subcases.
Subcase 2a: , , and are not coplanar. Let be the boundary of in equipped with the induced length metric . As we mentioned in Example 2.4, is a complete geodesic space with nonnegative Alexandrov curvature. Clearly is the union of four subsets , , and of . On each of these four subsets, coincides with the Euclidean metric on . In particular, these four subsets are all isometric to convex subsets of the Euclidean plane even as subsets of . Define a map by sending each to , and to . Then
[TABLE]
for any and . By the assumption of Case 2,
[TABLE]
Fix a geodesic segment in with endpoints and . Clearly has a nonempty intersection with the line segment , or . If has a nonempty intersection with , then Lemma 3.3 implies that
[TABLE]
because is a geodesic segment even in with endpoints and , and
[TABLE]
by (9.35), (9.36) and (9.37). If has a nonempty intersection with or , then we obtain (9.38) in the same way. Thus (9.38) always holds in Subcase 2a. By (9.35), (9.36), (9.37) and (9.38), satisfies
[TABLE]
for any . Therefore, Lemma 9.1 implies that there exist a space and a map such that
[TABLE]
for any . Thus is a map from to a space with the desired properties.
Subcase 2b: , , and are coplanar, and . In this case, we define to be the piecewise Euclidean simplicial complex constructed from two simplices and by identifying with , with , and with . In other words, is the piecewise Euclidean simplicial complex obtained by gluing and along their boundaries. As we mentioned in Example 2.5, is a complete geodesic space with nonnegative Alexandrov curvature, and the natural inclusions of and into are both isometric embeddings. Define a map by sending , , , and to the points in represented by and , respectively. Then a similar argument as in Subcase 1a in the proof of Lemma 9.4 yields
[TABLE]
for any . Therefore, Lemma 9.1 implies that there exist a space and a map such that
[TABLE]
for any . Thus is a map from to a space with the desired properties.
Subcase 2c: , , and are coplanar, and . Let be the plane in through , , and . Define a map by sending each to , and to . Then
[TABLE]
for any and any . By the assumption of Case 2,
[TABLE]
Because and , has a nonempty intersection with , or . If has a nonempty intersection with , then Lemma 3.2 implies that
[TABLE]
because
[TABLE]
by (9.39), (9.40) and (9.41). If has a nonempty intersection with or , then we obtain (9.42) in the same way. Thus (9.42) always holds in Subcase 2c. By (9.39), (9.40), (9.41) and (9.42),
[TABLE]
for any . Therefore, because is a complete geodesic space with nonnegative Alexandrov curvature, Lemma 9.1 implies that there exist a space and a map such that
[TABLE]
for any . Thus is a map from to a space with the desired properties.
The above three subcases clearly exhaust all possibilities in Case 2. By Proposition 7.2, Case 1 and Case 2 exhaust all possibilities. ∎
Using the facts that we have proved so far, we now prove the following proposition.
Proposition 9.6**.**
If a metric space satisfies the -inequalities, then satisfies the condition.
Proof.
Let be a metric space that satisfies the -inequalities. Let and be the vertex set and the edge set of , respectively. We set
[TABLE]
as shown in Figure 9.1. Fix a map , and set
[TABLE]
for any . By Theorem 1.7, if for some with , then there exist a space and a map such that for any . Therefore, we assume that for any with . We define by
[TABLE]
We consider three cases.
Case 1: Both and admit isometric embeddings into . In this case, Lemma 9.2 implies that there exist a space and a map such that
[TABLE]
for any with . Define a map by
[TABLE]
for each . Then
[TABLE]
for any . Thus is a map from to a space with the desired properties.
Case 2: * admits an isometric embedding into , and does not, or vice versa.* In this case, Lemma 9.5 implies that there exist a space and a map such that
[TABLE]
for any with . Define by
[TABLE]
for each . Then
[TABLE]
for any . Thus is a map from to a space with the desired properties.
Case 3: Neither nor admits an isometric embedding into . We divide Case 3 into four subcases.
Subcase 3a: * is over-distance with respect to or , and is over-distance with respect to or .* In this case, Lemma 9.3 implies that there exist a space and a map such that
[TABLE]
for any with . Define by
[TABLE]
for each . Then
[TABLE]
for any . Thus is a map from to a space with the desired properties.
Subcase 3b: * is under-distance with respect to or , and is under-distance with respect to or .* In this case, Lemma 9.4 implies that there exist a space and a map such that
[TABLE]
for any with . Define by
[TABLE]
for each . Then
[TABLE]
for any . Thus is a map from to a space with the desired properties.
Subcase 3c: * is under-distance with respect to and , and is over-distance with respect to and .* In this case, if neither nor admits an isometric embedding into , then Corollary 7.13 implies that is over-distance with respect to or , and is over-distance with respect to or , and therefore the existence of a map from to a space with the desired properties is proved in exactly the same way as in Subcase 3a. If or embeds isometrically into , then the existence of a map from to a space with the desired properties is proved in exactly the same way as in Case 1 and Case 2.
Subcase 3d: * is over-distance with respect to and , and is under-distance with respect to and .* In this case, the existence of a map from to a space with the desired properties is proved in exactly the same way as in Subcase 3c.
By Proposition 7.2, the above four subcases exhaust all possibilities in Case 3. Case 1, Case 2 and Case 3 exhaust all possibilities. ∎
We have proved that a metric space satisfies the condition for every graph containing at most five vertices whenever satisfies the -inequalities, which implies Theorem 1.3 by Proposition 1.9.
Proof of Theorem 1.3.
It follows from Propositions 6.1, 6.2, 6.3, 6.4, 6.6, 6.7, 6.8 8.5 and 9.6 that a metric space satisfies the condition for every graph that contains at most five vertices whenever satisfies the -inequalities. Therefore, Proposition 1.9 implies that a metric space containing at most five points admits an isometric embedding into a space whenever satisfies the -inequalities. Conversely, if a metric space containing at most five points admits an isometric embedding into a space, then satisfies the -inequalities because every space satisfies the -inequalities. ∎
Acknowledgements**.**
The author would like to thank Yu Kitabeppu, Takefumi Kondo, Masato Mimura, Shin Nayatani and Hiroshi Tamaru for helpful discussions and a number of valuable comments.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] S. Alexander, V. Kapovitch, and A. Petrunin. Alexandrov meets Kirszbraun. Proceedings of the Gökova Geometry-Topology Conference 2010 . Int. Press, Somerville, MA, 2011, 88–109.
- 2[2] A. Andoni, A. Naor, and O. Neiman. Snowflake universality of Wasserstein spaces. Ann. Sci. Éc. Norm. Supér. (4) , 51(3):657–700, 2018.
- 3[3] I. D. Berg and I. G. Nikolaev. Quasilinearization and curvature of Aleksandrov spaces. Geom. Dedicata , 133:195–218, 2008.
- 4[4] M. R. Bridson and A. Haefliger. Metric spaces of non-positive curvature , volume 319 of Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences] . Springer-Verlag, Berlin, 1999.
- 5[5] D. Burago, Y. Burago, and S. Ivanov. A course in metric geometry , volume 33 of Graduate Studies in Mathematics . American Mathematical Society, Providence, RI, 2001.
- 6[6] Y. Burago, M. Gromov, and G. Perelman. A. D. Aleksandrov spaces with curvatures bounded below. Uspekhi Mat. Nauk , 47(2(284)):3–51, 222, 1992.
- 7[7] P. Enflo. On the nonexistence of uniform homeomorphisms between L p subscript 𝐿 𝑝 L_{p} -spaces. Ark. Mat. , 8:103–105, 1969.
- 8[8] A. Eskenazis, M. Mendel, and A. Naor. Nonpositive curvature is not coarsely universal. Invent. Math. , 217(3):833–886, 2019.
