Completeness of the isomorphism problem for separable C*-algebras

This paper studies the descriptive set-theoretical complexity of the isomorphism problem for separable C*-algebras. We prove that the isomorphism problem for separable (simple, AI) C*-algebras is complete in the class of orbit equivalence relations. This means that any isomorphism problem arising from a continuous action of a separable completely metrizable group can be reduced to the isomorphism of simple, separable AI C*-algebras.

in logic and computer science, perhaps with the most prominent examples of NP-complete problems.
In the continuous setting, a descriptive set-theoretic complexity theory for problems arising as Borel and analytic equivalence relations on standard Borel spaces, has been developed by Kechris, Louveau, Hjorth and others [2,38,40,41,48] over the last 30 years. The classification problems arising in this setting are of the following form: given an analytic or Borel equivalence relation E on a standard Borel space X , decide whether two points in X are E-equivalent. Of great interest here are the equivalence relations given by Borel actions of separable completely metrizable (i.e. Polish) groups on standard Borel spaces or, equivalently, continuous actions of Polish groups on Polish spaces (see [8]). Typically, isomorphism problems arising in various areas of mathematics are easily translated into this language. The relative complexity is measured in terms of Borel reducibility: an equivalence relation E on X is Borel reducible to an equivalence relation F on Y if there is a Borel map f : X → Y such that x 1 E x 2 if and only if f (x 1 ) F f (x 2 ) for every x 1 , x 2 ∈ X . The meaning of this notion is that the function f , being computable (Borel), gives a way of reducing the problem of E-equivalence of points in X to that of F-equivalence of points in Y . We say that an equivalence relation E is complete in a class of equivalence relations if it belongs to and every relation F in is Borelreducible to E. For examples of complete analytic equivalence relations see [29,56]. Two relations E and F are bi-reducible if E is Borel reducible to F and F is Borel reducible to E. For countable group actions, also a stronger notion (in the measure-theoretic context) is used: two group actions on standard Borel measure spaces X and Y are called orbit equivalent if there is a Borel isomorphism of X and Y which maps (a.e.) orbits to orbits (see [32]). We say that an equivalence relation is an orbit equivalence relation if it is bi-reducible with an equivalence relation induced by a Borel action of a Polish group. Descriptive set-theoretic complexity theory has enjoyed spectacular successes, for instance the striking results of Thomas [66,67] on the relative complexity of isomorphism problems for torsion-free abelian groups or the results of Foreman, Rudolph and Weiss [31] on the conjugacy problem in ergodic theory.
The isomorphism problem for separable C*-algebras has been studied since the work of Glimm in the 1960's and evolved into the Elliott program that classifies C*-algebras via their K -theoretic invariants. Glimm's result [35], restated in modern language, implies that the isomorphism relation for UHF algebras is smooth (see [33,Chapter 5.4]). In the 1970's the classification has been pushed forward to AF algebras via the K 0 group [17]. The Elliott invariant, which consists of the groups K 0 and K 1 together with the tracial simplex and the pairing map, was conjectured (see [19,24]) to completely classify all infinite-dimensional, separable, simple nuclear C*-algebras. The conjecture has been verified for various classes of C*-algebras, e.g certain classes of real rank zero algebras, AH algebras of slow dimension growth or separable, simple, purely infinite, nuclear algebras (modulo the universal coefficient theorem) [18,[21][22][23]49,50,64] and there have been dramatic breakthroughs in the program, including the counterexamples to the general classification conjecture constructed by Rørdam [65] and Toms [69].
The classification program of separable C*-algebras can be studied from the point of view of descriptive set-theoretic complexity theory (cf [20]). The framework here has been set up in 1996 by Kechris [47] and more recently by Farah, Toms and Törnquist [27,28].
The question is strictly connected with a long-standing conjecture (posed in the late 1990's) of Gao, Hjorth and Kechris. [40], Gao-Kechris [34]) The homeomorphism relation of compact metric spaces is a complete orbit equivalence relation.

Conjecture 1.2 (Hjorth
For some background on these problems the reader is advised to consult the lecture 1 of Farah at the ICM in Seoul [25].
In this paper we answer Question 1.1.

Theorem 1.3
The isomorphism relation of separable C*-algebras is complete in the class of orbit equivalence relations. In fact, already the isomorphism of separable simple AI C*-algebras is a complete orbit equivalence relation.
We would like to note here that very recently Zielinski [72] used the results of this paper (Theorem 1.4 below) to give a very elegant proof of Conjecture 1.2. Question 1.1 appears on a 2008 problem list of Farah [26]. Since then, it has been a focus of intense research and several workshops have been devoted to this question (at AIM, BIRS, Luminy, Singapore, and others). Question 1.1 appears on a problem list supported by the American Institute of Mathematics [1,Problem 7.2] and on the list edited by Effros, Elliott, Farah and Toms [14,Problem (3)]. Also recently, it has been stated in several forms as [28,Problem 9.3], [28,Problem 9.7] (asked by Hjorth), [16,Question 4.1], [16,Question 4.2].
A lower bound on the complexity of the isomorphism of separable simple AI algebras has been obtained by Farah, Toms and Törnquist [28], who showed that the isomorphism of separable simple AI algebras is not classifiable by countable structures (see [33,Chapter 10]). The upper bound showing that it is an orbit equivalence relation has been proved recently by Elliott, Farah, Paulsen, Rosendal, Toms, and Törnquist [16] using the technique of Gao and Kechris [34].
One has to mention here that an important point in the K -theoretic classification of separable simple nuclear C*-algebras is the functoriality of the invariants. While the theory of functorial reductions is still to be developed in the context of descriptive set theoretic complexity theory, it is worth noting that our proof of Theorem 1.3 shows features of functoriality. The details are discussed in Sect. 9.
Using the results of Thomsen [68], Farah, Toms and Törnquist [28] showed that the relation of affine homeomorphism of Choquet simplices is Borel reducible to the isomorphism relation of simple, separable, AI algebras. Theorem 1.3 will thus follow from the following.

Theorem 1.4 The relation of affine homeomorphism of Choquet simplices is complete in the class of orbit equivalence relations.
Gao and Kechris [34] and, independently, Clemens showed that the isometry relation of separable complete metric spaces is a complete orbit equivalence relation. Our proof of Theorem 1.4 reduces the relation of isometry of separable complete metric spaces to the affine homeomorphism of Choquet simplices.
The proof of Theorem 1.4 will be geometric. It will be based on two main new ideas connecting metrics on separable metric spaces with the affine geometry of Choquet simplices. In the first part of the proof we construct Choquet simplices using specific families of Lipschitz functions defined on a separable metric space. Here, we additionally incorporate an idea coming from the Katětov construction of the universal Urysohn space and use it in the analysis of the extreme boundary in our construction. In the second part, we introduce the blow-up construction that rigidifies the structure of a simplex with respect to a specific metric defined on its extreme points. This is later used to encode a metric into the affine structure of a simplex. The final construction is a fusion of these two methods.
It is worth noting here that Haydon [39] (see also [10,Theorem 29.9] and [13, Page 143]) showed that any Polish space is homeomorphic to the extreme bondary of a simplex. One should note, however, that this construction is not unique and, indeed, there are simplices with homeomorphic extreme boundaries which are not affinely homeomorphic (see [3, Page 119]). The general problem of determining a simplex from the structure of its extreme boundary is called the Dirichlet extension problem and is solved in [4]. In this paper, we take a different approach and, given a separable metric space, we construct a simplex whose extreme boundary only contains the metric space as a subspace. The advantage over Haydon's construction is that this construction is invariant under the isometry. Our simplices, which we call S-extensions of metric spaces, seem to be different from most of the typical constructions of simplices appearing in the literature. This paper is organized as follows. In Sect. 2 we recall some basic facts from convex analysis and Choquet's theory. In Sect. 3 we recall and slightly strengthen the results of Clemens, Gao and Kechris on the isometry of separable metric spaces. Section 4 contains some elementary back-and-forth constructions for building affine homeomorphism. The S-extension construction appears in Sect. 5. Sections 6 and 7 form a preparation for a coding construction of metrics. The main construction appears in Sect. 8. Section 9 contains some concluding remarks and questions.

Convex analysis and Choquet's theory
For basic concepts of convex analysis and Choquet's theory we refer the reader to [44,Chapter 15] and to [5,6,10,62]. In this paper we use the terms simplex and Choquet simplex interchangeably and all convex compact sets that we consider are metrizable.
We consider the Hilbert cube [0, 1] N as a compact convex subset of a locally convex topological vector space (e.g. ∞ with the weak* topology) and with the standard metric on [0, 1] N given by d [0,1] Given a set A in a locally convex vector topological space, we write conv(A) for the closed convex hull of A. For a compact convex set C, we write ext(C) for the set of extreme points of C. Given two convex compact sets C and D, we write C D to denote that C and D are affinely homeomorphic. We write n for the n-dimensional simplex. The Poulsen simplex [63] is the unique (see [54]) metrizable Choquet simplex with dense extreme boundary.
Whenever we consider a metric on a topological space, we assume it is compatible with the topology. Although convex compact sets are typically considered only with the affine and topological structure, we will sometimes use metrics on convex compact sets in locally convex vector topological spaces. We will always assume that if C is a compact convex set with a metric d C on it, then there is a bigger convex compact set D with C − C ⊆ D and a norm || · || on D such that d C (x, y) = ||x − y|| for every x, y ∈ C. For convex compact subsets of the Hilbert cube, we can use the metric d [0,1] N and for subsets of R the standard distance on R. Note that the open balls in such metrics are convex. Given an inverse system (S n , π n ) of simplices (with π n : S n+1 → S n an affine continuous surjection) and x ∈ lim ← − S n , we write x S i (or even x i if it does not cause confusion) for the image of x under the canonical projection map from lim ← − S n to S i . Sometimes, we use the notation x S i for x ∈ S j with j > i. It is worth noting here that, in general, it is not true that any continuous affine surjection is open and the exact characterization of when this happens has been given by Vesterstrøm [71]. The inverse limit of a system of simplices is again a simplex [43] and Lazar and Lindenstrauss [52] proved that any (metrizable) simplex is an inverse limit of a sequence of finite-dimensional simplices. Recently, López-Abad and Todorčević [55] showed that a generic inverse limit of simplices is affinely homeomorphic to the Poulsen simplex. For more on the Poulsen simplex we refer the reader to [44,Chapter 15] and [6,Chapter 3 Section 7].
The analysis on convex compact sets is dual to the theory of order unit Banach spaces via the spaces of affine functions (see [6,Chapter 2] and [15]).
The standard Borel structure on the space of simplices was introduced in [28] and is based on the parametrization of simplices proved by Lazar and Lindenstrauss [52] and the duality to the order unit spaces. Alternately, one can also use the induced Borel structure from the space of compact subsets of the Hilbert cube (see [28,Section 4.1.4]) or of the Poulsen simplex. Note that for a convex compact set C, the space of compact convex subsets of C is closed in K (C). The space of simplices contained in C is not closed but it is Borel in K (C) [28,Lemma 4.7].
We will need the following simple observation about affine continuous functions on convex compact sets. It is proved by an obvious averaging argument. Proposition 2.1 Let C, D be convex compact sets in locally convex vector topological spaces and let d C be a metric on C. If f, g : D → C are two affine continuous functions such that d C ( f (e), g(e)) ≤ ε for some ε > 0 and every e ∈ ext(D), then || f − g|| ∞ ≤ ε.

Isometry of perfect Polish spaces of bounded diameter
Recall that the Urysohn space U [70] is the universal ultrahomogeneous separable metric space, and for every r > 0 the bounded Urysohn space U 1 is its counterpart of diameter 1. Both these spaces are constructed in the same way and have finite isometry extension properties. Also, in the literature, U 1 is referred to as the Urysohn sphere and, as noted by Melleray, it is isometric to the sphere of diameter 1 (around any point) in the Urysohn space. For more on the Urysohn space and sphere, see [61,Chapter 5] or [53,59,60].
The standard Borel space of separable complete metric spaces is identified with the space of closed subsets of the Urysohn space U with its Effros Borel structure. Gao and Kechris [34], and independently Clemens [11,12], proved that the isometry relation on the space of separable complete metric spaces is complete in the class of orbit equivalence relations.
Similarly, we consider the standard Borel space of separable complete metric spaces of diameter bounded by 1 as the space of closed subsets of the Urysohn sphere U 1 .
For a Polish space X , write F p (X ) for the space of perfect (nonempty) subsets of X . Note that if X is compact, then F p (X ) is G δ in K (X ), which implies that for every Polish space X the set F p (X ) is Borel in F(X ). Given this, the standard Borel space of perfect separable metric spaces of diameter bounded by 1 is identified with F p (U 1 ).
The following result is essentially due to Gao, Kechris and Clemens, and can be proved by an easy modification of either the proof of Gao and Kechris [34] or of the proof of Clemens [11]. Below we present a nice and short proof suggested by the Referee. Proof Embed the Banach space C(2 N ), of continuous functions on the Cantor set, isometrically (as a metric space) into the Urysohn space U. This embedding induces a Borel map from the space of closed subspaces of C(2 N ) to F p (U) (as every Banach space is perfect). The map is simply taking separable Banach spaces and viewing them as metric spaces. By the work of Melleray [58], the relation of linear isometry between separable Banach spaces is complete in the class of orbit equivalence relations. As every surjective isometry between Banach spaces is affine, the map is a reduction from linear isometry of separable Banach spaces to the isometry of perfect metric spaces. So the latter is also complete in the class of orbit equivalence relations.
Finally, consider the map (X, d X ) → (X, d X 1+d X ) and note that it is a reduction from the isometry relation of perfect metric spaces to the isometry relation of perfect metric spaces of diameter less than 1.
Gao and Kechris [34,Section 2D] show also that the isometry relation of subspaces of U is bireducible with the equivalence relation induced by the action of Iso(U) on F(U). They deduce it from the fact that for every separable complete metric space X there is an isometric copy Z (X ) of X in U such that F(U) X → Z (X ) ∈ F(U) is Borel and for every X, Y ∈ F(U) if X and Y are isometric, then there is an isometry ϕ ∈ Iso(U) such that ϕ Z (X ) = Z (Y ). This follows from the fact (see Gromov [36,Page 79] and [34,Lemma 2.2]) that for every separable metric space there is a metric extension X * of X (obtained via the Katětov construction) that is canonically isometric to the Urysohn space U and such that any isometry ϕ : X → Y extends to an isometry ϕ * : X * → Y * . For more details on this construction see [33,Page 325]. Exactly the same arguments apply to metric spaces of diameter bounded by 1 and the Urysohn sphere U 1 , which gives the following.

Proposition 3.2
There is a Borel map Z : F p (U 1 ) → F p (U 1 ) such that for every X ∈ F p (U 1 ) there exists an isometry θ X : X → Z (X ) and if X, Y ∈ F p (U 1 ) are isometric via an isometry ϕ : X → Y , then there is an isometryφ ∈ Iso(U 1 ) withφ Z (X ) = Z (Y ) such thatφ extends θ Y ϕ(θ X ) −1 .

Approximate intertwinings
Say that an inverse system (S n , π n : n ∈ N) of simplices is increasing if S n ⊆ S n+1 is a face of S n+1 for each n ∈ N and π n (s) = s for each s ∈ S n . Note that if (S n : n ∈ N) is an increasing system of simplices, then also S i ⊆ lim ← − S n is a face of lim ← − S n , for each i ∈ N. An approximate intertwining between two increasing inverse systems of simplices (S i : i ∈ N) and (T i : i ∈ N) is a sequence of affine continuous injective maps ϕ i : S n i → T m i and ψ i : T m i → S n i+1 (for some increasing sequences n i and m i of natural numbers) such that ϕ n ⊆ ψ n −1 , ψ n ⊆ ϕ n+1 −1 (recall that the systems are increasing) and for each ε > 0 there exists i such that for each j > i and for each x ∈ S n j and y ∈ T m j we have Proof This is a back-and-forth argument. Write S = lim ← − S i and T = lim ← − T i . Let (ϕ n : n ∈ N) and (ψ n : n ∈ N) form an approximate intertwining and for simplicity assume that n i = m i = i. For x ∈ S and n < k look at the point ϕ k (x S k ) T n which is obtained by first projecting x to S k , then applying ϕ k and finally projecting to T n . Note that for each x ∈ S and for each n ∈ N the sequence of points (ϕ k (x S k ) T n : k ∈ N) in T n is Cauchy, by the property of approximate intertwining. For x ∈ S write x n = lim k ϕ k (x S k ) T n for the limit of this sequence. Note that for each n ∈ N the point x n belongs to T n and given n < m ∈ N we have Thus, for each x ∈ S there exists a point y ∈ T whose projection to T n is x n , for every n. Write ϕ(x) = y. Note that the map ϕ is affine since the composition of ϕ with the projection to T n is affine (as the limit of affine maps) for each n ∈ N. Note also that for each n ∈ N the restriction of ϕ to S n is equal to ϕ n since if x ∈ S n , then Proof Fix ε > 0. We need δ > 0 such that if x 1 , x 2 ∈ S are such that d S (x 1 , x 2 ) < δ, then d T (ϕ(x 1 ), ϕ(x 2 )) < ε. Fix n ∈ N big enough so that T n is ε/3-dense in T and ϕ(x) is ε/3-close to ϕ n (x S n ). Let δ > 0 be such that if d S n (x 1 , x 2 ) < δ, then d T n (ϕ n (x 1 ), ϕ n (x 2 )) < ε/3. Then, clearly, δ is as needed.
Analogously define the map ψ : T → S and argue that it is affine and continuous. Now, the facts that n S n is dense in S and n T n is dense in T , ϕ extends ϕ n and ψ extends ψ n for each n ∈ N, imply that ϕ −1 = ψ, as ϕ n ⊆ ψ n −1 and ψ n ⊆ ϕ n+1 −1 .

S-extensions of metric spaces
In this section we define the S-extensions of metric spaces. The definitions below stem from a simple observation that any finite metric space (X, d X ) is isometric to the extreme boundary of a convex compact subset of n Given a sequence C n of compact convex subsets of a compact convex set C in a locally convex topological vector space, say that C n is convergent if it convergent in K (C) (i.e. in the Hausdorff metric) and write lim n C n for the limit. Note that any increasing sequence of compact convex sets is convergent and then lim n C n is equal to the closure of its union.
Given a metric space (X, d X ), together with its (enumerated) countable dense set D ⊆ X and a countable (enumerated) family F ⊆ C(X, [0, 1]) of continuous functions with values in the unit interval, we will form a convex compact set S(X, d X , D, F). Let D = (d n : n ∈ N) and F = ( f n : n ∈ N). Consider the vectors a n = ( We will always consider S(X, d X , D, F) with the metric d [0,1] N induced from the Hilbert cube. Note that since all S n (X, d X , D, F)'s are convex, so is S(X, d X , D, F). In general, this is all we know about this set. We will show, however, that if the functions F are carefully chosen, then S(X, d X , D, F) is a simplex and its set of extreme points contains a dense homeomorphic copy of X .
For each n write S n n (X, d X , D, F) for the projection of S n (X, d X , D, F) into the first n-many coordinates. Treating [0, 1] n as a subset of the Hilbert cube (by padding sequences with zeros) note that the Hilbert cube is the limit of the sets [0, 1] n . In the same way, S n n (X, d X , D, F) is treated as a subset of the Hilbert cube (also by padding sequences with zeros) and, under this identification, S(X, d X , D, F) is the limit of the sets S n n (X, d X , D, F). We first show that the definition of S(X, d X , D, F) does not depend on the choice of the dense set D, in particular it does not depend on the enumeration of D. From the point of view of further applications, we would need the fact that if D and E are two countable dense sets in X , then S(X, d X , D, F) and S(X, d X , E, F) are affinely homeomorphic. However, they are actually the same set.

Lemma 5.2
If F is a countable family of Lipschitz 1 functions and D, E are two countable dense subsets of X , then S(X, d X , D, F) and S(X, d X , E, F) are equal.
Proof This is straightforward. Using the fact that both D and E are dense in X , conclude that the Hausdorff distance of S(X, d X , D, F) and S(X, d X , E, F) is arbitrarily small. Since S(X, d X , D, F) and S(X, d X , E, F) are compact, they must be then equal.
In the sequel, we write S(X, d X , F) rather than S(X, d X , D, F). Another way of stating the previous lemma is then to say that In principle, this can be taken as the definition of S(X, d X , F) but in further arguments we will use the approximation of S(X, d X , F) by S n (X, d X , D, F).

Definition 5.3 We say that a countable family
Note that if D is a dense subset of X , then the family of distance functions to the points from D is always saturated. Similarly, if X is embedded into the Urysohn space and D is a fixed dense subset of the Urysohn space, then the family of distance functions (defined on X ) to the points in D is also saturated. In the main part of the proof we will use saturated families of this form, however, some facts below will be stated for arbitrary saturated families, in sake of generality.
Note that D can be seen as a subset of S(X, d X , Note also that since all distance functions to the points of D are in the uniform closure of F, the above map is an embedding. Denote this map by i D F .

Lemma 5.4 If F is saturated, then there is a canonical homeomorphic embed-
for every x ∈ X by Lemma 5.2. It is clear that, when viewed as a map to S(X, d X , D, F), i F extends i D F . The fact that i F is an embedding of X into S(X, d X , D, F) follows from the fact that all distance functions to the points in D are in the uniform closure of F.
Again, since the distance functions from all points in X are in the uniform closure of F we have d(x n , y) → d(x, y) for every y ∈ X and hence x n → x, which shows that i F is a homeomorphism.
Finally, the fact that i F is Lipschitz 1 follows immediately from the fact that all functions in F are Lipschitz 1.
In the sequel we will abuse notation and treat X as a subset of S(X, d X , F), unless this can cause confusion. Now, we need to locate the extreme points of the sets S(X, d X , F). Notice that if F 1 ⊆ F 2 are two families of Lipschitz 1 functions, then there is a natural affine continuous projection from S(X, d X , Note also that if K and L are convex compact sets and ϕ : K → L is an affine continuous surjection, then ext(L) ⊆ ϕ ext(K ). This implies that the larger the family F we take, the more extreme points we get in S(X, d X , F).

Lemma 5.5 If F is saturated, then the points of X are extreme points in S(X, d X , F).
Given a compact convex set C in a locally convex vector topological space, with a metric d C on C, and a subset A ⊆ C we say that A is an ε-face provided that for every x, y ∈ C if 1 2 (x + y) ∈ A, then both d C (x, A) and d C (y, A) are smaller than ε. Note that if A ⊆ C is written as A = n A n so that each A n is closed convex and for each ε > 0 there is n 0 such that A n is an ε-face for each n > n 0 , then A is a face.
Proof of Lemma 5. 5 We will again look at S(X, d X , D, F) for a fixed countable dense set D ⊆ X . By Proposition 5.2, it is enough to show that the points of D are extreme in S(X, d X , D, F). Moreover, it is enough to show that given the enumeration of D as (d 1

Claim 5.6 For any
Proof This follows directly from the fact that i F is Lipschitz 1 and from local convexity of the Hilbert cube.
Write A n for the closed convex hull of the ball in X around d 1 of diameter 1/n. Claim 5.6 implies that n A n contains only one point, and thus is the singleton {d 1 }. We will show that for each ε > 0 there is n 0 such that A n is an ε-face for every n > n 0 .
Fix ε > 0 and find a function f ∈ F which is ε/8-uniformly close to the distance function z → d(z, d 1 ). Without loss of generality assume that f = f 1 .
Suppose now that n > 8/ε and y, z ∈ S(X, d X , F) are such that 1 2 (y + z) ∈ A n . Approximate y with y and z with z such that d S(X,d X ,F) (y, y ) < ε/8, d S(X,d X ,F) (z, z ) < ε/8 and y , z ∈ S k (X, d X , D, F) for some k ∈ N. Note that then 1 2 (y + z ) is ε/8-close to A n . Since the first coordinate of every point in A n is smaller than 1/n + ε/8, the first coordinate of 1 2 (y + z ) is smaller than 1/n + ε/4. Hence, the first coordinates of both y and z are smaller than 2(1/n + ε/4), which is smaller than 3ε/4. Recall that we have Suppose that Recall that the point With this in mind, by (2) for each j we have This, and an analogous argument for z in place of y , shows that Lemma 5.7 Suppose C n is an increasing sequence of compact convex subsets of a metrizable convex compact set C in a locally convex topological vector space. Then ext(lim n C n ) is contained in the closure of n ext(C n ).
Proof Write K for the closure of n ext(C n ) and suppose x ∈ lim n C n is such that x / ∈ K . We need to show that x is not an extreme point of lim n C n . Note that [44,Chapter 15,Proposition 2.3] x is a barycenter of a probability measure μ concentrated on K . By a theorem of Bauer [7] (see also [62,Proposition 1.4]) if x is an extreme point and a barycenter of a probability measure μ, then μ = δ x . But μ is concentrated on K , so cannot be equal to δ x . This immediately gives the following.

Corollary 5.8 If F is saturated, then X is dense in the set of extreme points of S(X, d X , F).
Let us now see some examples of convex compact sets that can arise as S(X, d X , F). The next proposition will not be used later in the proof but it shows some ideas behind the constructions that follow.
In the following proposition, for a compact metric space X , write P(X ) for the Bauer simplex of all Borel probability measures on X . The extreme boundary of P(X ) is canonically homeomorphic to X and any simplex whose extreme boundary is homeomorphic to X is canonically affinely homeomorphic to P(X ) (this follows for example from the positive solution to the Dirichlet extension problem for Bauer simplices [4]).
As a comment to the assumption of the following proposition, note that if (X, d X ) is compact, then Lipschitz functions are dense in C(X ), by the Stone-Weierstrass theorem. Thus, if (X, d X ) is compact, then the set of all Lipschitz 1 functions is linearly dense in C(X ).

Proposition 5.9 Suppose (X, d X ) is compact, F is saturated and linearly dense in C(X ). Then S(X, d X , F) is affinely homeomorphic to the Bauer simplex P(X ).
Proof Note that the set of extreme points of S(X, d X , F) is equal to X by Lemma 5.5 and Corollary 5.8. We need to prove that S(X, d X , F) is a simplex. For that, suppose μ, ν are two distinct probability measures on X . By linear density of F in C(X ), there is f ∈ F such that f dμ = f dν. Without loss of generality, assume that f = f 1 . Pick a countable dense set D ⊆ X and choose two sequences of atomic measures μ n and ν n concentrated on D such that μ n → μ and ν n → ν. Note that each μ n and ν n has a barycenter in one of the sets S k (X, d X , D, F), for if are the first coordinates in [0, 1] N of the barycenters of μ n and ν n . Thus, the first coordinate of the barycenter of μ is the limit of the first coordinates of the barycenters of μ n [44, Chapter 15, Proposition 2.2] and is equal to and the first coordinate of the barycenter of ν is the limit of the first coordinates of the barycenters of ν n and is equal to Thus, μ and ν have different barycenters, which shows that S(X, d X , F) is a simplex.
Now we need to see how S(X, d X , F) depends on the choice of F. First note that it does not depend on the enumeration of F. Lemma 5.10 Suppose F and G enumerates the same set of functions as F. Then S(X, d X , F) and S(X, d X , G) are affinely homeomorphic. (2) , . . .) and note that h is an affine homeomorphism of the Hilbert cube which maps Suppose now that (X, d X ) is a metric space, D ⊆ X is a countable dense set and that F consists of distance functions from the points in D. In such a case, we denote F by d X D. Note that d X D always consists of Lipschitz 1 functions and its uniform closure contains all distance functions to the points in X .

Proposition 5.11
Suppose (X, d X ) is separable, complete and D, E ⊆ X are two countable dense sets. Then there is an affine homeomorphism τ E D : S(X, d X , d X D) → S(X, d X , d X E) such that the following diagram commutes.
The map τ E D should be treated as the transition map between the coordinate systems of D and E.
Proof First note that isolated points of X must belong to both D and E and hence if X 1 is the set of isolated points, then by Lemma 5.10 we can assume that X 1 is enumerated in the same way in D and E. Thus, without loss of generality we can assume that X has no isolated points. Moreover, we can assume that D and E are disjoint since we can always use a third countable dense set which is disjoint from both D and E.
Proof Write C n = S n (X, d X , D, d X D) and B n = S n (X, d X , D, d X D ) for each n ∈ N. Write also [0, 1] N as [0, 1] {2,3,...} × [0, 1] interpreting the second coordinate of the product as the first coordinate in the Hilbert cube. Pick a subsequence d k n → d 0 in D and note that the distance function to d 0 is the uniform limit of the distance functions to d k n 's. By Proposition 2.1, this implies that on n C n the first coordinate is the uniform limit of the coordinates numbered with k n 's. Thus, n C n treated as a subset of [0, 1] {2,3,...} × [0, 1], is a graph of an affine function, say a, defined on n B n . Note that since a is the uniform limit of the sequence of functions given by coordinates in {k 1 , k 2 , . . .}, it follows that this sequence of functions is uniformly Cauchy on n B n . This sequence is also uniformly Cauchy on the closure of n B n , and hence uniformly convergent. Thus, the function a uniquely extends to an affine function defined on n B n = S(X, d X , d X D ). Note that the graph of this unique extension is equal to the closure of n C n , i.e. S(X, d X , d X D). Given that, the projection function from  (e 1 , e 2 , . . . , e n , d n+1 , d n+1 , . . .).

Claim 5.13
For each n ∈ N, there is an affine homeomorphism τ n : Proof It is enough to show that there is an affine homeomorphism τ n : S(X, d X , d X D n ) → S(X, d X , d X D n+1 ) with τ n • i D n = i D n+1 and without loss of generality assume that n = 0. But this follows from Claim 5.12 since both S(X, d X , d X D) and S(X, d X , d X D 1 ) are affinely homeomorphic to S(X, d X , d X D ) via maps which make the appropriate diagrams commute. Now note that since τ n+1 τ −1 n changes only the nth coordinate, the sequence τ n is uniformly Cauchy with respect to the Hilbert cube metric, and thus converges to an affine map τ E D : S(X, d X , d X D) → [0, 1] N . Moreover, since the distance of rngτ n to S n (X, d X , D, d X E) is smaller than 2 −n , we have that τ E D is an affine map from S(X, d X , d X D) to S(X, d X , d X E). In the same way construct maps τ n : d 2 , . . . , d n , e n+1 , e n+2 , . . .) and note that their limit is an affine function . The maps are clearly inverse to each other, so τ E D is an affine homeomorphism. Finally, τ E D • i d X D = i d X E follows from the fact that τ n • i d X D = i d X D n holds for each n and i d X D n → i d X E . This ends the proof.
The following definition and proposition will not be used in the proof but we state it here since they may be useful in answering some questions posed in Sect. 9. Note that if we want the set S(X, d X , F) to be a simplex, a natural condition for the family F is the following. Definition 5.14 A countable family F of Lipschitz 1 functions is called independent if for every x 1 , . . . , x n ∈ X there are f 1 , . . . , f n ∈ F such that the vectors ( f 1 (x 1 ), . . . , f n (x 1 )), . . . , ( f 1 (x n ), . . . , f n (x n )) ∈ R n are linearly independent.
The following proposition is stated for the Urysohn sphere U 1 but it also holds true (with the same proof) for the Urysohn space U. We say that a function f : and note that it is a nonzero linear function, so there are arbitrarily small ε > 0 at which it does not vanish. Pick such ε 0 > 0 which is smaller than min{d( Since the set of such y's is clearly open, we can find one, say d n , in D. Now we come to the question how to make sure that our convex compact sets are simplices. The Urysohn space has the extension property saying that every Katětov function defined on its finite subset is realized as a distance function to some point in the space. Huhunaišvili [42] (cf also [9,36,45,59,60]) showed that the same is true for Katětov functions defined on compact subsets of the Urysohn space. This is probably the strongest result that can guarantee that certain Katětov functions can be realized in the Urysohn space (or the Urysohn sphere). The following construction is motivated by the need of realizing Katětov functions defined on non-compact subspaces of the Urysohn sphere.
Let (X, d X ) be a separable metric space of diameter bounded by 1 and let D ⊆ X be its dense countable subset. Let R(D) be the ring of functions generated by the distance functions  E(X, d X , D) is an extension of X (as F(X ) contains all functions y → d X (x, y) for x ∈ X ), is separable and realizes all finitely supported Katětov functions on X . However, it is slightly bigger than the usual one-step Katětov extension since we also have realized the functions in R 1 (D). A standard argument shows that if ϕ : X → X is an isometry, then ϕ extends to an isometry ϕ of E(X, d X , D) and the definition of E(X, d X , D) does not depend on the choice of the dense set D. Thus, slightly abusing notation, we write E(X, d X ) for E(X, d X , D). Note, however, that given D, we have a canonical countable dense set D E in E(X, d X , D) consisting of R 1 (D) and all Katětov functions finitely supported on a subset of D and assuming rational values on their support. Now, similarly as in the Katětov construction of the Urysohn space, we iterate the above extension construction infinitely many times.

Definition 5.16 Given a separable metric space (X, d X ) and its countable dense subset
Given E n (X, d X , D) and D n (X, d X , D), which is a countable dense subset of E n (X, d X , D) let E n+1 (X, d X , D) = E(E n (X, d X , D), D n (X, d X , D)) and let D n+1 (X, d X , D) be D n (X, d X , D) E (cf the remarks proceeding this definition). Write E ∞ (X, d X , D) for the completion of the space E n (X, d X , D) and D ∞ (X, d X , D) for n D n (X, d X , D).
Again, the construction of E ∞ (X, d X , D) does not depend on the initial choice of the countable dense set D and we will abuse notation writing E ∞ (X, d X ) for E ∞ (X, d X , D), unless this can cause confusion. Note that the space E ∞ (X, d X ) is actually isometric to the Urysohn sphere since it realizes all finitely supported Katětov functions with values in [0, 1]. Note also that if ϕ : X → X is an isometry, then ϕ extends canonically to an isometry . This follows in the same way as the analogous extension property is proved for the Katětov extensions [61, Page 115] from the (above mentioned) fact that ϕ extends to E(X, d X ).
Given a metric space (X, d X ) and its countable dense subset D, write (X, d X , D). Write also R ∞ (X, d X , D) for the ring of functions on X generated by d E ∞ (X,d X ) D ∞ (X, d X ). The next proposition follows rather immediately from the construction.

Proposition 5.17 Let (X, d X ) be a separable metric space of diameter bounded by 1 and let D ⊆ X be a countable dense set. Then R ∞ (X, d X , D) is contained in the linear span of d E
is a polynomial in finitely many functions in d D ∞ , which in turn are the distance functions to finitely many points in D ∞ . Thus, there is n ∈ N such that f belongs to the ring generated by the distance functions to D n (X, d X , D). Then, f belongs to the linear span of distance functions to the points in D n+1 (X, d X , D).
Note also that by the remarks following Definition 5.3 and the fact that E ∞ (U 1 , d U 1 ) is isometric to the Urysohn sphere, the family d E D ∞ is saturated.
Recall (Proposition 3.2) that given a subspace (X, d X ) of U 1 we write Z (X, d X ) for an isometric copy of (X, d X ) appropriately embedded into U 1 .

Definition 5.18 For a subspace (X, d X ) of the Urysohn sphere
Note that by Proposition 5.11 and the remarks proceeding Proposition 5.17, up to affine homeomorphism, the above definition does not depend on the choice of the dense countable set D ⊆ U 1 .
Similarly as with Proposition 5.15, the following result is stated for the Urysohn sphere but holds true for the Urysohn space as well.

Proposition 5.19
The convex compact set S(U 1 , d U 1 ) is a simplex.
Proof Write S for S(U 1 , d U 1 ) and d S for the metric on S (induced from the Hilbert cube). Recall that we have fixed a countable dense set D ⊆ U 1 and write d E for the metric on E ∞ (U 1 , d U 1 , D).
Suppose μ and ν are two distinct Borel probability measures in P(S) which are supported on ext(S). Since as U 1 ⊆ ext(S) is dense by Corollary 5.8, we can pick two sequences of Borel probability measures μ n → μ and ν n → ν such that μ n and ν n are finitely supported on U 1 .
Since μ and ν are distinct as elements of P(S), and the coordinate functions (from [0, 1] N ) separate points in S, by the Stone-Weierstrass theorem, there is a function f ∈ C(S) which belongs to the ring generated by the coordinate functions and is such that f dμ = f dν. Note that the restrictions of the coordinate functions to U 1 are equal to the d E -distance functions to the points in D ∞ . By Proposition 5.17 and the fact that U 1 is dense in ext(S), we can assume that the restriction of f to U 1 is actually equal to the d E -distance function to, say, z ∈ D ∞ . Thus, we assume that the function f on ext(S) is just one of the coordinate functions. Say it is the kth coordinate, i.e. z is the kth element of D ∞ .
Write x for the barycenter of μ and y for the barycenter of ν and let x n be the barycenter of μ n and y n of ν n . Note that x n → x and y n → y [44, Chapter 15, Proposition 2.2]. Now, since μ n and ν n are supported on U 1 , similarly as in Proposition 5.9, we get that x n (k) = f dμ n and y n (k) = f dν n . But f dμ n → f dμ and f dν n → f dν. Thus, x(k) = f dμ and y(k) = f dν and hence x and y are distinct, as needed. This ends the proof.  (X, d X )). The fact that X is dense in ext(S Z (X, d X )) follows directly from Corollary 5.8.

Corollary 5.20 For every closed subspace
Finally, we need to see that S-extensions of metric spaces are invariant under the isometry of the metric spaces. Proof For simplicity again identify (X, are equal and we get the following diagram: Composing this with the diagram in Proposition 5.11 (where we take the restrictions of the maps i d D ∞ and i d E ∞ to U 1 ), we get and since all the maps are affine and continuous, this immediately implies that The simplex S(U 1 , d U 1 ) plays now the role of a universal homogeneous Choquet simplex. However, it does not seem to be affinely homeomorphic to the Poulsen simplex. On the other hand, that there is another convex compact set, which seems to be related to the Poulsen simplex. It is the . Again, up to affine homeomorphism, it does not depend on the choice of the countable set D. Now, the map from S( , which forgets about the coordinates corresponding to D ∞ \D is clearly affine and continuous and hence S(U 1 , d U 1 ) can be treated as an unfolded version of S (U 1 , d U 1 ). We do not know if S (U 1 , d U 1 ) is a simplex but it seems to be more closely related to the Pousen simplex than S(U 1 , d U 1 ).

Proposition 5.22 S (U 1 , d U 1 ) has a dense set of extreme points.
The proof follows from the following simple claim. Proof This is an elementary computation. The Katětov inequalities for α f + (1 − α)g follow directly from the Katětov inequalities for f and g.
Proof of Proposition 5.22 By the fact that d(d i , z). Now, Claim 5.23 implies that for every α 1 , . . . , α n ∈ [0, 1] with i α i = 1 the function i α i f i is a Katětov function with values in [0, 1], thus realized in U 1 . This implies that the set of points (d(x, d 1 ), . . . , d(x, d n )) ∈ [0, 1] n for x ∈ U 1 is convex. But the latter set is equal to U 1 n. Thus, since the vertices of S n n (U 1 , d U 1 , D, d U 1 D) belong to U 1 n and U 1 n is convex, we have that S n n (U 1 , d U 1 , D, d U 1 D) is contained in U 1 n, as needed. This ends the proof. where the convex hull is taken in Y (recall our convention on metrics in Sect. 2 and note that if S is a subset of the Hilbert cube, then the cone is embedded in the Hilbert cube as well).
The point (s, 1) is called the cone point of the cone and we will identify S with S × {0} ⊆ cone(S, s). We also denote the cone point as c(s). The cone admits a natural affine continuous map π : cone(S, s) → S which is just the projection map in Y . It maps the cone point c(s) to the point s.
We state now a couple of basic facts on the structure of cones.  α(1 − β)).

Lemma 6.1 If S is a simplex and s ∈ S, then cone(S, s) is a simplex, S is
Given the above lemma, we use the notation cone(S, s 1 , . . . , s n ) to denote an iterated cone of the form cone(. . . cone(S, s 1 ) . . . , s n ) (or with any other permutation). We also call a cone of the form cone(S, s 1 , s 2 ) a double cone.

Lemma 6.3 Given a simplex
Proof This follows directly from the definitions and Lemma 6.2. Definition 6.4 Given a simplex S and its countable (enumerated) subset D = (d n : n ∈ N), define the iterated cone over D as follows. Let S 0 = S and for each n ∈ N let S n = cone(S n−1 , d n ) and let π n : S n+1 → S n be the projection map. Define Note that if S is a subset of the Hilbert cube, then cone(S, D) can be naturally embedded into the Hilbert cube as well. Note also that the inverse system in the above definition is increasing. Thus, we treat S n as a face of cone(S, D), for each n ∈ N. Given that, all cone points of the simplices S n belong to cone(S, D) and we refer to them as to the cone points of the iterated cone. In principle, the iterated cone over D may depend on the ordering of the set D. As we will see, this does not happen. Lemma 6.5 Let S be a simplex, ε > 0 and ϕ : S → S be an affine homeomorphism. Given two points s 1 , s 2 ∈ S if d S (ϕ(s 1 ), s 2 ) < ε, then there is an affine homeomorphism ϕ : cone(S, s 1 ) → cone(S, s 2 ) extending ϕ such that d S (ϕ(π 1 (s)), π 2 (ϕ (s))) < ε for every s ∈ cone(S, s 1 ), where π 1 : cone(S, s 1 ) → S and π 2 : cone(S, s 2 ) → S are the projection maps.
Proof Write X = cone(S, D) and Y = cone(S, E) and define X n and Y n as X 0 = Y 0 = S and X n+1 = cone(X n , d n ) and Y n+1 = cone(Y n , e n ) so that X = lim ← − X n and Y = lim ← − Y n . We define inductively two increasing sequences of natural numbers n i and m i and affine continuous maps ϕ i : X n i → Y m i and ψ i : Y m i → X n i+1 such that ϕ 0 = ϕ and • (ϕ n , ψ n : n ∈ N) is an approximate intertwining.
• rng(ϕ n ) and rng(ψ n ) is a subcone of X or Y , for each n ∈ N.
The theorem will then follow by Proposition 4.1. Let We need to define ϕ i+1 : and X n i = rng(ψ i ) = dom(ϕ i ). By our assumption, X n i is a subcone, so there are p 1 , . . . , p k ∈ N such that X n i = cone(S, d p 1 , . . . , d p k ). Find n i+1 > n i such that p j < n i+1 for each j ≤ k. Let {q 1 , . . . , q l } = {1, . . . , n i+1 }\{ p 1 , . . . , p k }. By Lemma 6.3, X n i+1 is affinely homeomorphic to cone(X n i , d q 1 , . . . , d q l ). For each j ≤ l write X j i = cone(X n i , d q 1 , . . . , d q j ). We inductively find increasing numbers m j i ∈ N and maps ϕ for each x ∈ X Proof Note first that if (X n , π n : n ∈ N) is an increasing inverse system of simplices and x ∈ X 0 , then cone(lim ← − X n , x) lim ← − cone(X n , x), where the latter inverse system has the natural projection maps π n : cone(X n , x) → cone(X n−1 , x) that extend π n and map the cone point to the cone point.
Now we look at the extreme point of the iterated cones. Lemma 6.8 Suppose S is a simplex, s 1 , s 2 ∈ S and let y ∈ cone(S, s 1 ) be such that for some x ∈ S and 0 < α < 1. Write π : cone(cone(S, s 1 ), s 2 ) → cone(S, s 1 ) for the projection map. Then for every y ∈ cone(cone(S, s 1 ), s 2 ) with π(y ) = y there exists a unique x ∈ cone(S, s 2 ) such that and π(x ) = x.
is an open neighborhood of v n that is disjoint from ext(S) and does not contain any v i with i = n.

The blow-up construction
Given a countable dense subset D of a metric space (X, δ X ) with δ X < 1 2 , enumerate as ( p n = (x n , y n , s n , t n ) : n ∈ N), with infinite repetitions, all quadruples (x, y, s, t) with x, y ∈ D distinct and s < t ∈ Q ∩ (0, 1 2 ) such that s < δ X (x, y) < t. Call the sequence ( p n : n ∈ N) the metric scheme of (X, δ X , D) and denote it by Sch(X, δ X , D). For every n ∈ N and p n = (x n , y n , s n , t n ) in the metric scheme, write p n (1) for x n and p n (2) for y n . Write also p n (D) for the nth element of Sch(X, d X , D).
Recall that given a simplex S and two points x 1 , x 2 ∈ S the double cone cone(S, x 1 , x 2 ) is the simplex cone(cone(S, x 1 ), x 2 ). Now, given a simplex S and its subset X ⊆ S together with a metric d X on X we will define another, bigger, simplex, which will be used to encode the metric in its affine structure.
Let ( p n : n ∈ N) enumerate the metric scheme of (X, 1 2 d X ). Define an increasing inverse system of simplices as follows. Let B 0 = S and B n = cone(B n−1 , p n (1), p n (2)). Define the blow-up of S with respect to (X, d X ) (slightly abusing the notation), denoted by B(S, X, d X ) as lim ← − B n and write c 1 ( p n ) for the cone point over p n (1) in B(S, X, d X ) and c 2 ( p n ) for the cone point over p n (2) in B(S, X, d X ).
In principle, the blow-up construction depends only on the enumeration (with repetitions) of pairs of points in D. We keep, however, the sequence of p n 's for reference to the further construction. Note that each pair of distinct points in D appears infinitely often in the sequence. Analogous arguments as in Sect. 6, show that the blow-up depends neither on the ordering p n 's nor on the choice of the dense set. Proposition 7.2 Suppose S and T are simplices, X ⊆ S and Y ⊆ T are their subsets, d X , d Y < 1 are metrics on X and Y , respectively and D ⊆ X and E ⊆ Y are countable dense sets. Given an affine homeomorphism ϕ : S → T such that ϕ X = Y and ϕ X is an isometry of (X, d X ) and (Y, d Y ), there is an affine homeomorphismφ : B(S, X, d X ) → B(T, Y, d Y ) such thatφ extends ϕ and (a) for every p ∈ Sch(X, 1 2 d X , D) there exists q ∈ Sch(Y, 1 2 x 2 , s, t), then q = (y 1 , y 2 , s, t) andφ maps c 1 ( p) to c 1 (q) and c 2 ( p) to c 2 (q), (b) for every q ∈ Sch(Y, 1 2 d Y , E) there exists p ∈ Sch(X, 1 2 d X , D) such that if q = (y 1 , y 2 , s, t), then p = (x 1 , x 2 , s, t) andφ −1 maps c 1 (q) to c 1 ( p) and c 2 (q) to c 2 ( p).
Proof The proof is essentially the same as that of Proposition 6.6 and we only sketch it. Write B n for the simplices in the inverse system of B(S, X, d X ) and C n for the simplices in the inverse system of B(T, Y, d Y ). By induction on i ∈ N, construct an approximate intertwining ϕ i : B n i → C m i and ψ i : C m i → B n i+1 so that ϕ 0 = ϕ. At the inductive construction, when extending a map from B n i to B n i+1 , make sure that if p n (D) = (x 1 , x 2 , s, t), then for some m ∈ N with p m (E) = (y 1 , y 2 , s, t), the point c 1 ( p n (D)) is mapped to and d Y (y 1 , y 2 ) ∈ (s, t). Analogous conditions apply when we extend a map from C m i to C m i+1 . The fact that the above is possible follows at once from the fact that ϕ was an isometry and the elements in the schemes are enumerated with infinite repetitions. Once the construction is finished, (4) and the symmetric condition involving d S imply that the sequence forms an approximate intertwining. Then, an application of Proposition 4.1 gives an affine homeomorphismφ : lim ← − B i → lim ← − C i . The conditions (a) and (b) follow directly from the construction.

Coding a metric into the affine structure of a simpliex
Given a metric space (X, d X ) with d X < 1, which we assume is a subspace of the Urysohn sphere U 1 , and a dense countable subset D of X , let ( p n = ((x n , y n , s n , t n ) : n ∈ N) be the associated metric scheme of (X, 1 2 d X ). Consider the blow-up B(X, d X ) and let M(X, d X , D) be the subset of B(X, d X ) consisting of the points for q ∈ (s n , t n ) ∩ Q (note that the points c 1 ( p n ) and c 2 ( p n ) do not belong to the closure of this set since (s n , t n ) ∩ Q is isolated away from 0).
Use the Kuratowski-Ryll-Nardzewski theorem [46,Theorem 12.13], to find a countable dense subset D(X ) for every (nonempty) closed subset X of U 1 so that the map D : X → D(X ) is Borel. Define now (X, d X ) as cone(B(X, d X ), M(X, d X , D(X )). It is easy to check that is a Borel map from the space of closed (nonempty) subsets of U 1 to the space of separable Choquet simplices (cf. Sect. 2 for the Borel structure on the space of simplices). In fact, the map (X, D) → cone(B(X, d X ), M(X, d X , D)), which maps a pair of a Polish space and its dense countable subset to a simplex, is continuous in the following natural topologies. First, any such pair (X, D) with X ⊆ U 1 is uniquely determined by D (as X = D) and hence the topology on such pairs can be taken as the topology on the space on sequences of elements of U 1 , which is the product topology on (U 1 ) N . Second, the simplices cone(B(X, d X ), M(X, d X , D)) obtained from the pairs (X, D) are naturally embedded into the Hilbert cube [0, 1] N , and the natural topology there is the Vietoris topology on compact subsets of the Hilbert cube.
Proof For simplicity, identify X with Z (X ) and Y with Z (Y ) (see Proposition 3.2) and let ϕ : U 1 → U 1 be an isometry such that ϕ X = Y . By Propositions 5.21 and 7.2, there is an affine homeomorphismφ : B(X, d X ) → B(Y, d Y ) which extends ϕ and such that • for each p = (x 1 , x 2 , s, t) in the scheme of (X, 1 2 d X ) there is q = (y 1 , y 2 , s, t) in the scheme of (Y, 1 2 d Y ) such thatφ maps the cone points c 1 ( p) to c 1 (q) and c 2 ( p) to c 2 (q), • for each q = (y 1 , y 2 , s, t) in the scheme of (Y, 1 2 d Y ) there is p = (x 1 , x 2 , s, t) in the scheme of (X, 1 2 d X ) such thatφ −1 maps c 1 (q) to c 1 ( p) and c 2 (q) to c 2 ( p).
The above imply thatφ cl(M(X, d X , D(X ))) = cl(M(Y, d Y , D(Y ))) and hence, by Proposition 6.6, there is an affine homeomorphismφ : Proposition 8.1 shows that maps isometric metric spaces to affinely homeomorphic simplices. To show that is a reduction, we will restrict attention to perfect separable metric spaces.
is perfect with d X < 1, then the set of nonisolated extreme points of (X, d X ) is equal to ext(S Z (X, d X )).
Proof X is perfect and dense in ext(S Z (X, d X )) by Corollary 5.20, so all extreme points of S Z (X, d X ) are nonisolated in ext(S Z (X, d X )). Since the simplex S Z (X, d X ) is a face of (X, d X ), the extreme points of S Z (X, d X ) are still nonisolated extreme points of (X, d X ). Now, Lemmas 6.9 and 6.10 and analogous statements for the blow-up (here we use the fact that [s, t] ⊆ (0, 1 2 ) for s < t appearing in the metric scheme of (X, 1 2 d X ) in order to ensure that c 1 ( p n ) and c 2 ( p n ) remain isolated after passing from B(X, d X ) to (X, d X )) imply that all the other extreme points of (X, d X ) are isolated.

Lemma 8.3
Suppose (X, d X ) is a perfect metric subspace of U 1 . If x, y ∈ X and x = y, then 1 2 d X (x, y) is the only α ∈ (0, 1 2 ) such that open neighborhoods of x and y in (X, d X ) ∀c 1 ∈ V x ∀c 2 ∈ V y isolated extreme points is a limit of isolated extreme points of (X, d X )) is a limit of isolated extreme points of (X, d X )) .

(5)
Proof Write D for the countable dense subset D(X ) of X . By Claim 8.2 and Lemma 6.9, the only isolated extreme points of (X, d X ) are in the sets It follows from the iterated cone construction that if z ∈ M(X, d X , D), then for any isolated extreme point e of (X, d X ), no point in the set {λc(z)+(1−λ)e : λ ∈ [0, 1]} is a limit of isolated extreme points of (X, d X ). On the other hand, if e 1 , e 2 ∈ E 1 are such that for some λ ∈ [0, 1] the point λe 1 + (1 − λ)e 2 is a limit of isolated extreme points of (X, d X ), then there is p ∈ Sch(X, 1 2 d X , D) such that {e 1 , e 2 } = {c 1 ( p), c 2 ( p)}. The latter follows from the fact that the intersection of B(X, d X ) with the closure of the set {c(z) : z ∈ M(X, d X , D)} is exactly the closure of M(X, d X , D).
We also need to show that α is the only number is (0, 1 2 ) satisfying (5) for x and y. Pick any β ∈ (0, 1 2 ) distinct from α. Let ε > 0 be smaller than |α − β|. Pick a basic open neighborhood (s, t) ⊆ (β − ε/2, β + ε/2) of β. We claim that (s, t) witnesses that (5) is not satisfied. Let V x and V y be arbitrary open neighborhoods of x and y, respectively, in (X, d X ). Pick d 1 , d 2 ∈ D such that d X (d 1 , x) < ε/2, d X (d 2 , y) < ε/2 and d 1 ∈ V x , d 2 ∈ V y . Note that 1 2 d X (d 1 , d 2 ) ∈ (α−ε/2, α+ε/2) and that (s, t) is disjoint from (α−ε/2, α+ε/ 2). Find a basic open neighborhood (q, r ) of 1 2 d X (d 1 , d 2 ) in (0, 1 2 ) such that [q, r ] ∩ (s, t) = ∅. Find n ∈ N big enough so that p n ∈ Sch(X, 1 2 d X , D) is equal to (d 1 , d 2 , q, r ) and such that letting c 1 = c 1 ( p n ), c 2 = c 2 ( p n ) we have c 1 ∈ V x and c 2 ∈ V y . Now, there is λ ∈ (0, 1 2 ) such that λc 1 + (1 − λ)c 2 is a limit of isolated extreme points of (X, d X ) but the set of such λ is equal to [q, r ], which is disjoint from (s, t). This shows that β does not satisfy (5) and ends the proof. Now we are ready to finish the proof that is a reduction. Proof Let ϕ : (X, d X ) → (Y, d Y ) be an affine homeomorphism. Note that ϕ maps nonisolated extreme points of (X, d X ) to nonisolated extreme points of (Y, d Y ), so, by Claim 8.2, ϕ ext(S(X, d X )) = ext(S(Y, d Y )). Now, X ⊆ S(X, d X ) and Y ⊆ S(Y, d Y ) are dense G δ sets, so there is a comeager set X ⊆ X such that Y = ϕ X is comeager in Y . Note that since ϕ preserves the topological and affine structure, (5) is preserved by ϕ and so Lemma 8.3 implies that for x 1 , x 2 ∈ X we have d Y (ϕ(x 1 ), ϕ(x 2 ) = d X (x 1 , x 2 ). This means that (X , d X ) and (Y , d Y ) are isometric. Since X is comeager in X and Y is comeager in Y , the spaces X and Y are isometric as well.

Concluding remarks and open questions
As we have mentioned in the introduction, the theory of functorial reductions is still to be developed in the context of descriptive set-theoretic complexity theory. One way to make it precise can be made in terms of Polish groupoids. In this setting, a functorial reduction would be a full (Borel) functor between Polish groupoids. It is not difficult to check that our reduction of the isometry of complete separable metric spaces to the affine homeomorphism of Choquet simplices is in fact functorial in the above sense. Another notion of functoriality can be also defined in terms of functors on small categories in order to capture all morphisms between objects. This setting is more subtle.
Another major problem that is still left open is that of the complexity of the homeomorphism relation for compact subspaces of [0, 1] 2 . It is known that the homeomorphism relation for compact subspaces of the interval is classifiable by countable structures but the homeomorphism relation in two dimensions is turbulent as shown by Hjorth [40]. In [28,Theorem 7.3] Farah, Toms and Törnquist showed that the isomorphism of separable simple nuclear C*-algebras is below an action of the automorphism group of the Cuntz algebra Aut(O 2 ). Since complete orbit equivalence relations are typically induced by actions of universal Polish groups, the following question is natural.

Question 9.2 Is the group Aut(O 2 ) a universal Polish group?
On the other hand, the following seems to be unknown: Finally, this paper reveals an interesting connection between three categories of objects: separable metric spaces, metrizable Choquet simplices and separable Banach spaces. It is somewhat parallel to the connection between metric spaces and Banach spaces given by the Arens-Eells extensions. Recall that given a separable metric space, its Arens-Eells extension is a separable Banach space and the assignment of the Arens-Eells extensions is isometry invariant. On the other hand, given a simplex, one can look at the space of affine continuous functions on it. Now, the S-extensions give an invariant assignment of separable Banach spaces to separable metric spaces that factors through simplices as follows: The three categories of separable metric spaces, metrizable Choquet simplices and separable Banach spaces contain universal objects that have been studied independently. While the universal objects in the first two classes are the Urysohn space and the Poulsen simplex, the category of separable Banach spaces contains the Gurariȋ space [37], which is a separable Banach space with an almost isometric extension property. This space turns out to be unique [57] (see also [51] for a recent proof of this result). It is known that the Gurariȋ space is isomorphic to the space of affine functions on the Poulsen simplex [57] but the relations between the Urysohn space and the Gurariȋ space or the Poulsen simplex remain unclear. Fonf and Wojtaszczyk [30] showed that the Gurariȋ space is not isomorphic to the Arens-Eells extension of the Urysohn space. While we think that the S-extension of the Urysohn space is not affinely homeomorphic to the Poulsen simplex, we suspect that the compact convex set S (U 1 ) is the Poulsen simplex (see page 21 for the definition). Question 9.4 Is S (X ) always a simplex for a separable metric space X ? Is S (U 1 ) affinely homeomorphic to the Poulsen simplex?