Twisted Lax--Oleinik formulas and weakly coupled systems of Hamilton--Jacobi equations
Maxime Zavidovique

TL;DR
This paper introduces a method to approximate viscosity solutions of weakly coupled Hamilton--Jacobi systems using iterated twisted Lax--Oleinik operators, proving convergence and analyzing properties of the approximations.
Contribution
It presents a novel iterative scheme for approximating solutions of coupled Hamilton--Jacobi systems and proves its convergence.
Findings
Convergence of the iterated scheme to the true solution.
Properties of the approximate solutions are characterized.
The method extends classical Lax--Oleinik formulas to coupled systems.
Abstract
We show that viscosity solutions of evolutionary weakly coupled systems of Hamilton--Jacobi equations can be approximated by iterated twisted Lax--Oleinik like operators. We establish convergence to the solution of the iterated scheme and discuss further properties of the approximate 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.
Taxonomy
TopicsOptimization and Variational Analysis · Nonlinear Partial Differential Equations · Geometric Analysis and Curvature Flows
Twisted Lax–Oleinik formulas and weakly coupled systems of Hamilton–Jacobi equations
Maxime Zavidovique
IMJ (projet Analyse Algébrique), UPMC, 4, place Jussieu, Case 247, 75252 Paris Cédex 5, France
Abstract.
Nous démontrons que les solutions de viscosité d’un système faiblement couplé d’équations d’Hamilton–Jacobi peuvent–être approchées par des itérations d’opérateurs tordus à la Lax–Oleinik. On établit la convergence vers la solution du schéma itératif et mettons en exergue quelques propriétés supplémentaires des solutions approchées.
Abstract.
We show that viscosity solutions of evolutionary weakly coupled systems of Hamilton–Jacobi equations can be approximated by iterated twisted Lax–Oleinik like operators. We establish convergence to the solution of the iterated scheme and discuss further properties of the approximate solutions.
Key words and phrases:
weakly coupled systems of Hamilton–Jacobi equations, viscosity solutions, weak KAM Theory
2010 Mathematics Subject Classification:
35F21, 49L25, 37J50.
Introduction
Representation formulas for solutions of Hamilton–Jacobi equations with Tonelli Hamiltonians are the starting point of important theories studying the qualitative properties of the PDE and of the associated dynamical system. Of course, we have in mind Fathi’s weak KAM theory which builds a bridge between solutions of the stationary equation (or cell problem) and Aubry-Mather theory which deals with action minimizing trajectories and measures.
Establishing such a dual point of view has led to striking results, let us mention, out of many others, two of them: the longtime convergence of solutions of the Hamilton–Jacobi equation (see for example [16, 12]) and the convergence of solutions to the discounted equations ([11, 19]). For both of those examples, purely PDE proofs were later on found (for instance in [4, 2, 5, 18] and references therein).
A natural generalization of Hamilton–Jacobi equations are systems of Hamilton–Jacobi equations and more particularly, weakly coupled systems, meaning that the coupling only appears on the [math] order terms. Ironically, weak KAM theory for those systems evolved backward compared to what happened for a single equation. The study of the critical equation was done first, from a purely PDE angle in [14], before the dynamical aspects were highlighted ([20, 17]). Recently, Lax–Oleinik formulas, combined with a random framework were studied for evolutionary equation in [13]. However deterministic approaches had been tried previously without success.
The goal of this paper is to take those deterministic formulas as a starting point and see how to recover the solutions of the weakly coupled system from them. We expect the reader to have some familiarity with viscosity solutions, see [1] for an introduction on the subject.
0.1. Acknowledgement
The author wishes to thank A. Davini, with whom he started thinking about this problem, for his insight and for enriching conversations. This research was financed by ANR WKBHJ (ANR-12-BS01-0020).
The author thanks the anonymous referee for his helpful advise in improving the presentation of the paper.
1. Setting and main result
We will consider Lagrangians on . They will be denoted by .
Moreover, for technical reasons, we will make a couple of assumptions on the growth of the and their derivatives.
Definition 1.1**.**
In the following is a function (called Nagumo function) such that
[TABLE]
We will say that a function is a good Lagrangian if it verifies the following set of hypotheses
- (L1)
the Lagrangian is a function and for all , is a strictly convex function;
- (L2)
there exists constants and such that
[TABLE]
We will hence assume that all the , are good Lagangians (with a common Nagumo function and constants and ).
Remark 1.2**.**
This hypothesis is mainly technical and serves at one specific instance: Theorem 2.1 and its application in Proposition 3.3. It allows to obtain automatic Lipschitz estimates of minimizers of a minimization problem involving time–dependent Lagrangians. For autonomous Lagrangians, such hypotheses are not needed thanks to conservation of energy and Clarke–Vinter’s theorem ([10]) but we will have to deal with non–autonomous Lagrangians. **
Definition 1.3**.**
A matrix is a coupling matrix if its non–diagonal entries are non–positive and the sum of the elements of each line is non negative.
It follows from the above definition that the diagonal entries of verify .
We recall that given a Lagrangian on , such that each verifies the above hypotheses, its Hamiltonian is defined by
[TABLE]
The Hamiltonian is then a strictly convex function of , it is also superlinear.
In what follows, is the Hamiltonian associated to ;
Definition 1.4**.**
Let be a continuous initial datum. The unique solution (see Proposition 2.6) to the evolutionary equation
[TABLE]
with will be denoted by .
Remark 1.5**.**
Existence and uniqueness results for this equation are established in [6] under additional growth assumptions on the Hamiltonians. Those assumptions are removed in [13, Proposition A.1]. The proofs follow the same path as for a single equation. First, a comparison principle is established (see Proposition 2.6). This uses in an essential manner the sign properties of the coupling matrix (they imply the system fall in a more general class of coupled systems, see [15]). This comparison principle implies uniqueness and existence follows from Perron’s method (properties of give that a supremum of subsolutions is a subsolution). **
Definition 1.6**.**
We will denote by the twisted Lax–Oleinik formula which to a vector valued function associates another vector valued function the entries of which are, for :
[TABLE]
where the infimum is taken over all absolutely continuous curves and where .
We will often use the following notation:
[TABLE]
Note that in the previous equation, we only write one infimum to have a synthetic formula, but there are actually quantities to minimize hence possibly different minimizing curves.
The goal of this note is to show a link between and . As is easily seen, one reason why differs from (apart from the fact that it does not provide a solution of the weakly coupled system in any reasonable sense) is that it does not verify the semi–group property (or sometimes also referred to as dynamical programming property; an explicit counterexample is given in appendix). At the contrary, by the uniqueness of viscosity solutions, is indeed a semi–group, meaning that for all we have .
Our main result is the following:
Theorem 1.7**.**
Let be a Lipschitz function, then for any , the following holds:
[TABLE]
The procedure of considering iterates of is a natural way of forcing the semi–group property. It has already appeared, for example making a link between variational and viscosity solutions associated to non–convex Hamiltonians (in the case of a single equation). See the works of Wei ([22]) and also of Roos ([21]) for more details on this subject.
This can also be seen as a result on the convergence of an approximate scheme for the system. Many results in the literature of viscosity solutions justify that the result can be expected to be true (see [3]). We will give a self contained proof of our result in this particular setting which is an adaptation of the previous reference.
Finally let us comment on the previous statement and its hypotheses. They are willingly stronger than necessary because the proof is more natural in this setting. However, the Lipschitz continuity of the initial data can be weakened to continuity (Theorem 4.6). The regularity of the Lagrangians can also be lowered to Lipschitz (Theorem 4.7). Finally the fact of taking increasing subdivisions of the interval is not necessary in order to obtain the convergence result. It is however more natural in some regards (see section 4.1 and particularly Remark 4.5).
2. Preliminaries
2.1. About a single Hamilton–Jacobi equation
Given a continuous function , let us define the Lax–Oleinik semi–group as follows: if and then
[TABLE]
The infimum in the previous formula is taken amongst absolutely continuous curves . Clearly, this family of operators verifies a Markov property, meaning that if then .
Let us recall hereafter some properties verified by such Lagrangian functions and their Lax–Oleinik semi–group.
Theorem 2.1**.**
Let be a -Lipschitz continuous function and be a good Lagrangian, we define the function by .
- (1)
The function is a viscosity solution to the Cauchy problem
[TABLE] 2. (2)
For any and , the infimum in the definition of the Lax–Oleinik semi–group is a minimum. Moreover, there exists a constant depending solely on , and such that any minimizer is -Lipschitz and even . 3. (3)
Finally, the function is Lipschitz continuous (with Lipschitz constants depending only on , and ) in hence it is the unique viscosity solution to (3).
Remark 2.2**.**
Lipschitz continuity of is a direct consequence of the Lipschitz continuity of the minimizing curves. Lipschitz continuity of minimizing curves is proved in [7, Theorems 6.2.5, 6.3.1] from which the hypotheses on the Lagrangians are taken. The property of minimizing curves is a consequence of the strict convexity of the Lagrangians (see [9, Ex. 18.5 p. 351]). Actually, finer properties can be obtained, as semi–concavity estimates (see for instance [7, Theorems 6.4.2, 6.4.3 and 6.4.4]) but we will not need them. The fact that existence of a Lipschitz solution to (3) implies uniqueness is a folklore result (see [8] and references therein or [13, Proposition A.2]). **
2.2. About systems
Recall that the matrix is a coupling matrix if its non–diagonal entries are non–positive and the sum of the elements of each line is non negative. We denote by the vector with all entries equal do .
Proposition 2.3**.**
Under the above hypotheses, for all , the entries of are all non–negative.
Proof.
This is an immediate consequence of the formula
[TABLE]
∎
It follows from the previous proposition and the fact that the exponential is smooth that:
Proposition 2.4**.**
Let , then for all , the Lagrangian is a good Lagrangian on .
Corollary 2.5**.**
For all , the following inequalities hold:
[TABLE]
Proof.
The left inequality follows from Proposition 2.3. For the right inequality, write
[TABLE]
It follows that all entries are decreasing as increases. As equality holds for this proves the result. ∎
We now come back to the Definition 1.4. Such a solution exists and is unique thanks to the following more general comparison principle (see [13, Proposition 2.5]):
Proposition 2.6**.**
Let and be respectively a lower semicontinuous supersolution and a bounded upper semicontinuous subsolution of (1). Assume they are bounded on , then on .
Let us now come back to the twisted Lax–Oleinik formula
[TABLE]
Using the notation the twisted Lax–Oleinik formula may be interpreted as follows:
[TABLE]
Hence, as by Proposition 2.4, the are good Lagrangians (when restricted to ), Theorem 2.1 applies to the twisted Lax–Oleinik formula.
3. Proof of Theorem 1.7
Definition 3.1**.**
Given and , let us define the iterated operator W_{n}(t)=W(s)\circ\big{(}W(T/2^{n})\big{)}^{k} where and are such that and . **
Following [3], we state some fundamental properties of the operators and .
Proposition 3.2**.**
The operator verifies the following:
- •
Monotonous*: if and then ,*
- •
Continuity*: if then for any function and , . In particular, is –Lipschitz for the sup norm.*
It follows immediately that enjoys the same properties.
The second property follows from Corollary 2.5.
The last property we state is fundamental as it links the operators with the original system (1):
Proposition 3.3**.**
The operator is consistent in the sense that if is a function then
[TABLE]
where we use the notation \mathbb{H}(\cdot,D\Phi)=\big{(}H_{i}(\cdot,D\phi_{i})\big{)}_{i\in\{1,\dots,d\}}.
Proof.
Let us fix and . For , let us denote by a curve realizing the minimum in (2) for the -th equation. Recall that the curve is then . Moreover, for any , the function is differentiable at and setting this differential, the couple solves Hamilton’s equations with Hamiltonian function (associated to the Lagrangian ), see [7, Theorem 6.3.3 and 6.4.7].
We may then compute
[TABLE]
where is a function going to [math] as . Note that the function depends on , , , but due to the fact that the Lipschitz constant of (and of ) depends only on the convergence of to [math] is uniform with respect to and .
This proves the proposition.
∎
As proved in [3], consistency, monotonicity and continuity are enough to ensure that Theorem 1.7 holds. For the sake of completeness, we reproduce the proof (adapted to our setting) below:
proof of Theorem 1.7.
Let be a Lipschitz continuous initial data and . Let , for . For we define by
[TABLE]
where and , and . We will in fact prove that converges to as .
We introduce the relaxed semi–limits, let us set and where the liminf and limsup are taken with respect to sequences and .
Obviously, . The core of the proof is to show that (resp. ) is a subsolution (resp. supersolution) of (1). Proposition 2.6 will then entail the reverse inequality, proving the convergence.
Let us prove that is a subsolution, the proof for being the same. Note that is upper semi–continuous. Let , and be a function such that attains a global strict maximum at by vanishing at this point. It follows there exists an extraction and points converging to such that attains a global maximum at and such that . Denoting by we obtain that and that . Write and .
Let us fix an and construct a test function as follows: , for and finally . Up to taking large enough, we still have the following property: attains a global maximum at .
We then compute
[TABLE]
As the last term \frac{\xi_{n}}{r_{n}}\Big{(}1-(\textrm{\rm e}^{-r_{n}B}\mathbbm{1})_{i}\Big{)} converges to [math] as .
By making use of Proposition 3.3 and letting we infer that
[TABLE]
Letting shows that is a subsolution. ∎
4. Further properties and extensions of Theorem 1.7
In this final section, we discuss some nice properties of the twisted operators . Then we show how to weaken the hypotheses of our main theorem and propose some possible variations.
4.1. Properties of
Proposition 4.1**.**
If a function is a Lipschitz subsolution of the evolutionary equation then for any and any absolutely continuous curve the following holds:
[TABLE]
In particular, \mathbf{u}\big{(}t,\gamma(t)\big{)}\leqslant W(t)\mathbf{u}(0,\cdot). More generally, for any positive integer and positive times such that ,
[TABLE]
Proof. Assume that is differentiable almost everywhere on the image of , then
[TABLE]
Note that for the last inequality, we use the fact that all entries of the matrices are non negative. The general case is then proved by an approximation argument of by curves on which is differentiable almost everywhere.
The second point is then the result of a straightforward induction on . ∎
Remark 4.2**.**
It can actually be proved that the converse is also true in the above Proposition (see [13]). **
Proposition 4.3**.**
Let then, for all ,
[TABLE]
Proof. Let be a curve realizing the infimum for the first component of . We then have
[TABLE]
∎
Notice that in the previous inequality, there is no hope to obtain an equality, for the curve has no reason to realize the infimum in on other coordinates than the first one.
Corollary 4.4**.**
The sequence is decreasing with .
Proof. Using notations of the corollary, let . Either , then and , or , then and . Let us deal with the first case, the second one being similar.
[TABLE]
Moreover, by proposition 4.1 it is greater than . ∎
Remark 4.5**.**
- (1)
The previous results explain our choice of subdivision of the interval in our construction of . Indeed, Theorem 1.7 holds true for any sequence of partitions such that the length of the subdivisions uniformly converge to [math]. However, taking nested partitions (as we did) gives a decreasing family of operators. 2. (2)
The corollary, along with Proposition 4.1 immediately imply that converges given a Lipschitz function . One alternative idea of proof would then be to establish that the limit is itself a subsolution. It would hence be the solution by maximality. However, to do so, we need to be able to keep track of the Lipschitz constants of the which we were not able to do without requiring much stronger hypotheses on the Lagrangians.
4.2. Weakening the hypotheses of Theorem 1.7
The following Theorem weakens the Lipschitz hypothesis on the initial data :
Theorem 4.6**.**
Assume is a continuous function, then the sequence converges to .
Proof.
All the operators , and are -Lipschitz, hence approximating by Lipschitz functions and using Theorem 1.7 yields that again,
[TABLE]
∎
Finally, we show how to weaken the hypotheses on the Lagrangians:
Theorem 4.7**.**
Assume that the Lagrangians are Lipschitz continuous, convex in the variable and that there exists a Nagumo function verifying (N) for which the satisfy ((L2)) in the almost everywhere sense.
Then the conclusions of Theorems 1.7 and 4.6 still hold.
Proof.
The proof follows from the following simple observations. Assume that are other Lagrangians such that for all . We infer, by monotonicity of the Legendre transform, that for all (with obvious notations).
We then observe that if is an initial data, then is a subsolution for the weakly coupled system (1). Hence, by the comparison principle, we conclude that . By a symmetric argument, we infer that .
Moreover, using the explicit formulas defining , and there analogues for denoted by and we obtain that for any continuous initial data , we have as well that and .
Hence, approximating uniformly by strictly convex, smooth Lagrangians verifying the hypotheses of theorems 1.7 and 4.6 gives the result. ∎
4.3. An alternative approximation scheme
We conclude this section by proposing another way of approximating solutions to the weakly coupled system. The proofs being similar (even simpler with some respect) we omit them and leave them as an exercise to the motivated reader.
As in some respect, the structure of the schemes below are more simple, the proofs also work in the case of coupling matrices depending on the space variable. We henceforth consider a continuous, coupling matrix valued function .
Definition 4.8**.**
Given a continuous initial condition , we define the operator
[TABLE]
Theorem 4.9**.**
Let be a continuous function, then for any , the following holds:
[TABLE]
Remark 4.10**.**
Actually, the proof of consistency of this scheme is easier and the hypotheses on the Nagumo functions and derivatives of the Lagrangians are not even needed. Indeed, as the Lagrangians appearing in the operator are autonomous (contrarily to the ones in that depend on time because of the exponential term), conservation of energy gives the Lipschitz estimates on minimizing curves by only assuming that each is continuous, convex in and superlinear.
However, this operator is less natural and does not enjoy the nice properties established for . And it was not misused in literature. **
The last scheme we propose consists in only taking the first terms of the exponential term:
Definition 4.11**.**
Given a continuous initial condition , we define the operator
[TABLE]
Theorem 4.12**.**
Let be a continuous function, then for any , the following holds:
[TABLE]
Appendix A An explicit computation
We conclude this article by giving a very simple example showing does not provides the viscosity solution operator. For sake of simplicity and of nice formulas, we consider here a problem on .
We will consider the simple system with \mathbb{H}=\left(\begin{array}[]{c}H_{1}\\ H_{2}\end{array}\right) where on and B=\left(\begin{array}[]{cc}1&-1\\ -1&1\end{array}\right). It then holds that
[TABLE]
We will also make use of that fact that if is independent of the first variable and if , then the solution to
[TABLE]
with initial condition is given by
[TABLE]
We now proceed to computing
[TABLE]
As there is no exponential term in the integral, in formula (6), we recognize there a classical Lax–Oleinik formula and we can interpret that both lines of are respectively solutions at time of the simple Hamilton–Jacobi equation (4) with initial conditions, respectively the entries of . It follows that to compute we have to compute the solution, at time , of two classical Hamilton-Jacobi equations, with initial conditions given by the entries of .
In our case, we take \mathbf{u}^{0}(x)=\left(\begin{array}[]{c}0\\ \langle p,x\rangle\end{array}\right) therefore, \textrm{\rm e}^{-tB}\mathbf{u}^{0}(x)=\langle p,x\rangle\left(\begin{array}[]{c}\frac{1-\textrm{\rm e}^{2t}}{2}\\ \frac{1+\textrm{\rm e}^{2t}}{2}\end{array}\right).
We deduce from (5) that
[TABLE]
To conclude, we compute that
[TABLE]
Hence is not a solution to the Hamilton–Jacobi system.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] G. Barles , Solutions de viscosité des équations de Hamilton-Jacobi , vol. 17 of Mathématiques & Applications (Berlin) [Mathematics & Applications], Springer-Verlag, Paris, 1994.
- 2[2] G. Barles, H. Ishii, and H. Mitake , A new PDE approach to the large time asymptotics of solutions of Hamilton-Jacobi equations , Bull. Math. Sci., 3 (2013), pp. 363–388.
- 3[3] G. Barles and P. E. Souganidis , Convergence of approximation schemes for fully nonlinear second order equations , Asymptotic Anal., 4 (1991), pp. 271–283.
- 4[4] G. Barles and P. E. Souganidis , On the large time behavior of solutions of Hamilton-Jacobi equations , SIAM J. Math. Anal., 31 (2000), pp. 925–939 (electronic).
- 5[5] F. Cagnetti, D. Gomes, H. Mitake, and H. V. Tran , A new method for large time behavior of degenerate viscous Hamilton-Jacobi equations with convex Hamiltonians , Ann. Inst. H. Poincaré Anal. Non Linéaire, 32 (2015), pp. 183–200.
- 6[6] F. Camilli, O. Ley, and P. Loreti , Homogenization of monotone systems of Hamilton-Jacobi equations , ESAIM Control Optim. Calc. Var., 16 (2010), pp. 58–76.
- 7[7] P. Cannarsa and C. Sinestrari , Semiconcave functions, Hamilton-Jacobi equations, and optimal control , Progress in Nonlinear Differential Equations and their Applications, 58, Birkhäuser Boston Inc., Boston, MA, 2004.
- 8[8] P. Cannarsa and H. M. Soner , Generalized one-sided estimates for solutions of Hamilton-Jacobi equations and applications , Nonlinear Anal., 13 (1989), pp. 305–323.
