Perturbation problems in homogenization of hamilton-jacobi equations
Pierre Cardaliaguet (CEREMADE), Claude Le Bris (MATHERIALS),, Panagiotis Souganidis

TL;DR
This paper investigates how the ergodic constant in convex Hamilton-Jacobi equations behaves under periodic and random perturbations, revealing dimension-dependent first-order effects and extending nonlinear homogenization theory.
Contribution
It provides the first first-order Taylor expansion of the ergodic constant in nonlinear Hamilton-Jacobi homogenization, highlighting dimension-dependent phenomena.
Findings
First-order term is non-trivial in dimension 1.
For dimensions ≥ 2, the first-order term vanishes.
Results extend homogenization theory to nonlinear Hamilton-Jacobi equations.
Abstract
This paper is concerned with the behavior of the ergodic constant associated with convex and superlinear Hamilton-Jacobi equation in a periodic environment which is perturbed either by medium with increasing period or by a random Bernoulli perturbation with small parameter. We find a first order Taylor's expansion for the ergodic constant which depends on the dimension d. When d = 1 the first order term is non trivial, while for all d 2 it is always 0. Although such questions have been looked at in the context of linear uniformly elliptic homogenization, our results are the first of this kind in nonlinear settings. Our arguments, which rely on viscosity solutions and the weak KAM theory, also raise several new and challenging questions.
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
TopicsAdvanced Mathematical Modeling in Engineering · Nonlinear Partial Differential Equations · Geometric Analysis and Curvature Flows
\newconstantfamily
Csymbol=C \newconstantfamilycsymbol=c \newconstantfamilyOsymbol=Ω
Perturbation problems in homogenization of Hamilton-Jacobi equations
Pierre Cardaliaguet, Claude Le Bris and Panagiotis E. Souganidis
Ceremade, Université Paris-Dauphine, Place du Maréchal de Lattre de Tassigny, 75775 Paris cedex 16 - France
Ecole des Ponts and Inria, 6 -8 avenue Blaise Pascal, Cite Descartes, Champs-sur-Marne, 77455 Marne La Vallee cedex 2 - France
Department of Mathematics, University of Chicago, Chicago, Illinois 60637, USA
Version:
Abstract.
This paper is concerned with the behavior of the ergodic constant associated with convex and superlinear Hamilton-Jacobi equation in a periodic environment which is perturbed either by medium with increasing period or by a random Bernoulli perturbation with small parameter. We find a first order Taylor’s expansion for the ergodic constant which depends on the dimension . When the first order term is non trivial, while for all it is always [math]. Although such questions have been looked at in the context of linear uniformly elliptic homogenization, our results are the first of this kind in nonlinear settings. Our arguments, which rely on viscosity solutions and the weak KAM theory, also raise several new and challenging questions.
Cardaliaguet was partially supported by the ANR (Agence Nationale de la Recherche) project ANR-12-BS01-0008-01. Souganidis was partially supported by the National Science Foundation Grants DMS-1266383 and DMS-1600129. Part of the work was completed during Le Bris visits to the University of Chicago.
1. Introduction
The paper is concerned with the behavior of the ergodic constant associated with convex and superlinear Hamilton-Jacobi (HJ for short) equations in a periodic environment which is perturbed either by medium with increasing period which is a multiple of the original one or by a random Bernoulli perturbation with small parameter. We find a first-order Taylor’s expansion for the ergodic constant which depends on the dimension . When the first order term is non trivial, while for all it is always [math]. Our results are the first of this kind for nonlinear problems. The arguments, which rely on viscosity solutions and the weak KAM theory, also raise several new and challenging questions.
The motivation for this work came from the recent studies by Anantharaman and Le Bris [2, 3] and Duerinckx and Gloria [11], who considered similar questions for linear uniformly elliptic operators (and systems in [11]). The former paper considered Bernoulli perturbations of a periodic environment, while the latter reference, which complemented and generalized the work of the former, considered Bernoulli perturbations of a stationary ergodic medium and provided, taking strong advantage of the linearity of the equation, a full expansion.
Loosely speaking the aim of homogenization is to replace a possibly complicated heterogeneous medium with a homogeneous environment that shares the same macroscopic properties. In concrete models (equations) it allows to eliminate the fine scale up to an error which is controlled by the size of fine scale as compared to the macroscopic size.
From the modeling point of view, assuming that the medium is periodic is a rather rigid and idealistic assumption and somewhat remote from actual settings. Indeed, in view of the industrial process they are produced by, manufactured media, such as composite materials, can be considered, under reasonable conditions, to be periodic or at least “approximately” periodic. However, natural media, such as the subsoil, have no reason whatsoever to be periodic. Periodicity is then a mathematical idealization, or artifact, that might lead to inaccurate results.
A well established option is then to consider the medium to be random, and, more precisely, stationary ergodic. This assumption conveniently makes up for the absence of periodicity, and, actually, includes periodicity as a particular case. The mathematical theory of random homogenization, both quantitative and qualitative, born in the early 1970s, has seen an enormous growth over the past fifteen years. However in spite of the appeal the theory, its application to actual media for real applications and, in particular, numerical simulations, remains a challenging issue. Random homogenization, and all approaches that derive from it, may indeed be computationally prohibitively expensive, even for the simplest possible equations arising, for instance, in the engineering sciences. A compromise between the economical but idealistic periodic and the more general but extremely costly random settings is to consider small random perturbations of periodic scenarios. The response of the medium in terms of this small perturbation, that is the modification of the homogenized limit in the presence of the small random perturbation, is intuitively expected to be easier to evaluate. This was shown to be indeed true in the case of homogenization of linear elliptic equations in [2, 3]. A formal derivation of the first-order perturbation and numerical experiments performed there confirmed that it is possible, at a much reduced computational price, to approximate the homogenized limit of the random problem. As mentioned above, the approach has then been proven to be rigorous, and extended to all orders of perturbation, in a subsequent publication [11].
In order to convey to the reader the flavor of the mathematical mechanism in action, we consider the following simplistic setting, which can be thought as a computational model for the whole space . Let be a -periodic function that repeats itself within a presumably extremely large box of size , and assume that a certain output, , is computed from it. In the specific case addressed in [2, 3], and were respectively the matrix valued coefficient of the linear elliptic operator and the matrix replacing in the homogenized limit. In this paper, the function is the periodic Hamiltonian of a Hamilton-Jacobi equation and the outcome is the homogenized Hamiltonian . Assume now that is perturbed by the addition of a random function of, for example, the form , where the ’s are Bernoulli random variables of a small parameter , which are all independent from one another. Intuitively, at first order in , the perturbation experienced by consists of adding exactly one at each possible location within the large box of size . The probability of having two distinct non zero variables is of order , a term negligible with respect to the first order term in . The perturbation of the outcome with respect to the outcome can therefore be calculated using only the configurations of the periodic medium perturbed in one random location. Of course, the above argument is formal in many respects. For the rigorous result, we must consider the whole infinite space instead of a large box of finite size and need to prove the fact that all other configurations than those with exactly one non zero do not contribute to the asymptotics at first order. But the underlying idea remains. This general discussion is made more precise below.
We describe next in a somewhat informal way the results of the paper. The actual statement need hypotheses which will be given in Section 2.
Let be a Hamiltonian which is coercive in and periodic in . It was shown by Lions, Papanicolaou and Varadhan [19] that there exists a unique , often referred to as the effective Hamiltonian or the ergodic constant, such that the cell problem
[TABLE]
has a continuous, periodic (viscosity) solution known as a corrector.
Correctors are obviously not unique. Throughout the paper, we make the normalization that .
We recall that is obtained as the uniform limit, as of , where is the unique periodic solution to the approximate cell problem
[TABLE]
We consider two types of perturbations. The first is also periodic with increasingly large integer period. The second is random (Bernoulli) with small intensity.
In the first case the perturbed -periodic Hamiltonian , with , is
[TABLE]
with the -periodic function defined as
[TABLE]
where
[TABLE]
In view of the form of , we often refer to as a “bump” located at the point .
Let be the ergodic constant associated with . Then there exists a continuous periodic solution of the cell-problem
[TABLE]
which is “renormalized” by .
Since, as , there are fewer bumps in a given ball, it is reasonable to expect that, as , converges to . Our goal is to obtain quantitative information (rate, first term in the expansion) for this convergence.
In the second type of perturbation, the randomly perturbed Hamiltonian is given by
[TABLE]
where
[TABLE]
with satisfying (1.5) and
[TABLE]
Contrary to the periodic setting, in random media the effective Hamiltonian is not characterized by the cell-problem. The reason is that to guarantee its uniqueness, it is necessary to have correctors which are strictly sub-linear at infinity. As shown in Lions and Souganidis [23], in general, this is not possible.
The effective constant is defined, for instance, through the discounted problem
[TABLE]
which has unique bounded solution as the almost sure limit (see Souganidis [28])
[TABLE]
Note that, as , the probability that there is a bump in a fixed ball becomes smaller and smaller. So here again it is natural to expect that converges to as and we want to understand at which rate this convergence holds.
We establish two types of results. The first is an estimate of the difference between or and , which holds even for more general (almost periodic) perturbations.
We prove that, if is convex and coercive in and periodic in , then there exists depending only on (see Corollary 3.2 and Corollary 3.4) such that
[TABLE]
[TABLE]
and, in particular,
[TABLE]
The result is unusual in the homogenization of Hamilton-Jacobi equations because the perturbations do not vanish in the -norm and relies strongly on the fact that the bumps are nonnegative. In general the convergence does not hold otherwise; see Achdou and Tchou [1], Lions [18] and Lions and Souganidis [24], where we also refer for more general statements about homogenization with fixed perturbations of periodic and random environments.
We point out that (1.10), (1.11) and (1.12) are examples of more general statements which hold for general almost periodic or random perturbations; see Propositions 3.1 and 3.3.
In view of (1.10), (1.11) and (1.12), it is natural, and this is the second type of results in this paper, to identify the limits
[TABLE]
It turns out that is much more complicated than proving (1.12) and we only have a complete answer under some additional assumptions.
In order to describe the results as well as to give a hint of the subtlety, we explain briefly and very informally the proof of (1.10). Similar arguments justify (1.11).
We argue as if both and were smooth, which is not the case in general. We subtract (1.1) from (1.6), we linearize the difference around assuming also that is smooth, and we use the convexity of to find
[TABLE]
where denotes the gradient of with respect to .
Let be the invariant measure associated with (1.1), which exists in view of the weak KAM theory (see Fathi [14]), that is, is a Borel probability measure in the unit cube and
[TABLE]
We extend by periodicity to and we integrate both sides of (1.13) with respect to over . Using the fact that, for large enough, there is only the compactly supported bump in the cube , we find
[TABLE]
The last inequality not only justifies the right-hand side of (1.10), but also hints that the limit of should be . This turns out to be false.
Indeed, under some assumptions on the minimizing Mather measure in the weak KAM formulation of (1.1) which are stated informally below, we show in Theorem 4.1, that, when ,
[TABLE]
and, when ,
[TABLE]
For the proof we assume that the invariant measure is unique, has a non vanishing rotational number and its marginal has a full support. The assumption on is strong and holds only for specific classes of Hamiltonian.
A schematic view of our strategy of proof goes as follows. Let be the convex dual of defined in (2.3). The variational interpretation of (1.6) and (1.1) implies that the respective correctors and satisfy the identities
[TABLE]
and
[TABLE]
where is the set of Lipschitz curves in such that .
Let denote the optimal path in the expression for , which exists in view of the assumptions on . Then based on the equalities above, the difference of the two Hamiltonians and reads, for all , as
[TABLE]
Identifying the limit of therefore amounts to constructing a specific trajectory that almost minimizes the infimum problem in the right-hand side. Clearly, that infimum is not achieved by , since the presence of has perturbed the original problem. However, is expected to provide an accurate approximation of the infimum, at least far from the bumps. The actual proof consists in making this intuition precise and in understanding the behavior of the optimal trajectories near the bumps.
The same strategy of proof applies to the random perturbation. There it is necessary to construct an appropriate random perturbation of the trajectory . Most of the argument then aims at fixing all the necessary technicalities in the construction of that particular modified trajectory.
An intuitive way to explain the result is that, when , the minimizers in (1.6) eventually avoid the bump and stay close to those of (1.1), while, when , they must pass through the bump. A similar interpretation can be used for the result in the random setting.
The conclusion that, when , does not deviate much from is in stark contrast with what is happening for uniformly elliptic divergence form operators where the first term in the expansion is nonzero. The heuristic explanation for this difference is that in the Hamilton-Jacobi setting information is propagated along curves which are lower dimensional objects when , while for the elliptic problem the information is obtained by averaging.
Next we describe some of the major ingredients in our analysis concentrating always for simplicity on the periodic problem. An important fact is that, after a renormalization by additive constants, the correctors of the periodically perturbed cell-problem (1.6) converge, along subsequences as and locally uniformly in , to solutions , which are no longer periodic, of the equation
[TABLE]
the existence of such solutions was also proved by different methods in [1], [18] and [24].
The interesting property of is that it keeps track of the perturbed problem, in the sense that, at least formally (see Lemma 4.2 for a rigorous statement),
[TABLE]
It follows from the invariance property of that the right-hand side of (1.16) sees only the difference of at infinity.
The analysis of is in itself a very intriguing problem. Using that we prove in Corollary 2.4 that there exists a constant such that is always above , coincides with outside of a “cylinder”, and tends to at infinity. This is enough to show that the right-hand side of (1.16) vanishes, which in turn proves that tends to [math]. The analysis when is based on a more direct argument. The proof for the random perturbed problem relies on structure of as well.
We continue with a rather brief summary of the history of the problem acknowledging that is really not possible to refer to all previous papers. As already mentioned earlier the first homogenization result for Hamilton-Jacobi equations in periodic environments was proved in [19]. Subsequent developments are due to Evans [12, 13] and, among others, Majda and Souganidis [25]. The first result about the homogenization of Hamilton-Jacobi equations in random media was obtained in Souganidis [28] and Rezakhanlou and Tarver [26]. Other important contributions to the subject always in the context of the qualitative theory of homogenization for Hamilton-Jacobi equations are Lions and Souganidis [21, 22, 23], Armstrong and Souganidis [6, 7], and Cardaliaguet and Souganidis [8, 9]. Quantitative results, that is error estimates, were shown in Armstrong, Cardaliaguet and Souganidis [5] and Armstrong and Cardaliaguet [4].
Organization of the paper
The paper is organized as follows. In the next section we introduce the main assumptions and recall some well known facts from the weak KAM theory. In Section 3 we state and prove two general results about the growth of the perturbations of the ergodic constant and make the connections with (1.10) and (1.11). In Section 4 we introduce the assumptions and state and prove the asymptotic result for periodic perturbations, while in Section 5 we consider random perturbations.
Notation and terminology
We work in and we write for the Euclidean length of a vector and, for , is the usual inner product. The sets of integers and positive and nonnegative integers are respectively , and . If , then . The cube centered at and of size is denoted by and we set and for simplicity. Given a finite subset , denotes the number of elements of . Given a nonnegative measure and function , and are respectively their support. If is bounded, . If is integrable and has a finite volume, we denote by the average of on , that is . For notational convenience, we write , if If and , we write . Given , and, for all , is the set of compactly supported real valued functions on . Throughout the paper, is a constant that may vary from line to line and depends on the Hamiltonian and the space dimension , unless otherwise specified. All the Hamilton-Jacobi equations encountered in the text have to be understood in the sense of viscosity solutions [10].
The random setting
We describe here the random setting that we use in the paper and introduce the necessary notation and terminology.
The general setting is a probability space and we write for the expectation of a random variable We assume that the group acts on . We denote by this action and assume that it is measure preserving, that is, for all and , and ergodic, that is, for any translation invariant ,
A process is said to be -stationary if, for all , almost everywhere in and almost surely in
The ergodic theorem says that, if is stationary, then, as ,
[TABLE]
Finally we remark, although we will not be making use of this in the paper, that almost periodic functions can be thought as stationary functions in an appropriate probability space with continuous stationary and ergodic action (translation).
2. The assumptions and some basic facts
We introduce the assumptions on the Hamiltonian and recall some basic facts from the weak KAM theory, for which we refer to [14]. We discuss the one-dimensional setting in detail as well as the existence and properties of the “corrector” of the perturbed problem in the whole space.
The motivation for this presentation is to have all assumptions and their immediate consequences in one place. We recommend, however, that the reader skips this section the first time and returns to it as is necessary while going through the other parts of the paper.
Assumptions on the Hamiltonian
We assume that is
[TABLE]
and
[TABLE]
Facts from the weak KAM theory
Let be the Lagrangian associated with which, for all , is given by
[TABLE]
We recall from the introduction that is the effective (ergodic) constant associated with , that is is the unique constant such that the cell problem (1.1) has a periodic, continuous solution . Note that the coercivity of yields that is Lipschitz continuous.
The weak KAM theory provides an alternative characterization for , namely
[TABLE]
where the infimum is taken over the Radon measures on which are periodic in , have weight on and are closed, that is, for all -periodic
[TABLE]
Throughout the text, we often write and for an optimal measure in the minimization problem (2.4) and its marginal with respect to respectively. In the context of the weak KAM theory such and are called respectively a minimizing Mather measure and a projected minimizing measure. Note that the restriction of to is a probability measure.
We use the following well known facts from the weak KAM theory (see [14]):
[TABLE]
[TABLE]
and
[TABLE]
that is
[TABLE]
An assumption on the Mather measure and its consequences
In order to prove the asymptotic results and, in particular, the existence of the limits discussed in the Introduction, we need to further assume that
[TABLE]
The assumption of the full support in is written as
[TABLE]
and the nonzero rotation number is given by
[TABLE]
The first two conditions in (2.6), that is the uniqueness of and existence of a nonzero rotation number, are rather mild. For example, if for some Hamiltonian satisfying (2.1) and (2.2) and some , then is unique for a “generic” and the nonzero rotation number exists for large enough; see [14]. That the projected Mather measure has full support in is a much stronger assumption and only holds under restrictive structure conditions.
We continue listing several consequences of (2.6) that are used in the rest of the paper. We refer to [14] and references therein for the proofs.
Since the projected Mather measure has a full support,
[TABLE]
It then follows that
[TABLE]
The strict convexity of the Hamiltonian also implies that
[TABLE]
Indeed, if and are two correctors, subtracting their respective equations and using the strict convexity we find, for some ,
[TABLE]
Multiplying the inequality above by , integrating over with respect to and integrating by parts using the periodicity and the fact that is an invariant measure, that is (2.5) holds, we obtain
[TABLE]
Thus the continuous maps and agree on a dense subset of and therefore everywhere.
In view of (2.9), we can define the flow of optimal trajectories for any initial position by
[TABLE]
we note that the map is continuous for any .
We recall now that the optimality of implies that, for all ,
[TABLE]
The uniqueness of the projected Mather measure implies that it is actually ergodic. As a result, for a.e. , we have
[TABLE]
As a matter of fact we will see below (Lemma 2.2), that, as a consequence of the uniqueness of , (2.12) actually holds for all .
We present now a simple example satisfying (2.1), (2.2) and (2.6). Let for some non rational direction . In this case, we have and . The unique invariant measure is and .
The KAM theory then implies that (2.6) holds true for with a Diophantine vector and periodic, smooth and small enough. Obviously, (2.1) and (2.2) are satisfied.
The one-dimensional setting when (2.1), (2.2) and (2.6) hold
We know from (2.6) that the cell problem (1.1) has a -periodic solution and
The strict convexity of implies that the inverse of has two branches as long as one is away from its minimum, which is the case in view of (2.6). Since the corrector is smooth, must be, for all , in the same branch of and we can rewrite (1.1) as an the ode
[TABLE]
using only one of them. The choice of the branch, which from now we denote as , is dictated by
In view of the above discussion, in any with , we have
[TABLE]
It also follows from (2.6) and (2.5) that the invariant measure associated with the cell problem at hand has periodic extension in with density
[TABLE]
note that for notational simplicity we often identify the invariant measure with its density,
Let denote the derivative of with respect to the first argument. It follows from (2.13) that
[TABLE]
and, in view of (2.15),
[TABLE]
We conclude with the following classical example always for . The Hamiltonian is for some fixed and a -periodic potential with . It is well known that, if , then the cell problem
[TABLE]
has a smooth periodic solution for given by . This last expression and the sign of identify the branch of the that we need to choose.
A corrector of the perturbed problem in the whole space
An important ingredient in our analysis is the construction of a “perturbed corrector” , that is a solution to (1.15), which, as it turns out (see Lemma 4.2), keeps track of the difference between and as .
The first step in finding is to obtain independent of sup- and Lipschitz bounds for the periodic solutions to (1.6); recall that we always consider .
Lemma 2.1**.**
Assume (2.1), (2.2) and (1.5). There exist solutions of the perturbed cell problem (1.6) such that
[TABLE]
Proof.
The gradient bound follows immediately from the coercivity of and holds for any solution of the cell problem. For the -bound, we consider the approximate cell problems (1.2) and
[TABLE]
which are respectively and periodic. Since, for any , is a strict subsolution to (1.2) in , the maximum of , if positive, can only be reached at some and, in view of the periodicity, we may assume that . Similarly, the minimum of , if negative, is reached at a point .
Thus
[TABLE]
Recall that the ’s are periodic. Moreover, in view of the assumed coercivity and bounds on , the ’s are Lipschitz continuous uniformly in . Hence their oscillations are bounded uniformly in .
It follows from (2.19) that the oscillation of is also bounded, uniformly with respect to and . Thus, we can extract a subsequence such that converge uniformly in to a solution of the perturbed cell problem (1.6) satisfying the uniform and Lipschitz bounds.
Up to a subsequence, we can assume that, as , the ’s converge locally uniformly to some , which is no longer periodic, solving (1.15). ∎
We discuss next some properties of the map and the optimal trajectories for and which will be useful for the asymptotic limit of the random perturbation in Section 5. The proof of Corollary 2.4 is presented at the end of Section 4, since it is there that all the necessary machinery is been developed.
Lemma 2.2**.**
In addition to (2.1) and (2.2), assume that the minimizing Mather measure is unique and in (2.12). For any and any , there is a time such that, if is such that
[TABLE]
then
[TABLE]
We remark that the coercivity assumption and (2.20) imply that and, hence, are uniformly bounded on bounded (time) intervals of size less than . The lemma above, provides a bound on for time intervals of length larger than .
An immediate consequence of Lemma 2.2, which is used in the analysis of the asymptotic limits, is stated in the next corollary. Its proof, which is essentially a restatement of the conclusion of Lemma 2.2, is omitted.
Corollary 2.3**.**
In addition to (2.1) and (2.2), assume that the minimizing Mather measure is unique and in (2.12). For any , there exist and , such that, if satisfies the bound (2.20) with the given , then
[TABLE]
In particular, there exists such that any satisfying and (2.20) avoids the support of for any positive time.
The proof of Lemma 2.2.
Let be a sequence of trajectories satisfying (2.20). In view of the periodicity, we may assume without loss of generality that .
Let be the occupational measure on which is periodic in space and defined, for all which are periodic with respect to , by
[TABLE]
It follows from (2.20) that
[TABLE]
and, hence, in view of the coercivity of , the family is tight.
Then, as , there exists a subsequence of (for simplicity we do not change the notation of the subsequence) that converges weakly to a measure satisfying
[TABLE]
Note also that, for any -periodic ,
[TABLE]
that is is also closed, and, hence, a Mather minimizing measure and, in view of the assumed uniqueness, the entire family converges to as . Moreover, is the image of by the map .
In particular, as ,
[TABLE]
The claim then follows from the assumption that . ∎
Finally the proof of Theorem 4.1 yields the following partial description of which is of independent interest.
Corollary 2.4**.**
Let be the open set of points such that does not intersects . There exists such that
- (i)
* in ,*
- (ii)
* in ,*
- (iii)
there exists such that, if , then ,
- (iv)
for any there exists such that, if , then .
The proof is presented at the end of Section 4.
3. The growth of the perturbed ergodic constant
Given a Hamiltonian we consider perturbations of the form where is a non negative potential and prove that, under assumptions on the potential, the difference of the corresponding effective constants can be controlled by some “average” of .
We present two results, one for almost periodic and one for random media. Then we describe the relationship with the two examples in the introduction and prove (1.10) and (1.11).
Almost periodic perturbations
Let
[TABLE]
and recall that almost periodicity implies the existence of the average
[TABLE]
Given satisfying (2.1) and (2.2), we consider the perturbed Hamiltonian
[TABLE]
and note that, for any , is almost periodic.
We recall (see Ishii [16]) that the ergodic constant associated with is obtained as the uniform in limit, as , of , where is the the unique bounded viscosity solution to
[TABLE]
It is straightforward implication of the comparison principle of viscosity solutions that
[TABLE]
This estimate does not depend on the almost periodicity of and, hence, is not useful here since it does not “see” the averaging that is taking place.
To obtain a more precise estimate of the difference we introduce the auxiliary quantity
[TABLE]
and note that, since is uniformly continuous, is a periodic and continuous map, and, moreover, and this is very important, is in general much smaller than .
To illustrate the difference between and , we discuss the example we considered in the introduction, that is the periodic perturbation given by (1.4), which is obviously almost periodic, and we estimate
Let such that the support of is contained in . Then, for any and , we have
[TABLE]
It follows that, for sufficiently larger than ,
[TABLE]
and, hence,
[TABLE]
Note that, as , , whereas is constant.
The general result about the size of the perturbation is the following Theorem.
Theorem 3.1**.**
Assume (2.1), (2.2) and (3.1). Then
[TABLE]
In view of the computations above, we have the following corollary.
Corollary 3.2**.**
*Assume (2.1)and (2.2) and consider, for , the perturbation given by (1.4). Then *
[TABLE]
Theorem 3.1 states that is close to if the almost periodic perturbation is nonnegative and small in “average”. In the two examples discussed below we show that both conditions are sharp.
The assumption that is nonnegative cannot be removed. we show this in the framework of Corollary 3.2. Indeed, if and , then it is known (see [19]) that and, independently of the sign of , In particular, does not converge to as , if takes negative values, since, in this case .
Next we discuss the manner in which the perturbation is averaged. When is nonnegative, it seems reasonable to expect that can be replaced by the average of in Proposition 3.1. This is, however, also not true. For example, fix small and large and consider the perturbation
[TABLE]
with satisfying (1.5) and ; note that this periodic perturbation differs from the one in (1.4) and thus Corollary 3.2 does not apply here. Then, uniformly on ,
[TABLE]
Moreover, if , where is continuous, then . If, in addition, has a unique and strict global minimum on at [math] and is sufficiently small independently of , then . Hence does not tend, as , to .
Proof of Theorem 3.1..
Since is nonnegative, the comparison argument yields .
For the upper bound, it is convenient to regularize the problem and to consider, for , the almost periodic solution of the approximate viscous cell-problem
[TABLE]
We recall that, as , uniformly in and , where is the solution to
[TABLE]
We also consider the solution of the viscous periodic cell-problem associated to , that is
[TABLE]
as well as the associated ergodic measure which has a continuous, strictly positive, periodic density of mass over satisfying
[TABLE]
Finally, we recall that , while the measure converges, up to subsequences, to some Mather minimizing measure .
Subtracting (3.3) from (3.2) and using the convexity of we find that solves
[TABLE]
Multiplying the above inequality by , integrating over for a large and using that is an invariant measure, that is (3.4), we find
[TABLE]
where is the outward unit normal at .
Note that the periodicity of yields
[TABLE]
while the integrand of the integral over in (3.5) is bounded.
Dividing (3.5) by letting and using Fatou’s Lemma, we get
[TABLE]
Finally letting first and then yields the claim, in view of the uniform convergence in of to (as ) and of to (as ) and by the convergence of to in measure (as ). ∎
Random perturbations
We consider here a perturbation of the Hamiltonian by a random potential in a probability space described in the introduction.
We assume that
[TABLE]
that is for all and . It follows that the map is a continuous and periodic function.
Let be the ergodic constant associated with the Hamiltonian which exists (see [28]) and is identified by the a.s. limit , being the bounded and Lipschitz continuous, with a constant independent of , -stationary solution to the discounted problem
[TABLE]
Theorem 3.3**.**
Assume (2.1), (2.2) and (3.6). Then
[TABLE]
We describe now the particular case of the above result which was discussed in the introduction and will be further investigated in Section 5.
Fix satisfying (1.5) and, for , let be a family of i.i.d. Bernoulli random variables of parameter , that is
[TABLE]
Set
[TABLE]
and denote by (instead of ) the effective constant.
In this context, Theorm 3.3 yields immediately the following result.
Corollary 3.4**.**
Assume (2.1), (2.2) and let be defined as above. Then, for all ,
[TABLE]
We continue with the:
Proof of Theorem 3.3..
Using the notation and strategy of the proof of Theorem 3.1, we have
[TABLE]
Note that the maps and are periodic. Hence taking expectation, dividing by and letting in the above inequality, we find
[TABLE]
and, letting first and then , we obtain
[TABLE]
The inequality is an immediate consequence of the comparison principle. ∎
4. Sharper convergence for the periodic perturbation
We revisit the periodic perturbation example we discussed in the introduction. Given , the periodically perturbed Hamiltonian is defined by (1.3) for some large with as in (1.4) and satisfying (1.5).
Let and be the effective constants associated with and respectively. In view of Corollary 3.2, we know that is bounded. Here we show that, under suitable assumptions on the unperturbed problem, this quantity has a limit.
The asymptotic result is stated next. Notice that claim depends nontrivially on the dimension.
Theorem 4.1**.**
Assume (2.1), (2.2) and (2.6). If ,
[TABLE]
If and, in addition, the -periodic Hamiltonian also satisfies (2.6), then
[TABLE]
The result when is surprising. Indeed, as discussed in the introduction, the variational representations of and suggest that we should have with positive because has a full support. The claim in the Theorem 4.1 contradicts this intuition, since it implies that the optimal trajectories of the perturbed problem avoid the obstacles.
Of course, when the optimal trajectories have no room to escape and need to go through the bumps.
We present first the proof of the result for , which is rather straightforward and is based on the exact formulae which are available in view of the assumptions. Then we move to the higher dimensional setting, which is more complicated and requires considerable more tools and work.
The problem in one dimension
We present here the:
Proof of Theorem 4.1 when .
For we consider the cell problems (1.1) and (1.6). In view of the assumptions, the problems have , with bounds independent of , solutions and , which are respectively - and - periodic.
Following the discussion in the subsection about the one-dimensional problem, we can also rewrite (1.6) as the ode
[TABLE]
together with the condition
[TABLE]
where is the same branch of the inverse of we used for (2.13).
Let and recall that, in view of Corollary 3.2, .
We combine (2.14) and (4.2) as
[TABLE]
we rewrite it as
[TABLE]
with
[TABLE]
and
[TABLE]
and we study each term separately.
The strict convexity of and the bound on yield
[TABLE]
Then
[TABLE]
Since is large and has compact support, in view of the definition of , there is only one bump in . Hence, using (2.16), we get
[TABLE]
with
[TABLE]
It is now immediate that
[TABLE]
Collecting all the previous information we find
[TABLE]
Turning out attention to we observe that, since has compact support,
[TABLE]
The claim now follows. ∎
The multi-dimensional problem
The main tool of the proof when is the perturbed corrector , that is a solution to (1.15), which, as it turns out, keeps tracks of the difference between and ; see Lemma 4.2 below. The core of the argument consists in showing that the difference tends to a constant at infinity. This statement relies heavily on the assumption that the projected invariant measure has a full support (see Lemma 4.4 and its proof).
Lemma 4.2**.**
For any , the map belongs to and
[TABLE]
Proof.
The variational representation formulae for viscosity solutions to convex Hamilton-Jacobi equations give, for any ,
[TABLE]
and
[TABLE]
where is the set of Lipschitz curves such that , and
[TABLE]
recall that is defined by (2.3), while the last equality is (2.11).
Hence, as in the introduction,
[TABLE]
and, after integrating over with respect to the measure ,
[TABLE]
Since the map leaves the measure invariant (on the torus) and and are respectively - and - periodic, for , we have
[TABLE]
Therefore
[TABLE]
We now discuss the behavior, as , of the two integrals in the righthand side of the equality above.
Recall that is uniformly bounded. Therefore, does not see the bumps for as soon as , and large enough with respect to . Thus, for sufficiently large ,
[TABLE]
For the second integral, we note that the integrand is nonnegative. Using Fatou’s Lemma and the convergence of to , we find
[TABLE]
which, in view of the nonnegativity of the integrand in the second integral, yields the integrability of the map
[TABLE]
It follows from (4.6) and (2.11) that
[TABLE]
Since the map has compact support, it is integrable with respect to .
This last observation together with the integrability of yield the first assertion. The second one is immediate from the formulae above. ∎
The next lemma is about the fact that, at least along the optimal trajectories, has limits.
Lemma 4.3**.**
For a.e. , the map is non decreasing on any time-interval such that does not encounter . In particular, the limits
[TABLE]
exist for a.e. and, if never encounters , then .
Proof.
Let , and such that and , and, hence, on . Using (4.6) and (2.11), for any , we find
[TABLE]
Since, for a.e. ,
[TABLE]
there exists such that does not intersect for . Then is non decreasing and bounded on the intervals and , and the claimed limits exist.
If does not encounter at all, then is non decreasing on , and, hence,
[TABLE]
∎
The next step is crucial, since it asserts that it is possible to always compare and .
Lemma 4.4**.**
The maps and are constant with .
Proof.
Fix such that (2.12) holds. Since is ergodic, there exist and such that, as ,
[TABLE]
In view of the -periodicity of the flow , that is the fact that, for every , , we also have, for all ,
[TABLE]
and
[TABLE]
The boundedness and Lipschitz continuity of allow to choose a sequence that converges locally uniformly to some map .
Fix now some . Then (4.7) yields some such that and, in turn, Lemma 4.3 states that the map is nondecreasing and converges to as .
In particular, for any ,
[TABLE]
Then (4.8) and the continuity and periodicity of give
[TABLE]
while the uniform continuity of implies
[TABLE]
Note also that, using (4.8) with , and the periodicity and continuity of flow , we find that, as ,
[TABLE]
In conclusion
[TABLE]
This proves that, for all and ,
[TABLE]
Next we show that the map is constant for any
Fix . Since is ergodic with full support, there exist sequences and such that, as ,
[TABLE]
Then (4.9) implies that the map
[TABLE]
has constant on value and converges locally uniformly to , which is therefore also constant on , that is, for all and all
[TABLE]
Finally, (2.12) and the fact that imply that solves the same equation as , that is
[TABLE]
the main difference being that is not periodic a priori.
The next step is to show that a.e. and for this we use that a.e..
Let be a point of differentiability of and note is differentiable at . Then, since , (4.10) gives
[TABLE]
On the other hand the uniform convexity of implies, for some ,
[TABLE]
This proves that a.e. and, in particular, that is constant, which means that is periodic.
It follows from (4.9) that for any , which, using (4.10), leads to for any .
A symmetric construction shows that is also constant.
Finally, (2.12) yields some large enough such that the trajectory does not encounter and, in view of Lemma 4.3, . Note that we use here the fact that we work in dimension , since otherwise it is not true that the trajectory does not intersect for large enough. ∎
We continue with the:
Proof of Theorem 4.1 for ..
Fix large enough so that contains the support of and set , that is contains all points that can be reached by optimal trajectories starting in at some time .
The continuity of the flow and (2.12) imply the existence a time such that, for any and all such that ,
[TABLE]
Since , Lemma 4.2 suggests that to conclude, we just need to check that
[TABLE]
Lemma 4.3 states that is nonnegative, if the trajectory does not encounter . Since , in particular contains all the initial positions such that intersects the support of . Thus
[TABLE]
The set is not precise enough and we do not have much control over its size. In the next step, we replace it by a smaller one , which carries more information, without increasing by “too much” the size of the lower bound on in the inequality above.
Let us recall that, from Lemma 4.3, converges to as for a.e. . So, by Egoroff’s theorem, for any fixed , there exists a compact subset of and a time such that
- (i)
if and , then ,
- (ii)
if , then
[TABLE]
and
[TABLE]
The next step is to provide a more precise characterization for . For this we construct such that
[TABLE]
For any , let and set . It is immediate that is a Borel measurable set and satisfies (4.12).
For , set
[TABLE]
The family is a partition of . Moreover note that the definition of and (4.11) yield
[TABLE]
For , and large enough, we have
[TABLE]
where we used that is invariant by the flow and the image by the map of is .
Hence
[TABLE]
The choice of (property (i)) gives
[TABLE]
and, similarly,
[TABLE]
Thus, since and , we get
[TABLE]
Using property (ii) in the definition of , we finally find
[TABLE]
Letting , we obtain
[TABLE]
which yields both and . ∎
The proof of Corollary 2.4
Let be the common value of ; recall that in the proof of Theorem 4.1 we showed that . Let now , the open set of points such that does not intersects . Lemma 4.3 implies that the map is non increasing and has the same limit at and . Hence it is constant in and (i) holds.
Next we show that, for any , there exists such that
[TABLE]
Fix . We know from Lemma 4.3 that the map is non decreasing for large enough and converges to . Hence, there exists such that for .
Sine the map is continuous, we also have for any in some ball centered at and of radius .
Thus, since the map is nondecreasing, for and we have . We conclude using a standard compactness argument.
Next we claim that, for any , there exists such that, for all such that ,
[TABLE]
Fix , let be defined as in the previous step and choose
[TABLE]
with ; notice that .
It follows from Corollary 2.3 that, if is large enough, then for any with , the trajectory does not instersect for .
Fix with . If , we know that .
We now assume that there exists such that . Then, by the definition of , , and, since as and , we must have
[TABLE]
and, hence, . But then the first claim of the corollary gives
[TABLE]
which proves (4.13).
A similar argument shows that, for all , there exists such that, for all such that ,
[TABLE]
which implies (iv).
We now prove (ii). Fix and let be the optimal path for for positive times. Then
[TABLE]
while
[TABLE]
Fix and let be given by the previous step. It follows from (4.15) that, for all ,
[TABLE]
which, in view of Lemma 2.2, implies that there exists such that for all . Then the definition of gives that, for all
[TABLE]
Subtracting (4.16) from (4.15) and using yields
[TABLE]
which proves (ii) since is arbitrary.
It remains to show (iii). Let be given by Lemma 2.2 for and choose such that .
It follows, again from Lemma 2.2, that the trajectory avoids the support of for all positive times. Then Lemma 4.3 implies that the map is non decreasing on , so that
[TABLE]
Since, in view of (ii), the opposite inequality always holds, (iii) is proved. ∎
5. Sharper convergence for the random perturbation
Given a -periodic Hamiltonian satisfying (2.1), (2.2) and (2.6), we consider the random perturbation defined in (1.7), with and as in (1.5) and (1.9) respectively.
Let be the effective constant associated with . We are interested in the behavior of the ratio as ; recall that in Corollary 3.4 we proved that this ratio is bounded.
We prove that exists and equals a non-zero constant when and [math] when .
Theorem 5.1**.**
Assume (2.1), (2.2), (2.6), (1.7), (1.5) and (1.9). When ,
[TABLE]
and, when ,
[TABLE]
A discussion similar to the one after Theorem 4.1 explains the difference between the one and the multi-dimensional case.
The proof for makes strong use of the fact that in this case there exist “almost explicit formulae” for and and follows along the lines of the proof of the limit in Theorem 4.1.
Proof of Theorem 5.1 for
For we consider the cell problems (1.1) and
[TABLE]
with as in (1.7). We remark that, since we work on the real line and given the assumptions on , (5.1) has a strictly sublinear at infinity solution; see Lions and Souganidis [23]. Moreover, the solutions of (1.1) and (5.1) are in with bounds independent of . Finally we recall that the solution of (1.1) is periodic.
Following the discussion in the subsection about the one-dimensional problem as well as the proof of Theorem 4.1 for , we rewrite (5.1) as the ode
[TABLE]
together with condition
[TABLE]
where is the same branch for the inverse of we used for (2.13).
Let and recall that, in view of Corollary 3.2, .
Combining (2.14) with and (5.3), we find
[TABLE]
In what follows, for simplicity we assume that . Otherwise we need to account for lower order terms in ; we leave the details to the reader.
Since, in view of (1.8) and the assumed Bernoulli law, the left hand side of (5.3) can be evaluated explicitly, we rewrite (5.4) as
[TABLE]
The strict convexity of and the bound on in Corollary 3.4 yield, as in the proof of Theorem 4.1 for ,
[TABLE]
and
[TABLE]
Integrating over and using that
[TABLE]
in (5.5), we get
[TABLE]
and, since as ,
[TABLE]
∎
The multidimensional random problem
In higher dimensions, that is when , the proof is rather delicate and more involved. It is based on constructing a suitable (random) trajectory along which it is possible to control the quantity . This is accomplished combining the optimal trajectories of the unperturbed and the “one bump” problems.
The proof is divided into four parts. In the first we introduce some notation, in the second we explain the construction of the random trajectory and in the third we provide the key estimates. The argument is completed in the fourth part.
Notation
In what follows we denote by and the Borel measurable with respect to optimal paths for and , that is, for any and any ,
[TABLE]
and
[TABLE]
Set
[TABLE]
and note for later use that
[TABLE]
Fix be such that and . Then Lemma 2.2 and Corollary 2.4 imply the existence of and such that
[TABLE]
[TABLE]
and, if is a trajectory such that
[TABLE]
then, for all ,
[TABLE]
We also set
[TABLE]
and, for , , and are the sets
[TABLE]
Finally, , and are the algebras generated by the random variables with and , and respectively.
In what follows we fix , and and we set, for all
Throughout the proof is a generic constant, which may change from line to line, depends on the data and on by the choice of , or , but not on , or . In addition is a constant which may also depend on .
The random trajectory
We construct by induction a sequence of random points and times and, then, on each time interval , a random trajectory .
We define , and on as follows:
[TABLE]
Note that , are deterministic with , .
Assuming next that and are known, we find , and on . For this we need to consider three disjoint events , and . Roughly speaking, in the event , the perturbation vanishes on the trajectory in the set . In , the trajectory encounters only one bump in , and there are no other bump in a large neighborhood of the trajectory. The last event is the complement of the other two.
More precisely, recalling that and that the radius is such that , the event is defined by the property that there is no with and for some . In the event , there exists a unique with and for some , but there is no other such that ; here is a large constant depending on defined in (5.13) below. Finally,
In ,
[TABLE]
and
[TABLE]
In , we set in , ,
[TABLE]
where is given in the definition of ,
[TABLE]
Note that, by definition, for all ,
[TABLE]
Moreover, by Corollary 2.3, the times are finite.
The key properties of the construction
In the next four lemmata we study the properties of the construction above that are needed to complete the proof of the theorem.
Lemma 5.2**.**
For any and all , the trajectory remains in .
Proof.
We argue using induction. Observe that, in view of the choice of and , the claim is immediate for , and assume that the result holds for some .
The choice of in , yields that, for all , belongs to .
In view of the definition of in , to conclude we need to show that, for all
[TABLE]
Note first that (5.10) holds for . Then the definition of and the fact that yield that, for all
[TABLE]
It follows, in view of (5.6), that for all
[TABLE]
The optimality of for implies that, for any ,
[TABLE]
where, by (5.11), on .
Hence, using (5.12), we find
[TABLE]
It follows that is optimal for in , and, in view of the uniqueness of the optimal solution, we obtain that, for all
[TABLE]
Using that the map is periodic, we get that, for any ,
[TABLE]
which is (5.10). ∎
Lemma 5.3**.**
For any , , and the restriction of to are -measurable, while the events , and are -measurable.
Proof.
We argue again by induction. The claim is true for since , and the restriction of to are deterministic.
We assume next that , and the restriction of to are -measurable. Knowing and , it follows that , and belong to , and the induction assumption, implies that , and are -measurable. It follows from their definition that , and the restriction of to are -measurable. ∎
Lemma 5.4**.**
For any , belongs to for all .
Proof.
It is enough to show that, for any , belongs to for . Fix . Lemma 5.2 implies that, for all , , and the claim is clear in . In , we have for , and again in this interval. Moreover, (5.8)(ii) yields that
[TABLE]
and, hence, the choice of in (5.8) yields
[TABLE]
∎
Lemma 5.5**.**
There exists , which is independent of , , and , such that, for all , . In particular, as and almost surely,
Proof.
Since , we deduce that
[TABLE]
which proves that for some .
Recall that, for all and ,
[TABLE]
Then Lemma 2.2 yields such that, for all ,
[TABLE]
Similarly, since, for all ,
[TABLE]
it follows that
[TABLE]
Hence, in the event , where for , we have
[TABLE]
where denotes the integer part of .
In the event , on and on , where . Thus
[TABLE]
while
[TABLE]
Since, from the first part of the proof, is large for large , combining the inequalities above, we find that, for a suitable choice of ,
[TABLE]
∎
We now define the constant that was used in the construction of the random trajectory as
[TABLE]
and remark, for later use, that, in , .
We also emphasize that the construction of in the proof of Lemma 5.5 is deterministic. indeed, it does not depend on the definition of the random sets , and , but only on the possible expressions the trajectory can take in these events. In particular, the definition of is not circular.
Lemma 5.6**.**
There exists , which is independent of , , and , such that
[TABLE]
The intuition behind the lemma is quite clear. The set is contained in the event that there is at least one bump , which is both near the trajectory and belongs to . Since ,
The proof of Lemma 5.6.
Let be the random set
[TABLE]
Lemma 2.2 implies the existence of a constant , independent of , such that
[TABLE]
Next we discretize with step size , for some , such that
[TABLE]
where .
It follows that
[TABLE]
Note also that since, for any , we have
[TABLE]
if is such that , then .
Hence
[TABLE]
Since
[TABLE]
we deduce that
[TABLE]
The -measurability of implies that the event with is independent of , and, thus
[TABLE]
where depends only on the dimension.
Then, since , we may conclude. ∎
Proof of Theorem 5.1
It is known (see [28]) that, if
[TABLE]
then, almost surely,
[TABLE]
In particular, in view of Lemma 5.5, we have
[TABLE]
If is the trajectory built in a previous subsection, then
[TABLE]
To estimate the right-hand side the inequality above, which is the core of the proof, we need to establish three more auxiliary results, which we formulate next as separate lemmata.
We set
[TABLE]
and we successively estimate in , and noting that the estimate in the last set is the hardest to establish.
Lemma 5.7**.**
There exists a nonnegative random variable such that
[TABLE]
Proof.
Recall that in . It follows that
[TABLE]
Let
[TABLE]
Since is the event that there is no with and for some ,
[TABLE]
Let
[TABLE]
and recall that, in view of Lemma 5.3, and are measurable. Then is also -measurable and equals in .
We now estimate for how long the trajectory remains in . Using (5.8)(ii) we find that, if , then, for all ,
[TABLE]
and, similarly, if , then
[TABLE]
It follows that for , and, hence,
[TABLE]
Using that remains in for positive times, is -measurable and the map is independent of in with , we find
[TABLE]
In the same way, since , and are measurable,
[TABLE]
The claim follows. ∎
Next we estimate in .
Lemma 5.8**.**
There exists a nonnegative random variable such that
[TABLE]
Proof.
It is immediate that
[TABLE]
with
[TABLE]
In the event , there are at least two different with . Since is independent of ,
[TABLE]
It follows from Lemma 5.5 that , and, hence,
[TABLE]
and the claim follows. ∎
The next lemma is about .
Lemma 5.9**.**
Let be as in Lemma 5.6. There exists a nonnegative random variable such that
[TABLE]
Proof.
In the event , we have set on and on , where . So we can write
[TABLE]
with
[TABLE]
and
[TABLE]
To estimate we argue as in Lemma 5.7. Indeed,
[TABLE]
with
[TABLE]
It then follows, as in the proof of Lemma 5.7, that
[TABLE]
We now turn to the estimate for . In the event , there exists a unique with and for some , and there is no other such that . Therefore
[TABLE]
The definition of yields
[TABLE]
Moreover, since while , using the in (5.9), we have
[TABLE]
It then follows from (5.7) and the periodicity of that
[TABLE]
The definition of implies that and, hence,
[TABLE]
and, in view of (5.6) and the periodicity of ,
[TABLE]
Collecting the above inequalities and using the periodicity in space of , we find that, in ,
[TABLE]
and, hence,
[TABLE]
where
[TABLE]
Recalling (5.15) as well as the fact that for , we find
[TABLE]
Let be the event that there is at least one bump different from , in . Since belongs to , we get
[TABLE]
It follows from (5.8)(ii) that, if with , then
[TABLE]
Moreover, since , we also find, for ,
[TABLE]
and, thus for .
It follows that
[TABLE]
In view of the fact that in there exist at least two distinct bumps in the set , we have
Writing
[TABLE]
we obtain
[TABLE]
and, in view of Lemma 5.6 and the above estimates,
[TABLE]
∎
We complete now the proof.
Proof of Theorem 5.1(continued).
Combining Lemma 5.7, Lemma 5.8 and Lemma 5.9, we find
[TABLE]
where , and, for all ,
[TABLE]
Therefore
[TABLE]
It follows from Lemma 5.5 that
[TABLE]
and, thus,
[TABLE]
Then, in view of (5.14), we get
[TABLE]
and, thus,
[TABLE]
Since and are independent on and , and are independent on , letting first and then , we conclude that
[TABLE]
The inequality then completes the proof. ∎
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Y. Achdou and N. Tchou. Hamilton-Jacobi equations on networks as limits of singularly perturbed problems in optimal control: dimension reduction. Communications in Partial Differential Equations , 40(4): 652–693, 2015.
- 2[2] A. Anantharaman and C. Le Bris. A numerical approach related to defect-type theories for some weakly random problems in homogenization. Multiscale Modeling & Simulation. A SIAM Interdisciplinary Journal , 9(2): 513–544, 2011.
- 3[3] A. Anantharaman and C. Le Bris. Elements of mathematical foundations for numerical approaches for weakly random homogenization problems. Communications in Computational Physics, 11(4): 1103–1143, 2012.
- 4[4] S. N. Armstrong and P. Cardaliaguet. Quantitative stochastic homogenization of viscous Hamilton-Jacobi equations. Comm. Partial Differential Equations , 40(3):540–600, 2015.
- 5[5] S. N. Armstrong, P. Cardaliaguet, and P. E. Souganidis. Error estimates and convergence rates for the stochastic homogenization of Hamilton-Jacobi equations. J. Amer. Math. Soc. , 27(2):479–540, 2014.
- 6[6] S. N. Armstrong and P. E. Souganidis. Stochastic homogenization of Hamilton-Jacobi and degenerate Bellman equations in unbounded environments. J. Math. Pures Appl. (9) , 97(5):460–504, 2012.
- 7[7] S. N. Armstrong and P. E. Souganidis. Stochastic homogenization of level-set convex Hamilton-Jacobi equations. Int. Math. Res. Not. IMRN , 2013(15):3420–3449, 2013.
- 8[8] P. Cardaliaguet, and P. E. Souganidis. Homogenization and enhancement of the G 𝐺 G -equation in random environments. Comm. Pure Appl. Math., 60(10):1582–1628, 2013.
