This paper proves an attainability result for the minimum time function in a control problem within Wasserstein spaces, modeling multiagent systems with nonlocal constraints on the dynamics.
Contribution
It introduces a novel attainability theorem for control problems in Wasserstein spaces with nonlocal nonholonomic constraints on the vector field.
Findings
01
Establishes attainability of the minimum time function in Wasserstein spaces.
02
Models multiagent systems with nonlocal interaction constraints.
03
Provides a framework for control in probabilistic measure spaces.
Abstract
In this paper we establish an attainability result for the minimum time function of a control problem in the space of probability measures endowed with Wasserstein distance. The dynamics is provided by a suitable controlled continuity equation, where we impose a nonlocal nonholonomic constraint on the driving vector field, which is assumed to be a Borel selection of a given set-valued map. This model can be used to describe at a macroscopic level a so-called \emph{multiagent system} made of several possible interacting agents.
Tables1
the open ball of center and radius of a normed space ,
i.e., ;
the closure of a subset of a topological space ;
the distance function from a subset of a metric space ,
i.e. ;
the set of continuous bounded function from a Banach space to ,
endowed with (if , will be omitted);
the set of compactly supported functions of ,
with the topology induced by ;
the set of continuous curves from a real interval to ;
the set of continuous curves from to ;
the set of absolutely continuous curves from to ;
the evaluation operator
defined by for all ;
the set of Borel probability measures on a Banach space ,
endowed with the weak∗ topology induced by ;
the set of vector-valued Borel measures on with values in ,
endowed with the weak∗ topology induced by ;
the total variation of a measure ;
the absolutely continuity relation between measures defined on the same
-algebra;
the -moment of a probability measure ;
the push-forward of the measure by the Borel map ;
the product measure of with the Borel family of measures
;
the -th projection map ;
the set of admissible transport plans from to ;
the set of optimal transport plans from to ;
the -Wasserstein distance between and ;
the subset of the elements with finite -moment,
endowed with the -Wasserstein distance;
the Lebesgue measure on ;
the Radon-Nikodym derivative of the measure w.r.t. the measure ;
the Lipschitz constant of a function .
the set of admissible trajectories defined in (3.1).
\mathcal{A}^{p}_{I}(\mu):=\left\{\boldsymbol{\mu}=\{\mu_{t}\}_{t\in I}:\,\begin{array}[]{l}\boldsymbol{\mu}\textrm{ is an admissible trajectory}\\
\textrm{with }\mu_{a}=\mu\end{array}\right\}.
\mathcal{A}^{p}_{I}(\mu):=\left\{\boldsymbol{\mu}=\{\mu_{t}\}_{t\in I}:\,\begin{array}[]{l}\boldsymbol{\mu}\textrm{ is an admissible trajectory}\\
\textrm{with }\mu_{a}=\mu\end{array}\right\}.
Ψ(x,γ):=⎩⎨⎧(∣x∣+∣γ(0)∣+∥γ˙∥L∞)p, if γ∈Lip([0,T];Rd),+∞, otherwise,
Ψ(x,γ):=⎩⎨⎧(∣x∣+∣γ(0)∣+∥γ˙∥L∞)p, if γ∈Lip([0,T];Rd),+∞, otherwise,
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Full text
Attainability property for a probabilistic target in Wasserstein spaces
In this paper we establish an attainability result for the minimum time function
of a control problem in the space of probability measures endowed with Wasserstein distance.
The dynamics is provided by a suitable controlled continuity equation,
where we impose a nonlocal nonholonomic constraint on the driving vector field,
which is assumed to be a Borel selection of a given set-valued map.
This model can be used to describe at a macroscopic level a so-called multiagent system
made of several possible interacting agents.
Key words and phrases:
optimal transport, differential inclusions, time optimal control
2010 Mathematics Subject Classification:
34A60, 49J15
1. Introduction
We consider a finite-dimensional multiagent system, i.e., a system in Rd where the number of agents is so large that only a macroscopic
description is available. As usual in this framework, in order to describe the behaviour of the system at a certain time t, we introduce a Borel positive measure μt on Rd
whose meaning is the following: given a Borel set A⊆Rd the quantity
μt(Rd)μt(A) represents the fraction of the total number of agents that are present in A at the time t.
We will assume that the system is isolated, thus the total number of agents remains constant in time. Hence, by normalizing the measure μt,
we can always assume μt(Rd)=1, i.e., μt is a probability measure for all t.
The macroscopic evolution of the system is thus given by a curve t↦μt in the space of probability measures.
Due to the mass-preserving character of the evolution, we can assume that such an evolution is governed by the continuity equation
[TABLE]
to be satisfied in a distributional sense, where vt is a suitable time-depending Borel vector field describing the macroscopic mass flux during the evolution.
It can be easily proved, see e.g. [CM-LSSC17], that for a.e. t and μt-a.e. x∈Rd the vector field vt(x) can be constructed as a weigthed average of the velocities of the agents passing through
the point x at time t, where the weights are given by the fraction of the mass carried by each agent w.r.t.
the total amount of mass flowing through x at time t.
In particular, possibly nonlocal nonholonomic constraints on the agents’ motion will reflect into constraints for the possible choices of vt.
In this paper we consider a situation where each agent is constrained to follow the trajectories of a differential inclusion with a nonlocal dependence
on the overall configuration of the agents. This fact models the possible nonlocal interaction among the agents.
Examples of such interactions are quite commmon in the models of pedestrian dynamics, flocks of animals and social dynamics in general.
Due to the potential applications, the literature on control of multi-agent systems is growing quite fast in the recent years.
Among the most recent contributions, we mention [CFPT], where the authors investigate a controllability problem for a leader-follower model in a finite-dimensional setting
and their aim is to achieve an alignment consensus for a mass of indistinguishable agents when the action of an external policy maker
is sparse, i.e. concentrated on few individuals. In [FPR] it is provided a mean-field formulation of the same model through Gamma-convergence techniques.
The relevance of such kind of results is enhanced when dealing with problems involving a considerable number of individuals,
in order to circumvent the bounds coming from the curse of dimensionality: indeed, the mean-field limit can be used as a realistic approximation
when the number of agents is huge. Results in this direction are provided for example by [FLOS] or the preprint paper [CLOS],
where the authors study a Gamma-convergence result for an optimal control problem of a N-particles system subject to a nonlocal dynamics
when N→+∞.
Controllability conditions in the space of probability measures are also analyzed in the preprints [DMR1], [DMR2].
In particular, the aim of the authors is to provide sufficient conditions in order to steer an initial configuration of agents into a
desired final one, by acting through a control term on the vector field, under the constraint that the action can be implemented only in
a certain fixed space region.
Also the extension of classical viability theory to multi-agent systems is attracting an increasing interest in the community.
Similarly to the finite-dimensional framework, a subset K of probability measures is said to be viable for a controlled dynamics if it is possible to
keep the evolution confined inside K by acting with an admissible control when starting with a initial state in K.
We refer to [Aver] for first results in this direction based on a geometric approach (tangent cones to K) and to the preprint [CMQ] for a viscous-type approach to the problem.
It is worth pointing out that a key feature of all these studies, and many others available in the literature, is the combined use of tools, concepts, and techniques from optimal transport theory, measure theory,
and from optimal control theory.
In this paper, we deal with a time-optimal control problem. More precisely, given a target set of desired final configurations, we are interested in the minimum time needed
to steer the agents to it starting from an initial distribution, and respecting the nonholonomic constraints. In particular, in our measure-theoretic setting, the target set is given in duality
with the space Cb0(Rd) of continuous and bounded functions as follows. Given a family of observables Φ⊆Cb0(Rd), the target set is defined as
(see Definition 4.2)
[TABLE]
where (Pp(Rd),Wp), with p≥1, is the p-Wasserstein space of probability measures endowed with the metric Wp (see Definition 2.4).
Section 4 is entirely devoted to the analysis of topological properties of this class of generalized target sets.
In Section 3, we study the set of admissible trajectories AIp(μ) defined on a time interval I⊂R and starting from a given initial
datum μ∈Pp(Rd), i.e., those absolutely continuous curves in Pp(Rd) whose driving velocity field satisfies the nonlocal nonholonomic
constraint given by a set-valued map F:Pp(Rd)×Rd⇉Rd
[TABLE]
This equation represents the controlled dynamics of the system.
The results obtained, expecially Theorem 3.11 providing Filippov-Gronwall type estimates, are then used in Section 5 where we study the
main object of the paper, i.e., the minimum time function defined as
[TABLE]
More precisely, we first prove the existence of optimal trajectories, lower semicontinuity of the minimum time function and a Dynamic Programming Principle as in the classical case.
In the case without interactions, by passing to the limit in the Dynamic Programming Principle,
in [CMNP] the authors proved that the minimum time function solves in a suitable viscosity sense an Hamilton-Jacobi-Bellman equation in the spaces of measures provided that it is continuous (not just l.s.c.),
and further development on this theory have been recently done in [MQ, JMQ]. We refer the reader to [AGa, GT2019, GS] for an introduction to Hamilton-Jacobi
equations in Wasserstein spaces.
The aim of this paper is to provide a sufficient condition for the continuity of the minimum time function in this framework, i.e., sufficient conditions granting Small Time Local Attainability (STLA) in the sense of [KQ].
Indeed, assuming STLA, in Proposition 5.4 we get the continuity of the minimum time function thanks to the Filippov estimate proved in Theorem 3.11 and the Dynamic Programming Principle.
Sufficient conditions for STLA are finally provided in the main Theorem 5.9, assuming geometric properties of the generalized target set S~pΦ together with a sort of gradient-descent behavior of the associated family of observables Φ when integrated along admissible trajectories (see Definition 5.6). This condition represents a weakening of the well-known Petrov’s condition in the classical framework.
The paper is structured as follows: in Section 2 we fix the notation and review some basic results about measure theory,
optimal transport and set-valued analysis, in Section 3 we prove some basic properties of the admissible trajectories in the space of measures,
in Section 4 we discuss some geometric properties of the target sets. In Section 5 we state our main result concerning
the continuity of the minimum time function, and finally in Section 6 we compare our sufficient condition for STLA with the finite-dimensional one of [KQ].
2. Preliminaries and notation
In this section we review some concepts from measure theory, optimal transport and set-valued analysis.
Our main references for this part are [AGS], [AuF], and [Vil].
We will use the following notation.
In this section we give some preliminaries and fix the notation. Our main reference for this part is [AGS].
Definition 2.1** (Space of probability measures).**
Given Banach spaces X,Y, we denote by P(X) the set of Borel probability measures on X endowed with the weak∗ topology
induced by the duality with the Banach space Cb0(X) of the real-valued continuous bounded functions on X with the uniform convergence norm.
For any p≥1, the p-moment of μ∈P(X) is defined by mp(μ)=∫X∥x∥Xpdμ(x), and
we set Pp(X)={μ∈P(X):mp(μ)<+∞}.
For any Borel map r:X→Y and μ∈P(X), we define the push forward measurer♯μ∈P(Y)
by setting r♯μ(B)=μ(r−1(B)) for any Borel set B of Y.
Definition 2.2** (Total variation).**
Let X,Y be Banach spaces, and denote by M(X;Y) the set of Y-valued Borel measures defined on X.
The total variation measure of ν∈M(X;Y) is defined for every Borel set B⊆X as
[TABLE]
where the sup ranges on the set of countable collections {Bi}i∈N of pairwise disjoint Borel sets
such that i∈N⋃Bi=B.
For the following result see [AGS, Theorem 5.3.1].
Theorem 2.3** (Disintegration).**
Given a measure μ∈P(X) and a Borel map r:X→X, there exists a family of probability
measures {μx}x∈X⊆P(X),
uniquely defined for r♯μ-a.e. x∈X, such that μx(X∖r−1(x))=0 for r♯μ-a.e. x∈X, and
for any Borel map φ:X→[0,+∞] we have
[TABLE]
We will write μ=(r♯μ)⊗μx.
If X=X×Y and r−1(x)⊆{x}×Y for all x∈X, we can identify each measure μx∈P(X×Y) with a measure on Y.
Definition 2.4** (Transport plans and Wasserstein distance).**
Let X be a complete separable Banach space, μ1,μ2∈P(X). We define the set of admissible transport plans between μ1 and μ2 by setting
[TABLE]
where for i=1,2, we defined pri:Rd×Rd→Rd by pri(x1,x2)=xi.
The inverseπ−1 of a transport plan π∈Π(μ,ν) is defined by π−1=i♯π∈Π(ν,μ),
where i(x,y)=(y,x) for all x,y∈X.
The p-Wasserstein distance between μ1 and μ2 is
[TABLE]
If μ1,μ2∈Pp(X) then the above infimum is actually a minimum, and we define
[TABLE]
The space Pp(X) endowed with the Wp-Wasserstein distance is a complete separable metric space, moreover
for all μ∈Pp(X) there exists a sequence {μN}N∈N⊆co{δx:x∈suppμ} such that Wp(μN,μ)→0 as N→+∞.
Remark 2.5*.*
Recalling formula (5.2.12) in [AGS], we have
[TABLE]
for all μ∈Pp(Rd). In particular, if t↦μt is Wp-continuous, then t↦mp1/p(μt) is continuous.
Definition 2.6** (Set-valued maps).**
Let X,Y be sets. A set-valued map F from X to Y is a map associating to each x∈X a (possible empty) subset F(x) of Y. We will write F:X⇉Y to denote a set-valued map from X to Y.
The graph of a set-valued map F is
[TABLE]
while the domain of F is domF:={x∈X:F(x)=∅}⊆X.
A selection of F is a map f:domF→Y such that f(x)∈F(x) for all x∈domF.
When X,Y are topological spaces, we say that
•
F has closed images if F(x) is closed in Y for every x∈X,
•
F has closed graph if graphF is closed in X×Y,
•
F is compact valued (or that it has compact images) if F(x) is compact for every x∈X,
•
F is upper semicontinuous at x∈X if for every open set V⊆Y such that V⊇F(x)
there exists an open neighborhood U⊆X of x such that F(z)⊆V for all z∈U.
•
F is lower semicontinuous at x∈X if for every open set V⊆Y such that V∩F(x)=∅ there exists an open neighborhood U⊆X of x such that F(z)∩V=∅ for all z∈U.
•
F is continuous at x∈X if it is both lower and upper semicontinuous at x.
•
F will be called continuous (resp. lower semicontinuous, upper semicontinuous) if it is continuous (resp. lower semicontinuous, upper semicontinuous) at every x∈X.
When Y is a vector space, F is convex valued (or it has convex images) if F(x) is convex for every x∈X.
When X,Y are measurable spaces, we say that F is measurable if graphF is measurable in X×Y endowed with the product of σ-algebrae on X and Y.
When (X,d) is a metric space and Y is a normed space, given L>0 we say that F is Lipschitz continuous with constant L if for all x1,x2∈X
[TABLE]
where the sum and the product of sets are in the Minkowski sense: A+B={a+b:a∈A,b∈B} and λA={λa:a∈A} for every A,B⊆Y, λ∈R.
3. Admissible trajectories
Given a collection μ={μh}h∈I⊆P(X) of Borel measures on the measure space X indexed by a parameter h∈I, by a slight abuse of notation we will denote by μ both the set μ={μh}h∈I⊆P(X) and the function h↦μh. In each occurrence, the context will clarify what we are referring to.
Definition 3.1** (Admissible trajectories).**
Let I=[a,b] be a compact real interval, μ={μt}t∈I⊆Pp(Rd), ν={νt}t∈I⊆M(Rd;Rd),
F:Pp(Rd)×Rd⇉Rd be a set-valued map.
We say that μ is an admissible trajectory driven byν defined on I with underlying dynamics F if
•
∣νt∣≪μt for a.e. t∈I;
•
vt(x):=μtνt(x)∈F(μt,x) for a.e. t∈I and μt-a.e. x∈Rd;
•
∂tμt+divνt=0 in the sense of distributions on [0,T]×Rd, equivalently
[TABLE]
for a.e. t∈[0,T] and all φ∈Cc1(Rd).
Define AIp:Pp(Rd)⇉C0([0,T];Pp(Rd)) by
[TABLE]
When I and p are clear by the context, we will omit them.
Let Ii=[ai,bi], μ(i)={μt(i)}t∈Ii∈AIip(μai(i)), i=1,2, be satisfying μb1(1)=μa2(2). We define I3=[a1,b1+b2−a2] and
μ(3)={μt(3)}t∈I3 by setting μt(3)=μt(1) for t∈I1 and
μt(3)=μt+a2−b1(2) for t∈I3∖I1. The curve μ(3)
will be called the concatenation of μ(1) and μ(2) and will be denoted by
μ(3)=μ(1)⊙μ(2). By [DNS, Lemma 4.4], we have
μ(3)∈AI3p(μa1(1)).
Let I=[a,b], J=[a′,b′] with J⊆I, and μ={μt}t∈I∈AIp(μa).
The restrictionμ∣J={μ^t}t∈J of μ to J is defined by
taking μ^t=μt for all t∈J and we have μ∣J∈AJp(μa′).
Let μ(i)∈AIip(μ(i)), i=1,2. We say that μ(2)
is an extension of μ(1) if I2⊇I1 and μ∣I1(2)=μ(1).
Throughout the paper, we will assume the following
Hypothesis 3.3**.**
The set-valued map F:Pp(Rd)×Rd→Rd has nonempty, convex and compact images, moreover
it is Lipschitz continuous with constant L>0 with respect to the metric
[TABLE]
on Pp(Rd)×Rd. We set KF:=v∈F(δ0,0)max{∣v∣}.
Definition 3.4** (Definition of ΥF).**
Assume Hypothesis 3.3 for F. Let θ={θt}t∈[0,T] be a Wp-continuous curve in Pp(Rd), μ∈Pp(Rd).
Denote by ΥF(μ,θ) the set of μ={μt}t∈[0,T]⊆Pp(Rd) satisfying
the following property: there exists η∈P(Rd×ΓT) such that
•
μt=et♯η for all t∈[0,T], μ0=μ;
•
for η-a.e. (x,γ)∈Rd×ΓT and a.e. t∈[0,T] it holds γ∈AC([0,T]), γ(0)=x, γ˙(t)∈F(θt,γ(t)) .
We set Mθ:=τ∈[0,T]supmp1/p(θτ) and
[TABLE]
On the set X:=Pp(Rd)×C0([0,T];Pp(Rd)) we define the metric
[TABLE]
where θ(i)={θt(i)}t∈[0,T], i=1,2.
Finally, we define the set-valued map Sθ:Rd⇉ΓT by setting for all y∈Rd
[TABLE]
Since t↦F(θt,x) is continuous for all x∈Rd and x↦F(θt,x) is Lipschitz continuous by Hypothesis 3.3, with constant L
for all t∈[0,T], the set-valued map Sθ(⋅) is Lipschitz continuous by [AuF, Corollary 10.4.2].
Lemma 3.5** (Estimates on the moments).**
Assume Hypothesis 3.3 for F.
Let θ={θt}t∈[0,T] be a Wp-continuous curve in Pp(Rd), μ∈Pp(Rd). Let Ξ(μ,θ), ΥF(μ,θ) and Mθ be as in Definition 3.4, and let η∈Ξ(μ,θ) and μ={μt}t∈[0,T]∈ΥF(μ,θ) such that μt=et♯η for all t∈[0,T].
Then for all t,s∈[0,T]
[TABLE]
Proof.
Set μ={μt}t∈[0,T]∈ΥF(μ,θ).
For η-a.e. (x,γ)∈Rd×ΓT and a.e. t∈[0,T] we have
[TABLE]
Thus for all s,t∈[0,T] and a.e. τ∈[0,T]
[TABLE]
By Grönwall lemma, this implies for all 0≤s≤t∈[0,T]
[TABLE]
recalling that γ˙(s)∈F(μs,γ(s)) for a.e. s.
We conclude by taking the Lηp norm of the above inequalities and using the triangular inequality.
∎
Proposition 3.6** (Upper semicontinuity of the solution map).**
Set X:=Pp(Rd)×C0([0,T];Pp(Rd)).
The set-valued map ΥF:X⇉C0([0,T];Pp(Rd)), defined in Definition 3.4, is upper semicontinuous with compact nonempty images.
Proof.
We prove first that ΥF(μ,θ)=∅ for all (μ,θ)∈X.
Consider now the set-valued map Sθ(⋅) defined as in Definition 3.4.
Since it is Lipschitz continuous, it has a Borel selection. Thus let h0:Rd→AC([0,T]) be a Borel map such that h0(x)∈Sθ(x) for every x∈Rd.
Define η=μ⊗δh0(x), μt=et♯η, μ={μt}t∈[0,T]. Then, by construction, we have μ∈ΥF(μ,θ).
Let now {(μ(n),θ(n))}n∈N⊆X be a sequence dX-converging to (μ,θ)∈X,
and {μ(n)}n∈N⊆C0([0,T];Pp(Rd)), {η(n)}n∈N⊆P(Rd×ΓT)
be such that
•
θ(n)={θt(n)}t∈[0,T], θ={θt}t∈[0,T];
•
μ(n)∈ΥF(μ(n),θ(n)) and η(n)∈Ξ(μ(n),θ(n)) for all n∈N;
•
μ(n)={μt(n)}t∈[0,T] with μt(n)=et♯η(n) for all t∈[0,T] and n∈N,
where Ξ(⋅,⋅) is defined as in Definition 3.4.
We prove that the sequence {μ(n)}n∈N has always cluster points, and all the cluster points are contained in ΥF(μ,θ).
This will imply in particular that ΥF(⋅) has compact images (by taking constant sequences (μ(n),θ(n))≡(μ,θ)).
For n sufficiently large, we have mp1/p(μ(n))≤mp1/p(μ)+1 and Mθ(n)≤Mθ+1,
recalling the definition of the convergence in X and the definition for Mθ given in Definition 3.4.
Thus, by applying the estimates of Lemma 3.5, we have
[TABLE]
In particular
•
{μ(n)}n∈N is equicontinuous;
•
for all t∈[0,T], we have that {μt(n)}n∈N is relatively compact in Pp(Rd), since it has p-moment uniformly bounded.
Thus {μ(n)}n∈N is relatively compact in C0([0,T];Pp(Rd)) by Ascoli-Arzelà theorem.
Up to passing to a subsequence, we may assume that there exists μ={μt}t∈[0,T]∈C0([0,T];Pp(Rd)) such that
[TABLE]
We notice also that the functional Ψ:Rd×ΓT→R∪{+∞}
[TABLE]
has compact sublevels in Rd×ΓT by Ascoli-Arzelà theorem.
Since
[TABLE]
we have that {η(n)}n∈N is tight in P(Rd×ΓT). Thus, up to passing to a subsequence,
we may assume also that there exists η∈P(Rd×ΓT) such that η(n)⇀η narrowly.
By the continuity of et:Rd×ΓT→Rd, we have μt=et♯η.
By [AGS, Proposition 5.1.8], for η-a.e. (x,γ)∈Rd×ΓT there exists a sequence {(xn,γn)}n∈N
such that xn=γn(0), γn∈AC([0,T]), γ˙n(t)∈F(θt(n),γn(t)) for a.e. t∈[0,T] and for all n∈N
with xn→x, ∥γn−γ∥∞→0 as n→+∞.
By (3.2) and recalling that Mθ(n)≤Mθ+1 and ∣xn∣≤∣x∣+1 for n sufficiently large,
we have n∈N,
[TABLE]
In particular, by Ascoli-Arzelà Theorem, we have that γ is Lipschitz continuous.
For a.e. t,τ∈[0,T] we have also
[TABLE]
For every ε>0 there is nε∈N such that if n>nε we have for a.e. t,τ∈[0,T]
[TABLE]
In particular, let t∈[0,T] be a differentiability point of γn. We have for all z∈Rd, s∈[0,T], s=t, and n>nε
[TABLE]
By letting n→+∞ and s→t we conclude that γ˙(t)∈F(θt,γ(t)) since F(θt,γ(t)) is closed and convex.
Hence μ∈ΥF(μ,θ), which completes the proof.
∎
Proposition 3.7** (Superposition Principle).**
Assume Hypothesis 3.3 for F, and let T>0.
Then μ={μt}t∈[0,T] is an admissible trajectory if and only if μ∈ΥF(μ0,μ), with ΥF(⋅,⋅) defined in Definition 3.4.
Proof.
(1)
Sufficience. Assume that μ={μt}t∈[0,T]∈ΥF(μ0,μ). Let Ξ(⋅,⋅) be as in Definition 3.4.
Then there exists η∈Ξ(μ0,μ) such that μt=et♯η.
Set
[TABLE]
Since L1⊗η(N)=0,
for η-a.e. (x,γ)∈Rd×ΓT and a.e. t∈[0,T] we have that γ˙(t) exists and belongs to F(μt,γ(t)), and γ(0)=x.
Given φ∈Cc1(Rd), we have
is Lipschitz continuous. Hence its distributional derivative is in L∞ and coincides with the pointwise derivative almost everywhere.
Thus, in the sense of distributions in ]0,T[, we obtain for all φ∈Cc1(Rd)
[TABLE]
where we disintegrated η w.r.t. et obtaining η=μt⊗ηt,y and used the fact that ∥∇φ∥∞ is bounded, and
that the map γ↦∥γ˙∥L∞ is in Lη1 due to the uniform bound on the moments.
By Jensen’s inequality, we have
[TABLE]
and so for μt-a.e. y∈Rd and a.e. t∈[0,T] we have
[TABLE]
hence
μ={μt}t∈[0,T] is an admissible trajectory driven by ν={νt}t∈[0,T] with νt=vtμt for a.e. t∈[0,T].
3.
4. (2)
Necessity. Assume that μ={μt}t∈[0,T] is an admissible trajectory driven by ν={νt}t∈[0,T].
Set vt(x)=μtνt(x)∈F(μt,x) for μt-a.e. x∈Rd and a.e. t∈[0,T].
Filippov’s Theorem (see e.g. [AuF, Theorem 8.2.10]) implies that there exists a Borel selection ξ(⋅) of F(δ0,0), such that
[TABLE]
for all x∈Rd, and so we have
[TABLE]
By [AGS, Theorem 8.2.1], there exists η∈P(Rd×ΓT) such that μt=et♯η for all t∈[0,T] and η is
concentrated on (x,γ)∈Rd×ΓT with γ∈AC([0,T]), γ˙(t)=vt(γ(t))∈F(μt,γ(t)) for a.e. t∈[0,T] and γ(0)=x.
Thus μ∈ΥF(μ0,μ).
∎
Remark 3.8*.*
Notice that by Definition of ΥF in Definition 3.4, Proposition 3.7 gives in fact a Superposition Principle along the line of [AGS, Theorem 8.2.1] adapted to nonlocal differential inclusions. Indeed, under the given assumptions, it states that μ={μt}t∈[0,T] is an admissible trajectory if and only if
there exists η∈P(Rd×ΓT) such that
•
μt=et♯η for all t∈[0,T], μt=0=μ0;
•
for η-a.e. (x,γ)∈Rd×ΓT and a.e. t∈[0,T] it holds γ∈AC([0,T]), γ(0)=x, γ˙(t)∈F(μt,γ(t)) .
In this case, we say that μ is represented by η.
Corollary 3.9** (Existence of admissible trajectories).**
Assume Hypothesis 3.3 for F and let T>0. The set-valued map A:Pp(Rd)⇉C0([0,T];Pp(Rd))
is upper semicontinuous with nonempty compact images.
Proof.
Let μ∈Pp(Rd). Given R>0, define
[TABLE]
Recalling that the concatenation of solutions of the continuity equation is again a solution of the continuity equation driven by the time concatenation of the vector fields (see [DNS, Lemma 4.4]),
in order to prove that A(μ)=∅ it is not restrictive to assume LT<1/2.
In particular, we have 1−eLTLT>0. Define
[TABLE]
Notice that C(R)=∅, since it contains the constant curve μt≡μ for all t∈[0,T], it is convex, and it is compact in C0([0,T];Pp(Rd)) by Ascoli-Arzelà theorem.
Moreover, defining ΥF(⋅,⋅) as in Definition 3.4, we have ΥF(μ,C(R))⊆C(R) by Lemma 3.5 and the choice of R.
By Kakutani-Ky Fan Theorem (see e.g. [KF, Theorem 1]) we have that there exists μ∈C(R) such that μ∈ΥF(μ,μ), i.e.,
by Proposition 3.7, μ is an admissible trajectory starting from μ.
All the other properties of A(⋅) trivially follows from the fact that ΥF(⋅) is upper semicontinuous with nonempty compact images.
∎
Remark 3.10*.*
An alternative proof of existence of admissible trajectories, i.e. A(μ)=∅, can be found for example in [orrieri, Theorem 6.1] where the author provides sufficient conditions in order to ensure existence (and uniqueness) of solutions of a continuity equation for some given non-local vector field.
Theorem 3.11** (Filippov-type estimate for the set of admissible trajectories).**
Assume Hypothesis 3.3 for F. Let T>0, μ(A),μ(B)∈Pp(Rd) be given. Let μ(A)={μt(A)}t∈[0,T] be an admissible trajectory satisfying μ0(A)=μ(A).
Then there exists an admissible trajectory μ(B)={μt(B)}t∈[0,T] satisfying μ0(B)=μ(B)
such that
[TABLE]
In particular, the set-valued map A:Pp(Rd)⇉C0([0,T];Pp(Rd)) is Lipschitz continuous.
Proof.
Let π∈Πop(μ(A),μ(B)) be an optimal transport plan between μ(A) and μ(B) for the p-Wasserstein distance. By disintegrating π w.r.t. pr1:Rd×Rd→Rd, defined by pr1(x,y)=x, we have a Borel collection
of measures {πx}x∈Rd⊆P(Rd×Rd), uniquely defined for μ(A)-a.e. x∈Rd,
such that π=μ(A)⊗πx.
According to Proposition 3.7, there exists η(A)∈P(Rd×ΓT)
concentrated on pairs (x,γ)∈Rd×ΓT with γ∈AC([0,T]), γ˙(t)∈F(et♯η(A),γ(t)) for a.e. t∈[0,T] and γ(0)=x
such that μt(A)=et♯η(A).
Let θ∈C0([0,T];Pp(Rd)), and define the set-valued map Sθ(⋅) as in Definition 3.4.
Define the set-valued map Rθ:Rd×suppη(A)⇉ΓT by
[TABLE]
Notice that this map has closed domain, closed graph, and compact values since Rθ(y,x,γ)⊆Sθ(y), thus it is upper semicontinuous, hence Borel measurable.
We prove that it has nonempty images. Given a point (y,x,γ)∈Rd×suppη(A), there are sequences {xn}n∈N converging to x and {γn}n∈N⊆AC([0,T]) uniformly converging to γ such that xn=γn(0) and γ˙n(t)∈F(μt(A),γn(t)) for a.e. t∈[0,T].
According to Filippov’s theorem (see [AuF, Theorem 10.4.1]), for every n∈N there exists ξn∈Sθ(y)
such that
[TABLE]
recalling the Lipschitz continuity of F(⋅) and the choice of γn.
By compactness of Sθ(y), up to passing to a subsequence, we may assume that {ξn}n∈N uniformly converges
to ξ∈Sθ(y) and, by construction, we have ξ∈Rθ(y,x,γ), hence Rθ(⋅) is Borel measurable with closed domain and nonempty images, thus it admits a Borel selection hθ:Rd×suppη(A)→ΓT.
We extend hθ(⋅) to a Borel map defined on the whole of Rd×Rd×ΓT→ΓT by setting
hθ(y,x,γ)=γ if (x,γ)∈/suppη(A).
Define ηθ∈P(Rd×ΓT) by
[TABLE]
and set μθ={μtθ}t∈[0,T] where μtθ=et♯ηθ for all t∈[0,T].
We have, by construction,
[TABLE]
Notice that
[TABLE]
Thus μθ∈ΥF(μ(B),θ), where ΥF(⋅,⋅) is as in Definition 3.4.
We have
[TABLE]
Thus, since Wp(μt(A),μtθ)≥Wp(δ0,μtθ)−Wp(μt(A),δ0)=mp1/p(μtθ)−mp1/p(μt(A)), we have
[TABLE]
where we denoted with D=LeLT+1.
As in the proof of Corollary 3.9, without loss of generality we can assume that 0≤2pp−1LDT<1. The general case will follow by concatenating finitely many pieces of admissible curves defined on time-subintervals of sufficiently small length.
We take R>0 sufficiently large such that
[TABLE]
and such that mp1/p(θt)≤R for all t∈[0,T] and also mp1/p(μtθ)≤R
for all t∈[0,T].
Define a sequence {μ(n)={μt(n)}t∈[0,T]}n∈N⊆C0([0,T];Pp(Rd)) by setting
μ(0) to be the constant μ(B) and μ(n) to be equal to μθ
with θ=μ(n−1). Notice that μ0(n)=μ(B) for all n∈N.
According to Lemma 3.5, the family {μ(n)}n∈N is relatively compact, thus
up to passing to a subsequence, we may assume that it converges to μ∞∈C0([0,T];Pp(Rd)). Since μ(n)∈ΥF(μ(B),μ(n−1)), by recalling the u.s.c.
of ΥF(⋅,⋅) proved in Proposition 3.6, we obtain that μ∞∈ΥF(μ(B),μ∞), i.e.,
μ∞ is an admissible trajectory, starting from μ(B).
Finally, by passing to the limit in
[TABLE]
we have
[TABLE]
and, by Grönwall’s Lemma,
[TABLE]
as desired, where D^=L(2+LeLT). The proof is concluded by setting μ(B)=μ∞. The last assertion
trivially follows.
∎
Lemma 3.12** (Initial velocity set).**
Assume Hypothesis 3.3 for F and let Ξ(⋅,⋅) be as in Definition 3.4. Let μ∈Pp(Rd).
(1)
Given any Borel selection vμ:Rd→Rd of F(μ,⋅), there exists η∈P(Rd×ΓT) such that, set μt=et♯η for t∈[0,T],
we have μ={μt}t∈[0,T]∈A[0,T]p(μ), η∈Ξ(μ,μ) and
[TABLE]
for η-a.e. (x,γ)∈Rd×ΓT.
2. (2)
Given any admissible trajectory μ={μt}t∈[0,T]∈A[0,T]p(μ), there exists η∈Ξ(μ,μ) such that
μt=et♯η and for η-a.e. (x,γ)∈Rd×ΓT we have
[TABLE]
Proof.
**1. **Without loss of generality, we may assume LT≤1/2, the general case will be obtained concatenating μ with any other admissible trajectory starting from μT.
Let v0:Rd→Rd be any Borel selection of F(μ,⋅).
Define γx:[0,T]→Rd by γx(t)=x+v0(x)⋅t, and observe that x↦γx is a Borel map.
Let θ={θt}t∈[0,T]∈C0([0,T];Pp(Rd)) such that θ0=μ, and notice that
[TABLE]
Thus, by Filippov’s Theorem (see [AuF, Theorem 10.4.1]) the set-valued map Rθ:Rd⇉ΓT defined as
[TABLE]
has nonempty images for every x∈Rd. Notice that this set-valued map has closed images and it is Borel measurable by [AuF, Theorem 8.2.9], thus it admits a Borel selection hθ:Rd→ΓT.
Set ηθ=μ⊗δhθ(x) and μθ={μtθ}t∈[0,T], μtθ=et♯ηθ.
By construction we have μθ∈ΥF(μ,θ), moreover for all x∈Rd we have
[TABLE]
Furthermore,
[TABLE]
Choose
[TABLE]
and notice that if mp1/p(θt)≤R for all t∈[0,T], then mp1/p(μtθ)≤R for all t∈[0,T].
Define sequences {μ(n)={μt(n)}t∈[0,T]}n∈N⊆C0([0,T];Pp(Rd)) and {η(n)}n∈N⊆P(Rd×ΓT)
by setting μ(0) to be the constant μ, μ(n) and η(n) to be equal to μθ and ηθ, respectively,
with θ=μ(n−1) for all n∈N.
According to Lemma 3.5, the families {μ(n)}n∈N and {η(n)}n∈N are relatively compact, thus
up to passing to a subsequence, we may assume that the sequences converge to μ∞={μt∞}t∈[0,T]∈C0([0,T];Pp(Rd)) and to η∞∈P(Rd×ΓT),
with μt∞=et♯η∞ for all t∈[0,T].
Since μ(n)∈ΥF(μ,μ(n−1)) (ΥF(⋅,⋅) defined in Definition 3.4), by recalling the u.s.c.
of ΥF(⋅,⋅) proved in Proposition 3.6, we obtain that μ∞∈ΥF(μ,μ∞), i.e.,
μ∞ is an admissible trajectory, starting from μ.
Recall that for η∞-a.e. (x,γ) there exists a sequence {(xn,ξn)}n∈N⊆Rd×ΓT converging to (x,γ) such that (xn,ξn)∈suppη(n).
Thus, without loss of generality, we may assume for all t∈[0,T]
[TABLE]
and, by passing to the limit,
[TABLE]
**2. **Recall the Superposition Principle in Proposition 3.7 and the definitions of ΥF and Ξ in Definition 3.4. Then, from the assumption it follows that there exists η∈Ξ(μ,μ) such that μt=et♯η for all t∈[0,T].
By Jensen’s inequality, for η-a.e. (x,γ)∈Rd×ΓT, we have
[TABLE]
We conclude by taking the Lηp-norm and using Lemma 3.5.
∎
4. Generalized targets
In this section, we provide the generalized notion of target set in the space of probability measures, thus extending in a natural way the classical concept of target set in Rd.
A naive physical interpretation of the generalized target can be given as follows: to describe the state of the system, an observer chooses to measure
some quantities ϕ. The results of the measurements are the averages of the quantities ϕ with respect to the measure μt, representing the state of
the system at time t. Our aim is to steer the system to states where the result of such measurements is below a fixed threshold (that, without loss of generality, we assume to be [math]).
The following result provides a characterization of the class of such generalized target.
Lemma 4.1**.**
Let S~⊆P(Rd) be nonempty.
Then, S~ is w∗-closed and convex if and only if there exists a family Φ⊆Cb0(Rd) such that S~ can be written as follows
[TABLE]
Proof.
We first prove the necessity, so let S~ be as in (4.1) for some fixed Φ⊆Cb0(Rd). Then, the convexity of S~ comes by linearity of the integral w.r.t. the measure, while the closure in w∗ topology follows immediately since Φ is a family of test functions for w∗-convergence.
We pass to the proof of the sufficiency.
Recalling formula (5.1.7) in [AGS, Remark 5.1.2], we have that μˉ∈S~ if and only if for all ψ∈Cb0(Rd) it holds
[TABLE]
Given ψ∈Cb0(Rd), set
[TABLE]
Then we have that μˉ∈S~ if and only if for all ψ∈Cb0(Rd) such that Cψ<+∞ it holds
Let S~⊆P(Rd) be nonempty w∗-closed and convex, Φ⊆Cb0(Rd).
We say that S~ is a generalized target generated byΦ, and write S~=S~Φ if
[TABLE]
Given p≥1 we set S~pΦ=S~Φ∩Pp(Rd), and we define the generalized distance from
S~pΦ to be the 1-Lipschitz continuous map given by d~S~pΦ(⋅):=μ∈S~pΦinfWp(⋅,μ).
Remark 4.3*.*
•
In Definition 4.2 we can equivalently assume that Φ is a set of continuous bounded functions, or bounded Lipschitz functions, or even just l.s.c. functions bounded from below.
Moreover, without loss of generality, we can always assume that Φ is convex.
Indeed, assume that Ψ is a set of l.s.c. functions bounded from below. For all ψ∈Ψ and k∈N∖{0} we define
a Lipschitz continuous bounded map φkψ:Rd→R by setting
[TABLE]
We recall that {φkψ}k∈N is an increasing sequence of bounded Lipschitz functions bounded from below and pointwise converging to ψ.
Hence, by Monotone Convergence Theorem, we have
[TABLE]
where Φ={φkψ:k∈N∖{0},ψ∈Ψ}.
Replacing Φ with its convex hull does not change anything due to the linearity of the integral operator.
•
Since convergence in Wp(⋅,⋅) implies w∗-convergence, if S~Φ is a generalized target, then S~pΦ is closed and convex in Pp(Rd) endowed with the p-Wasserstein metric Wp(⋅,⋅).
•
We notice that if there exists xˉ∈Rd such that φ(xˉ)≤0 for all φ∈Φ then the set S~ given by (4.2) is nonempty, since δxˉ∈S~.
The last condition of Remark 4.3 is indeed not necessary to have the nontriviality of S~.
Example 4.4*.*
For every y∈R, ε>0, define
[TABLE]
and set Φε:={φyε:y∈R}.
Clearly, we have that φyε attains its maximum at x=−y and the value of the maximum is ε>0. Thus the sufficient condition
of the last assertion in Remark 4.3 is violated. For 0<ε≤121 sufficiently small we have
[TABLE]
thus the measure χ[−1/2,1/2]L1∈S~.
Indeed, by the translation invariance of the problem, we have that μa:=χ[a,a+1]L1∈S~ for all a∈R,
in particular, we have that S~ is not tight, hence not w∗-compact, since for any K⊆R it is possible to find a∈R
such that μa(R∖K)=1.
Lemma 4.5** (Compactness).**
Let S~ be a nonempty generalized target generated by the family Φ⊆C0(Rd).
If there exists ϕˉ∈Φ, A,C>0 and p≥1 such that ϕˉ(x)≥A∣x∣p−C,
then S~Φ=S~pΦ is compact in the w∗-topology and in the Wp-topology.
Proof.
Trivially we have that S~pΦ⊆S~Φ for any p≥1. Conversely, given μ∈S~Φ, we have
[TABLE]
hence μ∈S~pΦ and all the measures in S~pΦ=S~Φ have p-moments uniformly bounded by C/A.
This means that the w∗-topology and Wp-topology coincide on S~Φ=S~pΦ, which turns out to be tight, according to [AGS, Remark 5.1.5],
and w∗-closed, hence w∗-compact and Wp-compact.
∎
We mention the following example, which may be relevant for the applications.
Example 4.6*.*
Given a nonempty and closed set S⊆Rd and α≥0, a natural choice for Φ can be for example Φα={dS(⋅)−α}.
If α=0 we have that S~Φ0={μ∈P(Rd):μ(Rd∖S)=0}.
More generally, for all r>0 let Br(S):={z∈Rd:dS(z)≤r}.
Then, if μ∈S~Φα,
[TABLE]
thus, in particular, we must have μ(Rd∖Br(S))≤min{1,rα} for all r>0,
which, if α is sufficiently small can be interpreted as a relaxed version of the case α=0.
Given a generalized target S~⊆P(Rd), a natural question is wheter it is possible to localize it, i.e., to describe it as the set of all the measures
supported a certain (closed) subset of Rd. Equivalently, we want to find a nonempty closed set S⊆Rd, such that, set Φ={dS(⋅)}, we have S~=S~Φ.
To this aim, we give the following definition.
Definition 4.7** (Classical counterpart of generalized target).**
Let S~⊆P(Rd) be a generalized target. Given a set S⊆Rd,
we say that S is a classical counterpart of the generalized targetS~
if
[TABLE]
An analogous definition is given for the classical counterpart of S~∩Pp(Rd), p≥1 by taking intersection of the right hand side with Pp(Rd).
Remark 4.8*.*
•
From the very definition of classical counterpart, if S~ admits S and S′ as classical counterparts, then S=S′.
•
In general a classical counterpart may not exists: in R, take Φ={ϕ} where ϕ:R→R, ϕ(y):=∣y∣−1.
Defined μ0:=21(δ0+δ2), we have μ0∈S~pΦ for every p≥1. If a classical counterpart S of S~Φ
would exists, by definition it should contain the support of μ0, i.e. 0,2∈S. However, δ2∈/S~Φ even if supp(δ2)⊆S.
So neither S~Φ nor S~pΦ admit a classical counterpart.
•
If S is the classical counterpart of S~Φ (or S~pΦ), there exists a representation of S~Φ as S~Φ^, where
Φ^={ϕ^} and ϕ^(x)≥0 for every x∈Rd where the inequality is strict at every x∈/S.
In particular we can take Φ^={arctan∘dS} (resp. Φ^={dS}), i.e., we can replace Φ with the set {arctan∘dS} (resp. {dS}).
Our aim is now to characterize the generalized target possessing a classical counterpart.
Proposition 4.9** (Existence, uniqueness and properties of the classical counterpart).**
Let S~⊆P(Rd) be a generalized target, S⊆Rd.
(1)
if S~ admits S as classical counterpart then S is closed;
2. (2)
S~* admits S as classical counterpart if and only if*
[TABLE]
for all φ∈Cb0(Rd) and μ∈S~;
3. (3)
if S~ admits S as classical counterpart, then S~p admits S as classical counterpart for all p≥1.
4. (4)
If S~=S~Φ (resp. S~∩Pp(Rd)=S~pΦ), for a suitable Φ⊆Cb0(Rd), admits a classical counterpart S, then
[TABLE]
Proof.
(1)
Assume that S~ admits S as a classical counterpart and S~=S~Φ for a suitable Φ∈Cb0(Rd).
In particular, we have δx∈S~ for all x∈S, i.e. ϕ(x)≤0 for all x∈S.
Let {xn}n∈N be a sequence in S converging to x∈Rd. Then for all φ∈Φ we have φ(xn)≤0 for all n∈N,
which implies φ(x)≤0, and so δx∈S~. Since S is a classical counterpart of S~ and suppδx={x}, we have that thus x∈S, so S is closed.
3. (2)
S~ admits S as classical counterpart if and only if S~=co{δx:x∈S}, where the closure is the weak∗ closure in P(Rd).
Indeed, every measure supported in S is w∗-limit of convex combinations of Dirac deltas concentrated in points of S, and conversely
all such deltas belong to S~ by definition of classical counterpart, and S~ is convex and w∗-closed.
Recalling formula (5.1.7) in [AGS, Remark 5.1.2], we have that μ∈S~ if and only if
[TABLE]
for all φ∈Cb0, as desired.
4. (3)
It is sufficient to use the same argument as in (2) but taking the intersection with Pp(Rd) and the closure w.r.t. Wp distance.
5. (4)
Trivially, if there exist xˉ∈Rd and φ∈Φ such that φ(xˉ)>0, then δxˉ∈/S~, thus xˉ does not belong to the classical
counterpart of S~. Conversely, if φ(xˉ)≤0 for all φ∈Φ, then δxˉ∈S~, and so xˉ∈S by definition of classical counterpart.
∎
A useful sufficient condition can be expressed as follows.
Corollary 4.10**.**
Assume that for every ϕ∈Φ we have either ϕ(x)≥0 or ϕ(x)≤0 for all x∈Rd.
Then S~Φ (and so S~pΦ) admits classical counterpart.
Proof.
Denote by
[TABLE]
If for all ϕ∈Φ and x∈Rd we had ϕ(x)≤0, then we would trivially have S=Rd and S~Φ=P(Rd) as desired since
δx∈S~Φ for all x∈Rd, thus concluding with the thesis.
Otherwise, let μ∈S~Φ and suppose by contradiction that μ(Rd∖S)>0. Thus there exists y∈Rd∖S of density 1 w.r.t. μ.
In particular, there exists a neighborhood Ay of y contained in Rd∖S such that μ(Ay)>0.
If for all φ∈Φ we had φ(y)≤0, we would have y∈S, contradicting the fact that y∈/S.
So, according to the assumptions, there exists ϕ^∈Φ such that ϕ^(x)≥0 for all x∈Rd and such that ϕ^(y)>0. Thus we have
[TABLE]
hence μ∈/S~Φ, leading to a contradiction. Thus S~Φ⊆{μ∈P(Rd):suppμ⊆S}.
Since the converse inclusion is always true, equality holds.
∎
Remark 4.11*.*
The condition of Corollary 4.10 is not necessary in general.
In R, take Φ={ϕ1,ϕ2,ϕ3} where ϕi:R→R, i=1,2,3 are
defined to be ϕ1(x)=min{max{x,0},1}, ϕ2(x)=min{max{−x,−1},0}, ϕ3(x)=min{max{x,−1},1}.
Then both S~pΦ and S~Φ admits S as their classical counterpart, with S=]−∞,0],
but ϕ3 changes its sign.
We are now ready to state some comparison results between the generalized distance and the classical one.
Proposition 4.12** (Comparison with classical distance).**
Let p≥1, μ0∈Pp(Rd), Φ⊆Cb0(Rd;R) be such that S~pΦ=∅, and
define
[TABLE]
Then d~S~pΦ(μ0)≤∥dS∥Lμ0p, and equality holds if and only if the generalized target S~pΦ admits classical
counterpart. In this last case, the classical counterpart of S~pΦ is S, moreover d~S~pΦp:Pp(Rd)→[0,+∞[ is convex.
Proof.
If S=∅ we have dS(x)≡+∞ at all x∈Rd so the statement is trivially true, thus suppose S=∅.
Since S is closed and nonempty, [AuF, Corollary 8.2.13] implies
the existence of a Borel map g:Rd→S such that ∣x−g(x)∣=dS(x).
We have
[TABLE]
moreover, for all ϕ∈Φ, we have
[TABLE]
since g(y)∈S for all y∈Rd and so ϕ∘g(y)≤0
for all y∈Rd.
Therefore, g♯μ0∈S~pΦ, and so
[TABLE]
Assume now that S~pΦ admits classical counterpart. As noticed in Proposition 4.9, S must be the classical counterpart of S~pΦ.
For every ν0∈S~pΦ we have thus suppν0⊆S and hence ∣x−y∣≥dS(x) for all π∈Π(μ0,ν0) and π-a.e. (x,y)∈Rd×Rd.
This leads to
[TABLE]
By taking the infimum on π∈Π(μ0,ν0) and then on ν0∈S~pΦ, we obtain d~S~pΦ(μ0)≥∥dS∥Lμ0p,
thus equality holds.
Without the assumption of existence of a classical counterpart for S~pΦ,
the inequality d~S~pΦ(μ0)≤∥dS∥Lμ0p is strict.
Indeed, since S~pΦ does not admit S as a classical counterpart, there exist a measure μ∈S~pΦ and n∈N such that
[TABLE]
and so there exists a Borel set A⊆Rd and ε>0 such that dSp(z)≥ε for μ-a.e. z∈A, μ(A)>0.
This implies
[TABLE]
Finally, the last statement is trivial, and it follows from the fact that
[TABLE]
is linear in μ.
∎
Without the p-th power, the generalized distance in the case of the Proposition 4.12 above may fail to be convex.
Example 4.13*.*
Let p>1. In R2, consider P=(0,0), Q1=(1,0), Q2=(0,21/p). Set S={P}, Φ={dS(⋅)}, hence S~pΦ:={δP},
and define νλ=λδQ1+(1−λ)δQ2, λ∈[0,1].
By Proposition 4.12, we have
[TABLE]
whence d~S~pΦ(νλ)=p2−λ, which is not convex.
In the metric space Pp(Rd) endowed with the Wp-distance, another concept of convexity can be given,
related more to the metric structure rather than to the linear one inherited by the set of all Borel signed measures.
Given any product space XN (N≥1), in the following we denote with pri:XN→X the projection on the i–th component, i.e., pri(x1,…,xN)=xi.
Definition 4.14** (Geodesics).**
Given a curve μ={μt}t∈[0,1]⊆Pp(Rd), we say that it is a (constant speed) geodesic if for all 0≤s≤t≤1
we have
[TABLE]
In this case, we will also say that the curve μ is a geodesic connecting μ0 and μ1.
Theorem 4.15** (Characterization of geodesics).**
Let μ0,μ1∈Pp(Rd) and let π∈Πop(μ0,μ1) be an optimal
transport plan between μ0 and μ1, i.e.
[TABLE]
Then the curve μ={μt}t∈[0,1] defined by
[TABLE]
is a (constant speed) geodesic connecting μ0 and μ1.
Conversely, any (constant speed) geodesic μ={μt}t∈[0,1] connecting μ0 and μ1 admits
the representation (4.4) for a suitable plan π∈Πop(μ0,μ1).
Proof.
See [AGS, Theorem 7.2.2].
∎
Definition 4.16** (Geodesically and strongly geodesically convex sets).**
A subset A⊆Pp(Rd) is said to be
(1)
geodesically convex if for every pair of measures μ0,μ1 in A, there exists a geodesic connecting μ0 and μ1 which is contained in A.
2. (2)
strongly geodesically convex
if for every pair of measures μ0,μ1 in A and for every admissible transport plan π∈Π(μ0,μ1), the curve t↦μt defined by (4.4)
is contained in A.
The interest in this alternative concept of convexity comes from the fact that, in many problems, functionals defined on probability measures are convex along geodesics
(a notion related to geodesically convex sets) and not convex with respect to the linear structure in the usual sense. We refer to [AGS, Section 9.1]
for further details.
Remark 4.17*.*
Notice that, even if the notations do not highlight this fact, the notions of geodesic and geodesical convexity depend on the exponent p
which has been fixed.
Proposition 4.18** (Strong geodesic convexity of S~pΦ).**
Let p≥1, Φ as in Definition 4.2 and assume that all the elements of Φ are also convex.
Then the generalized target S~pΦ is strongly geodesically convex.
Proof.
Let μ0,μ1∈S~pΦ and let π∈Π(μ0,μ1) be an admissible transport plan between μ0 and μ1.
Consider the corresponding curve μ={μt}t∈[0,1] defined by (4.4), and fix t∈[0,1].
We have for every ϕ(⋅)∈Φ
[TABLE]
since pri♯π are the marginal measures of π, which belong to S~pΦ.
The conclusion follows from the arbitrariness of ϕ(⋅)∈Φ.
∎
Remark 4.19*.*
In particular, considering also the first item in Remark 4.3, the above result holds for Φ:={dS(⋅)−α} when S is nonempty, closed and convex, and α∈[0,1].
In this case, since in the above proof we use only the convexity property of dS(⋅), the
statement holds also if we equip Rd with a different norm than the Euclidean one.
We conclude this section by investigating the semiconcavity properties of the generalized distance along geodesics.
The case p=2 is particularly easy thanks to the geometric structure of the metric space P2(Rd).
Proposition 4.20** (Semiconcavity of d~S~2Φ2).**
Let S~2Φ be a generalized target in P2(Rd).
Then the square of the generalized distance satisfies the following global semiconcavity inequality: for every μ0,μ1∈P2(Rd) and every t∈[0,1]
[TABLE]
where μ={μt}t∈[0,1] is any constant speed geodesic for W2 joining μ0 and μ1.
Proof.
Owing to [AGS, Theorem 7.3.2], we have that for any measure σ∈P2(Rd) the function
μ↦W22(μ,σ) is semiconcave along geodesics, with semiconcavity constant independent by σ, i.e. it satisfies for every t∈[0,1]
[TABLE]
The conclusion follows by passing to the infimum on σ∈S~2Φ.
∎
In the case p=2 we need additional requirements on Φ.
Proposition 4.21** (Semiconcavity of d~S~pΦp).**
Let p≥1, and S~pΦ be a generalized target. Assume
that S~pΦ admits a classical counterpart S⊆Rd.
Let K⊆Rd∖S be compact and convex.
Then the p-th power of the generalized distance d~S~pΦ(⋅)
satisfies the following local semiconcavity inequality:
there exists a constant C=C(p,K)>0 such that for every μ0,μ1∈Pp(K) we have
[TABLE]
where μ={μt}t∈[0,1] is any constant speed geodesic for Wp joining μ0 and μ1.
Proof.
In this proof to make clearer the notation we will omit the superscript Φ, since Φ is fixed.
Under the above assumptions, and recalling Proposition 4.12, we have d~S~p(μ0)=∥dS∥Lμ0p.
Given x0,x1∈K and t∈[0,1] we set
[TABLE]
According to [CSb, Proposition 2.2.2], there exists c=c(K)>0 such that
dS satisfies the following inequality for all x0,x1∈K:
[TABLE]
By using [CSb, Proposition 2.1.12 (i)], we obtain that
[TABLE]
with C′=C′(p,K).
For any Borel sets A,B⊆Rd and π∈Π(μ0,μ1), we now have supp(π)⊆K×K.
Therefore, we choose a transport plan π∈Πop(μ0,μ1) realizing the p-Wasserstein distance between μ0 and μ1, so that the representation in formula (4.4) holds, and we integrate the estimate (4.6) to find that
[TABLE]
where μ={μt}t∈[0,1]⊆Pp(Rd) is the constant speed geodesic corresponding to π. But
according to Proposition 4.12, there holds
[TABLE]
and applying Jensen’s inequality to the concave map ξ↦ξγ/p on R+, with γ=min{p,2}, we obtain that
[TABLE]
We thus conclude that
[TABLE]
and the proof is completed.
∎
Remark 4.22*.*
Notice that inequality (4.5) implies that, for p≥2 and under the assumption of Proposition 4.21,
the functional −d~S~pp(⋅):Pp(K)→]−∞,0] is λ-geodesically convex,
in the sense of [AGS, Definition 9.1.1], with λ=−2C.
5. The generalized minimum time function
Definition 5.1** (Generalized minimum time function).**
Given a generalized target S~p=S~pΦ defined in Definition 4.2, we define the generalized minimum time function T~p:Pp(Rd)→[0,+∞] by
[TABLE]
where we set inf∅=+∞ by convention.
We say that μ={μt}t∈[0,T]∈A[0,T]p(μ) is time optimal from μ if T~p(μ)≤T<+∞ and μT~p(μ)∈S~p.
for any μ∈Pp(Rd) with T~p(μ)<+∞ there exists a time optimal admissible trajectory from μ;
2. (2)
the function T~p(⋅) is lower semicontinuous;
3. (3)
the following Dynamic Programming Principle holds
[TABLE]
In particular, t↦t+T~p(μt) is nondecreasing along every admissible trajectory μ={μt}t∈[0,T]∈A[0,T]p(μ),
and it is constant if and only if μ={μt}t∈[0,T]∈A[0,T]p(μ) is the restriction to [0,T]∩[0,T~p(μ)] of an optimal trajectory.
Proof.
(1)
Fix μ∈Pp(Rd) with T~p(μ)<+∞. For any n∈N∖{0} there exists Tn>0 and μ(n)={μt(n)}t∈[0,Tn]∈A[0,Tn]p(μ) such that μTn(n)∈S~p and Tn≤T~p(μ)+1/n.
We can extend each μ(n) to an admissible curve defined on T~p(μ)+1 (possibly concatenating it with an element of A[Tn,T~p(μ)+1](μTn(n)), which is nonempty for all n∈N∖{0}). Thus, without loss of generality, we may assume that we have a sequence μ^(n)={μ^t(n)}t∈[0,T]∈A[0,T]p(μ) of admissible trajectories, which are all defined in [0,T] with T=T~p(μ)+1, and satisfying μ^Tn(n)∈S~p where Tn≤T~p(μ)+1/n.
Recalling the compactness of A[0,T]p(μ) (see Corollary 3.9), up to passing to a subsequence, the sequence of curves {μ^(n)}n∈N uniformly converges to μ^∞={μ^t∞}t∈[0,T] and, moreover, we have Tn→ℓ. In particular, μ^Tn(n)→μ^ℓ∞ which, by the closedness of S~p, implies μ^ℓ∞∈S~p, and so T~p(μ)≤ℓ. But passing to the limit in Tn≤T~p(μ)+1/n yields the reverse inequality, thus ℓ=T~p(μ),
hence μ^∞ is optimal.
3. (2)
Let {μ(n)}n∈N⊆Pp(Rd) be a Wp-converging sequence satisfying μ(n)→μ∞
and
n→+∞liminfT~p(μ(n))=:ℓ∈R. If ℓ=+∞ there is nothing to prove, so let us assume ℓ<+∞.
As before, up to concatenation and restriction and by taking n sufficiently large, this implies that there exists a sequence {μ(n)}n∈N such that μ(n)={μt(n)}t∈[0,ℓ+1]∈A[0,ℓ+1](μ(n))
and μT~p(μ(n))(n)∈S~p for all n∈N.
By Theorem 3.11, there exists a sequence
{μ^(n)={μ^t(n)}t∈[0,ℓ+1]}n∈N⊆A[0,ℓ+1](μ∞) such that
[TABLE]
for all t∈[0,ℓ+1], where D:=2pp−1eL(2+LeL(ℓ+1))(ℓ+1). Recalling the compactness of A[0,ℓ+1]p(μ∞) (see Corollary 3.9), up to a passing to a subsequence, the sequence of curves {μ^(n)}n∈N uniformly converges to μ^∞={μ^t∞}t∈[0,ℓ+1], in particular, we have that
[TABLE]
By taking the limit for n→+∞, we have that Wp(μT~p(μ(n))(n),μ^ℓ∞)→0,
hence, by the closedness of S~p, we obtain μ^ℓ∞∈S~p, and so T~p(μ∞)≤ℓ.
4. (3)
Let μ={μt}t∈[0,T]∈A[0,T]p(μ) and
μ^(t)∈A[0,T~p(μt)]p(μt) such that μ^(t) is optimal for μt
(such an optimal trajectory exists by item (1)).
For any t∈[0,T], the concatenation μ∣[0,t]⊙μ^(t)∈A[0,t+T~p(μt)]p(μ),
and so T~p(μ)≤t+T~p(μt) for every t∈[0,T], μ={μt}t∈[0,T]∈A[0,T]p(μ),
t>0, giving the first inequality in (5.1).
In particular, for 0≤t≤s≤T, we have
[TABLE]
since the restriction of μ to [t,T] is an admissible trajectory from μt. Thus t↦t+T~p(μt) is
nondecreasing along all the admissible trajectories.
If μ is an optimal trajectory, by taking s=T~p(μ) we have T~p(μs)=0 and so T~p(μ)=t+T~p(μt)
for all t∈[0,T~p(μ)], which gives equality in (5.1).
Finally, assume that t↦t+T~p(μt) is constant along an admissible trajectory μ∈A[0,T]p(μ).
By (5.1) we have that T~p(μ)=t+T~p(μt) for all t∈[0,T].
If T≥T~p(μ), this implies that μ is optimal, since by taking t=T~p(μ) we obtain T~p(μT~p(μ))=0
and so μT~p(μ)∈S~p. If T<T~p(μ) we concatenate μ with an optimal trajectory
μ^={μ^s}s∈[0,T~p(μT)]∈A[0,T~p(μT)](μT) for μT.
Set μ⊙μ^={μ~s}s∈[0,T+T~p(μT)].
In particular, we have T~p(μT)=s+T~p(μ^s) for all s∈[0,T~p(μT)], thus T~p(μ)=τ+T~p(μ~τ)
for all τ∈[0,T~p(μ)]. By taking τ=T~p(μ) we obtain T~p(μT~p(μ))=0 and so μT~p(μ)∈S~p
thus the concatenation μ⊙μ^ is an optimal trajectory, whose restriction to [0,T] is μ.
∎
The following definition of Small-Time Local Attainability (STLA) has been introduced in [KQ] for finite-dimensional control systems, but can be easily generalized in our framework.
Definition 5.3** (STLA for Wasserstein spaces).**
We say that the system with generalized target S~p satisfies the STLA property if
Property (STLA):
for any ε>0 and μ^∈S~p there exists δ>0
such that T~p(μ)≤ε for any μ∈Pp(Rd) satisfying
Wp(μ,μ^)≤δ.
The link between STLA and continuity of the generalized minimum time is provided by the following result.
Proposition 5.4** (STLA and continuity of T~p).**
Let S~p be
a generalized target. Assume Hypothesis 3.3 for F, and that (STLA) holds for the system.
Then T~p:Pp(Rd)→[0,+∞] is continuous at every point where it is finite.
Proof.
Recalling the l.s.c. of T~p(⋅), given μ∈Pp(Rd) with T~p(μ)=+∞,
we have n→+∞limT~p(μ(n))=+∞ for every sequence {μ(n)}n∈N converging to μ in Wp.
Therefore, we assume T:=T~p(μ)<+∞. Since T~p(⋅) is l.s.c., it is enough to prove that for all {μˉ(n)}n⊆Pp(Rd) such that Wp(μˉ(n),μ)→0 as n→+∞, we have
[TABLE]
Fix an optimal trajectory μ∞:={μt∞}t∈[0,T] starting from μ∣t=0∞=μ.
Let {μ(n)}n∈N be a sequence converging to μ in Wp and such that n→+∞limT~p(μ(n)) exists.
By Theorem 3.11,
there exists a sequence of admissible trajectories {μ(n)}n∈N such that
•
μ(n)={μt(n)}t∈[0,T], μ0(n)=μ(n) for all n∈N and
•
d~S~p(μT(n))≤Wp(μT(n),μT∞)≤D⋅Wp(μ(n),μ), recalling that μT∞∈S~p,
where D:=2pp−1eL(2+LeLT)T.
In particular, by (STLA), given ε>0 there exists nε∈N such that for all n>nε we have
T~p(μT(n))≤ε. By Dynamic Programming principle, we have
[TABLE]
By letting n→+∞ and ε→0, we have
[TABLE]
We conclude by the arbitrariness of the sequence {μ(n)}n∈N.
∎
Definition 5.5**.**
Given Φ⊂Cb0(Rd), ϕ∈Φ and μ∈P(Rd) we define
[TABLE]
Our aim is to provide a sufficient condition for (STLA), following the line of [LM] and [MR] for finite-dimensional systems. We recall that the l.s.c. of T~p(⋅) was already showed in [CMNP, Theorem 4] in a simplified setting,
while a stronger sufficient condition was provided in [Cav, Theorem 4.1] to prove the Lipschitz continuity regularity. The continuity of T~p(⋅) was a crucial assumption also in [CMNP, Theorem 8]
to prove that it solves an Hamilton-Jacobi-Bellman equation in Wasserstein space.
The following definition establishes a quantitative estimate of the maximal infinitesimal decreasing of the functions ϕ∈Φ defining the generalized target, along the admissible trajectories of the system.
Definition 5.6**.**
We say that the generalized target S~pΦ is (r,Q)-attainable if there exist continuous maps
[TABLE]
such that
(1)
r(q)=0 if and only if q=0;
2. (2)
Q(r(q),q)<0 for all q∈]0,+∞[;
3. (3)
the function q↦∣Q(r(q),q)∣r(q) is decreasing and integrable on [0,+∞[.
4. (4)
for any μ∈Pp(Rd)∖S~pΦ there exists μ={μt}t∈[0,r(σΦ(μ))]∈A[0,r(σΦ(μ))]p(μ) such that
[TABLE]
Remark 5.7*.*
Roughly speaking, (r,Q)-attainability expresses a relation between the variation of the distance (or a related positive function vanishing only on the target) along a particular admissible
trajectory in a time interval, and the size of the time interval itself. The integrability condition asks that the approaching speed, which can be seen as the quotient
between the variation of the distance and the time needed to realize it, is sufficiently high to ensure that the target will be reached in finite time.
Finite-dimensional examples of similar constructions can be found e.g. in [LM], while an example in this setting with no interactions can be found in [Cav].
With the notations of Definitions 5.5, 5.6 we state the following results of this section.
Proposition 5.8**.**
Assume Hypothesis 3.3 for F and that the generalized target S~pΦ is (r,Q)-attainable.
Then
[TABLE]
Proof.
Define sequences {μ(i)}i∈N⊆P(Rd), {σi}i∈N, {ti}i∈N⊆[0,1] as follows.
Set μ(0)=μ. Suppose to have defined μ(i), then define σi=σΦ(μ(i)).
We notice that, by assumption, if μ(i)∈/S~pΦ we have σi>0, and so Q(r(σi),σi)<0.
By property (4) in Definition 5.6, if μ(i)∈/S~pΦ there exists μ(i)={μt(i)}t∈[0,r(σi)]∈A[0,r(σi)]p(μ(i)) such that
[TABLE]
Thus, for any ε>0 there exists tiε∈[0,r(σi)] such that
[TABLE]
Notice that, if we choose ε sufficiently small, in particular 0<ε<−2Q(r(σi),σi), then tiε=0.
We thus fix ε^(i)=−Q(r(σi),σi) and set ti=tiε^(i)>0 and μ(i+1)=μti(i).
While, if μ(i)∈S~pΦ, then we set ti=0 and μ(i+1)=μti(i)=μ(i).
Thus, together with property (1) in Definition 5.6, this implies that μ(i)∈/S~pΦ if and only if σi,ti>0.
Notice that σi≥0 for all i∈N, moreover, if σi=0 then σm=tm=0 for all m≥i.
For every i∈N such that σi=0 we have
[TABLE]
by property (2) in Definition 5.6.
Thus the sequence {σi}i∈N is decreasing and bounded from below, and so it has a limit σ∞≥0.
If σi=0 for some i∈N then σ∞=0. If σi=0 for all i∈N, by passing to the limit in (5.2) we get Q(r(σ∞),σ∞)=0, by continuity of Q(⋅,⋅) and r(⋅), which implies σ∞=0.
We have
[TABLE]
To conclude the proof, we consider two cases
•
assume that σi=0 for all i∈N. Then for any i∈N there exists an admissible trajectory μ(∞)={μt(∞)}[0,T] starting from μ and coinciding with μ(i) on [ti−1,ti].
In particular, μ∑ti(∞)∈S~pΦ since σ∞=0, and so T(μ)≥T~p(μ).
•
let ^ the minimum of the set {i∈N:ti=0}. Then there exists an admissible trajectory μ^(^)={μ^t(^)}[0,T] starting from μ and coinciding with μ(i) on [ti−1,ti], for all i≥1.
In particular, μ^∑i=1^−1ti(^)∈S~pΦ, and so
[TABLE]
Thus in both cases we have T(μ)≥T~p(μ), which concludes the proof.
∎
Theorem 5.9** (Sufficient condition for (STLA)).**
Assume Hypothesis 3.3 for F and that the generalized target S~pΦ is (r,Q)-attainable. Assume that there exists C>0 and an open set U⊆Pp(Rd) such that U⊇S~pΦ and
σΦ(μ)≤C for all μ∈U. Then (STLA) holds.
Proof.
Fix ε>0. Since max{σΦ(μ),0}≤C in a neighborhood of S~pΦ, we have that the convex function
μ↦max{σΦ(μ),0} is continuous in a neighborhood of S~pΦ and vanishes exactly on S~pΦ.
Thus for any ε>0 there exists ρ,δ>0 such that if dS~pΦ(μ)≤δ we have σΦ(μ)≤ρ and
[TABLE]
recalling that by the integrability assumption in item (3) in Definition 5.6, the map
[TABLE]
is continuous.
∎
In conclusion, in order to check the (r,Q)-attainability of a set from the data of the problem, the following result may serve the purpose.
Corollary 5.10**.**
Given α≥0, an interval I⊆R, γ∈AC(I;Rd) and v:Rd→Rd, we define
[TABLE]
Let D⊆P2(Rd) and assume that there exist constants Cϕ≥0, α,β,K>0 such that, by defining for any μ∈D
[TABLE]
we have
a.)
Φ:={ϕ}, where ϕ is semiconcave with constant Cϕ;
2. b.)
for all μ∈D∖S~2Φ there exist functions vμ,ξμ∈Lμ2(Rd;Rd),
η∈P(Rd×ΓIμ), and constants C2,μ,C3,μ,C4,μ>0
satisfying
Integrating w.r.t. η and using Hölder’s inequality yields
[TABLE]
Choose
[TABLE]
In particular, we have r(q)=0 if and only if q=0, Q(r(q),q)<0 if q=0,
[TABLE]
which is a decreasing integrable function of q. Furthermore, we notice that by definition tμ=r(σΦ(μ)) and Q(r(σΦ(μ)),σΦ(μ))=−Ktμα+2. Thus, from (5.3) we get
[TABLE]
and so we showed that S~2Φ is (r,Q)-attainable.
The result now follows from Theorem 5.9 and Proposition 5.8.
∎
6. A brief comparison with classical attainability
As reported in p. 352 [CD] and at the beginning of Sec. 6.1 in [Car], we recall that if (Ω,B,P) is a sufficiently
“rich” probability space, i.e., Ω is a complete separable metric space, B is the Borel σ-algebra on Ω, and P
is an atomless Borel probability measure, given any μ1,μ2∈P2(Rd)
there exist X1,X2∈LPp(Ω) such that μi=Xi♯P, i=1,2, and Wp(μ1,μ2)=∥X1−X2∥LPp.
For instance, we can take Ω=[0,1] endowed with the restriction of the Lebesgue measure to [0,1].
This allows to use the well-known differential structure on LPp(Ω) (the case p=2 is the most common, in particular in the context of mean field games)
in order to formulate the problem and possible derive finer properties of regularity for the solutions, by relying for instance on the theory of viscosity solution in infinite-dimensional
Banach spaces.
For instance, in this setting (more oriented to a stochastic process interpretation) the representation of Remark 3.8 can be expressed as follows.
Corollary 6.1** (Stochastic SP).**
Let (Ω,F,P) be a reference probability space, where Ω is a Polish space and P∈P(Ω) an atomless measure. Then, μ={μt}t∈[0,T]⊆P2(Rd) is an admissible trajectory if and only if there exists a stochastic process X=X(⋅) with
[TABLE]
such that
•
μt=Xt♯P* for all t∈[0,T];*
•
X˙(t)∈F(μt,X(t))* for a.e. t∈[0,T].*
Proof.
The proof is a consequence of Proposition 3.7, it sufficies to give the relation between the measure η of Proposition 3.7 and the stochastic process X. By e.g. Lemma 5.29 in [CD], there exists a Borel map V:Ω→Rd×ΓT such that η=V♯P. We can thus conclude by setting Xt:=et∘V for all t∈[0,T], indeed we have μt=et♯η=Xt♯P.
∎
Here we will not follow this approach, since it is not in the purposes of the present paper to enter into this theory. However we actually implemented this more stochastic approach in a similar context in the preprint [CMQ]. Indeed, there our interest is the study of a viability problem in the probability measure space (P2(Rd),W2) by means of a suitable lifted Hamiltonian in L2(Ω).
For completeness, we mention that a theory of well-posedness for Hamilton-Jacobi equations in metric spaces has been introduced and developed for instance by [AF14, AGa, FK06, FN12, GT2019, GS].
In this section, we provide viscosity results related to our study with the purpose to compare the concept of (r,Q)-attainability given in Definition 5.6 with the classical one provided by [KQ] in the finite dimensional framework.
For this sake, we first study an Hamilton-Jacobi-Bellman equation associated with our time-optimal control problem in a suitable viscosity sense. In particular, we prove that the minimum time function is a viscosity supersolution of an HJB equation similarly to what occurs in the finite dimensional case.
Definition 6.2** (Superdifferential).**
Let 1<p<+∞, U:Pp(Rd)→R, μ∈Pp(Rd) and let p′ be the conjugate exponent of p. We say that q∈Lp′(Rd) belongs to the viscosity superdifferential of U at μ, and we write q∈D+U(μ), if for all ν∈Pp(Rd) and all π∈Π(μ,ν) we have
[TABLE]
Similarly, the set of viscosity subdifferentials of U at μ is defined by D−U(μ)=−D+(−U)(μ).
Definition 6.3** (Viscosity solution).**
Let 1<p<+∞, and U:Pp(Rd)→R. Let H(μ,q) be defined for any μ∈Pp(Rd) and q∈Lμp′(Rd). We say that
•
U is a viscosity subsolution of H(μ,DU(μ))=0 if U is u.s.c. and H(μ,qμ)≤0 for all qμ∈D+U(μ) and μ∈Pp(Rd);
•
U is a viscosity supersolution of H(μ,DU(μ))=0 if U is l.s.c. and H(μ,pμ)≥0 for all pμ∈D−U(μ) and μ∈Pp(Rd);
•
U is a viscosity solution of H(μ,DU(μ))=0 if it is both a super and a subsolution.
In the following, we prove that the minimum time function is a viscosity solution of an Hamilton-Jacobi-Bellman equation with the Hamiltonian H defined as follows
[TABLE]
for μ∈Pp(Rd), q(⋅)∈Lμp′(Rd)
where p′ is the conjugate exponent of 1<p<+∞.
Proposition 6.4**.**
Let 1<p<+∞ and S~p be
a generalized target. Assume Hypothesis 3.3 for F, and that (STLA) holds for the system. Then the minimum time function T~p is a viscosity solution of the HJB equation H(μ,DT~p(μ))=0, with Hamiltonian H defined in (6.1).
Proof.
By (STLA) assumption and Proposition 5.4, we get the continuity of T~p.
Let μ∈Pp(Rd).
Given a function vμ∈Lp(μ) with vμ(x)∈F(μ,x) for μ-a.e. x, there exists an admissible trajectory μ={μt}t∈[0,T] represented by η
satisfying Lemma 3.12(1).
According to the Dynamic Programming Principle (Proposition 5.2(3)), for all q∈D+T~p(μ) and for all πt∈Π(μ,μt)
[TABLE]
where we chose πt=(et,e0)♯η in the last line. By letting t→0+, Lemma 3.12(1) yields
[TABLE]
By taking the infimum on vμ∈Lp(μ) s.t. vμ(x)∈F(μ,x) for μ-a.e. x∈Rd, we have for all πt(ε)∈Π(μ,μt)
[TABLE]
thus T~p(⋅) is a viscosity subsolution of H(μ,DT~p(μ))=0.
On the other hand, from the Dynamic Programming Principle, for any ε>0 we also get the existence of an admissible trajectory μ(ε)={μt(ε)}t∈[0,T],
represented by η(ε) satisfying Lemma 3.12(2), such that for all p∈D−T~p(μ) and for all πt(ε)∈Π(μ,μt(ε))
[TABLE]
where we chose πt(ε)=(et,e0)♯η(ε) in the last line.
Consider the disintegration of η(ε) with respect to the evaluation operator at time t=0, i.e. η(ε)=μ⊗ηx(ε).
By Filippov’s measurable selection Theorem (see [AuF, Theorem 8.2.10, Corollary 8.2.13])
there exists wt∈Lμp(Rd) such that wt(x)∈F(μ,x) for μ-a.e. x∈Rd and
[TABLE]
where we used Jensen’s inequality in the last step. The last term vanishes as t→0+ by Lemma 3.12(2), and therefore for t sufficiently small
[TABLE]
Recalling that for μ-a.e. x∈Rd we have
[TABLE]
we have that ∥wt∥Lμp is bounded uniformly w.r.t. t,ε, and so by letting t→0+ and ε→0+ we get
[TABLE]
Thus T~p(⋅) is also a viscosity supersolution of H(μ,DT~p(μ))=0.
∎
Remark 6.5*.*
It seems natural that the combined use of (STLA) condition, of Grönwall estimate (see Theorem 3.11) together with a semiconcavity assumption for the distance to the target
can be used to derive a semiconcavity estimate for the generalized minimum time function, pretty much as in the finite-dimensional case (see e.g. [CS0]).
This topic will be subject of future investigation.
To conclude, we want to perform a comparison between the concept of (r,Q)-attainability of Definition 5.6 and the results obtained in [KQ].
Proposition 6.6**.**
Let 1<p<+∞. Assume Hypothesis 3.3 for F and that the generalized target S~pΦ is (r,Q)-attainable, with Q=Q(t,s) differentiable and such that
∂tQ(0,⋅)<0. Then
σΦ(⋅), defined in Definition 5.5, is a viscosity supersolution of
1+H(μ,DσΦ(μ))=0, in particular
[TABLE]
for all p(⋅)∈D−σΦ(μ), μ∈Pp(R2)∖S~pΦ.
Proof.
Let μ∈Pp(Rd)∖S~pΦ and μ∈A[0,t]p(μ) be an admissible trajectory represented by η according to Proposition 3.7 and Remark 3.8, with 0<t<r(σΦ(q)).
We notice that, for all p(⋅)∈D−σΦ(μ) we have
[TABLE]
In particular, according to (r,Q)-attainability condition, for every ε>0 and 0<t≤ε we can find μ(ε)∈A[0,t]p(μ) represented by η(ε)
such that
[TABLE]
where we used the previous estimate and divided by t>0.
Recalling the hypothesis on Q and that without loss of generality we can consider Q(0,⋅)=0, then by letting t→0+ and ε→0+ we obtain
[TABLE]
Here, we used the same arguments used in Proposition 6.4 when proving that T~p is a viscosity supersolution of an HJB equation with Hamiltonian H defined in (6.1). We remind that in order to be a supersolution, the continuity of T~p is not needed, and the l.s.c. is provided by Proposition 5.2.
So, we got that σΦ(⋅) is a viscosity supersolution of 1+H(μ,DσΦ(μ))=0, thus the conclusion noting that the expression above can be equivalently written as
[TABLE]
∎
Remark 6.7*.*
Notice that the expression obtained above in (6.2) represents a natural counterpart of formula (27) in [KQ] (and subsequent extensions, see Corollary 3.5 and Remark 3.3 of [KQ]).
Here, the Lipschitz continuity requested in [KQ] is replaced by an integrability assumption of the derivative ∂tQ.
Therefore, under these hypothesis, (r,Q)-attainability can be seen as a sampled form of the assumption in [KQ], indeed in our framework the decreasing condition (27) is checked
along admissible trajectories only at time steps of size given by r(⋅).
Acknowledgements: G.C. has been partially supported by Cariplo Foundation and Regione Lombardia via project Variational Evolution Problems and Optimal Transport and by MIUR PRIN 2015 project Calculus of Variations, together with FAR funds of the Department of Mathematics of the University of Pavia.
The authors finally thank both the referees for their suggestions which definetely helped us to improve the presentation of the paper and to better frame it in the existing literature.