Optimal transport maps on Alexandrov spaces revisited
Tapio Rajala Timo Schultz


Optimal transport maps on Alexandrov spaces revisited]
Optimal transport maps on Alexandrov spaces revisited




University of Jyvaskyla

         Department of Mathematics and Statistics 

         P.O. Box 35 (MaD) 

         FI-40014 University of Jyvaskyla 

         Finland
tapio.m.rajala@jyu.fi
timo.m.schultz@student.jyu.fi

Both authors partially supported by the Academy of Finland.
[2000]Primary 53C23. Secondary 49K30






We give an alternative proof for the fact that in n-dimensional Alexandrov spaces with curvature bounded below there exists a unique optimal transport plan from any purely (n-1)-unrectifiable starting measure, and that this plan is induced by an optimal map.


[
    Timo Schultz
    December 30, 2023
=====================





§ INTRODUCTION




The problem of optimal mass transportation has a long history, starting from the work of Monge <cit.> in the late 18th century. In the original formulation of the problem, nowadays called the Monge-formulation, the problem is to find the transport map T minimizing the transportation cost

    ∫_^nc(x,T(x)) μ̣_0(x),

among all Borel maps T ^n →^n transporting a given probability measure μ_0 to another given probability measure μ_1, that is, T_♯μ_0 = μ_1. In the original problem of Monge, the cost function c(x,y) was the Euclidean distance. Later, other cost functions have been considered, in particular much of the study has involved the distance squared cost, c(x,y) = |x-y|^2, which is the cost studied also in this paper.

In the Monge-formulation (<ref>) of the optimal mass transportation problem the class of admissible maps T that send μ_0 to μ_1 is in most cases not closed in any suitable topology. To overcome this problem, Kantorovich <cit.> considered a larger class of optimal transports, namely, measures π on ^n ×^n such that the first marginal of π is μ_0 and the second is μ_1. Such measures π are called transport plans. Kantorovich's relaxation leads to the so-called Kantorovich-formulation of the problem,

    inf_π∫_^n×^nc(x,y) π̣(x,y).

Due to the closedness of the admissible transport plans and the lower semi-continuity of the cost, minimizers exist in the Kantorovich-formulation under very mild assumptions on the underlying space and the cost c. 

For the quadratic cost in the Euclidean space, it was shown independently by Brenier <cit.>
and Smith and Knott <cit.> that having μ_0 absolutely continuous with respect to the Lebesgue measure guarantees that the optimal transport plans (minimizer of (<ref>)) are unique and given by a transport map. Moreover, the optimal transport map is given by a gradient of a convex function.

The results of Brenier and of Smith and Knott have been generalized in many ways. The most important directions of generalization have been: going from the underlying space ^n to other metric spaces, considering other cost functions, and relaxing the assumption of the starting measure being absolutely continuous with respect to the reference measure (here the Lebesgue measure). In this paper, we study the direction of relaxing the absolute continuity in a more general metric space setting, the Alexandrov spaces. 
We note that one should be able to generalize our proof for more general costs, such as the distance to a power p∈ (1,∞). In order to keep the presentation simpler, we concentrate here on the distance squared cost.

The existence of optimal transportation maps in Alexandrov spaces with curvature bounded below for starting measures that are absolutely continuous with respect to the reference Hausdorff measure was proven by Bertrand <cit.>. 
Later Bertrand improved this result <cit.> by relaxing the assumption on the starting measure to give zero measure to c-c-hypersurfaces.
Here we provide an alternative proof for the result of Bertrand under the slightly stronger assumption on the starting measure of pure (n-1)-unrectifiability (see Definition <ref> for the definition of purely (n-1)-unrectifiability).


 Let (X,d) be an n-dimensional Alexandrov space with curvature bounded below. Then for any pair of measures μ_0,μ_1 ∈𝒫_2(X) such that μ_0 is purely (n-1)-unrectifiable, there exists a unique optimal transport plan from μ_0 to μ_1 and this transport plan is induced by a map.


The contribution of this paper is to provide a different approach to showing the existence and uniqueness of optimal transport maps than what was used by Bertrand in <cit.>. In <cit.>, Bertrand used the local (1+ε)-biLipschitz maps to ^n on the regular set of X, and the general existence of Kantorovich potentials and their Lipschitzness. Since the singular set of X is at most (n-1)-dimensional, and the Rademacher's theorem on ^n can be restated in X via the biLipschitz maps, Bertrand concluded that the optimal transport is concentrated on a graph that is given by applying the exponential map to the gradient of the Kantorovich potential. 
In <cit.>, Bertrand considered the problem in boundaryless Alexandrov spaces. He used Perelman's DC calculus to translate the problem to differentiability of convex functions on Euclidean spaces. Then the result follows from the characterization of nondifferentiability points of convex functions due to Zajíček <cit.>.

In this paper, 

we translate a contradiction argument (Lemma <ref>) from the Euclidean space (which uses just cyclical monotonicity in certain geometric configurations) to the space X via the (1+ε)-biLipschitz charts. In order to use the contradiction argument, we need to get all the used distances to be comparable. For this we use the fact that the directions of geodesics are well-defined in the biLipschitz charts (Theorem <ref>) and thus we can contract along the geodesics without changing the geometric configuration too much. Finally, the geometric configurations that result in the contradiction via cyclical monotonicity are given by the pure (n-1)-unrectifiability (Lemma <ref>).

Let us comment on the history of the sufficient assumptions on μ_0.
The assumption of pure (n-1)-unrectifiability was shown by McCann <cit.> to be sufficient for the existence of optimal maps in the case of Riemannian manifolds. A sharper condition based on the characterization by Zajíček <cit.>
of the set of nondifferentiability points of convex functions 
was first used in the Euclidean context by Gangbo and McCann <cit.> when they showed that having an initial measure that gives zero mass to c-c -hypersurfaces is sufficient to give the existence of optimal maps. It was then shown by Gigli <cit.> that even in the Riemannian manifold context the sharp requirement for the starting measure to have optimal maps for any target measure is indeed that it gives zero measure to c-c -hypersurfaces. 
It still remains open whether zero measure of c-c -hypersurfaces also gives a full characterization in the case of Alexandrov spaces. One of the directions, the sufficiency, was obtained by Bertrand <cit.>.

The existence of optimal maps has been studied in wider classes of metric measure spaces that satisfy some form of Ricci curvature lower bounds or weak versions of measure contraction property. 
These classes include CD(K,N)-spaces that were introduced by Lott and Villani <cit.>, and by Sturm <cit.>, MCP(K,N)-spaces (see Ohta <cit.>), and RCD(K,N) spaces that were first introduced by  Ambrosio, Gigli and Savaré <cit.> (see also the improvements and later work by Ambrosio, Gigli, Mondino and Rajala <cit.>, Erbar, Kuwada and Sturm <cit.> and Ambrosio, Mondino and Savaré <cit.>). All of these classes contain Alexandrov spaces with curvature lower bounds, see Petrunin <cit.>.

It was first shown by Gigli <cit.>, that in nonbranching CD(K,N)-spaces you do have the existence of optimal maps provided that the starting measure is absolutely continuous with respect to the reference measure. In all the subsequent work, the assumption has been the same for the starting measure, and it would be interesting to see if it can be relaxed also in the more general context of metric measure spaces with Ricci curvature lower bounds.

Also a metric version of Brenier's theorem was studied by Ambrosio, Gigli and Savaré <cit.>. They did not obtain the existence of optimal maps, but showed that at least the transportation distance is given by the Kantorovich potential. Later, Ambrosio and Rajala <cit.> showed that under sufficiently strong nonbranching assumptions one can conclude the existence of optimal maps.

Rajala and Sturm <cit.> noticed that strong CD(K,∞) spaces, and hence RCD(K,∞) spaces are at least essentially nonbranching, and that this weaker form of nonbranching is sufficient for carrying out Gigli's proof. This result was later improved by Gigli, Rajala and Sturm <cit.>. Essential nonbranching was then studied together with the measure contraction property MCP(K,N) by Cavalletti and Huesmann <cit.> and Cavalletti and Mondino <cit.>, and finally it was shown by Kell <cit.> that under a weak type measure contraction property, the essential nonbranching characterizes the uniqueness of optimal transports and that the unique optimal transport is given by a map for absolutely continuous starting measures.

The existence of optimal transport maps in CD(K,N) spaces without any extra assumption on nonbranching is still an open problem. An intermediate definition between CD(K,N) and essentially nonbranching CD(K,N), called very strict CD(K,N), was studied by Schultz <cit.>. He showed that in these spaces one still has optimal transport maps even if the space could be highly branching and the optimal plans non-unique. It is also worth noting that if one drops the assumption of essential nonbranching for MCP(K,N), then optimal transport maps need not exist. This is seen from the examples by Ketterer and Rajala <cit.>.




The paper is organized as follows. In Section <ref> we recall basic things about rectifiability, Alexandrov spaces and optimal mass transportation. While doing this, we also present a few facts that easily follow from well-known results: purely n-1-unrectifiable measures have mass in all directions (Lemma <ref>), the singular set in an Alexandrov space is (n-1)-rectifiable (Theorem <ref>), gradients of geodesics exist in charts in Alexandrov spaces (Theorem <ref>) and the failure of cyclical monotonicity persists after small perturbations (Lemma <ref>). In Section <ref> we then put these things together and prove Theorem <ref>.




§ PRELIMINARIES

In this paper (X,d) always refers to a complete and locally compact length space.
By a length space we mean a metric space  where the distance between any two points x and y is equal to the infimum of lengths  of curves connecting x and y. 
By the Hopf-Rinow-Cohn-Vossen Theorem, our spaces (X,d) are then geodesic, proper and, in particular, separable. A space is called geodesic, if any two points in the space can be connected by a geodesic.
By a geodesic we mean a constant speed length minimizing curve γ [0,1]→ X. 
Notice that we parametrize all the geodesics by the unit interval.
We denote the space of geodesics of X by (X) and equip it with the supremum-distance.
By a (geodesic) triangle Δ (x,y,z) we mean points x,y,z∈ X and any choice of geodesics [x,y], [y,z] and [x,z] pairwise connecting them.



 §.§ Rectifiability


For our Theorem <ref> the starting measure μ_0 is diffused enough if it is purely n-1-unrectifiable. Let us recall this notion.


A set A ⊂ X is called (countably) k-rectifiable if there exist Lipschitz maps f_i  E_i → X from Borel sets E_i ⊂^k for i ∈, such that A ⊂⋃_i∈f_i(E_i).

A measure μ is called purely k-unrectifiable, if μ(A) = 0 for every k-rectifiable set A.


The property of purely unrectifiable measures that we use is that they have mass in all directions. This is made precise using (one-sided) cones that are defined as follows.
Given x ∈^n, θ∈^n-1, α > 0 and r> 0, we denote the open cone at x in direction θ with opening angle α, by

    C(x,θ,α) := {y ∈^n : ⟨ y-x, θ⟩ > cos(α)|y-x|}.



 Let μ be a purely (n-1)-unrectifiable measure on ^n and let E ⊂^n with μ(E) > 0. Then at μ-almost every x ∈ E we have C(x,θ, α) ∩ B(x,r) ∩ E ∅
 for all θ∈^n-1, α > 0 and r> 0.


 Suppose that there is a subset E_0 ⊂ E with μ(E_0)>0 such that the conclusion fails, i.e. for every x ∈ E_0 there exist θ_x ∈^n-1, α_x > 0 and r_x> 0 such that C(x,θ_x, α_x) ∩ B(x,r_x) ∩ E = ∅. Since
 
    C(x,θ, α) ∩ B(x,r) ⊂ C(x,θ, α') ∩ B(x,r')

 if α' ≥α and r'≥ r, there exist r>0 and α >0 such that the subset
 
    {x ∈ E_0 : C(x,θ_x, α) ∩ B(x,r) ∩ E = ∅}

 has positive μ-measure. By considering a countable dense set of directions {θ_i}_i ∈, we have that there exists one fixed direction θ_i such that the set
 
    E_1 := {x ∈ E_0 : C(x,θ_i, α/2) ∩ B(x,r) ∩ E = ∅}

 has positive μ-measure. But now, for evey x ∈^n, the set E_1∩ B(x,r/2) is contained in a Lipschitz graph and hence E_1 is an (n-1)-rectifiable set, giving a contradiction with the pure (n-1)-unrectifiability of μ.




 §.§ Alexandrov spaces


Let us recall some basics about Alexandrov spaces.
Unless we provide another source, all the following definitions and results can be found in <cit.>.

Alexandrov spaces generalize sectional curvature bounds by means of comparison to constant curvature model spaces. Alexandrov spaces can be defined for instance by comparing geodesic triangles of a metric space to the corresponding ones in a model space. Let us next give precise definitions. 

For each k∈, let M_k be a simply connected surface with constant sectional curvature equal to k, that is, for negative k, M_k is a scaled hyperbolic plane, for k=0, M_k is the Euclidean plane, and for positive k, M_k is a (round) sphere. Let us denote the distance between two points x,y ∈ M_k by |x-y|.

Let k∈. For a triplet x,y,z∈ X, let x̃,ỹ,z̃∈ M_k be points so that the triangles Δ (x,y,z) and Δ (x̃,ỹ,z̃) have the same side lengths, that is, d(x,y)=|x̃-ỹ|,d(y,z)=|ỹ-z̃|,d(x,z)=|x̃-z̃|. We call the triangle Δ (x̃,ỹ,z̃)  a comparison triangle for Δ (x,y,z).
For a triangle Δ(x,y,z) in X we denote by ∡̃_k(y,x,z) the comparison angle at x̃ in the comparison triangle Δ(x̃,ỹ,z̃) in M_k.

 We say that (X,d) is an Alexandrov space (with curvature bounded below by k) if there exists k∈ so that for each point p∈ X there exists a neighbourhood U of p for which the following holds. If Δ (x,y,z)⊂ U, Δ (x̃,ỹ,z̃) its comparison triangle in M_k, and w∈ [x,y], w̃∈ [x̃,ỹ] with d(x,w)=|x̃-w̃|, then d(w,z)≥ |w̃-z̃|. 
 
An Alexandrov space might have infinite (Hausdorff) dimension. In this paper we study only finite dimensional Alexandrov spaces. Recall that in an Alexandrov space every open nonempty set has the same dimension, so the dimension of an Alexandrov space is always well defined.
Moreover, the dimension is either an integer or infinity.
From now on, the space (X,d) is assumed to be an n-dimensional Alexandrov space with curvature bounded below by k ∈ with n ∈.



We will use the fact that our purely (n-1)-unrectifiable starting measures μ_0 live on the regular set of the space, that has nice charts. Let us recall the notion of regular and singular points.


 A point p ∈ X is called regular, if the space of directions Σ_p at p is isometric to the standard sphere ^n-1, or equivalently, if the Gromov-Hausdorff tangent at p is the Euclidean ^n.
 A point p ∈ X that is not regular is called singular. The set of regular points of X is denoted by 
 (X) and the set of singular points by (X).


The following  result is from <cit.> (see also <cit.>). It implies that our starting measures μ_0 give zero measure to the singular set.



 The set (X) is (n-1)-rectifiable.


Notice that <cit.> states that (X) has Hausdorff dimension at most n-1.
However, the proof easily gives the stronger conclusion of (n-1)-rectifiability. Namely, observe that in the proof of <cit.> Otsu and Shioya show that (X) is contained in Lipschitz images from subsets of the spaces of directions Σ_p for countably many points p ∈ X. Since the points p are only needed to locally form a maximal ε-discrete net in X, they can be chosen to be regular points of X. Thus, (X) is contained in countably many Lipschitz images from subsets of ^n-1 and is therefore (n-1)-rectifiable.


Let us then recall a well-known consequence of the nonbranching property of Alexandrov spaces. For its proof, we need the notion of an angle.
Let α, β [0,1] → X be two constant speed geodesics emanating from the same point p = α(0) = β(0). Let us denote by θ_k(t,s) := ∡̃_k(α(t),p,β(s)) the angle at p̃ of the comparison triangle Δ (p̃, α̃(t),β̃(s)) in M_k of Δ (p, α(t),β(s)).
In Alexandrov spaces the angle 

    ∡(α,β) := lim_t,s ↘ 0θ_k(t,s)

is well-defined for every pair of geodesics α, β emanating from the same point.
Moreover, by Alexandrov convexity (see for instance <cit.>) the quantity θ_k(t,s) is  monotone non-increasing in both variables t and s.


 Let γ_1, γ_2  [0,1] → X be be two constant speed geodesics with γ_1(0)=γ_2(0) and γ_1(1) γ_2(1). Then
 
    lim_t ↘ 0d(γ_1(t),γ_2(t))/t > 0.



We may assume ℓ(γ_1) ≥ℓ(γ_2). If ℓ(γ_1) > ℓ(γ_2), then by triangle inequality
d(γ_1(t),γ_2(t)) ≥ t (ℓ(γ_1) - ℓ(γ_2)), giving the claim. If ℓ(γ_1) = ℓ(γ_2), then θ_k(1,1) = ∡̃_k(γ_1(1),x,γ_2(1)) > 0.
Then by Alexandrov convexity, ∡(γ_1,γ_2) ≥θ_k(1,1) > 0, 
and thus by the cosine law

    d(γ_1(t),γ_2(t))/t→ℓ(γ_1)√(2-2cos(∡(γ_1,γ_2))) > 0,

as t → 0.








Our aim is to arrive at a contradiction with cyclical monotonicity at a small scale near a regular point. We will transfer the Euclidean argument to the Alexandrov space X using the following standard charts φ. Since we need the existence of directions of geodesics in these charts, we write the existence down explicitly inside the following theorem.


 For every p ∈(X) and every ε > 0 there exist a neighborhood U of p and a (1+ε)-biLipschitz map
 φ U →^n with φ(U) open so that for every constant speed geodesic γ [0,1] → U the limit
 
    lim_t ↘ 0φ(γ(t))-φ(γ(0))/d(γ(t),γ(0))

 exists.


We recall (see <cit.> or <cit.>) that the local (1+ε)-biLipschitz chart φ U →^n can be obtained as

    φ(x) = (d(a_1,x),d(a_2,x),…,d(a_n,x)),

where (a_i,b_i)_i=1^n is a δ-strainer for p, for some δ > 0.
Now, the first variation formula (see <cit.> or <cit.>) implies that 

    lim_t ↘ 0d(a_i,γ(t))-d(a_i,γ(0))/d(γ(t),γ(0)) = -cos(α),

where α = ∡(γ,β), with β a geodesic from γ(0) to a_i. Thus, the required limit exists for each i.
























 §.§ Optimal mass transportation


In this section we recall a few basic things in optimal mass transportation.

The Monge-Kantorovich formulation of optimal mass transportation problem (with quadratic cost) is  to investigate for two Borel probability measures μ_0 and μ_1 the following infimum

    inf∫_X× X d^2(x,y) π̣(x,y),

where the infimum is taken over all Borel probability measures π∈𝒫(X× X) which has μ_0 and μ_1 as a marginals, that is, π(A× X)=μ_0(A) and π(X× A)=μ_1(A) for all Borel sets A∈(X). In order to guarantee that the above infimum is finite, it is standard to assume the measures μ_0 and μ_1 to have finite second moments. The set of all Borel probability measures in X with finite second moments is denoted by 𝒫_2(X).

An admissible measure that minimizes the above infimum is called an optimal (transport) plan, and the set of optimal plans between μ_0 and μ_1 is denoted by (μ_0,μ_1). We say that an optimal plan π is induced by a map, if there exists a Borel measurable function T X→ X so that π =(𝕀× T)_#μ_0. Such a map is called an optimal (transport) map. While optimal plans exist under fairly general assumptions <cit.>, the existence of optimal maps is not true in general.

Optimality of a given transport plan depends only on the c-cyclical monotonicity of the support of the plan. 
Let us recall this notion.

A set Γ⊂ X× X is called c-cyclically monotone, if for all finite sets of points {(x_i,y_i)}_i=1^N⊂Γ the inequality

    ∑_i=1^Nd^2(x_i,y_i)≤∑_i=1^Nd^2(x_σ(i),y_i)

holds for all permutations σ∈ S_N of {1,…,N}.



A characterization of optimality using c-cyclical monotonicity of the support that is sufficient for us is  the following result proven in <cit.> which holds for continuous cost functions.

Let X be a Polish space and μ_0, μ_1∈𝒫_2(X). Then a transport plan π between μ_0 and μ_1 is optimal if and only if its support is c-cyclically monotone set.


In the following lemma we recall a well-known fact which allows us to localize the problem. One way to prove this is to use the result of Lisini in <cit.> about Wasserstein geodesics and their lifts to the space of probability measures on geodesics of X, see <cit.> for the proof.

Let (X,d) be a complete and separable geodesic metric space, and let Γ⊂ X× X be a c-cyclically monotone set. Then, the set 

    Γ_t{(γ(0),γ(t))∈ X× X: γ∈(X)  with  (γ(0),γ(1))∈Γ}
 
is c-cyclically monotone for all t∈[0,1].


In order to arrive at a contradiction with cyclical monotonicity, we will use the following lemma.


For each C>1 there exists δ>0 so that 

    1/2|y_1+y_2|^2<(1-δ)(|y_1|^2+|y_2|^2)

for all 

    y_1,y_2∈ K{(y_1,y_2)∈^2n : |y_2|=1 and  |y_2-y_1|∈[1/C,C]}.




Let us first observe that for y_1,y_2∈^n, with y_1  y_2 we have

    0 < |y_1-y_2|^2 = |y_1|^2 - 2⟨ y_1,y_2 ⟩ + |y_2|^2

and thus

    |y_1+y_2|^2 = |y_1|^2 + 2⟨ y_1,y_2 ⟩ + |y_2|^2 < 2(|y_1|^2+|y_2|^2).

The quantitative claim then follows by compactness of K: first of all notice that K⊂B̅(0,2+C) and thus K is bounded. The set K is also closed and hence it is compact. The function 
    (y_1,y_2)↦|y_1+y_2|^2/|y_1|^2+|y_2|^2

is continuous as a function K→. Therefore, the maximum of the above function is achieved in K. By (<ref>), this maximum is strictly less than two and hence there exists δ>0 as in the claim.  
































§ PROOF OF THEOREM <REF>


In order to prove the uniqueness of optimal transport plans it suffices to show that any optimal transport plan is induced by a map. Indeed, if there were two different optimal plans π_1 and π_2, then their convex combination 1/2(π_1+π_2) would also be optimal and not given by a map.
We will prove Theorem <ref> by assuming that there exists an optimal plan that is not induced by a map, then localizing to a chart and using an Euclidean argument to find a contradiction.

Step 1: initial uniform bounds and measurable selections

Let μ_0, μ_1 ∈𝒫_2(X) with μ_0 purely (n-1)-unrectifiable. Let π be an optimal  plan from μ_0 to μ_1. Towards a contradiction, we assume that π is not induced by a map, that is, there does not exist a Borel map T  X → X so that π = ( id,T)_♯μ_0. 

Consider the set 

    A{x∈ X: there exist  y^1,y^2∈ X  such that  (x,y^1),(x,y^2)∈(π)}.

Since A is a projection of a Borel set 

    {(x,y,z,w)∈(π)×(π): d(x,z)=0, d(y,w)>0},

it is a Souslin set and thus μ_0-measurable. (Actually, as a projection of a σ-compact set, A is Borel.) We will show that A has positive μ_0 measure.

For that we will first show that there exists a Borel selection T𝚙_1((π)) → X of (π), where 𝚙_1 X× X → X is the projection to the first coordinate. Define

    ((π))_x{y∈ X: (x,y)∈(π)}.

Then ((π))_x=({x}× X)∩(π) and thus it is closed. Furthermore, as a proper space, X is also σ-compact, and thus so is ((π))_x. Hence, by the Arsenin-Kunugui Theorem <cit.> there exists a Borel selection of (π), in other words, there exists a Borel map T𝚙_1((π))→ X with 𝚙_1((π)) Borel so that T(x)∈ ((π))_x for all x∈𝚙_1((π)). 

Suppose now that μ_0(A)=0. We will show that in this case π would be induced by the map T. Indeed, for E⊂ X× X we have that

    (𝕀,T)_#μ_0(E)   =μ_0((𝕀,T)^-1(E)∖ A)=μ_0(𝚙_1(E∩Graph(T)))
       =π((𝚙_1(E∩Graph(T))× X)∩(π))
    
       =π((E∩(π))∖(A× X))=π(E∩(π))=π(E).

Thus μ_0(A)>0.

Since X is geodesic, for all x∈ A there exist γ^1_x,γ^2_x∈(X) such that γ^1_x(0)=x=γ^2_x(0), γ^1_x(1)≠γ^2_x(1), and (γ^i_x(0),γ^i_x(1))∈ (π) for i∈{1,2}. We will need to choose the geodesics γ_x^1 and γ_x^2 in a measurable way. We will also make the selection so that

    d(x,γ_x^1(1)) ≤ d(x,γ_x^2(1))  0.



By now, we have a Borel selection T of (π). Since 𝚙_1((π)) is a Borel set, we can extend T to a Borel map T X→ X. Consider now the set (π)∖Graph(T). Since T is a Borel map, the graph of T is a Borel set and thus the set (π)∖Graph(T) is a Borel set. Since X∖ T(x) is σ-compact by the properness and separability of X, we have that ((π)∖Graph(T))_x is σ-compact as a closed subset of X∖ T(x). Thus again by the Arsenin-Kunugui Theorem 

there exists a Borel selection S𝚙_1((π)∖Graph(T))→ X that we can further extend to a Borel map S X→ X for which we have that T(x)=S(x) for x∉ A, and T(x)≠ S(x) for x∈ A. 


To have (<ref>) we will define two auxiliary maps T̃^1,T̃^2 X→ X× X as

    T̃^1(x){[     (x,T(x)), x∈ h^-1(-∞,0);     (x,S(x)), x∈ h^-1[0,∞), ].

where h(x) d(x,T(x))-d(x,S(x)), and similarly

    T̃^2(x){[     (x,S(x)), x∈ h^-1(-∞,0);     (x,T(x)), x∈ h^-1[0,∞). ].

The maps T̃^1 and T̃^2 are Borel maps since T,S and h are Borel maps.

It remains to select the geodesics between points x and T^i(x). For that, we consider the set 

    G{(x,y,γ)∈ X× X×(X) : γ(0)=x,γ(1)=y}.

The set G is Borel as the preimage of zero under the Borel map 

    (x,y,γ)↦sup{d(x,γ(0)),d(y,γ(1))}.

Furthermore, we have by the Arzelà-Ascoli Theorem that 

    G_(x,y){γ∈(X)  : γ(0)=x,γ(1)=y}.

is compact. Thus, by the Arsenin-Kunugui Theorem there exists a Borel selection F X× X→ G_(x,y). With this we may finally define T^1,T^2 X→(X) as 

    T^1    F∘T̃^1  and
     T^2    F∘T̃^2.



From now on, we will denote γ^1_x=T^1(x) and γ^2_x=T^2(x) for all x∈ A. Notice that γ_x^1 and γ_x^2 satisfy (<ref>).

By Lemma <ref>, we have for all x ∈ A that

    lim_t↘ 0d(γ^1_x(t),γ^2_x(t))/d(x,γ_x^2(t))∈(0,∞).

Thus, we may write A as a countable union of sets 

    A_i{x∈ A  :   d(x,γ^2_x(1))∈[1/i,i] and    d(γ^1_x(t),γ^2_x(t))/d(x,γ^2(t))∈[1/i,i] for all  t≤1/i},

and therefore there exists k∈ so that μ_0(A_k)>0. Notice that the sets A_i are measurable, since we can write A_i as the intersection of

    {x∈ A: d(x,γ_x^2(1))∈[1/i,i]}

and

    ⋂_t≤1/i
    t ∈ℚ{x∈ X:d(γ_x^1(t),γ_x^2(t))/d(x,γ_x^2(t))∈[1/i,i]}.

We now consider k ∈ fixed so that μ_0(A_k) > 0.

Step 2: localization to a chart

Now we are ready to localize the problem so that we may use properties of the Euclidean space to arrive to the contradiction. 

We will need to choose ε>0 sufficiently small to arrive to a contradiction with c-cyclical monotonicity in a (1+ε)-chart given by Theorem <ref>. 
We define

    ε := δ/100∈ (0,1/200),

where δ=δ(2k) ∈ (0,1/2) is the constant given by Lemma <ref> for the k fixed above.



Since μ_0 is purely (n-1)-unrectifiable and (X) is (n-1)-rectifiable by Theorem <ref>, we have μ_0(A_k∩(X))= μ_0(A_k). By Theorem <ref> we can cover the set (X) with open sets U for which the associated maps φ U→^n are (1+ε)-biLipschitz, and the limit  

    lim_t ↘ 0φ(γ(t))-φ(γ(0))/d(γ(t),γ(0))

exists for all geodesics γ⊂ U. Since X is a proper metric space, it is in particular hereditarily Lindelöf. Therefore, there exists a countable subcover ℱ of such open sets U. Hence, there exists U∈ for which μ_0(U∩ A_k)>0. Let φ U→^n be as in Theorem <ref>.


Step 3: discretization and choice of points for the contradiction

Next we take a subset of A_k∩ U where the direction of the two selected geodesics is independent of the point, up to a small error 

    ε̂ε/80k^4>0.

This is done by covering the set ^n by sets {B(y_i,ε̂)}_i∈.

Then there exist i, j and t_0>0 so that the set 

    B{x∈ A_k∩ U :    φ(γ^1_x(t))-φ(x)/t∈ B(y_i,ε̂), φ(γ^2_x(t))-φ(x)/t∈ B(y_j,ε̂),
       φ(γ^1_x(t)), φ(γ^2_x(t)) ∈ U for all  t≤ t_0}

has positive μ_0-measure. Notice that B is seen to be measurable by a similar argument than A_i. By relabeling, we may assume that i=1 and j=2.

Since φ is biLipschitz, the measure φ_#μ_0 is purely (n-1)-unrectifiable on ^n. Hence, by Lemma <ref> there exist points x_1,x_2∈ B such that

    φ(x_2)∈ C(φ(x_1),y_2-y_1/|y_2-y_1|, ε̂)∩ B(φ(x_1),r),

where r≤ε̂ is such that r≤t_0/2|y_2-y_1|. 
Now that we have selected the initial points x_1 and x_2 for the contradiction argument, we still need to
bring the target points close enough to x_1 and x_2 by contracting along the geodesics γ_x_1^2 and γ_x_2^1.
Since |φ(x_1)-φ(x_2)|<r, there exists the desired contraction parameter t≤ t_0 for which 

    2|φ(x_2)-φ(x_1)|= |ty_2-ty_1|.

We will now use as target points the points γ_x_1^2(t) and γ_x_2^1(t).

Step 4: verifying the bounds for Lemma <ref>

In the remainder of the proof we verify that the four selected points x_2,x_1,γ_x_1^2(t) and γ_x_2^1(t) give a contradiction with c-cyclical monotonicity.
Towards this goal we first check that we may apply Lemma <ref> with the selected δ.

First of all, we have by the definition of A_k that

    |φ(γ_x_1^2(t))-φ(γ_x_1^1(t))|/|φ(γ_x_1^2(t))-φ(x_1)|∈[1/(1+ε)^2k,(1+ε)^2k].


Since 

    ε̂≤ε/2(1+ε)k^2,

we have by the fact that x_1 ∈ A_k and φ is (1+ε)-biLipschitz, that 

    2tε̂≤ε/(1+ε)d(γ_x_1^2(t),x_1)/k≤ε d(γ_x_1^2(t),γ_x_1^1(t))/(1+ε)≤ε|φ(γ_x_1^2(t))-φ(γ_x_1^1(t))|.


Similarly, since ε̂≤ε/(1+ε)k, we have that

    tε̂≤ε|φ(γ_x_1^2(t))-φ(x_1)|.


Therefore, we have by the fact that x_1 ∈ B, the triangle inequality and the choice of ε and ε̂ that 

    |ty_2-ty_1|/|ty_2|   ≤|φ(γ_x_1^2(t))-φ(γ_x_1^1(t))|+2tε̂/|φ(γ_x_1^2(t))-φ(x_1)|-tε̂
       ≤(1+ε)/(1-ε)|φ(γ_x_1^2(t))-φ(γ_x_1^1(t))|/|φ(γ_x_1^2(t))-φ(x_1)|
       ≤(1+ε)/(1-ε)(1+ε)^2k< 2k

By similar arguments, we have that

    |ty_2-ty_1|/|ty_2|>1/2k.

Thus, by Lemma <ref> with the δ=δ(2k) already chosen accordingly, we have

    1/2|t(y_1+y_2)|^2/|ty_2|^2<(1-δ)(|ty_2|^2+|ty_1|^2)/|ty_2|^2,

that is,

    1/2|t(y_1+y_2)|^2<(1-δ)(|ty_2|^2+|ty_1|^2).


Step 5: the contradiction

We will then use the inequality (<ref>) to get to a contradiction with the c-cyclical monotonicity guaranteed by Lemma <ref>. Let us first estimate the terms on the right-hand side of (<ref>).

By the definition of y_1 and A_k we have that

    |ty_1|   ≤|ty_1-φ(γ_x_1^1(t))+φ(x_1)|+|φ(γ_x_1^1(t))-φ(x_1)|
       ≤ tε̂+(1+ε)d(γ_x_1(t),x_1)≤ tk+(1+ε)tk≤ 3tk.

Similarly, 
    |ty_2|≤ 3tk.

Therefore, we have that

    |1/2t(y_1+y_2)|,|1/2t(y_2-y_1)|≤ 3tk.


Using the definition of the set B, and (<ref>), (<ref>) and (<ref>), we have

    1/(1+ε)^2   d^2(x_2,γ^2_x_1(t)) ≤ |φ(γ^2_x_1(t))-φ(x_2)|^2
       =|1/2t(y_1+y_2)+(φ(γ^2_x_1(t))-φ(x_1)-ty_2)
    -(φ(x_2)-φ(x_1)-1/2t(y_2-y_1))|^2
       ≤(|1/2t(y_1+y_2)|+|φ(γ^2_x_1(t))-φ(x_1)-ty_2|
    +|φ(x_2)-φ(x_1)-1/2t(y_2-y_1)|)^2
       ≤ (|1/2t(y_1+y_2)|+tε̂+1/2|t(y_2-y_1)|ε̂)^2 
    ≤ (|1/2t(y_1+y_2)|+(3k+1)tε̂)^2 
       ≤ |1/2t(y_1+y_2)|^2 + 6tk (3k+1)tε̂+ ((3k+1)tε̂)^2
    ≤ |1/2t(y_1+y_2)|^2 + 40 t^2k^2ε̂

and similarly

    1/(1+ε)^2d^2(x_1,γ^2_x_2(t))≤ |1/2t(y_1+y_2)|^2 + 40 t^2k^2ε̂.


Thus, by summing the two terms, using (<ref>) and the fact that x_1 ∈ A_k,

    1/(1+ε)^2   [d^2(x_2,γ^2_x_1(t))+d^2(x_1,γ^1_x_2(t))]
     ≤ 2|1/2t(y_1+y_2)|^2+80 t^2k^2ε̂
       ≤1/2|t(y_1+y_2)|^2 + t^2/k^2ε≤1/2|t(y_1+y_2)|^2 + ε d^2(γ^2_x_1(t),x_1),
































Again,  by the definition of the set B and the choice of ε̂ 

    |ty_1|^2   ≤((1+ε)d(γ^1_x_2(t),x_2)+tε̂)^2≤((1+ε)d(γ^1_x_2(t),x_2) + ε d(γ^2_x_1(t),x_1))^2 
       ≤((1+ε)^2+2(1+ε)ε)d^2(γ^1_x_2(t),x_2) 
    +(ε^2 +2(1+ε)ε) d^2(γ^2_x_1(t),x_1)
       ≤ (1 + 7ε) d^2(γ^1_x_2(t),x_2) + 5ε d^2(γ^2_x_1(t),x_1)

and

    |ty_2|^2    ≤((1+ε)d(γ^2_x_1(t),x_1)+tε̂)^2
       ≤ (1+2ε)^2d^2(γ^2_x_1(t),x_1) ≤ (1+8ε) d^2(γ^2_x_1(t),x_1).


Using the inequalities (<ref>), (<ref>) and (<ref>), we get that

    1/2|t(y_1+y_2)|^2     <(1-δ)(|ty_2|^2+|ty_1|^2)
       ≤ (1-δ)(1+13 ε)(d^2(γ^2_x_1(t),x_1)+d^2(γ^1_x_2(t),x_2)).

Hence, by (<ref>), (<ref>), the fact that δ≤1/2 and the choice of ε, we have that 

    d^2(x_2,   γ^2_x_1(t))+d^2(x_1,γ^1_x_2(t))
       ≤ (1+ε)^2(1/2|t(y_1+y_2)|^2 + ε d^2(γ^2_x_1(t),x_1))
       ≤ (1+ε)^2(1-δ)(1+15ε)(d^2(γ^2_x_1(t),x_1)+d^2(γ^1_x_2(t),x_2))
       ≤ (1-δ)(1+100ε)(d^2(γ^2_x_1(t),x_1)+d^2(γ^1_x_2(t),x_2))
        <d^2(x_2,γ^1_x_2(t))+d^2(x_1,γ^2_x_1(t))

However, since (x_2,γ_x_2^1(1)),(x_1,γ_x_1^2(1))∈(π) we have by Lemma <ref> that 

    d^2(x_2,γ^1_x_2(t))+d^2(x_1,γ^2_x_1(t))≤ d^2(x_2,γ^2_x_1(t))+d^2(x_1,γ^1_x_2(t)).

which is a contradiction.
Therefore, the plan π is induced by a map.



















amsplain

