Convergence of the solutions of discounted Hamilton--Jacobi systems
Andrea Davini, Maxime Zavidovique

TL;DR
This paper proves that solutions to a weakly coupled system of discounted Hamilton--Jacobi equations on a Riemannian manifold converge to a specific limit as the discount factor approaches zero, using generalized Mather measures and random representations.
Contribution
It introduces a generalized Mather measure framework for Hamilton--Jacobi systems and establishes convergence results for discounted solutions on manifolds.
Findings
Solutions converge to a specific limit as discount factor approaches zero
Generalized Mather measures are used to analyze the system
Random representation formulas facilitate the convergence proof
Abstract
We consider a weakly coupled system of discounted Hamilton--Jacobi equations set on a closed Riemannian manifold. We prove that the corresponding solutions converge to a specific solution of the limit system as the discount factor goes to zero. The analysis is based on a generalization of the theory of Mather minimizing measures for Hamilton--Jacobi systems and on suitable random representation formulae for the discounted solutions.
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.
Convergence of the solutions
of discounted Hamilton–Jacobi systems
Andrea Davini and Maxime Zavidovique
Dip. di Matematica, Sapienza Università di Roma, P.le Aldo Moro 2, 00185 Roma, Italy
IMJ-PRG (projet Analyse Algébrique), UPMC, 4, place Jussieu, Case 247, 75252 Paris Cedex 5, France
(Date: February 24, 2017)
Abstract.
We consider a weakly coupled system of discounted Hamilton–Jacobi equations set on a closed Riemannian manifold. We prove that the corresponding solutions converge to a specific solution of the limit system as the discount factor goes to [math]. The analysis is based on a generalization of the theory of Mather minimizing measures for Hamilton–Jacobi systems and on suitable random representation formulae for the discounted solutions.
Key words and phrases:
asymptotic behavior of solutions, Mather measures, weak KAM Theory, viscosity solutions, optimal control
2010 Mathematics Subject Classification:
35B40, 37J50, 49L25.
Work supported by ANR-07-BLAN-0361-02 KAM faible & ANR-12-BS01-0020 WKBHJ
Introduction
In this paper, we are interested in the asymptotic behavior, as , of the solutions of the following system of weakly coupled Hamilton–Jacobi equations
[TABLE]
for , where is a compact, connected Riemannian manifold without boundary, is a real number, are continuous function on , convex and coercive in the gradient variable, and is an irreducible and weakly diagonally dominant matrix, see Section 1.2 for the precise assumptions. The solution is assumed to be continuous and to solve the above system in the viscosity sense. The sign and degeneracy condition assumed on the coefficients of amounts to requiring that is the generator of a semigroup of stochastic matrices.
It is convenient to restate the system in the following vectorial form
[TABLE]
where we have used the notations \mathbb{H}(x,D\mathbf{u})=\big{(}H_{1}(x,Du_{1}),\cdots,H_{m}(x,Du_{m})\big{)}^{T} and . The conditions assumed on imply, in particular, that .
When , there is a unique value for which (1) admits solutions, hereafter denoted by and termed critical. Furthermore, the solutions of the critical system
[TABLE]
are not unique, not even up to addition of vectors of the form , in general.
When , on the other hand, the system (1) satisfies a comparison principle, yielding the existence of a unique continuous solution for every fixed . Moreover, the solutions are equi–Lipschitz. The peculiarity of the discounted system (1) when relies on the fact that the corresponding solutions are also equi–bounded. By Ascoli–Arzelà Theorem and by the stability of the notion of viscosity solution, we infer that they uniformly converge, along subsequences as goes to [math], to viscosity solutions of the critical system (2). Since the solutions of the critical system are not unique, it is not clear at this level that the limits of the along different subsequences yield the same critical solution.
In this paper, we address this question. The main theorem we will establish is the following:
Theorem 1**.**
Let be the solution of system (1) with and . The functions uniformly converge as to a single solution of the critical system (2).
We will characterize in terms of a generalized notion of Mather minimizing measure for HJ systems.
Notice that the relationship between and when varies is rather straightforward: it is easily verified that . As a consequence, we derive from Theorem 1 the following fact:
Theorem 2**.**
Let be the solution of system (1) with . Then, as , the functions uniformly converge in to the constant vector \big{(}c-c(\mathbb{H})\big{)}\mathbbm{1} and the functions uniformly converge to in .
Theorem 2 for can be restated by saying that the ergodic approximation selects a specific critical solution in the limit. The ergodic approximation is a classical technique introduced in [14] for the case of a single equation (i.e. with and ). Since then, it has been extended and applied to many different settings, including the case of weakly coupled systems of Hamilton–Jacobi equations, see [3, 16]. This technique is typically employed to show the existence and uniqueness of the critical value and the existence of a solution of the corresponding critical problem. The latter is usually obtained by renormalizing the discounted solutions so to produce a family of equi–bounded and equi–Lipschitz functions satisfying suitable perturbed discounted problems (for instance, the family in the case of HJ systems) and by taking limits, along subsequences as , of these renormalized functions. The fact that the limit is unique has been recently established in [7] for the case of a single equation by using tools and results issued from weak KAM Theory. This selection principle has been subsequently generalized in different directions, see [1, 6, 10, 12, 13, 18], testifying the interest for the issue.
The extension of the selection principle to HJ systems provided in the present work is based on a generalization of the theory of Mather minimizing measures, which is new in this setting and enriches the frame of analogies with weak KAM theory for scalar Eikonal equations. This stream of research was initiated in [3] with the proof of the long–time convergence of the solutions to evolutive HJ systems, under hypotheses close to [19]. Other outputs in this vein can be found in a series of works including [20, 17]. The links with weak KAM theory were further made precise by the authors of the present paper in [9] where, by purely using PDE tools and viscosity solution techniques, an appropriate notion of Aubry set for systems was given and some relevant properties of it were generalized from the scalar case. A dynamical and variational point of view of the matter, integrating the PDE methods, was later brought in by [15, 11]. This angle allowed the authors to detect the stochastic character of the problem, displayed by the random switching nature of the dynamics and by the role of an adapted action functional. Representation formulae for viscosity (sub)solutions of the critical systems and a cycle characterization of the Aubry set were derived.
The random frame introduced in [15] and subsequently developed in [8] is the starting point of our analysis. It is exploited to provide suitable random representation formulae for the solutions of both the critical and the discounted system. A point that is crucial to our purposes consists in showing the existence of admissible minimizing curves in such formulae. This is done by making use of the results proved in [8] and by adapting the construction therein employed to the discounted system case.
The paper is organized as follows: in Section 1 we fix notations and the standing assumptions, and we provide some preliminary results on the critical and discounted systems. In Section 2 we present the random frame in which our analysis takes place and we prove suitable random representation formulae for the solutions of the critical and discounted systems. In Section 3 we generalize the theory of Mather minimizing measures to the case of HJ systems. Section 4 contains the proof of Theorem 1.
Acknowledgements. This research was initiated in May 2015, while the first author was visiting, as Professeur Invité, the Institut de Mathématiques de Jussieu, Université Pierre et Marie Curie (Paris), that he gratefully acknowledges for the financial support and hospitality.
1. Preliminaries
1.1. Notations
In this work, we will denote by the –dimensional flat torus , where is an integer number. This is done to simplify the notation and to be consistent with the references we will use. We remark however that our results and proofs keep holding, mutatis mutandis, whenever is a compact connected Riemannian manifold without boundary. The associated Riemannian distance on will be denoted by . We denote by the tangent bundle and by a point of , with and . In the same way, a point of the cotangent bundle will be denoted by , with and a linear form on the vector space . The latter will be identified with the vector such that
[TABLE]
where denotes the Euclidean scalar product in . The fibers and are endowed with the Euclidean norm , for every .
With the symbols and we will refer to the set of positive integer numbers and nonnegative real numbers, respectively. We say that a property holds almost everywhere ( for short) in a subset of (respectively, of ) if it holds up to a negligible subset of , i.e. a subset of zero –dimensional (resp., –dimensional) Lebesgue measure.
Given a continuous function on and a point , we will denote by and the set of subdifferential and superdifferential of at , respectively. When is locally Lipschitz in , we will denote by the set of Clarke’s generalized gradient of at , see [5] for a detailed presentation of the subject.
We will denote by the usual –norm of , where the latter is a measurable real function defined on . We will denote by \big{(}\mbox{\rm C}(M)\big{)}^{m} the Banach space of continuous functions from to , endowed with the norm
[TABLE]
We will write in to mean that . A function \mathbf{u}\in\big{(}\mbox{\rm C}(M)\big{)}^{m} will be termed Lipschitz continuous if each of its components is –Lipschitz continuous, for some . Such a constant will be called a Lipschitz constant for . The space of all such functions will be denoted by \big{(}\mbox{\rm Lip}(M)\big{)}^{m}.
We will denote by the vector of having all components equal to 1, where the upper–script symbol stands for the transpose. We consider the following partial relations between elements : if (resp., ) for every . Given two functions , we will write in (respectively, ) to mean that (resp., ) for every .
1.2. Weakly coupled systems
Throughout the paper, we will assume the Hamiltonians to be continuous functions on satisfying, for every ,
- (H1)
(convexity) p\mapsto H_{i}(x,p)\qquad\hbox{is convex on \mathbb{R}^{N}x\in M;}
- (H2)
(coercivity) there exist two coercive functions such that
[TABLE]
For our analysis, it will be convenient and non restrictive, see Section 2, to reinforce this coercivity condition in favor of the following:
- (H2*′*)
(superlinearity) there exist two superlinear functions such that
[TABLE]
We recall that a function is termed coercive if as , while it is termed superlinear if as .
In the sequel, we will denote by the set of subdifferentials at of the function in the sense of convex analysis. We recall that, due to conditions (H1)–(H2), the function is locally Lipschitz in , with a local Lipschitz constant that can be chosen independent of . In particular, the sets are uniformly bounded for fixed .
The coupling matrix has dimensions and satisfies
- (B1)
b_{ij}\leqslant 0\ \hbox{for j\not=i,}\quad\quad\sum_{j=1}^{m}b_{ij}=0;
- (B2)
is irreducible, i.e. for every subset there exist and such that .
For and , we consider the following weakly coupled system of Hamilton–Jacobi equations
[TABLE]
where we have adopted the notation \mathbb{H}(x,D\mathbf{u})=\big{(}H_{1}(x,Du_{1}),\cdots,H_{m}(x,Du_{m})\big{)}^{T}.
Let . We will say that is a viscosity subsolution of (1.1) if the following inequality holds for every
[TABLE]
We will say that is a viscosity supersolution of (1.1) if the following inequality holds for every
[TABLE]
We will say that is a viscosity solution if it is both a sub and a supersolution. In the sequel, solutions, subsolutions and supersolutions will be always meant in the viscosity sense, hence the adjective viscosity will be omitted.
When , there exists a unique value for which the system (1.1) admits solutions, hereafter denoted by and termed critical. In fact, can be also characterized as
[TABLE]
see [9] for a detailed analysis.
We recall from [9] the following result, that will be crucial for our analysis:
Proposition 1.1**.**
Let \mathbf{u}=(u_{1},\dots,u_{m})^{T}\in\big{(}\mbox{\rm C}(M)\big{)}^{m} be a subsolution of (1.1) with and . Then there exist constants and , only depending on , on the Hamiltonians and on the coupling matrix , such that
- (i)
\|u_{i}-u_{j}\|_{\infty}\leqslant C_{c}\ \quad\qquad\hbox{for every i,,j\in{1,\dots,m};}
- (ii)
* is –Lipschitz continuous in .*
We proceed presenting some basic facts about the discounted system, i.e. system (1.1) when . The following existence and uniqueness result depends on the fact that the matrix is non degenerate as soon as .
Proposition 1.2**.**
Let and . Let \mathbf{v},\mathbf{u}\in\big{(}\mbox{\rm C}(M)\big{)}^{m} be respectively a subsolution and a supersolution to (1.1), then . In particular, there exists a unique solution in \big{(}\mbox{\rm C}(M)\big{)}^{m}.
Proof.
The first assertion is a consequence of Proposition 2.8 in [9], while the second follows via a standard application of Perron’s method. ∎
As already mentioned in the Introduction, the relationship between those solutions when varies is given by . In particular, it follows that as , the family may be bounded at most for one value .
We now explain why this is the case for .
Proposition 1.3**.**
Let us denote by the unique solution in \big{(}\mbox{\rm C}(M)\big{)}^{m} of (1.1) with and . Then the functions are equi–Lipschitz and equi–bounded. In particular, as .
Proof.
Let \mathbf{u}\in\big{(}\mbox{\rm C}(M)\big{)}^{m} be a solution of (1.1) with and . By taking big enough, it follows that takes only positive values and takes only negative values. Therefore, and are respectively a super and a subsolution of (1.1) with for any parameter . By Proposition 1.2 we infer that in for all , thus proving the asserted equi–bounded character of the .
Let us now prove that is Lipschitz and its Lipschitz constant can be chosen independent of . Let us set . The function \mathbf{w}\equiv-\mathbbm{1}\big{(}b-c(H)\big{)}/\lambda is obviously a subsolution of (1.1) with . By Proposition 1.2, we must have \lambda\mathbf{u}^{\lambda}\geqslant\big{(}-b+c(H)\big{)}\mathbbm{1} in , hence
[TABLE]
in the viscosity sense. According to Proposition 1.1 we conclude that is –Lipschitz, where the constant only depends on the constant , on the Hamiltonians and on the coupling matrix . ∎
Remark 1.4**.**
Note that . This readily follows from the characterization of given in (1.2) after noticing that the null function is a subsolution of (1.1) with and .
**
2. Random representation formulae for solutions
In this section, we will establish suitable representation formulae for the solution of the following system
[TABLE]
when either or . This will be done by adopting the random frame introduced in [8] and by adapting the strategy therein employed to the case at issue. In the sequel, we shall refer to the system (2) and its corresponding (sub, super) solutions as discounted when , critical when .
To implement this program, we need to assume that the Hamiltonians satisfy the stronger growth assumption (H2*′*). We want to explain here why this is not restrictive for our analysis. According to the proof of Proposition 1.3, the discounted solutions satisfy
[TABLE]
in the viscosity sense with . In view of Remark 1.4, this is also true for the (sub-)solutions of the critical system. Therefore all these functions are –Lipschitz continuous, with chosen according to Proposition 1.1. We can therefore modify each Hamiltonian outside the compact set to obtain a new Hamiltonian which is still continuous and convex, and satisfies the stronger growth condition (H2*′*). Since on for each , it is easily seen that and the solutions of the corresponding critical and discounted systems are the same.
In the remainder of the paper, we will therefore assume each Hamiltonian to be convex and superlinear in , i.e. hypotheses (H1) and (H2*′*) will be in force. This allows us to introduce the associated Lagrangian defined as follows:
[TABLE]
As well known, satisfies properties analogous to (H1)–(H2*′*). By definition of we derive
[TABLE]
which is known as Fenchel’s inequality.
2.1. Random frame
We briefly recall the random frame in which our analysis takes place, see [8] for more details. We take as sample space the space of paths that are right–continuous and possess left–hand limits (known in literature as càdlàg paths, a French acronym for continu à droite, limite à gauche, see Billingsley’s book [2] for a detailed treatment of the topic). By càdlàg property and the fact that the range of is finite, the points of discontinuity of any such path are isolated and consequently finite in compact intervals of and countable (possibly finite) in the whole of . We call them jump times of .
The space is endowed with a distance, named after Skorohod, see [2], which turns it into a Polish space. We denote by the corresponding Borel –algebra and, for every , by the map that evaluates each at , i.e. for every . It is known that is the minimal –algebra that makes all the functions measurable, i.e. for every and .
Let us now fix an matrix satisfying assumption (B1)–(B2). We record that is a stochastic matrix for every , namely a matrix with nonnegative entries and with each row summing to 1. We endow of a probability measure defined on the –algebra in such a way that the right–continuous process is a Markov chain with generator matrix , i.e. it satisfies the Markov property
[TABLE]
for all times , states and . We will denote by the probability measure conditioned to the event and write for the corresponding expectation operators. It is easily seen that the Markov property (2.3) holds with in place of , for every .
In the sequel, we will call random variable a map X:(\Omega,\mathcal{F})\to\big{(}\mathbb{F},\mathscr{B}(\mathbb{F})\big{)}, where is a Polish space and its Borel –algebra, satisfying for every . Let us denote by \mbox{\rm C}\big{(}\mathbb{R}_{+};M\big{)} the Polish space of continuous paths taking values in , endowed with a metric that induces the topology of local uniform convergence in .
We call admissible curve a random variable \gamma:\Omega\to\mbox{\rm C}\big{(}\mathbb{R}_{+};M\big{)} such that
- (i)
it is uniformly (in ) locally (in ) absolutely continuous, i.e. given any bounded interval and , there is such that
[TABLE]
for any finite family of pairwise disjoint intervals contained in I and for any ;
- (ii)
it is nonanticipating, i.e. for any
[TABLE]
We will say that is an admissible curve starting at when for every .
Given an admissible curve \gamma:\Omega\to\mbox{\rm C}\big{(}\mathbb{R}_{+};M\big{)} and , we will denote by the –norm of the derivative of the curve .
We record for later use the following Dynkin’s formula, see [8, Theorem 4.7] for a proof:
Theorem 2.1**.**
Let be a locally Lipschitz function and an admissible curve. Then, for every index , we have
[TABLE]
*for a.e. .
2.2. Representation formulae
In this section, we establish some representation formulae for solutions of the system (2). We begin with the critical system.
Theorem 2.2**.**
Let \mathbf{u}\in\big{(}\mbox{\rm Lip}(M)\big{)}^{m} be a critical solution, namely a solution of (2) with . Let and be fixed.
- (i)
The following holds:
[TABLE]
where the minimization is performed over all admissible curves \gamma:\Omega\to\mbox{\rm C}\big{(}\mathbb{R}_{+};M\big{)} starting at .
- (ii)
There exists an admissible curve \eta:\Omega\to\mbox{\rm C}\big{(}\mathbb{R}_{+};M\big{)} starting at for which such a minimum is attained. Moreover, for every , the following holds:
[TABLE]
In particular, there exists a constant , only depending on and such that for every .
Proof.
The assertion follows as a simple consequence of the results proved in [8]. It is easily seen that the function is a solution of the time–dependent system
[TABLE]
with initial datum . Item (i) and the first assertion in (ii) readily follow from [8, Theorem 6.1]. Let us prove (2.7). Fix . According to Lemma 6.8 and Lemma 1.4 in [8], for a.e. there exists p_{s}\in\partial^{c}u_{\omega(s)}\big{(}\eta(s,\omega)\big{)} such that
[TABLE]
hence, by Fenchel’s duality we get . The remainder of the statement follows from Proposition 1.1 and the fact that is bounded on compact subsets of due to (H1)–(H2*′*). ∎
Let us now consider the discounted system.
Theorem 2.3**.**
Let \mathbf{u}^{\lambda}\in\big{(}\mbox{\rm Lip}(M)\big{)}^{m} be the solution of (2) with . Let be fixed.
- (i)
The following holds:
[TABLE]
where the minimization is performed over all admissible curves \gamma:\Omega\to\mbox{\rm C}\big{(}\mathbb{R}_{+};M\big{)} starting at .
- (ii)
There exists an admissible curve \eta^{\lambda}:\Omega\to\mbox{\rm C}\big{(}\mathbb{R}_{+};M\big{)} starting at for which such a minimum is attained. Moreover, for every , the following holds:
[TABLE]
In particular, there exists a constant , only depending on and such that for every and .
Proof.
Let \gamma:\Omega\to\mbox{\rm C}\big{(}\mathbb{R}_{+};M\big{)} be an admissible curve starting at . By applying Dynkin’s formula to the function and by integrating (2.6) on we get
[TABLE]
We now make use of Fenchel’s inequality together with the fact that is a solution of the discounted system (2). Arguing as in the proof of Proposition 5.6 in [8] we end up with
[TABLE]
Next, we prove that there exists an admissible curve \eta^{\lambda}:\Omega\to\mbox{\rm C}\big{(}\mathbb{R}_{+};M\big{)} starting at for which (2.10) holds with an equality. This will be obtained via a slight modification of the strategy employed in [8]. Let . It is readily verified that verifies the following system:
[TABLE]
In particular is, for each fixed , a solution to the equation
[TABLE]
where G_{i}(t,x,p)=\textrm{\rm e}^{\lambda t}\big{(}H_{i}(x,\textrm{\rm e}^{-\lambda t}p)-c(\mathbb{H})\big{)}+\sum_{k=1}^{m}b_{ik}v_{k}(t,x). As is locally Lipschitz, it is standard, see for instance Appendix A in [8], that it verifies the following Lax–Oleinik formula for every :
[TABLE]
where is the Lagrangian associated to by duality and the infimum is taken amongst all absolutely continuous curves such that . By standard results in the Calculus of Variations, we know that this infimum is in fact a minimum. For any fixed , let us denote by be an absolutely continuos curve with and realizing the minimum in (2.11) with . By the Dynamic Programming Principle, such a curve is also a minimizer of (2.11) for every . Arguing as in the proof of Theorem 2.2, we get
[TABLE]
for a.e. . Due to the equi–Lispchitz character of the functions established in Proposition 1.3, we infer that there exists a constant , independent of and , so that . Note that L_{G_{i}}(t,x,v)=\textrm{\rm e}^{\lambda t}\big{(}L_{i}(x,v)+c(\mathbb{H})-\sum_{k=1}^{m}b_{ik}u^{\lambda}_{k}(x)\big{)}. It follows that
[TABLE]
for every . Letting and extracting a subsequence, we obtain a curve with and satisfying the previous equality for every . By sending , we end up with
[TABLE]
Now the proof ends exactly as in [8]. For every , we denote by the set of absolutely continuous curves with satisfying (2.13). The set is nonempty, in view of the preceding discussion. Moreover, any curve in satisfies (2.12) for a.e. , in particular it is –Lipschitz continuous. We derive that is compact–valued and upper semicontinuous as a set–valued map from to \mbox{\rm C}\big{(}\mathbb{R}_{+};M\big{)}, in particular it is measurable. By [4, Theorem III.8], there exists a measurable function \Xi:M\times\{1,\dots,m\}\to\mbox{\rm C}\big{(}\mathbb{R}_{+};M\big{)} such that
[TABLE]
For any fixed , let \big{(}\tau_{k}(\omega)\big{)}_{k\geqslant 0} be the sequence of jump times of , where and is the –th jump time. We define inductively a sequence \big{(}y_{k}(\omega)\big{)}_{k\geqslant 0} of points in by setting and
[TABLE]
The sought curve is given by
[TABLE]
for every and . Arguing as in [8, Section 6], one can check that is an admissible curve starting at for which (2.10) holds with an equality. The fact that satisfies (2.9) is clear by construction in view of (2.12). ∎
3. Mather measures for the critical system
In this section we generalize the notion of Mather minimizing measure to the case of the critical system, i.e.
[TABLE]
It is not so surprising that such measures will be concentrated on the support of minimizing controls associated to solutions of (3.1).
We start by adapting the notion of closed measure to this setting.
Definition 3.1**.**
A probability measure on will be termed closed if
- (i)
;
- (ii)
\displaystyle\int_{TM\times\{1,\dots,m\}}\big{(}B\bm{\phi}(x)\big{)}_{i}+\langle D\phi_{i}(x),v\rangle\ \mbox{\rm d}\mu(x,v,i)=0* for every \bm{\phi}\in\big{(}\mbox{\rm C}^{1}(M)\big{)}^{m}.*
*We will denote by the set of closed measures on .
Theorem 3.2**.**
The following holds:
[TABLE]
In particular, is non empty.
Proof.
We first observe that, for every , there exists a function \mathbf{w}^{\varepsilon}\in\big{(}\mbox{\rm C}^{1}(M)\big{)}^{m} such that
[TABLE]
To see this, take a solution of (3.1) and regularize it via convolution with a standard mollifier. The above inequality follows, for a proper choice of the mollifier, via a well known argument based on Jensen’s inequality, the convexity of the Hamiltonians and the fact that is Lipschitz.
By integrating (3.3) with respect to a measure and by using Fenchel’s inequality we get:
[TABLE]
Since is closed, the left hand side is equal to . By letting we obtain
[TABLE]
Let us now proceed to prove the existence of a minimizing closed measure. To this aim, take a critical solution and fix . For every , let \eta_{k}:\Omega\to\mbox{\rm C}\big{(}\mathbb{R}_{+};M\big{)} be an admissible curve starting at and such that
[TABLE]
We define a probability measure on by setting
[TABLE]
In view of Theorem 2.2, these measures have support contained in a common compact subset of , so, up to subsequences, weakly converges to a probability measure on . Let us show that is closed. It clearly satisfies item (i) of Definition 3.1 since its support is compact. Let \bm{\phi}\in\big{(}\mbox{\rm C}^{1}(M)\big{)}^{m}. By applying Dynkin’s formula to the function , see Theorem 2.1, and by integrating (2.6) in we get
[TABLE]
otherwise stated
[TABLE]
By sending we infer that satisfies item (ii) in Definition 3.1 as well. To prove that is minimizing, we remark that, in view of (3.4) and the fact that the measures have equi–compact support, we have
[TABLE]
∎
We will call Mather measure a closed probability measure on which minimizes (3.2). The set of Mather measures will be denoted by in the sequel.
4. Convergence of the discounted solutions
This section is devoted to the proof of Theorem 1, namely that the solutions of the discounted system (2) converge to a particular solution of the critical system (3.1) as .
The first step consists in identifying a good candidate for the limit of the solutions . To this aim, we consider the family of subsolutions \mathbf{w}\in\big{(}\mbox{\rm C}(M)\big{)}^{m} of the critical system (3.1) satisfying the following condition
[TABLE]
where denotes the set of Mather measures, see Section 3.
Note that, given any critical subsolution , the function is in . Therefore is not empty.
Lemma 4.1**.**
The family is uniformly bounded from above, i.e.
[TABLE]
Proof.
Let us denote by and the constants provided by Proposition 1.1 for . Pick . For , we have
[TABLE]
Let such that . Since is -Lipschitz, we infer
[TABLE]
On the other hand, for we have in . ∎
Therefore we can define by
[TABLE]
As the supremum of an equi–Lipschitz family of critical subsolutions, we get that is Lipschitz continuous and a critical subsolution as well, see [9, Proposition 1.6]. As a consequence of our convergence result, we will obtain in the end that is a critical solution belonging to .
We proceed by studying the asymptotic behavior of the discounted solutions as and the relation with . Let us denote by
[TABLE]
Note that any function in is a solution to the critical system (3.1) by the stability of the notion of viscosity solution.
We begin with the following result:
Proposition 4.2**.**
Let . Then
[TABLE]
In particular, .
Proof.
Fix . The assertion will be a direct consequence of the following fact:
[TABLE]
Indeed, let us fix . Regularizing by convolution, we find a sequence of smooth functions such that and
[TABLE]
By integrating this inequality with respect to and by using Fenchel’s inequality we get
[TABLE]
where for the last equality we have used the fact that is closed and minimizing. The inequality (4.3) follows after sending and dividing by . ∎
The next (and final) step is to show that in whenever . This will be obtained by defining a special family of probability measures on for the discounted systems (2). The construction is the following: fix and, for every , let \eta^{\lambda}:\Omega\to\mbox{\rm C}\big{(}\mathbb{R}_{+};M\big{)} be an admissible curve starting at that realizes the infimum in (2.8). We define a probability measure on by setting
[TABLE]
for every \mathbf{f}\in\big{(}\mbox{\rm C}_{c}(TM)\big{)}^{m}. The following holds:
Proposition 4.3**.**
The measures defined above are probability measures on , whose supports are all contained in a common compact subset of . In particular, they are relatively compact in the space of probability measures on with respect to the weak convergence. Furthermore, if is weakly converging to for some sequence , then is a minimizing Mather measure.
Proof.
According to Theorem 2.3, there exists a constant such that for every and . Set . Then the measures are all supported in the compact set and are probability measures, as it can be easily checked by their definition. This readily implies the asserted relative compactness of . Let now assume that is weakly converging to for some . Then is a probability measure with support in , in particular it satisfies item (i) in Definition 3.1. Moreover, if \bm{\phi}\in\big{(}\mbox{\rm C}^{1}(M)\big{)}^{m}, by Dynkin’s formula applied to the function , see Theorem 2.1, we get
[TABLE]
yielding
[TABLE]
By setting in the previous equality and sending we infer
[TABLE]
thus proving that is closed.
To prove that is minimizing, we recall that, by definition,
[TABLE]
The assertion follows by setting and sending . ∎
We proceed by proving a lemma that will be crucial for the proof of Theorem 1.
Lemma 4.4**.**
Let be any critical subsolution. For every and we have
[TABLE]
where is the probability measure defined by (4.4).
Proof.
Let be a critical subsolution. By convolution with a regularizing kernel, we construct a family of smooth function uniformly converging such that
[TABLE]
Starting again from the definition of and by exploiting Fenchel’s inequality we obtain
[TABLE]
Using the definition of and Dynkin’s formula with , see Theorem 2.1, we get
[TABLE]
The desired inequality follows by sending . ∎
We have now all the ingredients to prove our main result.
Proof of Theorem 1.
Let . By Proposition 4.2, we already know that . Let us prove the opposite inequality. By definition, there exists a sequence such that as . Pick and fix . By setting in (4.5) and by sending , we infer, thanks to Proposition 4.3, that there exists a Mather measure such that
[TABLE]
where, for the last inequality, we have used the fact that . As this is true for any and arbitrary , we infer that . This concludes the proof. ∎
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] E. S. Al-Aidarous, E. O. Alzahrani, H. Ishii, and A. M. M. Younas , A convergence result for the ergodic problem for Hamilton-Jacobi equations with Neumann-type boundary conditions , Proc. Roy. Soc. Edinburgh Sect. A, 146 (2016), pp. 225–242.
- 2[2] P. Billingsley , Convergence of probability measures , Wiley Series in Probability and Statistics: Probability and Statistics, John Wiley & Sons, Inc., New York, second ed., 1999. A Wiley-Interscience Publication.
- 3[3] F. Camilli, O. Ley, P. Loreti, and V. D. Nguyen , Large time behavior of weakly coupled systems of first-order Hamilton–Jacobi equations , No DEA Nonlinear Differential Equations Appl., 19 (2012), pp. 719–749.
- 4[4] C. Castaing and M. Valadier , Convex analysis and measurable multifunctions , Lecture Notes in Mathematics, Vol. 580, Springer-Verlag, Berlin-New York, 1977.
- 5[5] F. H. Clarke , Optimization and nonsmooth analysis , Canadian Mathematical Society Series of Monographs and Advanced Texts, John Wiley & Sons Inc., New York, 1983. A Wiley-Interscience Publication.
- 6[6] A. Davini, A. Fathi, R. Iturriaga, and M. Zavidovique , Convergence of the solutions of the discounted equation: the discrete case , Math. Z., 284 (2016), pp. 1021–1034.
- 7[7] , Convergence of the solutions of the discounted Hamilton-Jacobi equation: convergence of the discounted solutions , Invent. Math., 206 (2016), pp. 29–55.
- 8[8] A. Davini, A. Siconolfi, and M. Zavidovique , Random Lax–Oleinik semigroups for Hamilton–Jacobi systems , Ar Xiv e-prints, (2016).
