This paper proves the stability of optimal traffic paths in branched transport, demonstrating that limits of optimal paths remain optimal, thus resolving a previously open problem in the field.
Contribution
It establishes the full generality of stability results for optimal traffic paths in branched transport, removing previous restrictive assumptions.
Findings
01
Limit of optimal traffic paths is optimal
02
Addresses an open problem in branched transport stability
03
Provides a general proof applicable to broad cases
Abstract
We show in full generality the stability of optimal traffic paths in branched transport: namely we prove that any limit of optimal traffic paths is optimal as well. This solves an open problem in the field (cf. Open problem 1 in the book Optimal transportation networks, by Bernot, Caselles and Morel), which has been addressed up to now only under restrictive assumptions.
Equations275
Mα(T):=∫Eθ(x)αdH1(x),
Mα(T):=∫Eθ(x)αdH1(x),
W^{\alpha}(\mu^{-},\mu^{+}):=\inf\{\mathbb{M}^{\alpha}(T):\mbox{$T$ is a traffic path transporting $\mu^{-}$ onto $\mu^{+}$}\}.
W^{\alpha}(\mu^{-},\mu^{+}):=\inf\{\mathbb{M}^{\alpha}(T):\mbox{$T$ is a traffic path transporting $\mu^{-}$ onto $\mu^{+}$}\}.
\partial(x\times\!\!\!\!\!\times\,\mu)=\mu-\bigg{(}\sum_{i\in\mathbb{N}}\theta_{i}\bigg{)}\delta_{x}\quad\mbox{ and }\quad\mathbb{M}^{\alpha}(x\times\!\!\!\!\!\times\,\mu)\leq l\cdot\mathbb{M}^{\alpha}(\mu).
\partial(x\times\!\!\!\!\!\times\,\mu)=\mu-\bigg{(}\sum_{i\in\mathbb{N}}\theta_{i}\bigg{)}\delta_{x}\quad\mbox{ and }\quad\mathbb{M}^{\alpha}(x\times\!\!\!\!\!\times\,\mu)\leq l\cdot\mathbb{M}^{\alpha}(\mu).
μn(S(Q′,k))=0,\mboxforall(k,n)∈N2.
μn(S(Q′,k))=0,\mboxforall(k,n)∈N2.
Lj:=k∈N⋃Hj,k.
Lj:=k∈N⋃Hj,k.
μ(Lj+ρjej)=0.
μ(Lj+ρjej)=0.
M(μn)=M(νn),Mα(μn)+Mα(νn)≤C.
M(μn)=M(νn),Mα(μn)+Mα(νn)≤C.
μn(S(Q,k))=νn(S(Q,k))=0,\mboxforall(k,n)∈N2.
μn(S(Q,k))=νn(S(Q,k))=0,\mboxforall(k,n)∈N2.
\sigma_{n}:=\sum_{\ell=1}^{2^{kd}}\theta_{\ell}\delta_{x_{\ell}}\quad\mbox{ where $x_{\ell}$ is the barycenter of $Q_{\ell}$ and }\theta_{\ell}:=\nu_{n}(Q^{\ell})-\mu_{n}(Q^{\ell}).
\sigma_{n}:=\sum_{\ell=1}^{2^{kd}}\theta_{\ell}\delta_{x_{\ell}}\quad\mbox{ where $x_{\ell}$ is the barycenter of $Q_{\ell}$ and }\theta_{\ell}:=\nu_{n}(Q^{\ell})-\mu_{n}(Q^{\ell}).
\mathbb{M}^{\alpha}(\sigma_{n})=\sum_{\ell=1}^{2^{kd}}|\nu_{n}(Q^{\ell})-\mu_{n}(Q^{\ell})|^{\alpha}\leq\gamma,\quad\mbox{ for $n$ sufficiently large}.
\mathbb{M}^{\alpha}(\sigma_{n})=\sum_{\ell=1}^{2^{kd}}|\nu_{n}(Q^{\ell})-\mu_{n}(Q^{\ell})|^{\alpha}\leq\gamma,\quad\mbox{ for $n$ sufficiently large}.
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGeometric Analysis and Curvature Flows · Point processes and geometric inequalities · Stochastic processes and statistical mechanics
Full text
**On the well-posedness of branched transportation
**
Maria Colombo, Antonio De Rosa, and Andrea Marchese
Abstract.
We show in full generality the stability of optimal traffic paths in branched transport: namely we prove that any limit of optimal traffic paths is optimal as well.
This solves an open problem in the field (cf. Open problem 1 in the book Optimal transportation networks, by Bernot, Caselles and Morel), which has been addressed up to now only under restrictive assumptions.
This paper deals with optimizers of the branched transportation problem. Given a source μ− and a target μ+, positive measures on Rd with compact support, a traffic path transporting μ− onto μ+ is given by a 1-rectifiable current T whose boundary ∂T is μ+−μ−. This can be identified with a vector-valued measure T=T(θH1\vrulewidth=0.51663pt,height=5.16663pt,depth=0.12915pt\vrulewidth=3.44444pt,height=0.38748pt,depth=0.12915ptE) (with unit vector field T and non-negative multiplicity θ), supported on a bounded set E⊂Rd, which is contained in a countable union of curves of class C1 and having distributional divergence \mboxdivT=μ−−μ+.
Given a parameter α∈(0,1), quantifying the convenience of grouping particles during the transportation, we consider the α-mass of T
[TABLE]
and the minimal transport energy to connect μ− to μ+
[TABLE]
The optimizers in the minimization problem are called optimal traffic paths; the set of optimizers is denoted by OTP(μ−,μ+).
The existence of solutions is obtained by direct methods and in general one does not expect uniqueness. Arguably the main open question concerning the well-posedness of the problem, of special relevance in view of numerical simulations, is whether or not the optima are stable with respect to variations of the initial and final distribution of mass. In other words, we ask if the limit of suitable sequences of optima (with respect to the usual notion of convergence of vector-valued measures denoted by Tn⇀∗T) is still an optimum.
The main result of our paper provides a positive answer to this question, raised in [2, Problem 15.1], for every α∈(0,1).
**1.1. Theorem **(Stability of optimal traffic paths).
Let α∈(0,1), μ−,μ+ be mutually singular positive measures on B(0,R), R>0, satisfying μ−(Rd)=μ+(Rd). Let {μn−}n∈N,{μn+}n∈N be positive measures on B(0,R) such that μn−(Rd)=μn+(Rd) for every n∈N and
[TABLE]
and assume there exist Tn∈OTP(μn−,μn+) optimal traffic paths satisfying
[TABLE]
Then, the (non-empty) family of subsequential weak-∗ limits of Tn is contained in OTP(μ−,μ+).
**1.2. Remark **(H-masses).
With minor changes, Theorem 1.1 holds true for every H-mass. Namely we can replace the integrand x↦xα in (1.1) with a general function H:R→[0,∞) which is even, sub-additive, lower semi-continuous, monotone non-decreasing in (0,+∞), continuous in [math] and satisfies H(0)=0. These functionals have been widely studied (see e.g. [44, 21, 19, 9, 13, 34]).
The interest is twofold: firstly a general formulation of the branched transportation problem allows to consider several interesting models, which are relevant for applied mathematics and numerical approximations as in [9], secondly the possibility to prove the result in such generality shows the flexibility and the robustness of our strategy, which does not employ any peculiar property of the function x↦xα. In Remark 4.1 we detail how to modify the proof of Theorem 1.1 to include such generalization.
1.3. Background
In the case of discrete measures μ− and μ+, the minimization problem (1.2) was suggested by Gilbert [25], who proposed finite directed weighted graphs G as transportation networks. For arbitrary measures μ− and μ+, two generalizations of the the Gilbert problem have been proposed. On one hand, the above description in terms of traffic paths is due to Xia [45, 46], and it is related to a problem which arises in the characterization of weakly approximable Sobolev maps with values in a manifold [26].
On the other hand, a different model was introduced and studied in [29, 2]: here the transportation networks (called traffic plans) consist in measures
on the set of Lipschitz paths, where each path represents the trajectory of a single particle.
In both models, the existence of optimizers in the minimization problem has been established [45, 29, 1, 10, 40] (see also the reference book [2]). The correspondence between traffic plans and traffic paths can be established by means of Smirnov’s theorem on the structure of acyclic, normal 1-dimensional currents [43]. Indeed, the two
formulations were proved to be equivalent (see [2, 40] and references therein).
Under some restrictions on α,μ− and μ+, optimizers exhibit regularity properties both in the interior (roughly speaking, they are locally finite graphs) and close to their boundary, that is the supports of μ± [46, 5, 23, 36, 47, 7].
The models described above can be used and generalized to describe a variety of problems related to branched transportation: for instance, one can study the mailing problem [2] (for which the first stability result was proved in [18]), the urban planning model [8], including two different regimes of transportation, or the recent multi-material transport problem [32, 33], allowing simultaneous transportation of different goods or commodities. Recently, shape optimization problems related to the functional (1.1) were analysed in [41, 11] and similar branching structures are observed in superconductivity models and for minimizers of Ginzburg-Landau type functionals, see for instance [27, 14, 15, 16, 20].
Explicit optima are known only in few (mainly discrete) cases; for this reason, some effort has been put in developing numerical strategies to compute minimizers, for instance in term of phase-field approximations [37, 12, 4], in the spirit of numerical calibrations [35, 3], or exploiting the convex nature of different formulations of some aspects of the problem (which is overall highly nonconvex) [30, 31, 6].
**1.4. Remark **(Stability in previous works).
The answer to the stability question was previously known for α∈(1−\nicefrac1d,1]. In this case, a simple argument relies on the fact that the minimal transport energy Wα(νn,ν) metrizes the weak-∗-convergence of probability measures νn⇀∗ν (see [2, Lemma 6.11 and Proposition 6.12]). This property is false for α≤1−\nicefrac1d, as shown in [17]. The threshold
α=1−\nicefrac1d
appears also because for α above this value any two probability measures with compact support in Rd can be connected with finite cost. The same threshold is then recurrent in other results: for instance, above the threshold interior regularity holds (see [2, Theorem 8.14]) and a possible proof is obtained using the stability property.
1.5. Strategy of the proof
In analogy with previous works [1, 2, 17], to prove Theorem 1.1 we assume by contradiction that T is not optimal, denote Topt a minimizer, and we construct a better competitor for Tn (n large enough) by “sewing” a small portion of the traffic path Tn with a large portion of Topt.
In the following we shortly describe some of the main ideas and difficulties behind the proof of Theorem 1.1.
1.5.1. Lagrangian description of traffic paths
By means of Smirnov theorem we decompose the optimal path Tn as a superposition of curves without cancellations. At difference from previous works, our energy competitor for Tn is not only expressed in Lagrangian terms as a cut and paste of trajectories, to exploit the full power of the slicing operation defined for currents (see §3.4).
1.5.2. Cancellations in the Lagrangian description of T
A technical difficulty for our construction is related to the fact that, although the limit of the Lagrangian descriptions of Tn provides a Lagrangian description of T, the latter could contain cycles and cancellations at the level of currents. This issue did not appear in [17, Theorem 1.2] because there the convergence Tn⇀∗T was not necessary to obtain a cheap connection of the slices.
To overcome this and obtain a lower semi-continuity result which keeps track in the limit of those Lagrangian trajectories which have opposite orientations and therefore they would cancel at the Eulerian level, we employ some ideas from the theory of currents with coefficients in normed groups (see §3.9).
1.5.3. Sewing trajectories
Lemma 3.3 shows that, even though Mα does not metrize the weak-∗ convergence of measures for α below the critical threshold (as explained in Remark 1.4), this holds true on the class of atomic measures with uniformly bounded energy (the energy of an atomic measure is defined in (3.1)).
This lemma is applied to the slices of some portions of Tn and T along the boundary of small cubes and it allows us to have a cheap connection between Tn and T in proximity of the boundary. For such operation we need to exploit the convergence of the slices of Tn to the slices of T: for this reason we cannot directly connect the trajectories of Tn to the trajectories of Topt.
1.5.4. Comparison with previous strategies
In [17, Theorem 1.2] we employed a dimension-reduction argument to cut the trajectories of Tn and glue them with the trajectories of Topt.
There are three substantial differences in the approach we adopt in the present paper: firstly, in the previous work we guaranteed the smallness of the connection by making it act on a d−1 dimensional surface (hence the bound α>1−\nicefrac1d−1);
secondly, to guarantee the smallness of the connection we required that μ± were supported on an H1-null set;
lastly, while in [17, Theorem 1.2] the connection acted on Lagrangian trajectories, in this paper we need to perform the slicing at the Eulerian level of currents, possibly introducing cancellations in mass.
2. Notation and preliminaries
2.1. Sets and Measures
We add below a list of frequently used notations:
e1,…,ed
standard basis of Rd;
B(x,r)
open ball with center x and radius r;
A
closure of the set A;
1E
characteristic function of a set E, taking values [math] and 1;
Imγ
image (or support) of a curve γ;
∣v∣
Euclidean norm of a vector v∈Rd;
dist(x,A)
:=infy∈A{∣x−y∣}, distance between the point x and the set A; we also denote dist(A,B):=infy∈A{dist(y,B)} and B(A,ρ):={x:dist(x,A)<ρ};
M+(Y)
set of positive Radon measures on the space Y; we use P(Y) for the subset of probability measures;
fμ
measure associated to a measure μ and a
function f, namely
[fμ](E):=∫Efdμ;
push-forward of a measure μ on Y
according to a map f:Y→Y′, that is,
the measure on Y′ given by
[f#μ](E):=μ(f−1(E));
∣μ∣
total variation measure associated to a real- or vector-valued
measure μ; we call positive and negative part of a real-valued measure μ respectively the measures \nicefrac12(∣μ∣+μ) and \nicefrac12(∣μ∣−μ);
supp(μ)
support of μ; we say that μ is supported on E if ∣μ∣(Y∖E)=0; we say that two measures μ and ν are mutually singular if μ is supported on a set E such that ∣ν∣(E)=0;
M(μ)
:=∣μ∣(Y), mass of a measure μ on a space Y;
μ≤ν
means that μ(A)≤ν(A) for every Borel set A;
δx
Dirac delta at the point x;
Hk
k-dimensional Hausdorff measure;
Lp(μ)
space of p-integrable functions w.r.t. μ; we also use Lp(μ;V) for p-integrable functions with values in the normed space V.
∥⋅∥p
Lp-norm; we use ∥⋅∥∞ also to denote the supremum norm;
μn⇀∗μ
denotes the weak-∗ convergence of measures, that is ∫fdμn→∫fdμ for every f∈Cc0.
2.2. Rectifiable sets and currents
We recall here the basic terminology related to k-dimensional rectifiable sets and currents. We refer the reader to the introductory presentation given in the standard textbooks [42], [28] and to the most complete treatise [24]. For the purposes of this paper, we point out that in [17] the same was used and more extensively presented in the context of branched transport.
For k=0,1,…,d, a set E⊂Rd is said k-rectifiable if it can be covered, up to an Hk-negligible set, by countably many k-dimensional submanifolds of class C1.
In the sequel we use the following notation:
Tan(E,x)
tangent k-plane to the k-rectifiable set E at the point x (defined at Hk-a.e. x∈E);
Dk(Rd)
space of smooth and compactly supported differential k-forms on Rd. The topology on Dk(Rd) is analogous to the topology defined on the space of test functions with respect to which distributions are dual;
Dk(Rd)
space of k-dimensional currents in Rd, namely continuous linear functionals on Dk(Rd);
⟨T,ω⟩
duality pairing between a k-current T and a k-form ω. We use the same symbol for the duality pairing between a k-covector and a k-vector;
Tn⇀T
weak-∗ convergence of currents, namely ⟨Tn,ω⟩→⟨T,ω⟩ for every ω∈Dk(Rd);
∂T
boundary of T, that is the (k−1)-dimensional current defined via
⟨∂T,ϕ⟩:=⟨T,dϕ⟩ for every ϕ∈Dk−1(Rd);
∥ω∥
:=supx,τ{⟨ω(x),τ⟩: x∈Rd, τ is a unit simple k-vector} is the comass norm of the form ω;
M(T)
:=supω{⟨T,ω⟩: ∥ω∥≤1} is the mass of the current T;
T=T∣T∣
representation of a current with finite mass (or a vector valued measure)111Even though currents with finite mass and vector valued measures can be naturally identified, the convergence of currents does not imply in general convergence of vector valued measures. This is the reason for using the two different symbols μn⇀∗μ and Tn⇀T., namely
⟨T,ω⟩=∫Rd⟨ω(x),T(x)⟩d∥T∥(x), where ∣T∣∈M+(Rd) and T is a unit k-vector field. In particular M(T)=M(∣T∣);
supp(T)
support of T (in the distributional sense);
Nk(Rd)
normal currents, that is currents T such that both T and ∂T have finite mass;
∂+T,∂−T
(for T∈N1(Rd)) positive and negative part of the (finite) measure ∂T;
restriction of a current T with finite mass to the Borel set A, namely ⟨T\vrulewidth=0.51663pt,height=5.16663pt,depth=0.12915pt\vrulewidth=3.44444pt,height=0.38748pt,depth=0.12915ptA,ω⟩:=∫A⟨ω(x),T(x)⟩d∣T∣(x);
F(T)
flat norm of the current T, that is F(T):=inf{M(R)+M(S):T=R+∂S,R∈Dk(Rd),S∈Dk+1(Rd)};
Rk(Rd)
space of k-rectifiable currents, represented as T=[E,τ,θ], which means
⟨[E,τ,θ],ω⟩:=∫E⟨ω(x),τ(x)⟩θ(x)dHk(x), where E is a k-rectifiable set, τ(x) is a unit, simple k-vector field spanning Tan(E,x) for Hk-a.e x∈E, and θ∈Lloc1(Hk\vrulewidth=0.51663pt,height=5.16663pt,depth=0.12915pt\vrulewidth=3.44444pt,height=0.38748pt,depth=0.12915ptE); in particular M(T)=∫E∣θ(x)∣dHk(x);
Mα(T)
:=∫E∣θ∣α(x)dHk(x) is the α-mass of T, where α∈(0,1] and T=[E,τ,θ]. We set Mα(T)=+∞ for every T∈Nk(Rd)∖Rk(Rd).
**2.3. Remark **(Flat norm and weak-∗ convergence).
In general F(Tn−T)→0 implies that Tn⇀T. If the Tn’s are all supported on a common compact set, and they have equi-bounded masses and masses of the boundaries the reverse is also true. This fact can be easily deduced from [24, Theorem 4.2.17(1)].
2.4. Traffic paths
Fix R>0. From now on, by X we denote the closed ball of radius R in Rd centered at the origin. Following [45] and
[2], given two positive measures μ−,μ+∈M+(X) with the same total variation, we define the set TP(μ−,μ+) of the traffic paths connecting μ− to μ+ as
[TABLE]
and the minimal transport energy associated to μ−,μ+ as
[TABLE]
Moreover we define the set of optimal traffic paths connecting μ− to μ+ by
[TABLE]
As observed in [17, Proposition 2.5], in order to minimize the α-mass among currents with boundary in X, it is not restrictive to consider only currents supported in X.
2.5. Structure of optimal traffic paths and good decompositions
In the class of rectifiable 1-currents, some basic objects are given by the ones associated to Lipschitz simple curves with finite length. The aim of this subsection is to describe the so called “superposition principle” according to which every acyclic normal 1-current can be written as a weighted average of such curves.
We denote by Lip the space of 1-Lipschitz curves γ:[0,∞)→Rd which are eventually constant (and hence of finite length). For γ∈Lip we denote by T0(γ) and T∞(γ) the values
[TABLE]
Given γ∈Lip,
we call γ(∞):=limt→∞γ(t).
We say that a curve γ∈Lip is simple if γ(s)=γ(t) for every T0(γ)≤s<t≤T∞(γ) such that γ is non-constant in the interval [s,t].
We associate canonically to each simple curve γ∈Lip,
the rectifiable 1-current
Iγ:=[Imγ,\nicefracγ′∣γ′∣,1].It is easy to check that
M(Iγ)=H1(Imγ)
and
∂Iγ=δγ(∞)−δγ(0);
since γ is simple, if it is also non-constant, then γ(∞)=γ(0) and M(∂Iγ)=2.
A normal current T∈N1(Rd) is said acyclic if there exists no non-trivial current S such that
[TABLE]
We recall a fundamental result of Smirnov ([43]) which establishes that every acyclic normal 1-current can be written as a weighted average of simple Lipschitz curves in the following sense.
2.5.1. Definition (Good decomposition).
Let T∈N1(Rd) be represented as a vector-valued measure T∣T∣, and let P∈M+(Lip) be a finite positive measure, supported on the set of curves with finite length, such that
[TABLE]
namely for every smooth compactly supported 1-form φ:Rd→Rd it holds
[TABLE]
We say that P is a good decomposition of T if P is supported on non-constant, simple curves and satisfies the equalities
[TABLE]
[TABLE]
It has been shown in [38, Theorem 10.1] that optimal traffic paths T∈OTP(μ−,μ+) are acyclic, hence they admit such a good decomposition. In the next result, we collect some useful properties of good decompositions, whose proof can be found in [17, Proposition 3.6].
**2.6. Theorem **(Existence and properties of good decompositions)[39, Theorem 5.1] and [17, Proposition 3.6].
Let μ−,μ+∈M+(Rd) and T∈OTP(μ−,μ+) with finite α-mass. Then T is acyclic and there is a Borel finite measure P on Lip such that P is a good decomposition of T. Moreover, if P is a good decomposition of T∈N1(Rd) as in (2.2), the following statements hold:
(1)
*The positive and the negative parts of the signed measure ∂T are
*∂−T=∫Lipδγ(0)dP(γ)*and *∂+T=∫Lipδγ(∞)dP(γ).
2. (2)
If T=T[E,τ,θ] is rectifiable, then
∣θ(x)∣=P({γ:x∈Imγ}) for H1-a.e. x∈E.
3. (3)
For every P′≤P the representation
T′:=∫LipIγdP′(γ)
is a good decomposition of T′; moreover, if T=T[E,τ,θ] is rectifiable, then T′
can be written as T′=T[E,θ′,τ] with ∣θ′∣≤min{∣θ∣,P′(Lip)} and θ⋅θ′≥0, H1-a.e..
**2.7. Remark **(Lagrangian description of the limit).
Let Tn⇀T be a sequence of currents converging weakly-∗ with uniformly bounded mass and mass of the boundaries and let Pn be good decompositions of Tn. Up to a subsequence, Pn⇀∗P∈P(Lip) (thanks to (2.5) and to (2.4), which ensure pre-compactness of the sequence of measures). Then P might fail to be a good decomposition of T, but (2.2) remains valid.
Indeed, every smooth compactly supported 1-form ω, induces a continuous function on curves Lip∋γ→⟨Iγ,ω⟩ and we can test both weak-∗ convergences Tn⇀T and Pn⇀∗P to obtain the equality.
3. Preliminary results
Given a cube Q⊂Rd whose faces are parallel to the coordinate hyperplanes and k∈N we denote
[TABLE]
the collection of the 2kd cubes obtained dividing each edge of Q into 2k subintervals of equal length. We denote by
[TABLE]
the (d−1)-skeleton of the grid Λ(Q,k).
Moreover we denote by ρQℓ the concentric cube to Qℓ, with homothety ratio ρ.
Given two cubes Q,R , we define Lip(Q,R) as the set of curves in Lip which start in Q and end in R, namely
[TABLE]
Given an atomic measure μ∈M+(X) of the form μ=∑i∈Nθiδxi, we define its α-mass
[TABLE]
The alpha mass of a real-valued atomic measure is simply the sum of the α-mass of its positive and its negative part (the α-mass of a measure is considered to be infinite if the measure is not atomic).
If μ is atomic and supported on a cube Ql(x)⊂Rd, centred at x and with diameter l, the cone over μ with vertex x, is defined as the 1-current
[TABLE]
where Si is the 1-dimensional current canonically associated to the oriented segment connecting x to xi. It is easy to check that
[TABLE]
**3.1. Lemma **(Existence of a sequence of negligible nested grids).
Let Q⊂Rd be a cube. Let {μn}n∈N⊂M+(Q) be a countable family of measures. Then there exists a cube Q′⊃Q such that
[TABLE]
Proof.
Denote μ:=∑n∈N2−n\nicefracμnM(μn). Let Q′′ be cube such that d(Q,(Rd∖Q′′))≥1 and such that the edge length of Q′′ is an integer number. For every j=1,…,d and k∈N we denote
Hj,k the union of 2k+1 hyperplanes, orthogonal to ej, partitioning Q′′ into 2k slabs of equal volume. Denote also
[TABLE]
Since Lj+rej is disjoint from Lj+sej whenever r−s∈R∖Q, then for every j there exists ρj∈[0,1] such that
[TABLE]
We conclude that Q′:=Q′′+∑jρjej yields (3.4).
∎
3.2. A metrization property for Mα
We show that if a sequence μn of measures, satisfying a uniform bound on the α-masses, weak-∗ converges to a measure μ, then the connection cost Wα(μn,μ) converges to zero, for every α∈(0,1) (compare with Remark 1.4, which requires instead α>1−\nicefrac1d).
**3.3. Lemma **(Metrization property for Mα).
Let Q⊂Rd be a cube and C>0. Let μn,νn∈M+(Q) be atomic measures such that111We remind the reader that the symbol ⇀ denotes the weak-∗ convergence of [math]-currents. Under the assumptions of the lemma, this is equivalent to the weak-∗ convergence of the associated real-valued measures. μn−νn⇀0 and for all n∈N
[TABLE]
Then limn→∞Wα(μn,νn)=0.
Proof.
By Lemma 3.1 we can assume that, up to enlarging the cube Q,
[TABLE]
Now fix k∈N and γ>0; let {Qℓ}ℓ=1,…,2kd be the cubes in Λ(Q,k).
Denote by σn the real-valued measure
For every ℓ=1,…,2kd, we consider the cone over (μn−νn)\vrulewidth=0.51663pt,height=5.16663pt,depth=0.12915pt\vrulewidth=3.44444pt,height=0.38748pt,depth=0.12915ptQℓ of vertex xℓ as in (3.2)
[TABLE]
Its boundary is given by (μn−νn)\vrulewidth=0.51663pt,height=5.16663pt,depth=0.12915pt\vrulewidth=3.44444pt,height=0.38748pt,depth=0.12915ptQℓ+σn\vrulewidth=0.51663pt,height=5.16663pt,depth=0.12915pt\vrulewidth=3.44444pt,height=0.38748pt,depth=0.12915ptQℓ.
Denoting by l the diameter of Q and C1:=∑ℓ=12kdCℓ, we have
[TABLE]
and
[TABLE]
Denote also x the center of Q and C2:=x××σn. Again by (3.3) and (3.6), since ∑ℓ=12kdθℓ=0 we have
The conclusion follows from the arbitrariness of k and γ.
∎
3.4. Slicing
A fundamental tool for the proof of Theorem 1.1 is the notion of slicing of rectifiable 1-currents. Here we recall the definition and some fundamental properties. We refer the reader to [42, Section 28] for further details222As many classical references, [42] considers only rectifiable currents with integer multiplicities. It is easy to check that every statement we refer to is valid also in the case of real multiplicities..
**3.4.1. Definition **(Slicing of 1-rectifiable currents).
Let T=[E,τ,θ]∈R1(Rd) and let f:Rd→R be a Lipschitz function. For a.e. t∈R we define the slice of T according to f at t to be the 0-rectifiable current
[TABLE]
where:
•
Et=E∩f−1(t)* and it is at most countable (hence 0-rectifiable) for a.e. t;*
•
τt(x)=1* if the scalar product ∇Ef(x)⋅τ(x) is positive (where ∇Ef denotes the tangential gradient); τt(x)=−1 otherwise;*
•
θt=1Etθ.
We will use the following characterization of the slices (see [42, Lemma 28.5(2)]). Let T and f as above. Then
[TABLE]
for a.e. t∈(0,+∞).
We conclude this short review with a simple consequence of the Coarea formula for rectifiable sets (see [42, Lemma 28.5(1)]). Let T and f as above, then
[TABLE]
In the following, we choose f:=dx, where dx(z):=∥z−x∥∞.
**3.5. Lemma **(Estimate of Mα of suitable slices).
Let x,y∈Rd, r0>0,η0∈(1,2), {Tn=[En,τn,θn]}n∈N⊂R1(Rd) with Mα(Tn)≤C.
Then there exists a set of positive measure E⊆[r0,η0r0]
such that for every r∈E there exist infinitely many n∈N satisfying
[TABLE]
Proof.
For every n∈N we define the set
[TABLE]
We apply Chebyshev inequality and (3.11) to the 1-rectifiable current T~n=[En,τn,θnα]
to obtain
[TABLE]
[TABLE]
We deduce that H1(Fn)≥(η0−1)r0/2. By Fatou’s lemma
[TABLE]
hence there exists a set of positive measure of radii where limsupn→∞1Fn(r)=1. Any r in this set satisfies (3.12) (for a possibly r-dependent family of indices n).
∎
3.6. Improved lower semi-continuity
Given {x1,…,xN}∈Rd we consider a sequence of sets {Gk}k∈N with the following property. For every k there are closed disjoint cubes Q1k,…,QNk of diameters ρ1k,…,ρNk such that ρjk→0 for every j=1,…,N, as k→0, xj⊂Qjk for j=1,…,N and moreover Qjk⊃Qjh, for every h>k, for every j=1,…,N. Define
[TABLE]
3.7. Lemma.
Let {Gk}k∈N be as in (3.13) and let {Tn}n∈N⊂R1(Rd) and T∈R1(Rd) such that
[TABLE]
Then there exists a subsequence {Tnk} and a sequence of open sets Gk′⊂Gk such that
[TABLE]
Proof.
For every n∈N, let εn:=F(Tn−T). By assumption εn→0 as n→+∞. For every k∈N, let ρk>0 be such that ρk→0 as k→∞ and dist(Qik,Qjk)≥2ρk, for every 1≤i<j≤N. By definition of flat distance, for every n∈N there exist Rn,Sn such that Tn−T=Rn+∂Sn and M(Rn)+M(Sn)≤2εn. Choose nk such that 2εnk≤ρk2. By (3.11), for every k and for every j=1,…,N, there exists 0<rjk<ρk such that, denoting djk(x):=dist(x,Qjk), we have
[TABLE]
Denote Gk′:=Rd∖∪j=1NB(Qjk,rjk). Obviously Gk′⊂Gk for every k.
Moreover, since
[TABLE]
then in order to prove (3.15) it is sufficient to prove that
[TABLE]
Observe firstly that M(T\vrulewidth=0.51663pt,height=5.16663pt,depth=0.12915pt\vrulewidth=3.44444pt,height=0.38748pt,depth=0.12915pt(Rd∖Gk′))≤M(T\vrulewidth=0.51663pt,height=5.16663pt,depth=0.12915pt\vrulewidth=3.44444pt,height=0.38748pt,depth=0.12915pt(∪j=1NB(Qjk,ρk)))→0, as k→∞ because ∪j=1NB(Qjk,ρk) monotonically converges to the complementary of the H1-null set {x1,…,xN}, hence
[TABLE]
Therefore, it suffices to show that
[TABLE]
We can write, denoting ⟨Snk,∂Gk′⟩:=∑j=1N⟨Snk,djk,rjk⟩,
[TABLE]
Hence, denoting Rk′:=Rnk\vrulewidth=0.51663pt,height=5.16663pt,depth=0.12915pt\vrulewidth=3.44444pt,height=0.38748pt,depth=0.12915pt(Rd∖Gk′)+⟨Snk,∂Gk′⟩ and Sk′:=Snk\vrulewidth=0.51663pt,height=5.16663pt,depth=0.12915pt\vrulewidth=3.44444pt,height=0.38748pt,depth=0.12915pt(Rd∖Gk′), we have (Tnk−T)\vrulewidth=0.51663pt,height=5.16663pt,depth=0.12915pt\vrulewidth=3.44444pt,height=0.38748pt,depth=0.12915pt(Rd∖Gk′)=Rk′+∂Sk′, and, by (3.14), M(Rk′)+M(Sk′)≤ρk+2εnk, which tends to 0 as k→∞.
∎
**3.8. Lemma **(Semi-continuity with lower bound on the density).
Let T∈R1(Rd). For every Δ>0, there exists δT,Δ>0 satisfying the following property.
Let {Gk}k∈N be as in (3.13) and let {Tn}n∈N⊂R1(Rd) such that Tn=[En,τn,θn] and
[TABLE]
Then there exists kˉ∈N such that for any k≥kˉ and for infinitely many n (possibly depending on k)
[TABLE]
Proof.
Given Δ>0, let δT,Δ>0 be such that, by the lower semi-continuity of Mα with respect to the flat convergence (as stated in [19, Proposition 2.5]),
[TABLE]
Let us denote ε=(\nicefracδT,Δ2C)1−α1. By contradiction, there exist increasing sequences ki and mi such that
[TABLE]
By Lemma 3.7, there exists a subsequence {Tni}i∈N⊂{Tmi}i∈N and a sequence of open sets Gki′⊂Gki such that
[TABLE]
Moreover, since mi is an increasing sequence, we deduce that ni≥mi.
Combining (3.24), (3.21) and (3.20), for every i∈N, we deduce the desired contradiction
[TABLE]
∎
3.9. Currents with coefficients in RM
A technical difficulty in the proof of Theorem 1.1 comes from the fact that the limit of a sequence of good decompositions (as in Definition 2.5.1) is not necessarily a good decomposition. More precisely, we need a lower semi-continuity type result, which
heuristically keeps track in the limit of those Lagrangian trajectories which have opposite orientations and therefore they would cancel as classical currents. To this aim we require notions from the theory of currents with coefficients in groups. In particular we work in the normed group G:=(RM,∥⋅∥1) and we obtain in Lemma 3.10 a stronger statement with respect to the usual lower semi-continuity of the α-mass.
For the purposes of this paper it is sufficient to regard a current T on Rd with coefficients in RM as an ordered M-tuple of classical currents on Rd (i.e. with real coefficients), henceforth called the components of T, and denoted T1,…,TM.
In particular one can represent a rectifiable 1-current T on Rd with coefficients in RM as a triple [E,τ,Θ], where E is a 1-rectifiable set on Rd, τ is an orientation of E and Θ=(θ1,…,θM):E→RM, with Θ∈L1(H1\vrulewidth=0.51663pt,height=5.16663pt,depth=0.12915pt\vrulewidth=3.44444pt,height=0.38748pt,depth=0.12915ptE;RM). The components of T are the classical 1-rectifiable currents Tj:=[E,τ,θj], for j=1,…,M. The space of 1-rectifiable currents on Rd with coefficients in RM is denoted R1RM(Rd).
We refer the reader to [33, Section 4] for a more rigorous introduction.
For every α∈(0,1) and for T=[E,τ,Θ]∈R1RM(Rd) we define the quantity
[TABLE]
By [44, Section 6] this quantity is lower semi-continuous with respect to the standard notion of convergence in flat norm for currents with coefficients in groups, which by [33, Section 4.6] is equivalent to the joint convergence in flat norm of all components.
**3.10. Lemma **(Lower semi-continuity without cancellations).
For every n∈N, let {Tnℓ}ℓ=1M, {Tℓ}ℓ=1M⊂R1(Rd) with Tnℓ=[En,ℓ,τn,ℓ,θn,ℓ] and Tℓ=[Eℓ,τℓ,θℓ]. We assume that
[TABLE]
and
[TABLE]
We denote E=∪ℓ=1MEℓ and θ:x∈E↦∑ℓ=1M∣θℓ(x)∣. Then
[TABLE]
Proof.
We first observe that by (3.26), for every n∈N, there exists a unitary vector field τn on En:=∪ℓ=1MEn,ℓ such that
[TABLE]
For every ℓ=1,…,M, we can associate to the classical current Tnℓ the current Snℓ=[En,ℓ,τn,ℓ,θn,ℓeℓ]∈R1RM(Rd). Analogously we associate to the current Tℓ the currents Sℓ=[Eℓ,τℓ,θℓeℓ]. We define Sn:=∑ℓ=1MSnℓ and S:=∑ℓ=1MSℓ. In other words Sn is the current with coefficients in RM whose components are Tn1,…,TnM, while S has components T1,…,TM.
By (3.26), we can compute
[TABLE]
By the lower semi-continuity of MRMα, (see [44, Section 6]), we deduce that
Up to a simple scaling argument (detailed at the beginning of the proof of [17, Theorem 1.2]), we can assume without loss of generality that M(μn±)=M(μ±)=1. By contradiction, we assume that there exists a (non-relabelled) subsequence {Tn}n∈N and a traffic path T∈TP(μ−,μ+) such that F(Tn−T)→0 and T is not optimal. We consider Topt∈OTP(μ−,μ+) and denote
[TABLE]
Let δΔ/4>0 be defined as in Lemma 3.8 with respect to Δ/4 and T, denote
[TABLE]
and fix
[TABLE]
Step 1: Partitioning Smirnov curves of Tn according to their initial and final points.
Since Tn are optimal traffic paths, by Theorem 2.6 we can find for every n∈N a good decomposition (see Definition 2.5.1)
[TABLE]
Applying Lemma 3.1, we can find a cube Q containing X, such that
[TABLE]
Without loss of generality we will assume that the edge length of Q is 2, so that for every Qi∈Λ(Q,k) the distance between the center of Qi and ∂Qi is 2−k.
For every k∈N, we consider Λ(Q,k):={Qℓ}ℓ=12kd. Moreover, denoting Jk:={1,…,2kd}2 for every n∈N and every (i,j)∈Jk, we define
[TABLE]
which represents the portion of Tn associated to the paths which begin in Qi and end in Qj.
Notice that Tnij depends implicitly on k; we will not explicit this dependence in the proof, apart from the steps 8 and 9 where the dependence on k for the construction is more relevant.
By Theorem 2.6(3), we observe that (4.5) is a good decomposition. In particular, for every n∈N, denoting Tn=[En,τn,θn], we have that Tnij can be represented as Tnij=[En,τn,θnij], with θnij(x)⋅θn(x)≥0 and
[TABLE]
Step 2: Lagrangian description of T and partition of the associated trajectories.
By Theorem 2.6(2), ∣θn∣≤1 for H1-a.e. x. By (1.4), since Tn are optimal, we deduce the following tightness condition for Pn:
[TABLE]
By [2, Theorem 3.28], up to a further (non-relabelled) subsequence, Pn⇀∗P∈P(Lip). By [2, Lemma 3.21] P is supported on eventually constant curves, and by Remark 2.7
[TABLE]
Notice that in general (4.8) could fail to be a good decomposition of T in the sense of Definition 2.5.1.
Analogously to (4.5), one can define the portion of T associated to the paths which begin in Qi and end in Qj, as
[TABLE]
Again we recall that the latter may fail to be a good decomposition.
By Theorem 2.6(1) applied to Tnij and Pn, we deduce that
[TABLE]
where e0:γ∈Lip↦γ(0) and e∞:γ∈Lip↦γ(∞).
Passing to the limit in n, we deduce that
[TABLE]
For every (i,j)∈Jk we remark that Tnij⇀Tij. Since M(Tnij)≤1 and M(∂Tnij)≤1, by Remark 2.3, we have
[TABLE]
Indeed, Pn\vrulewidth=0.51663pt,height=5.16663pt,depth=0.12915pt\vrulewidth=3.44444pt,height=0.38748pt,depth=0.12915ptLip(Qi,Qj)⇀∗P\vrulewidth=0.51663pt,height=5.16663pt,depth=0.12915pt\vrulewidth=3.44444pt,height=0.38748pt,depth=0.12915ptLip(Qi,Qj), because they are obtained localizing the weakly-∗ converging sequence Pn⇀∗P to the set Lip(Qi,Qj),
whose boundary has [math] P-measure by (4.4):
[TABLE]
Step 3: Isolating “bad” cubes containing most of the atomic part of μ±.
In the following, given a measure ν∈M+(X), we denote by νa its atomic part, i.e. the only measure such that νa≤ν, νa is supported on a countable set and (ν−νa)({x})=0 for every x∈X.
Since μ± are finite measures, there exists N∈N, such that the sum of their atomic parts can be written as
[TABLE]
for some c1,…,cN∈R and N distinct points x1,…,xN∈X, (we are implicitly assuming that the two addenda in the RHS of (4.11) are mutually singular).
We observe that, for every k∈N, the set {xh:h=1,…,N} is contained in at most N cubes of Λ(Q,k). By (4.4), and since μ+,μ− are mutually singular, there exists k0 such that, for every k≥k0, all these cubes are disjoint (hence their mutual distances is larger or equal than the edge length of each cube, i.e. 2−k+1) and contain a single Dirac delta. For every k∈N, up to reordering, we denote these cubes by {Qh:h=1…,N}. Again, we do not explicit the dependence of these cubes on k, but we observe that their number N does not depend on k.
We recall that \nicefrac54Qh is the concentric cube to Qh, enlarged by the factor \nicefrac54, so that the cubes \nicefrac54Qh remain disjoint; we denote
[TABLE]
Since the sequence Bk converges monotonically decreasing to the finite set {xh:h=1…,N}, there exists k1≥k0 such that, for every k≥k1,
[TABLE]
Step 4: Multiplicity estimate for the pieces of Tn which do not connect bad cubes.
Since μd±:=μ±−μa± has trivial atomic part, then there exists k2≥k1 such that, for every k≥k2
Hence, by (1.3) and (4.4), for every k≥k2 there exists n0=n0(k) such that, for every n≥n0
[TABLE]
Since μ+ and μ− are mutually singular by assumption, and since each cube in {Qh:h=1…,N} contains at most 1 of the N points x1,…,xN, then by (4.11) and (4.14), for every k≥k2
[TABLE]
Hence, for every k≥k2, there exists n1=n1(k)≥n0(k) such that for every n≥n1
[TABLE]
Using Theorem 2.6 (1,3) applied to Tnij, we deduce from (4.17) that, for every couple of cubes Qi,Qj such that either Qi or Qj belong to Λ(Q,k)∖{Qh:h=1…,N}, for every k≥k2 and for every n≥n1,
[TABLE]
for H1-a.e. x∈En.
Step 5: Choice of slightly enlarged cubes to have a control on the slices.
In the following we use the short notation Snij(ρ) and Sij(ρ) to denote respectively
[TABLE]
where xi denotes the center of the cube Qi and dx is defined in §3.4.
For every k∈N, and for a given pair (i,j)∈Jk, applying Lemma 3.5, we get that, up to a (non relabelled) subsequence {Tn}n∈N, there exists a set of positive measure of radii ρkij∈(2−k,452−k) such that
[TABLE]
where the second inequality follows form Theorem 2.6 (3). Since by (4.10) and (3.10) for almost every radius ρkij
[TABLE]
by lower semi-continuity of Mα with respect to the flat convergence we deduce that
[TABLE]
Since for every k∈N the number of possible pairs (i,j) is finite, up to choosing iteratively a (non relabelled) subsequence {Tn}n∈N, we can assume that estimates (4.20) and (4.21) hold for every (i,j)∈Jk.
We observe that ∂Tnij\vrulewidth=0.51663pt,height=5.16663pt,depth=0.12915pt\vrulewidth=3.44444pt,height=0.38748pt,depth=0.12915pt(ρkijQi∪ρkijQj)=∂Tnij and analogously ∂Tij\vrulewidth=0.51663pt,height=5.16663pt,depth=0.12915pt\vrulewidth=3.44444pt,height=0.38748pt,depth=0.12915pt(ρkijQi∪ρkijQj)=∂Tij, which combined with (3.10) gives respectively
[TABLE]
and
[TABLE]
Consequently, we deduce respectively that
[TABLE]
We denote
[TABLE]
Step 6: Transport between ∂T and the corresponding slices S.
We observe that, since ∂Tnij=∂Tnij\vrulewidth=0.51663pt,height=5.16663pt,depth=0.12915pt\vrulewidth=3.44444pt,height=0.38748pt,depth=0.12915pt(Qi∪Qj), by (3.10)
[TABLE]
Analogously one can define T1ij and T1 as
[TABLE]
We have
[TABLE]
*Step 7: Connection of the slices of Tn and T. *
We define
[TABLE]
We observe that
[TABLE]
Indeed, the weak-∗ convergence holds because, by (4.20), we get
Moreover, thanks to (4.19) and (4.21) we have that
[TABLE]
Applying Lemma 3.3, for every k≥k2, there exists n2=n2(k)≥n1(k) such that for every n≥n2 there exists a transport Tn,conn such that
[TABLE]
Step 8: Improved semi-continuity of the energy to bound a modified density of T which neglects cancellations among different partitions.
In this step we will label the dependence of Tij and Tnij from k explicitly, with the notation Tkij and Tn,kij. In particular we write Tkij=[Ekij,τkij,θkij]. Let us consider the rectifiable set E=∪k∈N∪i,jEkij and θˉk=∑ij∣θkij∣. We claim that for H1-a.e. x∈E, the sequence θˉk(x) is non-decreasing in k and that, setting θˉ=supk∈Nθˉk, we have
[TABLE]
To prove this claim, we define the positive measures νkij:=∣θkij∣H1\vrulewidth=0.51663pt,height=5.16663pt,depth=0.12915pt\vrulewidth=3.44444pt,height=0.38748pt,depth=0.12915ptEkij∈M+(Rd) associated to Tkij and the measure νk:=∑ijνkij=θˉkH1\vrulewidth=0.51663pt,height=5.16663pt,depth=0.12915pt\vrulewidth=3.44444pt,height=0.38748pt,depth=0.12915ptE. By the good decomposition of Tn, we deduce that
[TABLE]
By (4.10) and (4.31), we can then apply Lemma 3.10 to the sequence Tn,kij to deduce that for every fixed k∈N
[TABLE]
Furthermore, we observe that νk≤νk+1 for every k∈N. Indeed,
[TABLE]
where we intend that Qs,Qt belong to Λ(Q,k+1) and Qi,Qj belong to Λ(Q,k).
Therefore
[TABLE]
Consequently, the monotonicity together with the uniform bound in k (4.32), yields (4.30).
Step 9: Energy estimate for T1.
We claim that there exist infinitely many indexes {kh}h∈N such that
[TABLE]
In the proof of this step we will trace the dependence of T1 from k explicitly with the notation T1k. We first observe that M(T1k)→0 as k→+∞.
To this aim, we denote by length(γ) the length of any curve γ∈Lip.
Since the function length is lower semi-continuous on Lip and Pn converge weakly-∗ as measures, by the good decomposition property (2.4) of Tn, and since finally by Theorem 2.6(2) the density of Tn is bounded by 1=Pn(Lip), we have
[TABLE]
Hence we know that length(γ)∈L1(P). Now we define
[TABLE]
and the function lengthk:Lip→[0,+∞) as
[TABLE]
We can then estimate
[TABLE]
As observed above, the limit P has the property that γ is an eventually constant curve for P-a.e. γ. We consequently deduce that lengthk(γ)→0 for P-a.e. γ∈Lip.
Moreover, lengthk(γ)≤length(γ).
Since length∈L1(P), by dominated convergence we deduce that
[TABLE]
By (4.35), there exists a subsequence {kh}h∈N such that the density θ1,kh of T1kh satisfies θ1,kh(x)→0 as h→∞ for H1-a.e. x∈E. Moreover, thanks to (4.30), we deduce that ∣θ1,kh∣α≤θˉkhα≤θˉα∈L1(H1\vrulewidth=0.51663pt,height=5.16663pt,depth=0.12915pt\vrulewidth=3.44444pt,height=0.38748pt,depth=0.12915ptE) (where the set E and the multiplicities θˉkh and θˉ have been defined in Step 8) and consequently, by dominated convergence, that
Step 10: Construction of the energy competitor for Tn.
In the rest of the proof we fix
[TABLE]
where kˉ and n are obtained in Lemma 3.8, with \nicefracΔ4 in place of Δ and {Gk}k∈N, {Tn}k∈N and T being those used so far in the proof of Theorem 1.1. We recall that k2 was defined (4.14), {kh} in (4.33), and n2(k) in (4.29).
In the first inequality we used that ε≤(\nicefracδΔ/42C)1−α1, by (4.3).
We define the following traffic path:
[TABLE]
This is a competitor for Tn, namely ∂Tn,comp=∂Tn. Indeed, thanks to (4.28), (4.27), and finally (4.29), we compute
[TABLE]
Step 11: Energy estimate and conclusion.
To estimate the energy of the competitor Tn,comp we first use the sub-additivity of Mα and the smallness of the energy contributions of Tn,conn and T1, in view of (4.29) and (4.33).
We obtain that
Next, we call T1:=Tn,1 and T2:=Tn\vrulewidth=0.51663pt,height=5.16663pt,depth=0.12915pt\vrulewidth=3.44444pt,height=0.38748pt,depth=0.12915pt(Gk∩{∣θn∣>ε}) and we estimate their densities.
We first observe that, by (4.12), it holds Gk∩(ρkijQi∪ρkijQj)⊂Bkc. This implies that for every x∈Gk∩(ρkijQi∪ρkijQj), either Qi or Qj belong to Λ(Q,k)∖{Qh:h=1…,N}.
Recalling the definition (4.25) Tn,1ij=Tnij\vrulewidth=0.51663pt,height=5.16663pt,depth=0.12915pt\vrulewidth=3.44444pt,height=0.38748pt,depth=0.12915pt(ρkijQi∪ρkijQj), applying (4.18), we can estimate the density of T1 as follows
[TABLE]
Notice that (4.38) may no longer hold for x∈/Gk: indeed (4.18) may fail if both Qi and Qj belong to {Qh:h=1…,N}.
On the other side, the density of T2 satisfies
[TABLE]
Combining the bounds (4.38) and (4.39), we deduce that
[TABLE]
We employ this inequality together with (4.26) in the energy estimate
[TABLE]
We plug this estimate in (4.37) and we recall that Mα(Tn)≤C, so that
[TABLE]
The estimate (4.41) contradicts the optimality of Tn.
4.1. Remark.
In the spirit of the works [44, 21, 19], we can replace x↦∣x∣α with more general functions H:R→[0,∞) that are even, sub-additive, lower semi-continuous, monotone non-decreasing in (0,+∞), continuous in [math] and satisfying H(0)=0. The associated functionals on traffic paths are usually called H-masses and are defined as
[TABLE]
The obvious analogue of Theorem 1.1 holds true. We divide the argument in two cases:
•
First case: limθ→0+\nicefracH(θ)θ=+∞. For every δ>0 there exists ε(δ,H)>0 such that \nicefracε(δ,H)H(ε(δ,H))<δ. One can repeat the proof of all the statements of Section 3 just changing Mα with MH. The only differences are in Lemma 3.8: the statement (3.19) becomes
[TABLE]
in the proof we choose ε:=ε(\nicefracδT,Δ2C,H) and we change (3.23) in
[TABLE]
We can then repeat verbatim Section 4, with the same proof of Theorem 1.1, just changing Mα with MH and modifying (4.36) according to the new version of Lemma 3.8.
•
Second case: liminfθ→0+\nicefracH(θ)θ<+∞. Then it is easy to show that the minimal transport energy
[TABLE]
defined analogously to (1.2), metrizes the weak-∗ convergence of measures. We can then simply repeat the proof in [2, Proposition 6.12] to get the validity of Theorem 1.1.
We observe moreover that the continuity of H in [math] is a necessary hypothesis for the validity of Theorem 1.1. Indeed consider the case of the size, i.e.
[TABLE]
Consider μ−:=δ0 and μ+:=δe1; for every n∈N we define
[TABLE]
Since μn− and μn+ are finite atomic measures, by [2, Proposition 9.1] the optimal traffic path Tn is a finite graph made of segments with no loops. Moreover, by (4.42), the energy is the sum of the length of the segments composing the graph.
In particular, the graph has to be connected, since both the points \nicefrace12+\nicefrace28 and e1 have to be connected to [math].
As a consequence, the energy of any traffic path in TP(μn−,μn+) must be bigger or equal than the length of the minimal tree connecting the three points, which is the union of the support of the following two curves γ1:[0,1]→Rd
[TABLE]
Hence WH(μn−,μn+)=417 for every n∈N and an optimal traffic path Tn∈OTP(μn−,μn+) is
[TABLE]
We observe that
[TABLE]
As previously observed MH(T)=\nicefrac174>1≥WH(μ−,μ+) (since the segment joining μ− and μ+ has energy one).
Since μn±⇀μ±, this inequality contradicts the stability.
Acknowledgments
M. C. was partially supported by the Swiss National Science Foundation grant 200021_182565. A. M. acknowledges partial support from GNAMPA-INdAM.
Bibliography47
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[1] M. Bernot, V. Caselles, and J.-M. Morel. The structure of branched transportation networks. Calc. Var. Partial Differential Equations , 32(3):279–317, 2008.
2[2] M. Bernot, V. Caselles, and J.-M. Morel. Optimal transportation networks. Models and theory. Lecture Notes in Mathematics, 1955. Springer, Berlin, 2009.
3[3] M. Bonafini, G. Orlandi, and E. Oudet. Variational approximation of functionals defined on 1-dimensional connected sets: the planar case. SIAM J. Math. Anal. , 50(6):6307–6332, 2018.
4[4] M. Bonnivard, A. Lemenant, and F. Santambrogio. Approximation of length minimization problems among compact connected sets. SIAM J. Math. Anal. , 47(2):1489–1529, 2015.
5[5] A. Brancolini, G. Buttazzo, and F. Santambrogio. Path functionals over Wasserstein spaces. J. Eur. Math. Soc. (JEMS) , 8(3):415–434, 2006.
6[6] A. Brancolini, C. Rossmanithand, and B. Wirth. Optimal micropatterns in 2d transport networks and their relation to image inpainting. Arch. Ration. Mech. Anal. , 228(1):, 279–308, 2018.
7[7] A. Brancolini and S. Solimini. Fractal regularity results on optimal irrigation patterns. J. Math. Pures Appl. (9) , 102(5):854–890, 2014.
8[8] A. Brancolini and B. Wirth. Equivalent formulations for the branched transport and urban planning problems. J. Math. Pures Appl. , 106(4):695–724, 2016.