Limit theory for random walks in degenerate time-dependent random environments
Marek Biskup, Pierre-Fran\c{c}ois Rodriguez

TL;DR
This paper establishes conditions under which variable speed random walks in time-dependent, potentially degenerate random environments on integer lattices converge to Brownian motion, using advanced PDE techniques.
Contribution
It introduces new conditions for diffusive limits of random walks in degenerate, time-dependent environments and employs Moser iteration for the analysis.
Findings
Proves invariance principle for degenerate environments
Uses Moser iteration to establish sublinearity of the corrector
Applicable to dynamical percolation and particle systems
Abstract
We study continuous-time (variable speed) random walks in random environments on , , where, at time , the walk at jumps across edge at time-dependent rate . The rates, which we assume stationary and ergodic with respect to space-time shifts, are symmetric and bounded but possibly degenerate in the sense that the total jump rate from a vertex may vanish over finite intervals of time. We formulate conditions on the environment under which the law of diffusively-scaled random walk path tends to Brownian motion for almost every sample of the rates. The proofs invoke Moser iteration to prove sublinearity of the corrector in pointwise sense; a key additional input is a conversion of certain weighted energy norms to ordinary ones. Our conclusions apply to random walks on dynamical bond percolation and interacting particle systems as well as to…
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.
\title\textbf
LIMIT THEORY FOR RANDOM WALKS IN DEGENERATE TIME-DEPENDENT RANDOM ENVIRONMENTS
\date
Abstract
We study continuous-time (variable speed) random walks in random environments on , , where, at time , the walk at jumps across edge at time-dependent rate . The rates, which we assume stationary and ergodic with respect to space-time shifts, are symmetric and bounded but possibly degenerate in the sense that the total jump rate from a vertex may vanish over finite intervals of time. We formulate conditions on the environment under which the law of diffusively-scaled random walk path tends to Brownian motion for almost every sample of the rates. The proofs invoke Moser iteration to prove sublinearity of the corrector in pointwise sense; a key additional input is a conversion of certain weighted energy norms to ordinary ones. Our conclusions apply to random walks on dynamical bond percolation and interacting particle systems as well as to random walks arising from the Helffer-Sjöstrand representation of gradient models with certain non-strictly convex potentials.
Marek Biskup1,2 and Pierre-François Rodriguez1
1Department of Mathematics December 18, 2017
University of California, Los Angeles
Los Angeles, CA, USA
2Center for Theoretical Study
Charles University [email protected]
Prague, Czech Republic [email protected]
© 2017 M. Biskup, P.-F. Rodriguez. Reproduction, by any means, of the entire article for non-commercial purposes is permitted without charge.
1 Introduction
1.1 Model and assumptions
The aim of this note is to study the long-time behavior of random walks on , , in a class of dynamical random environments given as a family of non-negative random variables
[TABLE]
where denotes the set of (unordered) nearest-neighbor edges of . For each sample of these random variables, referred to as conductances, we consider the continuous time Markov chain on with the instantaneous generator acting on functions as
[TABLE]
The variable , i.e., the jump rate of the walk across edge at time , is assumed to obey with allowed for non-trivial finite intervals of time. Our aim is to describe the long-time behavior of such random walks and, in particular, to show that their path distribution, scaled diffusively, tends to a non-degenerate Brownian motion.
A representative example of the above setting is the variable-speed random walk on dynamical bond percolation on . In this case is, for each , an independent copy of a stationary continuous-time process on with joint invariant distribution (product) Bernoulli() for some prescribed . We interpret as the event that edge is occupied at time and as the event that edge is vacant. The random walk then jumps at rate 1 across edges incident with its current position that are occupied at that instant of time. When the site where the walk is located has no incident occupied edges, the walk does not move.
It is clear that some mixing properties of the conductances (1.1) in both space and time are required for the desired convergence to Brownian motion to be possible. We will work under the following set of technical assumptions:
Assumption 1.1
The family is realized as coordinate projections on the product space endowed with the product Borel -algebra and the probability distribution denoted by . In addition, we assume:
- (1)
* obeys*
[TABLE]
for each and each , 2. (2)
letting denote the map
[TABLE]
the law is invariant and jointly ergodic under , 3. (3)
denoting, for each ,
[TABLE]
we have , -a.s.
We will write to denote expectation with respect to .
We remark that joint ergodicity in (2) means that any measurable subset of preserved by for all and is a zero-one event under . The restriction to conductances bounded by is only a matter of convenience; any uniform constant upper bound will suffice (and ensure that is non-explosive). Additional moment conditions on will need to be assumed in the statement of our main result. However, no assumptions will be made on the dynamics of the conductances and/or the law of its time reversal (which is stationary but possibly unrelated to ).
Besides dynamical percolation, the setting of Assumption 1.1 accommodates various other examples of interest. For instance, one can consider the random walk on the symmetric exclusion process , where is the indicator that site is occupied by a particle at time and the configuration evolves by swaps at endpoints and of edges in whenever an independent exponential clock rings at that edge. We then set, e.g.,
[TABLE]
for some . The walk is thus active only at times when it resides on an occupied site and the transitions are only between occupied vertices. Other particle systems such as the voter model or the contact process can of course be considered as well.
Another interesting class of random walks arises in the context of Helffer-Sjöstrand representations of gradient models with convex, but not uniformly strictly convex, potentials . The representative examples covered by our theory include
[TABLE]
with any , or even
[TABLE]
In this case the random environment is a family of diffusions evolving according to the Langevin dynamics
[TABLE]
where is a family of independent standard Brownian motions. The random walk jump rates are then given by
[TABLE]
In both (1.7) and (1.8), is non-negative and bounded yet not bounded away from zero.
1.2 Main result
In order to give a statement of our main result, we need some additional notation. Let denote the space of càdlàg functions endowed (disregarding the standard notation for the Skorokhod space) with the norm
[TABLE]
The space of continuous functions , a set that supports the law of the Brownian motion, is naturally embedded in and is, in fact, a closed (and thus measurable) subset thereof in the topology induced by the above norm. Our main conclusion regarding the Markov chain defined via (1.2) is as follows:
Theorem 1.2
Let and suppose that Assumption 1.1 holds and, in addition, the quantity in (1.5) obeys
[TABLE]
Then, for -a.e. random environment, the law of on tends, as , to the law of Brownian motion with
[TABLE]
where is a non-degenerate (deterministic) covariance matrix.
We note that this is a quenched statement (i.e., one for -a.e. environment). The corresponding annealed (or averaged) statement follows from the fact that the limiting covariance is non-random. The covariance actually admits the usual representation
[TABLE]
where is the harmonic coordinate constructed in Section 3. However, unlike for the static situations, the harmonic coordinate is not obtained by minimizing Dirichlet energy; instead one has to solve the heat equation (3.2) using a suitable limit procedure.
1.3 Connections and main ideas
Theorem 1.2 is an example of a quenched invariance principle which has been a topic of persistent interest over the past few decades. In the realm of static environments, the studied examples include uniformly elliptic random conductance models (Kipnis and Varadhan [25], Boivin [14], Boivin and Depauw [15], Sidoravicius and Sznitman [36]), the random walk on the supercritical percolation cluster (De Masi, Ferrari, Goldstein and Wick [18, 19], Sidoravicius and Sznitman [36], Berger and Biskup [9], Mathieu and Piatnitski [31]), non-elliptic i.i.d. random conductance models (Mathieu [30], Biskup and Prescott [12], Barlow and Deuschel [8], Andres, Barlow, Deuschel and Hambly [2]), balanced models (Lawler [29], Guo and Zeitouni [23], Berger and Deuschel [10]), environments admitting finite cycle decompositions (Deuschel and Kösters [20]). Recently, an elliptic regularity-based theory was developed that covers general random conductance models subject to moment conditions on the conductance tails at zero and infinity (Andres, Slowik and Deuschel [4]).
Significant advances have occured also for random walks in dynamical random environments. Here a line of attack focused on Markovian environments under various mixing conditions (Boldrighini, Minlos and Pellegrinotti [16], Bandyopadhyay and Zeitouni [6], Dolgopyat, Keller and Liverani [22], Redig and Völlering [35]) while other approaches worked under other structural assumptions on the environment such as independence and directionality (Rassoul-Agha and Seppälainen [34]) or ergodicity and uniform ellipticity (Andres [1]). Random walks on dynamical percolation have been studied by Peres, Stauffer and Steif [33] but the objective there were mixing properties rather than the scaling limit. An annealed invariance principle for random walks on the symmetric exclusion has been proved by Avena [5].
The sharpest conclusions concerning scaling to Brownian motion for dynamical environments of the kind (1.1) appear at present in the work of Andres, Chiarini, Deuschel and Slowik [3]. Indeed, a quenched invariance principle has been shown there to hold whenever
[TABLE]
are true for some with
[TABLE]
(Somewhat weaker, albeit harder-to-state, conditions actually suffice.) Although our rates are bounded (i.e., we can set above), the principal novelty of our work is that we allow with positive probability (which rules out existence of any as above). This is quite important in applications; e.g., we can reach previously unattainable examples such as the random walk on dynamical percolation or the Helffer-Sjöstrand walks for potentials (2.15), and even (2.14) for any (note that (1.15–1.16) apply only for sufficiently large).
Our approach is technically based on combining an enhanced version of the methods of the aforementioned article [3] with an observation from Proposition 4.6 in Mourrat and Otto [32]. The latter work proves a heat-kernel estimate (a.k.a. return probability) for random walks covered by our Assumption 1.1. The former in turn addresses random walks among random conductances satisfying (1.15–1.16) with the aim of proving that these scale to Brownian motion. The strategy there is fairly standard: prove that the key object of stochastic homogenization, the corrector, scales sublinearly in space and sub-diffusively in time.
The technical approach of [3] (drawing on its precursor [4] for static environments) is to control the corrector in supremum norm by way of Moser iteration starting only from a priori estimates in -norm. A key point is that the condition on the negative moment of from (1.15) is used only in a handful of places, and that typically for a conversion of a bound on a weighted -norm to a bound on an -norm, but these seem absolutely irreplaceable in the whole argument. This is where the said observation from [32] enters for us as this work shows that, under suitable averaging over time, one can control the heat kernel using energy norms where the “naked” is substituted by the weights
[TABLE]
for some positive, polynomially decaying function . The crucial input from [32, Proposition 4.6] is that these weighted energy norms can, for solutions of relevant Poisson equations, be again bounded by the ordinary energy norms (i.e., those where replaces ).
Under the condition a.s. we have a.s. and since we will even require finiteness of some moments of , we can count on having suitable moments of . The basic strategy of our proofs is thus to demonstrate that one can substitute by in those few places in the argument of [3] where finiteness and moments of these quantities are crucially required. However, this would in itself be an understatement of our contribution. Indeed, we have to carefully adapt the Moser iteration from [3] which is based on conversion (via an inequality from Kružkov and Kolodiĭ [27]) of certain space-time norms of the corrector into an -norm in time. This in turn requires generalizing [32, Proposition 4.6] to include arbitrary moments of the solutions. In addition, we also need to devise an alternative construction, and prove the a priori -estimate, of the corrector. Unlike for [3], these will again hinge on the aforementioned conversion of the energy norms.
1.4 Remarks and open questions
We proceed with a couple of remarks and open questions. First off, our aim here has been to find a way to prove convergence to Brownian motion under some reasonable (moment) conditions on the environment and so we have not tried to tune these conditions to get optimal control. It is thus of interest to solve:
Problem 1.3
Find out whether sharp moment conditions on exist for an invariance principle to hold for all environments satisfying Assumption 1.1.
We note that this includes both quenched and annealed statements. To see that we should hope to get better than (1.12), we note:
Lemma 1.4
Suppose Assumption 1.1 holds and, in addition, assume that is separately ergodic with respect to time shifts alone. Then for each ,
[TABLE]
We relegate the (easy) proof to the Appendix.
Remark 1.5
Under the conditions (1.15–1.16) with , which requires , we thus get finiteness of moments of of order larger than . We note that this is less than in all so our condition (1.12) is generally quite a bit stronger than (1.15–1.16).
As we will see in Lemma 2.10, our conditions on imply conditions on the negative moments of which then serve as technical input for the rest of the proofs. Noting that integrability of and Jensen’s inequality imply
[TABLE]
for some , these moment conditions on are directly implied by the corresponding moment conditions on . The bounds (1.18–1.19) indicate that the setting of [3] is naturally included in ours, except that (as was just noted in Remark 1.5) our conditions are more stringent than those in [3]. We take this as a suggestion for potential improvements of our techniques.
Another aspect left out in our study are environments where is unbounded from above. These include some very interesting cases; in fact, our initial motivation was to understand a specific model where is zero except for some random times when it has a Dirac-delta singularity. Our proofs require boundedness of in a number of places and we do not know how to overcome these restrictions.
Yet another aspect where our study falls short is our choice of time-parametrization of the walk. Indeed, our choice of the generator (1.2) corresponds to the so-called variable-speed random walk but other parametrizations, e.g., the constant-speed random walk, are of interest as well. In particular, we would like to solve:
Problem 1.6
Extend our conclusions to discrete-time random walks among (discrete) time dependent random conductances subject to (analogues of) Assumption 1.1.
A somewhat unexpected feature of time-dependent random environments is that different time-parametrizations are not directly related and so our proofs do not shed any light on those either. We consider this to be one of the most challenging open problems of this subject area.
As an attentive reader has surely noticed, our results are stated under the restriction to spatial dimensions . This is dictated by the fact that the parameters space-time Sobolev inequalities behave differently in than in . Although we think that these differences can be overcome, we have decided to skip the case in order to avoid having to deal with annoying provisos and keep the paper to a manageable length. Under the moment conditions (1.15–1.16), the one-dimensional case has been addressed in [21].
Finally, although we work with elliptic regularity techniques, we have not touched the subject of heat-kernel estimates; i.e., Gaussian-type upper/lower bounds on the probability that the walk conditional on being at at time is at at a later time . Unlike for the static environments, such bounds are much less regular and various pathologies may arise (cf. Huang and Kumagai [24]). As already mentioned, for our class of environments upper bounds on the diagonal term have been derived in Mourrat and Otto [32]. In analogy with the static case, we expect that our proof of the invariance principle with non-degenerate diffusion matrix should imply an on-diagonal lower bound. However, we have not been able to conclude this rigorously.
1.5 Outline
The remainder of the paper is organized as follows. In Section 2 we develop the functional-theoretical tools underpinning the proofs in later sections. This, in particular, includes the introduction of Sobolev inequalities and conversion of the Dirichlet energies mentioned above. In Section 3, we then construct the harmonic coordinate, which one can think of as an embedding of on which the random walk is a martingale. The change in the embedding is expressed by the said corrector, which is a fundamental quantity in all standard treatments of random conductance models (see, e.g, recent reviews by Biskup [11] and Kumagai [28]). The above mentioned a priori -estimates on the corrector are also derived here using methods of independent interest. In Section 4 we give a proof of the main result subject to a pointwise sublinearity estimate on the corrector. This estimate is then substantiated in Sections 5–6 by combining the a priori -bounds with Moser iteration. The Appendix collects some estimates that would be a distraction in the main line of a proof.
Let us make the following convention about the use of constants. We denote by positive and finite constants which can change from place to place. Numbered constants become fixed whenever they first appear. Their dependence on all parameters will always be explicit.
2 Sobolev inequalities and weighted energies
Here we introduce the necessary functional-theoretical tools for our later proofs. A reader preferring to avoid technicalities until they are actually used may consider skipping this section and returning to it only while reading the rest of the paper.
2.1 The -Sobolev inequality
The control of the corrector in stochastic homogenization seems to always require a kind of coercive-type estimate for its Dirichlet energy in terms of a suitable norm. Historically this was done (e.g., in Sidoravicius and Sznitman [36], drawing on Delmotte [17] and Barlow [7]) via the Poincaré inequality. This is easy and elegant in uniformly elliptic cases but becomes less so when one deals with non-elliptic environments and, particularly, wishes to work under moment assumptions on the conductances only. In this line of thought, Andres, Deuschel and Slowik [4] devised a powerful approach based on Sobolev inequalities which we will follow here as well. The starting point of this approach is:
Lemma 2.1** **(-Sobolev inequality)
For each there is such that any with finite support,
[TABLE]
Proof. This is very standard, but we give a proof as it is short and instructive and, also, as we will reuse the argument in the next lemma. First off we use Hölder’s inequality to get
[TABLE]
By the isoperimetric inequality in , for any finite , we have , where is the set of edges with exactly one endpoint in and denotes the cardinality of , for any . Using this for in (2.2), shows
[TABLE]
Performing the integral and using that \bigl{|}|a|-|b|\bigr{|}\leq|a-b| now yields (2.1). ∎
We note (as our proof above attests) that the -Sobolev inequality is equivalent to the isoperimetric inequality. The restriction to with finite support is sometimes inconvenient and one might wish to work instead in a finite box. The following lemma addressing this setting will be quite useful. No surprise, it is still based on isoperimetry but this time in a finite box:
Lemma 2.2
For there is such that for any , any and any translate of ,
[TABLE]
where .
Proof. Replacing by if needed, we may assume without loss of generality that
[TABLE]
Let denote the set on the left-hand side. Since , we have
[TABLE]
Jensen’s inequality along with the argument in (2.2) then show
[TABLE]
Since , the isoperimetric inequality in yields for any , where is the set of edges in that have both endpoints in . Using this as in (2.3) and plugging the result into (2.6) yields the claim with . ∎
2.2 Sobolev inequalities with weighted energies
Our next goal will be a conversion of the -Sobolev inequality into a more useful form. Given any Lebesgue measurable , for any measurable , with the value at denoted by , any and any , define the norms
[TABLE]
Recalling our notation for the set of unordered edges (with each edge included only once) in and writing for the set of edges in with at least one endpoint in , we will use the notation to denote the corresponding object for functions ; just replace sum over by sum over .
For any , any , any and any collection of non-negative weights we define
[TABLE]
The notation will be reserved for the specific situation when the weights are given by the conductances . Assuming in addition that is Borel measurable for each , we then define the integrated forms of these via
[TABLE]
reserving again for the case when the weights are given by the conductances. If , we denote the above energies simply by and . We now claim the validity of the following family of inequalities:
Lemma 2.3** **(Sobolev inequalities)
For each , each and each there is such that for defined by
[TABLE]
the inequality
[TABLE]
holds for any finite and any measurable .
The quantity should henceforth be interpreted as infinity when . We remark that Andres, Chiarini, Deuschel and Slowik [3] derive (2.12) for the particular case when and replaced by . However, their parametrization is different from ours.
Remark 2.4
The norm (2.8) is asymmetric in the sense that it puts integration with respect to the spatial variables before that with respect to time and so the reader may wonder whether setting the norms up the opposite way may give us any advantage. To address this issue, define
[TABLE]
Then a similar calculation to the one in the proof of Lemma 2.3 below shows that, for each and each ,
[TABLE]
holds for any finite and any measurable . In particular, both ways to define space-time norms seem more or less equally powerful.
Proof of Lemma 2.3. Let denote the set of ordered edges with at least one endpoint in . Pick and from the allowed ranges. The -Sobolev inequality along with the fact that
[TABLE]
and simple symmetrization show
[TABLE]
Let be defined by
[TABLE]
and notice that then by the first equality in (2.11). Hölder’s inequality with indices then bounds the right-hand side of (2.16) by
[TABLE]
where the constant arises from rewriting the first sum from that over edges to that over sites and where the sums are now over unordered edges again. Now multiply the resulting inequality by and integrate over . Since the second equality in (2.11) ensures that are Hölder conjugate indices, another use of Hölder’s inequality yields
[TABLE]
This now readily implies (2.12). ∎
Our later applications make it convenient to introduce normalized versions of the above norms. Assuming to be integrable and denoting by its -norm is with respect to Lebesgue measure, we thus set
[TABLE]
For the case we get
[TABLE]
where the essential supremum is with respect to the Lebesgue measure on . We will write and to denote the corresponding norms for functions indexed by edges of . For later reference, we note that, by Jensen’s inequality,
[TABLE]
The norms will be used heavily in Sections 5-6. The following form of (2.12) is tailored to the purposes of that section.
Corollary 2.5
For each , each and each and for and as in Lemma 2.3, defining
[TABLE]
the bound
[TABLE]
holds for all finite and all measurable .
Proof.
An application of (2.12) yields
[TABLE]
Now (2.11) implies and so
[TABLE]
Using this in (2.25), and noting that , the claim follows. ∎
Our application of the above norm in Moser iteration requires a comparison between various instances of the norm (2.8). This is the content of the following lemma.
Lemma 2.6** **(Interpolation)
Suppose and are such that
[TABLE]
Then, for all measurable and all finite ,
[TABLE]
In particular, for all with and all satisfying the first condition of (2.27) with , we have
[TABLE]
Proof. Writing in (2.8) and invoking Hölder’s inequality with conjugate exponents yields
[TABLE]
Hölder’s inequality with conjugate exponents then readily gives (2.28). The inequality (2.29) follows from (2.20) and (2.28) by noting that as . ∎
2.3 Edge weights and their growth
Throughout the rest of this paper, the edge weights we will work with always take the form (1.17). The choice of the function underlying (1.17) is tied to the choice of the function governing the above norms by certain conditions we will now spell out. Other than having to obey the restricted set of constraints listed in (2.31–2.33), the functions and can be chosen arbitrarily for the purposes we have in mind.
We assume that the function is supported in and is bounded, non-increasing, continuously differentiable on with both and Lebesgue integrable. We also assume that and
[TABLE]
The function is Borel measurable with both and Lebesgue integrable on . Moreover, setting
[TABLE]
there exists a constant such that for each ,
[TABLE]
Remark 2.7
The condition (2.33) is needed for the conversions of Dirichlet forms mentioned in the Introduction, see in particular Lemmas 2.11 and 6.1 below.
That a pair of functions satisfying the above requirements exists is ensured by:
Lemma 2.8
Let and . Then and obey the above conditions and, in particular, (2.31–2.33). In fact, for all , we have
[TABLE]
Proof. The integrability conditions are immediate from the fact that and ; (2.31) is checked directly. For (2.34) we note that where and then observe
[TABLE]
Since and (and ), both terms on the right are now less than a constant times . This proves (2.34) for ; in the complementary range of values the claim is checked directly. ∎
Unless specified otherwise, we will henceforth always tacitly assume that and are a pair of functions satisfying (2.31–2.33). Some (but not all) calculations will require adapting our setting to diffusive scaling of space and time, i.e., choosing in (2.8) with replaced by
[TABLE]
and replaced by
[TABLE]
with as above. It is then natural to require (2.34), instead of just (2.33), to hold. (Note that (2.34) is tantamount to saying that (2.33) holds for all pairs , .) When needed, the condition (2.34) will always be mentioned explicitly.
The diffusive scaling of time naturally underlies the following property that will be repeatedly used in the sequel:
Lemma 2.9
For each there is such that for all ,
[TABLE]
In particular, the integrals converge absolutely for all .
Proof. Dominating by , we may assume without loss of generality that . The assumed properties of ensure that . Using that is greater or equal to zero and Tonelli’s Theorem yields
[TABLE]
Denoting , straightforward monotonicity considerations show that the supremum over of the quantity on the right is at most
[TABLE]
The boundedness and integrability of imply that both integrals are finite. Jensen’s inequality and the Maximal Ergodic Theorem in turn ensure for some independent of . The claim follows. ∎
In order to use the Sobolev inequalities (2.24), we will need a uniform bound on the norms of the weights appearing on the right-hand side. This is the content of:
Lemma 2.10
Under Assumption 1.1, given for some (cf. (1.5)), and for satisfying (2.34) in addition to (2.31–2.33), the following holds: For each , the family defined in (1.17) is stationary with respect to time-shifts. Moreover, if is true for all and some , then
[TABLE]
and, in addition,
[TABLE]
is satisfied for all .
Proof. The stationarity of is clear from (1.17) and the assumed stationarity of . The definition (1.5) and monotonicity of ensure that, for any ,
[TABLE]
and so (2.41) directly follows from (1.12) and the assumed bound on . For (2.42), we first note that, if , then (2.22) implies
[TABLE]
where
[TABLE]
Under , (2.41) implies that for some . Lemma 2.9 and stationarity of then show . Bounding in (2.44) by the supremum, the claim follows from the Spatial Ergodic Theorem. ∎
2.4 Conversion of Dirichlet energies
The usual way a regularity argument starts with the use of Sobolev inequality to bound the desired norm of a function by its Dirichlet energy. For a solution to Poisson or heat equation, the Dirichlet energy is in turn bounded by a lower-order norm, thus gaining regularity. Unfortunately, our Sobolev inequality outputs a weighted Dirichlet energy and so we need an additional step in which we bound this Dirichlet energy by the ordinary one to which the rest of the argument can be applied.
Recall the definition of the (finite volume) Dirichlet energy in (2.9). The bound that achieves the stated goal is then as follows:
Lemma 2.11
Suppose are measurable and take values in . Let be finite and set . If solves (weakly) the heat equation
[TABLE]
for some bounded measurable , then for each ,
[TABLE]
where is as in (2.32).
Proof. We follow the calculation in the proof of Proposition 4.6 in Mourrat and Otto [32]. The definition of the weights in (1.17) gives
[TABLE]
Writing and using that and that then shows
[TABLE]
Concerning the second term in the parentheses, here (2.46) and yield
[TABLE]
where the last inequality follows by Cauchy-Schwarz and the bound . Plugging this in (2.49) and invoking the definition of , we get (2.47). ∎
Remark 2.12
The argument (2.50) uses crucially that the lattice gradient is a bounded operator. This is what makes the above proof fail in the continuum setting.
Recall the definitions of and from (2.36) and (2.37). Then we have:
Corollary 2.13
For and as in Lemma 2.11, if (2.34) holds (in addition to (2.31)-(2.33)), then for each ,
[TABLE]
Moreover, under Assumption 1.1, if and are such that and for each , each , and (2.46) holds, then
[TABLE]
Proof. In light of (2.47), the first conclusion follows directly from (2.34). For (2.52) take expectation of (2.51) (this eliminates the integrals over time), divide by and take . ∎
We remark that, in the derivations underlying the Moser iteration, we will need to rederive variants of these estimates for powers of the solutions multiplied by suitable mollifiers. Besides illustrating the main ideas of our proofs, the above simpler versions will be used to define, and derive a priori -estimates, of the corrector in the next section.
3 Construction of the corrector
The next task is the construction and derivation of the needed properties of the harmonic coordinate and the associated corrector. The natural setting for our proof is to require a certain moment condition for the weights defined in (1.17), see (3.1) below. We will verify immediately that this condition is met under the assumptions of Theorem 1.2.
Note that, whenever Assumption 1.1 holds, the family is stationary with respect to time-shifts for each , as can be seen from (1.17) and the assumed stationarity of . This will be used frequently below. Recall also that the functions are assumed to satisfy (2.31–2.33); enters through the definition of the weights and, although does not appear explicitly in the following theorem, it will be used in its proof. Let denote the space of measurable whose -th power is locally integrable with respect to the Lebesgue measure and . The main conclusion of this section is now as follows:
Theorem 3.1
Suppose the law of the conductances obeys Assumptions 1.1, (2.34) holds and, with as defined in (1.17), there exists such that
[TABLE]
Then there exists a measurable function such that the following holds:
- (1)
* is a weak solution to the family of the ODEs*
[TABLE]
where is the generator defined in (1.2), and , 2. (2)
* satisfies the cocycle conditions in space-time: for each and each ,*
[TABLE]
with , 3. (3)
* is of finite specific energy in the sense that*
[TABLE] 4. (4)
defining the corrector by and letting ,
[TABLE]
holds for each and each .
Remark 3.2
Theorem 3.1 fits the setting of Theorem 1.2 for the choice with any because (2.41) implies (3.1) with . Such a choice of can be made since when (and ).
From Theorem 3.1 and Lemma 2.8 we thus immediately obtain:
Corollary 3.3
Under the assumptions of Theorem 1.2, there exists a measurable function satisfying (1–4) in Theorem 3.1 above.
The strategy of our proof of Theorem 3.1 is as follows: similarly to all existing constructions of the harmonic coordinate, we will solve a suitably perturbed version of (3.2) and then control the removal of the perturbation. As usual, the latter step will be done using functional analytic methods. In [3], which is closest to our setting, even the former step was based on functional analytic tools (namely, the Lax-Milgram lemma) but here we will proceed by more probabilistic arguments.
Let , for and , denote the transition probability of the random walk between times and ; i.e.,
[TABLE]
We begin by noting the following fact about uniformly elliptic situations:
Lemma 3.4
Let and suppose, for the moment, that the conductances are Lebesgue measurable and taking values in . Let be bounded and measurable. Then
[TABLE]
is well defined with continuously differentiable for each . Moreover, obeys
[TABLE]
at each and .
Proof. Since is bounded, the sum in (3.7) converges absolutely and is bounded uniformly in , hence the integral over converges absolutely as well and is well-defined. The transition probability admits the representation
[TABLE]
where if and vanishes otherwise, means that and . Thus, the function obeys the differential equation
[TABLE]
Since the conductances are nearest-neighbor and uniformly bounded, the sum of the derivatives (with respect to ) of the terms in (3.7), as well as the resulting integral, converge absolutely. Standard criteria permit us to exchange the time derivative with the integral over and the sum over . The result then boils down to a simple calculation which we leave to the reader. ∎
Given a sample of the conductances satisfying Assumption 1.1, we will apply Lemma 3.4 to the function given by where
[TABLE]
However, in order to have the required ellipticity, the random walk will be driven by the collection of perturbed conductances , where
[TABLE]
Writing for the transition probability of the random walk among conductances , Lemma 3.4 then ensures that
[TABLE]
obeys
[TABLE]
Here is the discrete Laplacian on acting as and is the generator derived from the “bare” conductances as in (1.2). The effect of the term is to make the generator uniformly elliptic; the term (times identity) then represents a killing of the walk at uniform rate .
Our aim is to show that converges, as , to the desired corrector in a suitable sense. This will be done via a sequence of lemmas. First we note that satisfies the cocycle conditions in space-time:
Lemma 3.5
For each , each and each ,
[TABLE]
In particular, for each and each ,
[TABLE]
and so satisfies (3.3) for every .
Proof. (3.15) follows from (3.13) and the identities and . The second line follows from (3.15) and . ∎
Next we observe the validity of some a priori estimates:
Lemma 3.6
Under Assumption 1.1, for each ,
[TABLE]
and
[TABLE]
Proof. Recall that is bounded; by (3.14) and the definition of the same applies to its time derivative as well. This justifies exchanges of limits and expectations in
[TABLE]
where the middle equality follows from (3.15) and invariance of under . We thus have
[TABLE]
Taking the inner product of (3.14) at and with and then taking expectation yields, on account of (3.20),
[TABLE]
where we used (3.15) and simple symmetrization for the second term on the left hand side and also to obtain the middle equality, and then invoked the Cauchy-Schwarz inequality along with to get the last inequality. Since , foregoing the term yields (3.18) and, by plugging that in on the right-hand side of (3.21), also (3.17). ∎
These bounds have the following consequences:
Lemma 3.7
Under the assumptions of Theorem 3.1, for with as in (3.1), the following holds uniformly on compact sets of :
[TABLE]
and
[TABLE]
Proof. As , the first part of the claim follows immediately from (3.17), Hölder’s inequality and (3.15). For the second part we write , write the spatial difference as a telescoping sum, and then use (3.16) and (3.14) to obtain
[TABLE]
The first term on the right is bounded thanks to (3.17). For the expectations in the second term, we invoke the weights from (1.17) and Cauchy-Schwarz to get
[TABLE]
Since , the first term on the right-hand side is bounded thanks to (3.1). Using (2.52), (3.14), (3.15) and the identity , the second expectation on the right is no larger than
[TABLE]
By (3.17–3.18), (3.15), the fact that , and bounding in terms of (noting that the lattice gradient is a bounded operator), this is bounded uniformly in . ∎
We now set
[TABLE]
and note:
Proposition 3.8
Under the assumptions of Theorem 3.1, and with for as in (3.1), there is a sequence and a measurable function such that for each ,
[TABLE]
and, for each ,
[TABLE]
Moreover, on a set of full -measure, is normalized so that , obeys the cocycle conditions
[TABLE]
and is continuous and weakly differentiable with
[TABLE]
for all and all .
The bounds of Lemma 3.7 will readily allow us to take weak limits as . A slightly subtle point, see Lemma 3.9 below, is to choose a version of the resulting limiting process which has continuous trajectories. Once this is achieved, the proof of Proposition 3.8 will quickly follow.
We start with a few observations. We are henceforth tacitly working under the assumptions of Proposition 3.8. Let be the Hölder conjugate of ; the fact that (and the fact that is a standard Borel space, hence separable) ensures that the dual space is separable. In light of the uniform bound (3.23), Cantor’s diagonal argument ensures the existence of a sequence and functions and such that for any with compact support in the first coordinate,
[TABLE]
and, for any and any ,
[TABLE]
Standard arguments give
[TABLE]
for every . A key point in what follows is:
Lemma 3.9
The process admits a version which has -a.s. continuous sample paths. Moreover, on a set of full -measure, this version obeys
[TABLE]
for all .
Proof.
Consider the auxiliary process defined as
[TABLE]
First note that, since vanishes, (3.14) and (3.15) yield that
[TABLE]
Hence
[TABLE]
for all . On account of (3.22) and with as defined above (3.32), we thus get, for any bounded interval and with denoting the Lebesgue measure on ,
[TABLE]
In particular, is a weak limit in of the sequence .
Now pick any with compact support in the first variable. We then claim the validity of
[TABLE]
Indeed, we first note the rewrite
[TABLE]
Abbreviating
[TABLE]
the convergence statement (3.33) along with Fubini and the invariance of under space-time shifts show
[TABLE]
where to get the second line we also noted that , by invariance of under time-shifts, Jensen’s inequality, boundedness of and the fact that has compact support in the -variable. A similar computation applies to the term involving on the right of (3.41). Indeed, setting
[TABLE]
we get
[TABLE]
using (3.32) instead. In light of (3.36) and (3.41), (3.43–3.45) yield (3.40).
The weak limit in (3.40) being unique (as implied by the Hahn-Banach theorem), (3.39) implies that, on a set of full -measure, agrees with the term in square brackets on the right-hand side of (3.40). It follows that defined as
[TABLE]
equals on a set of full -measure. But this also implies that we can substitute for in (3.45) which shows that obeys (3.35) -almost everywhere. As has -a.s. continuous sample paths, a routine use of Fubini’s Theorem shows that (3.35) extends to all on a set of full -measure. ∎
We are now ready to complete:
Proof of Proposition 3.8. Letting be as defined in (3.33) and writing for the continuous version of as constructed in the proof of Lemma 3.9, we set
[TABLE]
and proceed to check the desired properties. The convergence statements (3.28–3.29) follow directly from (3.32–3.33) while (3.30) is a consequence of (3.16). With the help of an analogue of (3.40) (formulated for ) and (3.30), the equality (3.35) translates into
[TABLE]
Hereby (3.31) readily follows (with the derivative even in Lebesgue sense). ∎
Proof of Theorem 3.1. Let be as constructed in Proposition 3.8 and set
[TABLE]
Then (3.2) follows from (3.33) while (3.3) from (3.32). The identity (3.4) is a consequence of (3.18) and the fact that weak convergence in contracts -norms. The integrability conditions in (3.5) follow readily from (3.28–3.29). Since for each , this implies also the last condition in (3.5). ∎
We finish by a lemma that will be useful in some definitions below:
Lemma 3.10
For each , there is a random variable with such that
[TABLE]
Proof. Pick . Using fact that in Lemma 3.9 then shows, for each ,
[TABLE]
where is a constant related to the -norm of for . Since the increments of are also stationary due to (3.30), the ergodic theorem implies
[TABLE]
As , cf. (3.47), the claim follows with the choice . ∎
4 Proof of invariance principle
The goal of this section is to give a proof of the main result, which involves showing that the corrector constructed in Section 3 is sublinear in a strong () sense. We proceed by first showing a corresponding statement on average (i.e., in -sense, with respect to the norms introduced in Section 2), see Proposition 4.1 below. This result is then boosted to a sublinearity result in -sense in Theorem 4.6, which is proved by obtaining a maximal inequality using a Moser iteration approach, see Proposition 4.7, whose proof is deferred to Section 5. Conditionally on Proposition 4.7, the proof of Theorem 1.2 is completed at the end of the present section.
We will occasionally invoke the Maximal Ergodic Theorem for commuting measure preserving transformations throughout the section. We refer to Krengel [26, Section 6.2] for further details.
4.1 Sublinearity on average
We begin with an a priori estimate on the -norm of the corrector which constitutes a version of “sublinearity on average.” This will serve as a starting point for the Moser iteration developed in the next section. Recall the definitions of and from (2.36), (2.37), with satisfying (2.31–2.33), and the norms from (2.8). The desired statement is as follows:
Proposition 4.1
Let be the corrector constructed in Theorem 3.1. Then
[TABLE]
Although we could in principle follow the proof of Proposition 3.3 in [3], we found a different argument. We begin with two lemmas, both of which are formulated for rectangles of the form
[TABLE]
where are numbers that obey , . Without further mention, we assume in the remainder of Section 4.1 that is the object constructed in Theorem 3.1, and we implicitly work under the assumptions of that theorem.
The starting point of the proof is the following observation:
Lemma 4.2
For any sequence as above,
[TABLE]
Proof. Let denote the quantity on the left-hand side. The cocycle property gives
[TABLE]
where
[TABLE]
We first claim
[TABLE]
For this we invoke (3.31) and some elementary integration to write
[TABLE]
Plugging this into (4.5), noting that is bounded (and thus in ) and while the boundedness of and (3.5) ensure , the Spatial Ergodic Theorem shows
[TABLE]
where . The stationarity of with respect to spatial shifts ensures that the expectation vanishes and so we get (4.6) as claimed.
Let now be such that (3.5) holds. Next we claim that, for each ,
[TABLE]
In light of (4.6) and the Dominated Convergence Theorem, for this it suffices to show
[TABLE]
Here one more use of (4.7) shows
[TABLE]
The quantity in the large parentheses is in thanks to (3.5) and so (4.10) follows from the Maximal Ergodic Theorem for space-time shifts.
In order to prove the desired result, fix for as in (3.5). For each (4.4) then gives
[TABLE]
Lemma 2.9 ensures
[TABLE]
for some . The norm on the right tends to zero as by (4.9). The Dominated Convergence Theorem then implies a.s. as desired. ∎
For the rest of the proof, we will work with the quantity
[TABLE]
where the integral converges absolutely thanks to Lemma 3.10 and our assumption of integrability of . We then have:
Lemma 4.3
For any as above,
[TABLE]
For the proof we will need the following fact:
Lemma 4.4
Suppose is such that (3.5) holds. For each there is a measurable with such that for all ,
[TABLE]
We note that in earlier constructions of the corrector (including the one in [3]) the property in Lemma 4.4 follows more or less directly. Although we also obtain as a limit of the quantities , this limit is only in the weak sense and we do not presently see a way to boost it to a strong convergence as required above.
An alternative approach would be to regard as an element of the -space of cocycle vector fields with inner product and show that it can be approximated by a potential field; i.e., one of the form . Even if the existence of these approximations could be checked, we would still not know how to proceed as we no longer have a direct way to convert weighted -norms into -norms. (Indeed, the energy conversion applies only to solutions of the inhomogenous heat equation.) Our proof of Lemma 4.4, which we defer to the Appendix, proceeds by a direct argument inspired (with some necessary corrections) by derivations in Biskup and Spohn [13].
Proof of Lemma 4.3. Fix as appearing above (3.5). The conclusion of Lemma 4.4 holds and, given , let be as in (4.16). Define
[TABLE]
where the integrals again converge absolutely by Lemma 3.10 and the assumed integrability conditions on . Abbreviating also
[TABLE]
which converges absolutely by the last clause of Lemma 2.9, it is now easy to check
[TABLE]
Since for , the same holds true for , and Lemma 2.9 gives us that . The Spatial Ergodic Theorem then shows that the second term on the right tends to zero as . The same also applies trivially to the last term, and so we just need to control the first term on the right.
Let be the -algebra generated by the conductances and enlarge the probability space to include independent random variables , independent of , with uniform on and uniform on for each . Writing to abbreviate the vector and denoting , we get
[TABLE]
where
[TABLE]
and where the last step follows by invoking the definition of along with the cocycle property. The Maximal Ergodic Theorem for space-time shifts gives for some and Lemma 2.9 then ensures that (4.20) converges, as , to zero -a.s. Thus, if we can show
[TABLE]
the claim will follow.
The advantage of working in this “continuum” representation is that it makes telescoping arguments more manageable. Indeed, by the cocycle property we can write
[TABLE]
Now note that while has -norm bounded by some independent of . Introducing
[TABLE]
and denoting , we thus have
[TABLE]
Lemma 2.9 and (3.5) ensure that for . By the Spatial Ergodic Theorem, the normalized second sum on the right converges to and so does the Cezaro average over . But (2.38), Jensen’s inequality along with the cocycle property and the triangle inequality for the -norm show
[TABLE]
for some depending only on , , and . Lemma 4.4 then gives as thus proving (4.22) as desired. ∎
As an immediate consequence we get:
Corollary 4.5
For any as above,
[TABLE]
Proof. This follows by combining (4.3) with (4.15). ∎
We are now ready to give:
Proof of Proposition 4.1. We adapt part of the argument from page 227 in Sidoravicius and Sznitman [36]. (The argument cannot be used directly as it relies on square integrability of the corrector as well as separate ergodicity.) Denote and, given , let be the enumeration of sets of the form with that have a non-empty intersection with . Denote . Then Lemma 2.2 and a routine (by now) use of Cauchy-Schwarz inequality show
[TABLE]
Now sum this over and apply Cauchy-Schwarz inequality one more time to get
[TABLE]
Corollary 4.5 and the fact that is at most order ensures
[TABLE]
Lemma 2.10 in turn gives
[TABLE]
Since solves (3.31) with bounded, (2.51) and (3.4) also show
[TABLE]
The claim now follows from (4.29) by taking followed by . ∎
4.2 Sublinearity everywhere and proof of main result
Recall the definition of the corrector from the previous section. Our next goal is to boost the -sublinearity to an -version. Define the diffusive space-time cylinder
[TABLE]
We now claim that the corrector is sublinear on diffusive scale of space and time:
Theorem 4.6
Suppose Assumption 1.1 holds and assume, in addition, (1.12). Then
[TABLE]
Recalling the notation for the normalized norms from (2.20), the key point of the proof of this claim is the following proposition valid for general solutions to the heat equation. We state it in a form which will be sufficient to deduce Theorem 1.2. A more general version of the following result can be found in Corollary 5.9.
Proposition 4.7** **( to bootstrap)
Suppose Assumption 1.1 as well as the moment bound (1.12) hold. There exist functions satisfying (2.31)-(2.34) and constants and (all depending on and the choice of ) such that, if is a (measurable) weak solution to
[TABLE]
for some bounded satisfying for all and all , then for all ,
[TABLE]
where and is defined in (2.37) and
[TABLE]
satisfies
[TABLE]
Deferring the proof of Proposition 4.7 to Section 5, let us show how it implies our main result. We begin with:
Proof of Theorem 4.6. Since the corrector obeys the equation (3.31), this is immediate from Lemma 2.10, Proposition 4.1, Proposition 4.7 and the boundedness of . ∎
Next we note the standard fact:
Lemma 4.8
Suppose Assumption 1.1 and, given a sample of , let be a sample of the random walk. The process on is then Markov with a unique stationary measure . Moreover, the process is ergodic in the sense that, for any function , we have
[TABLE]
for -a.e. and -a.e. sample of .
Proof. The stationarity and reversibility of is verified easily by a standard generator calculation and the limit in (4.39) exists by the Ergodic Theorem. The only item where caution is needed is ergodicity which ensures that the limit value in (4.39) is constant -a.s., and thus equal to . This boils down to showing that any event which is invariant under the Markov shift is a zero-one event.
We build on an argument in Andres [1, Proposition 2.1]. Let be as above. For each , we then have -a.s. and so
[TABLE]
Taking expectation and dropping all but one term from the sum yields
[TABLE]
Since implies , choosing gives for all . Applying under expectation and swapping the roles of and then shows -a.s. for each , i.e., is time-shift invariant -a.s.
Next pick a neighbor of the origin and apply (4.41) to . Injecting the restriction into the expectation, we thus get
[TABLE]
But time-shift invariance of shows -a.s. and, on , we have
[TABLE]
It follows that . Taking and using that -a.s. (by Assumption 1.1(3)) we now again get -a.s. Hence is invariant with respect to all space-time shifts a.s.; ergodicity of then implies that as desired. ∎
We are now ready to give the:
Proof of Theorem 1.2. Let be the harmonic coordinate constructed in Theorem 3.1 and let be a sample of the random walk. Let . The equation (3.2) then implies that is a martingale. Letting , the quadratic variation process of is given by
[TABLE]
where
[TABLE]
In light of (3.4) and Lemma 4.8, the conditions of the Lindeberg-Feller Martingale Functional Central Limit Theorem are satisfied. Hence scales as to a Brownian motion with variance as in (1.14).
In order to complete the proof of convergence of to Brownian motion, it suffices to show that, for -a.e. realization of the environment,
[TABLE]
This is shown by noting that, for any and any ,
[TABLE]
For any fixed and , Theorem 4.6 ensures that the indicator is zero for sufficiently large -a.s. On the other hand, in the limit as followed by , the probability on the right tends to zero by the above convergence of to Brownian motion. This implies (4.46).
In order to show that the limiting covariance is non-degenerate suppose that for some . Then (1.14) and the cocycle conditions imply for all and and thus by the differential equation, see (3.2), the function is constant for each . However, Assumption 1.1(3) ensures that is positive eventually and so this means that -a.s. If , this violates the sublinearity of from Theorem 4.6 and so we must have after all. ∎
5 Maximal inequality via Moser iteration
The aim of this section is give a proof of the maximal inequality for the corrector stated in Proposition 4.7. The proof is based on Moser-iteration technique whose main input is the “one-step estimate” stated in Proposition 5.2 below. In this section we provide the proof of Proposition 4.7 conditional on the one-step estimate; this estimate is then proved in Section 6.
5.1 Cut-offs and the one-step estimate
Let us start with the statement of the one-step estimate. This will require working under spatial and temporal mollifiers (or smooth cut-offs), denoted by and respectively, that will be assumed to obey the following conditions:
Definition 5.1
Given finite sets , and parameters , and , we say that the (cut-off) functions are -adapted with parameters if, for , these functions take the form
[TABLE]
with and satisfying
[TABLE]
and
[TABLE]
The spatial mollifier should be thought of as a “smooth” version of the indicator of . Note that the conditions in (5.2) imply . An explicit construction of functions and is provided below in Lemma 5.5.
In order to state the one-step estimate, we need some more notation. Given (and recalling that edges are unoriented), specify one of its endpoints as its initial vertex and the other as (the choice will not matter in the sequel). Then abbreviate
[TABLE]
In what follows, we will write to denote the -norm with respect to the counting measure, for any (or, if functions on edges are considered, ) and any . We denote by the set of Lebesgue-a.e. bounded functions supported in . Recall also the notation and for the “Sobolev exponents” from (2.23), and the normalized norms from (2.20). We assume throughout that satisfies (2.31–2.33) and we are interested in weak solutions to the inhomogenous equation
[TABLE]
We are only interested in the specific case , see (3.31) and (3.11), for which a (weak) solution to (5.5) has been constructed in Proposition 3.8, but the following results only require that be finite. The “one-step estimate” is now the content of:
Proposition 5.2** **(One-step Moser iteration)
Let and suppose Assumption 1.1 holds. For all , all and all and defined by
[TABLE]
there is such that the following holds for any weak solution of inhomogenous heat equation (5.5): For all finite , all , all , all , all and all -adapted functions with parameters we have
[TABLE]
where ,
[TABLE]
(in particular, ) and the prefactor takes the explicit form
[TABLE]
with related to as in (2.11), and
[TABLE]
Here is the function on the right of (5.5).
The proof also exhibits the following estimate, which we record for later purposes:
Corollary 5.3
For the setting, notations and under the conditions of Proposition 5.2,
[TABLE]
Remark 5.4
The allowed range of implies that and, in particular, that . It follows that defined in (5.6) satisfies . As a consequence, can always be found so that (as will be desired).
The prefactor collects all dependencies on the cut-off functions as well as the norm , which we will control via Lemma 2.10. Our choices of parameters will eventually ensure that the term in square brackets on the right-hand side of (5.9) is of order unity, and so is basically order-. Both and will change through iterations, but in such a way that the overall product of prefactors of the type arising from subsequent iterations remains bounded.
Proposition 5.2 is where the principal novel ingredients of the present work enter the proof of Moser iteration; the rest is more or less just an adaptation of the arguments in [3]. Deferring the proof of Proposition 5.2 to Section 6, we now proceed to discuss these adaptations and give the proof of Proposition 4.7.
5.2 Iteration
The fact that in Proposition 5.2 can be rather arbitrary, and can be set to a quantity in excess of one (see Remark 5.4), offers the possibility to apply the inequality in (5.7) iteratively to bound high--norms of the solution to the Poisson equation by low--norms thereof. As we also need to keep the quantity in (5.9) bounded, this means that the underlying domains, and thus also the mollifiers, will have to vary throughout the iteration. The discrete nature of the underlying lattice only allows us to run the iteration a limited number of times, albeit increasing with the size of the initial domain. Another iterative argument will thus have to be invoked afterwards to convert the high--norm to the maximum over the space-time box . This will then readily yield Proposition 4.7.
Let us begin by introducing the needed notation. We will consider underlying domains that depend on two adjustable real-valued parameters and which satisfy
[TABLE]
These parameters are introduced only for the sake of the second iteration and they will remain unchanged throughout the first iteration. Given , consider a decreasing sequence of boxes such that
[TABLE]
We then have
[TABLE]
Next we introduce the cut-off functions (depending implicitly on the choice of and )
[TABLE]
as follows: For all , the function satisfies
[TABLE]
(This can be achieved by interpolating linearly between and .) Denoting
[TABLE]
the function is defined as
[TABLE]
where
[TABLE]
As seen from the rewrite in (5.18), equals on and then drops smoothly to [math] over the interval . Observe in addition that are such that and that is decreasing with and . For later purposes we also record that for all ,
[TABLE]
Note that , , all depend implicitly on the choice of and satisfying (5.12).
To see that the above choices are reasonable, we note:
Lemma 5.5
For all satisfying (5.12), all and all , the functions , defined by (5.15), (5.16) and (5.18) are -adapted with parameters , where
[TABLE]
Proof.
The conditions (5.2) hold on account of (5.16) (in particular, note that on ). As for (5.3), first note that . It thus remains to show that
[TABLE]
For we have and so these bounds hold trivially. In the range , we have and so the first bound is immediate, while the second follows from
[TABLE]
It remains to deal with the case . For in this interval, we observe
[TABLE]
and so . The first bound in (5.23) then follows immediately since while the second is obtained by invoking (5.24) one more time. ∎
Lastly, we recall the definition (2.37) of , , obtained from , cf. (2.31–2.33), by a (diffusive) rescaling. Let
[TABLE]
A recursive application of Proposition 5.2 then yields:
Proposition 5.6** **(Moser iteration)
Suppose Assumption 1.1 and (2.34) hold. For all , all , all , all and as defined in (5.6), there is such that, for all , all integers , , where
[TABLE]
and all weak solutions of (5.5) with on the right-hand side satisfying , we have
[TABLE]
where , , , with given by (5.26) and as in Proposition 5.2,
[TABLE]
and where is defined as
[TABLE]
Proof.
Let , be integers. In view of (2.34), satisfies conditions (2.31–2.33), hence we may apply Proposition 5.2 for the choices , , , so that by (5.13), the mollifiers and , which are -adapted with parameters by Lemma 5.5, and , which satisfies by (5.27) and since . Noting that as defined in (5.30) corresponds precisely to in (5.8), the one-step estimate (5.7) reads
[TABLE]
where
[TABLE]
with
[TABLE]
and . As we will now demonstrate, is bounded uniformly in by a quantity whose growth in can be controlled.
Clearly, , while on account of (5.29) and (5.14). Similarly, is bounded uniformly in and . Regarding the term in the large brackets in (5.32), by the assumption on and (5.16), and since , we obtain, recalling also (5.13) and (5.26),
[TABLE]
Finally, (5.12) and (5.21) show and so
[TABLE]
whilst . Recalling that , cf. Lemma 5.5 and (5.19), and noting that there is a numerical constant such that holds for all and all , we thus obtain
[TABLE]
where collects the various numerical prefactors in the above estimates.
Substituting (5.36) into (5.31) and using that while , the claim (5.28) readily follows by induction over (starting at ), noting also for the very last step that , which can be absorbed by adapting the constant , and extending the arising sums over to start at (rather than ; the term in square brackets on the right-hand side of (5.28) is greater or equal to ). ∎
Following up on Corollary 5.3, one also has the following bound:
Corollary 5.7
Under the setting and assumptions of Proposition 5.6, for all , , all and all weak solutions of (5.5), with on the right satisfying ,
[TABLE]
Proof.
We use the same setting as in the proof of Proposition 5.6 but invoke (5.11) instead of (5.7), and then apply (5.36). ∎
5.3 Proof of maximal inequality
Our next task is to “upgrade” the bound (5.28) to an estimate on the maximum of the solution over the space-time cylinder . First we state (in Lemma 5.8) a rather immediate consequence of Proposition 5.6 which bounds the maximum of in the space-time cylinder in terms of the -norm (for as above) of cut off outside of a slightly larger cylinder with spatial base . Keeping all dependencies on explicit is crucial as these will be subsequently varied to replace the -norm by the -norm.
Lemma 5.8
Suppose Assumption 1.1 and (2.34) hold. For all there is such that for all , all , all and as defined in (5.6), and for all integers , all and all weak solutions of (5.5) with on the right-hand side satisfying we have
[TABLE]
where , , is defined in (5.15), is as in (5.29), is the constant from Proposition 5.6 and \bar{\gamma}\,^{\prime}(\rho,n):=\bar{\gamma}\,\big{(}n,(\lceil\log\log n/\log\rho\rceil)\vee(N+1)\big{)} for as defined in (5.30) and with given by (5.27).
Proof.
Let , with given by (5.27). For any , the function is equal to on , cf. (5.16) and (5.20). Using that by (5.12) and (2.31), and applying Corollary 5.7 and Proposition 5.6 (the latter for index ), we thus get
[TABLE]
Choosing ensures that uniformly in . The claim follows upon defining by noting that and for all . ∎
The replacement of the -norm by the -norm is the subject of the following lemma, which is more or less drawn from [3]. The proof of Proposition 4.7 will then quickly follow, using also Lemma 2.10 to bound .
Lemma 5.9
For the setting of Lemma 5.8, there are , , and ,
[TABLE]
*where abbreviates the indicator of , and satisfies (and also implicitly depends on the same set of parameters as ). *
Proof.
Define for , which is increasing in with and . Abbreviate
[TABLE]
Our goal is to estimate by the right-hand side of (5.40). We will apply (5.38) repeatedly with and . We will write for the mollifier with these choices of and , and let denote the quantity defined below (5.38) for this pair, recalling the dependence of this quantity on and via the cut-off function appearing in (5.30). (Since will remain fixed, we will suppress it whenever possible.) Using (2.22) and (2.29) with , where and , we then have for each ,
[TABLE]
for some , where the second line follows from and the fact that is bounded uniformly in and . Inserting (5.42) into (5.38) while noting that yields, for all ,
[TABLE]
for some depending on the parameters , , and but not on or . Iterating (5.43), we obtain, for all and some constant depending on the full set of parameters ,
[TABLE]
Now, since for all , see (5.30) and below (5.38), and is bounded uniformly in (e.g., by the maximum of over , which is finite by our assumptions on ) the last term on the right of (5.44) tends to 1 as . The claim (5.40) follows from (5.44) by letting (the sums in the exponents all converge) and letting . ∎
We are now ready to prove the desired maximal inequality:
Proof of Proposition 4.7.
The claim will follow by applying Lemma 5.9 for suitable choice of the parameters. Fix and as appearing in (1.12) and any . Let and let and be defined by (2.11) in terms of and . Note in particular that and , as follows plainly from (2.11). Moreover, since ,
[TABLE]
as required by Lemmas 5.8–5.9. Having selected and , the parameters and are defined by (5.6) (and are both larger than , as noted in Remark 5.4), and we choose . The claim (4.36) is then an immediate consequence of (5.40). The (crucial!) fact that can be arranged, cf. (4.38), follows from Lemma 2.10 by choosing with any (note that by our choice of ) and as in Lemma 2.8, with . ∎
6 Proof of one-step estimate
Ouf final task is the proof of the one-step estimate in Proposition 5.2. The proof hinges on three ingredients. The first one is the weighted Sobolev inequality proved in Lemma 2.3 which bounds a suitable norm of by the weighted Dirichlet form . The second ingredient is a comparison of the weighted Dirichlet form with its “bare” counterpart . Lemma 2.11 provides such comparison when the argument is , the solution to the Poisson equation (2.46), inside a box; unfortunately, since we need to consider powers of the solution and invoke different (smoother) spatial and temporal truncations, we will have to prove the needed bound again. This is the content of (rather long) Lemma 6.1. The final ingredient is a bound on the resulting “bare” Dirichlet energy in terms of a suitable norm of the solution. This is done in the second subsection; the proof of Proposition 4.7 is presented right afterwards.
6.1 Dirichlet energy comparison
We begin by a comparison of the Dirichlet energies for powers of the solution of the inhomogeneous Poisson equation (2.46) mollified by spatial and temporal cut-off functions. While necessarily more involved, the mechanism behind the proofs is similar to that of Lemma 2.11.
Let us introduce some more Dirichlet forms which will recurrently show up in what follows. Recall and from (2.9) and (2.10), with weights as defined in (1.17). For and recalling our notation and for (arbitrarily ordered) endpoints of edge , define
[TABLE]
Using our earlier notation for the gradient of , for all , the discrete product rule reads
[TABLE]
Given with finite support and any , let
[TABLE]
and, similarly to (2.10), for any with compact (space-time) support, define
[TABLE]
Recall the definition of the norms in (2.8). We then have:
Lemma 6.1** **(Conversion of Dirichlet forms)
Suppose Assumption 1.1 and (2.33) hold and let be the constant from (2.33). There is such that the following holds: Let be a (weak) solution the equation (5.5) with bounded uniformly on . Fix finite and suppose obeys and vanishes on the inner boundary of (i.e. the set ). Let , with the value at denoted by , be a -function with compact support. Then for all ,
[TABLE]
where and where denotes the derivative of .
Remark 6.2
The precise form of (6.5) is tailored to our future purposes, in the sense that the Dirichlet form naturally comes out of a later energy estimate, see Lemma 6.4 below. It is important that these two quantities be matched.
In the proof we will need:
Lemma 6.3
For all and all , with , we have
[TABLE]
Proof. Suppose first that and have the same sign. In this case, as well as and so (6.6) can be recast as
[TABLE]
This is proved by setting (assuming ) and noting that for and (in fact the inequality even holds with instead of on the right-hand side).
Suppose now that and have opposite signs. By symmetry, it is enough to consider the case , , in which, using that ,
[TABLE]
The claim follows. ∎
Proof of Lemma 6.1. We build on the argument from the proof of Lemma 2.11 which we hereby invite the reader to inspect first. To start, using the discrete product rule (6.2), the definition of the weights in (1.17) along with the inequality and the bound , and minding that is a function of alone, we obtain for all that
[TABLE]
where is the quantity from (6.3) with in place of and where abbreviates the -norm on . Note that (2.33) implies . In view of (2.10) and (6.4), multiplying by on both sides of (6.9) and integrating over , it thus suffices to show a bound of the form (6.5) for in place of .
Using that , we write, for all ,
[TABLE]
Multiplying the first integral on the right by and integrating over , we get
[TABLE]
which in light of the definition of in (2.32) and (2.33) is at most . Hence, this term contributes directly to the first term on the right-hand side of (6.5). Concerning the second integral on the right of (6.10), the discrete product rule (6.2) implies
[TABLE]
In conjunction with the inequality , this yields
[TABLE]
where
[TABLE]
We will now show separately that, upon multiplication with and integration over , each of the three terms , , in (6.13) is bounded by the right-hand side of (6.5).
Using that , we immediately get for all . Since , this shows
[TABLE]
Some more care is needed to bound . Exchanging the order of integration and using (2.33) along with again, we obtain
[TABLE]
It remains to derive a suitable bound on which is considerably more involved. First, the assumption and elementary symmetrization arguments yield
[TABLE]
with the summation effectively only over a finite set since has finite support. We now use that solves (5.5) along with the fact that to get
[TABLE]
Substituting (6.18) into (6.17), using the Cauchy-Schwarz inequality and the standard inequality , we thus get
[TABLE]
where
[TABLE]
The following consequence of our basic assumptions on and will be useful for bounding all three quantities in (LABEL:E:Dirich18): For any measurable , the definition of in (2.32) and condition (2.33) imply
[TABLE]
Indeed, applying this with (which is indeed non-negative) yields
[TABLE]
which in light of is bounded by a corresponding term on the right-hand side of (6.5). For the term we use to bound . Then (6.21) shows
[TABLE]
In order to bound , we first use the Cauchy-Schwarz inequality, , and Lemma 6.3 to get
[TABLE]
Plugging this in (LABEL:E:Dirich18) and invoking (6.21) then yields
[TABLE]
It follows from (6.19), (6.22), (6.23) and (6.25) that admits the desired bound. The proof of (6.5) is complete. ∎
6.2 Energy estimate
Our next step is the so-called energy estimate which bounds the Dirichlet energy of powers of solution to the inhomogeneous Poisson equation (under truncation with respect to space and time) by a suitable norm thereof. The same calculation also produces a pointwise estimate (in time) of the -norm of the (power of) solution weighted by . The precise statement is as follows:
Lemma 6.4** **(Energy estimate)
Suppose Assumption 1.1 and (2.33) hold. There is a numerical constant such that for all and for any solution of (5.5), we have
[TABLE]
Proof.
Repeating the argument leading to (5.18) of [3] and using that yields an absolute constant such that the bound
[TABLE]
holds for all and all . Next we observe that, for all ,
[TABLE]
Multiplying both sides of (6.27) by , integrating over from [math] to infinity, invoking (6.28) with and foregoing the term , we find that is bounded by the right-hand side of (6.26). Repeating the argument, but this time neglecting the term in (6.27), and integrating from to infinity, we infer that admits the same bound, for all . Hereby (6.26) follows. ∎
6.3 Proof of one-step estimate
The proof of Proposition 5.2, which we are about to give, combines the Sobolev inequality of Corollary 2.5 with Lemmas 6.1 and 6.4. The conversion lemma (Lemma 6.1) will play a pivotal role in recovering the Dirichlet form that the energy estimate gives us information about; namely, the one naturally associated to the Poisson equation (5.5), cf. Remark 6.2(1).
Proof of Proposition 5.2.
Abbreviate and note that , as will be desired for applications of the previous two lemmas. In view of (5.6) and the interpolation inequality (2.29), we have
[TABLE]
We will now estimate each of the arising norms individually.
We begin with the second norm on the right of (6.29) as its control is easier. The energy estimate (6.26) from Lemma 6.4 along with readily yield
[TABLE]
where is as defined in (5.10). Since the weights were assumed to be -adapted with parameters , (5.3) shows that, for all ,
[TABLE]
With the help of Jensen’s inequality we in turn get that, for ,
[TABLE]
where in the last step we used that thanks to and (5.3). Substituting (6.31) and (6.32) into (6.30), we find
[TABLE]
where we also invoked the definition of from (5.8).
We now turn to the first norm in the second line of (6.29). Using the Sobolev inequality from Corollary 2.5, whose conditions are met for the allowed range of and , cf. above (5.6), and subsequently applying the energy-conversion Lemma 6.1 yields
[TABLE]
The “bare” Dirichlet energy on the right is now bounded using Lemma 6.4 exactly as above with the result
[TABLE]
The remaining terms are estimated directly with the help of (6.32) and the bounds on the mollifiers in (5.3). This yields
[TABLE]
In order to covert the last norm to the desired form, we observe that, since on by assumption, cf. (5.2), and minding that and , we have
[TABLE]
where we also recalled that . Substituting this into (6.33) and (6.36), and then these back into (6.29), the claim follows by noting that . ∎
We also need to finish:
Proof of Corollary 5.3.
This is due to (6.33) (recalling that ) and (6.37). ∎
Appendix
This short section collects various calculations that were relegated here from the main text of the paper. Specifically, we give proofs of Lemma 1.4 and Lemma 4.4.
A.1 Moment comparisons
We begin by a comparison of the ranges of parameters for negative moments of with the positive moments of :
Proof of Lemma 1.4. Let be such that . (Otherwise there is nothing to prove.) The assumption of separate ergodicity and the Pointwise Ergodic Theorem then imply
[TABLE]
Next fix large. Renewal considerations show
[TABLE]
It follows that
[TABLE]
Next we note that Höler’s inequality shows, for any ,
[TABLE]
The definition of ensures that the first term on the right is at most . Raising both sides of the resulting bound to power and setting , which is equivalent to and , then gives
[TABLE]
Plugging in (A.3) and bounding by the -power of shows
[TABLE]
Taking and invoking the Monotone Convergence Theorem, the claim follows. ∎
A.2 Approximating corrector by gradients
Our next task is to complete the proof of Lemma 4.4 showing that the corrector lies in the closed subspace generated by gradients of -functions. In order to avoid dealing with complicated summation formulas, we will cast the proof in functional-analytic notation and language.
Fix such that the integrability conditions in (3.5) apply. For each , consider the linear operator defined by
[TABLE]
with the -th unit vector in . We also set
[TABLE]
for the corresponding time-shift. The operators commute and they are all contractions (by Assumption 1.1). For any and , the operator is well defined and can be expressed as . Let be defined by the -limit
[TABLE]
which exists by the Pointwise Ergodic Theorem, see [26, p.9, Thm. 2.3]; the fact that the convergence is in follows in standard fashion by uniform integrability. Rewriting with , simple resummation shows
[TABLE]
From (A.9) and , we thus have
[TABLE]
for each .
Next, consider the (vector) valued functions defined by
[TABLE]
and
[TABLE]
The cocycle condition then reads
[TABLE]
By the cocycle property and (A.9) we also have
[TABLE]
The cocycle property then also gives, for each and each ,
[TABLE]
Upon division by , the last two terms on the right tend to zero in and so is invariant under space-time shifts. A completely analogous argument applies to ; in light of the joint ergodicity of with respect to the space-time shifts we thus get
[TABLE]
We are now ready to give:
Proof of Lemma 4.4. Define by
[TABLE]
Pick and use (A.14) along with the fact that commute, minding also the rewrite , to get
[TABLE]
where the last line follows by noting that the expression on the line before is a telescopic sum. Since for each , the norm of second term on the last line is at most that of . But this term converges to by (A.11) which vanishes thanks to (A.17). This implies that, for all ,
[TABLE]
which is now easily checked to give the desired claim. ∎
Remark A.1
Under the assumption of separate ergodicity — i.e., triviality of on events such that, for at least one , we have — we have for all . It then suffices to take ; cf Biskup and Spohn [13]. However, unlike erroneously concluded in [13], this does not suffice for that are only jointly ergodic where one has to use (A.18) instead.
Acknowledgments
This research has been partially supported by NSF grant DMS-1407558 and GAČR project P201/16-15238S. We wish to thank Jean-Dominique Deuschel for useful suggestions at various stages of this work and an anonymous referee for his careful reading of the manuscript. P-F.R. wishes to thank Center for Theoretical Study in Prague for hospitality that made this project take off the ground.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] S. Andres, Invariance principle for the random conductance model with dynamic bounded conductances , Ann. Inst. Henri Poincaré Probab. Stat. 50 (2014), no. 2, 352–374.
- 2[2] S. Andres, M.T. Barlow, J.-D. Deuschel and B.M. Hambly, Invariance principle for the random conductance model , Probab. Theory Rel. Fields 156 (2013), no. 3-4, 535-580.
- 3[3] S. Andres, A. Chiarini, J.-D. Deuschel, M. Slowik. Quenched invariance principle for random walks with time-dependent ergodic degenerate weights. ar Xiv:1602.01760
- 4[4] S. Andres, J.-D. Deuschel, M. Slowik, Invariance principle for the random conductance model in a degenerate ergodic environment , Ann. Probab., 43 (2015), no. 4, 1866–1891.
- 5[5] L. Avena, Symmetric exclusion as a model of non-elliptic dynamical random conductances , Electron. Commun. Probab. 17 (2012), no. 44, 1–8.
- 6[6] A. Bandyopadhyay and O. Zeitouni, Random walk in dynamic Markovian random environment , ALEA 1 (2006) 205–224.
- 7[7] M.T. Barlow, Random walks on supercritical percolation clusters , Ann. Probab. 32 (2004), no. 4, 3024–3084.
- 8[8] M.T. Barlow and J.-D. Deuschel, Invariance principle for the random conductance model with unbounded conductances Ann. Probab. 38 (2012), no. 1, 234–276.
