Dense blowup for parabolic SPDEs
Le Chen, Jingyu Huang, D. Khoshnevisan, Kunwoo Kim

TL;DR
This paper constructs examples of three-dimensional parabolic SPDEs with solutions that, despite existing and being unique, exhibit unbounded oscillations everywhere, revealing complex irregular behavior in high dimensions.
Contribution
It introduces the first known examples of 3D parabolic SPDE solutions with unbounded oscillations and analyzes their moment Lyapunov exponents growth, demonstrating super intermittency.
Findings
Solutions exist and are unique but have unbounded oscillations.
Moment Lyapunov exponents grow at least sub exponentially.
Super intermittency phenomena are established in 3D SPDEs.
Abstract
The main result of this paper is that there are examples of stochastic partial differential equations [hereforth, SPDEs] of the type such that the solution exists and is unique as a random field in the sense of Dalang and Walsh, yet the solution has unbounded oscillations in every open neighborhood of every space-time point. We are not aware of the existence of such a construction in spatial dimensions below . En route, it will be proved that there exist a large family of parabolic SPDEs whose moment Lyapunov exponents grow at least sub exponentially in its order parameter in the sense that there exist such that \[ \underline{\gamma}(k) := \liminf_{t\to\infty}t^{-1}\inf_{x\in\mathbb{R}^3} \log\mathbb{E}\left(|u(t\,,x)|^k\right) \ge A_1\exp(A_1 k^\beta)…
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
TopicsStochastic processes and financial applications · Stochastic processes and statistical mechanics · Advanced Mathematical Modeling in Engineering
Dense blowup for parabolic SPDEs††thanks:
Research supported in part by the NSF grants DMS-1307470 and DMS-1608575 [D.K.], and DMS-1440140 [J.H., D.K., and K.K.] while three of the authors were in residence at the Mathematical Sciences Research Institute at UC Berkeley in Fall of 2015.
Le Chen
Univ. Kansas
Jingyu Huang
Univ. Utah
D. Khoshnevisan
Univ. Utah
Kunwoo Kim
POSTECH
(February 26, 2017)
Abstract
The main result of this paper is that there are examples of stochastic partial differential equations [hereforth, SPDEs] of the type
[TABLE]
such that the solution exists and is unique as a random field in the sense of Dalang [6] and Walsh [30], yet the solution has unbounded oscillations in every open neighborhood of every space-time point. We are not aware of the existence of such a construction in spatial dimensions below .
En route, it will be proved that there exist a large family of parabolic SPDEs whose moment Lyapunov exponents grow at least sub exponentially in its order parameter in the sense that there exist such that
[TABLE]
This sort of “super intermittency” is combined with a local linearization of the solution, and with techniques from Gaussian analysis in order to establish the unbounded oscillations of the sample functions of the solution to our SPDE.
Keywords. Stochastic partial differential equations, blowup, intermittency.
AMS 2010 subject classification. Primary 35R60, 60H15; Secondary 60G15.
1 Introduction
Throughout, let us choose and fix a non random, globally Lipschitz-continuous function , and consider the stochastic heat equation,
[TABLE]
subject to initial value . The forcing term is a white noise with homogeneous correlations in its spatial variable; that is, is a centered, generalized Gaussian random field with
[TABLE]
where the spatial correlation function is a non random, non-negative, tempered, and positive semi-definite function. In principle, such equations can be — and have been — studied on for any integer . We will soon explain why we study them for here.
Let denote the Fourier transform of any distribution on , normalized so that
[TABLE]
The starting point of this article is the following existence and uniqueness theorem of Dalang [6]. Recall that almost everywhere because is positive semi-definite.
Theorem 1** (Dalang [6]).**
If
[TABLE]
then (1.1) has a random field solution . Moreover, is unique subject to the condition that
[TABLE]
According to a general form of Doob’s separability theorem [19, Theorem 2.2.1, Chapter 5], we may — and will — tacitly assume without loss of generality that the 4-parameter process is separable.
Dalang [6] has observed that Condition (1.2) is also necessary in the case that is identically a constant.
Recall that the oscillation function of a function is defined as
[TABLE]
where
[TABLE]
The main results of this paper are the following two theorems. In one form or another, the next two theorems show the existence of models of (1.1) that can have unbounded oscillations everywhere. This holds despite the fact that is a finite random variable at all non random space-time points .
Theorem 2**.**
Suppose in addition that and is bounded. Then, there exist correlation functions that satisfy (1.2) and
[TABLE]
This sort of extremely bad behavior of SPDEs has been observed earlier only for simpler, constant-coefficient SPDEs [8, 9, 12] and/or exactly-solvable ones [25, Theorem 1.2] that are forced by “very wild,” non-Gaussian noise terms. We believe that the methods of the present paper are novel, in addition to being general enough to include a variety of nonlinear SPDEs that are driven by Gaussian white-noise forcing terms. For a non-trivial variation of Theorem 2, see Theorem 3 below.
Before we describe that variation, we first would like to explain why we consider equations on only when : Spatial dimension three is the smallest dimension in which we know how to establish the blowup results of Theorem 2 and the next theorem.
Theorem 3**.**
If , then there exist correlation functions that satisfy (1.2) and
[TABLE]
Theorems 1, 2, and 3 together imply that there are models of that satisfy (1.2) such that, for every fixed, the random function has discontinuities of the second kind. These theorems, particularly Theorem 3, fall short of establishing the following conjectures.
Conjecture 1**.**
Under the hypotheses of Theorem 2, there exist correlation functions that satisfy (1.2) and
[TABLE]
Conjecture 2**.**
Suppose for all . Then, there exist correlation functions that satisfy (1.2) and (1.4) holds.
The methods of this paper are efficient enough to prove Conjecture 1 provided that the answer to the following is “yes”:
Open Problem**.**
Under the hypotheses of Theorem 2. Is it true that
[TABLE]
The only strict positivity type of theorem for SPDEs that we are aware of is the celebrated result of Mueller [24]; see also [23, pp. 134–135]. But that result, and its proof, rely crucially on the a priori Hölder continuity of the solution. This is a luxury that we do not have in the present setting, as is corroborated by Theorems 2 and 3. The best-known result, along these lines, is the following consequence of Corollary 1.2 of Chen and Huang [2].
Theorem 4** (Chen and Huang [2, Corollary 1.2]).**
If, additionally, , then
[TABLE]
The remainder of this paper is devoted to proving Theorem 2. At the end of the paper, we have also included a paragraph which outlines how one can prove Theorem 3 from Theorem 2. In anticipation of those arguments let us conclude the Introduction by introducing more notation that will be used throughout the paper.
Throughout, let denote the heat kernel in ; that is,
[TABLE]
In particular, does not refer to the time derivative of the heat kernel; rather the heat kernel itself.
We will use the following notation for shorthand. For any two functions , where is a topological space:
- •
as means ;
- •
for all means that either on or is independent of ;
- •
[equiv. ] for all means that there exists a finite constant such that for all ;
- •
for all means that for all .
Finally, let us recall that by a “solution” to (1.1) we mean a “mild solution.” That is: (i) is a predictable random field — with respect to the Brownian filtration generated by the cylindrical Brownian motion defined by , for all and measurable such that ; and (ii) solves the stochastic integral equation,
[TABLE]
where the stochastic integral is understood in the sense of Dalang [6] and Walsh [30]. Finally, it might help to recall also that
[TABLE]
for all and measurable such that for .
2 Some classical function theory
Recall that a function is said to be a correlation function if is locally integrable, with a nonnegative Fourier transform . The main goal of this section is to establish the following quantitative variation on a certain form of Wiener’s tauberian theorem. The following result will be used to show that there are many “bad” correlation functions on .
Throughout, define to be the centered ball of radius about the origin; that is,
[TABLE]
Theorem 5**.**
For every there are correlation functions such that:
* on ;* 2. 2.
* is uniformly continuous on for every ;* 3. 3.
There exists a nonincreasing function such that
[TABLE] 4. 4.
* uniformly for all ; and* 5. 5.
* uniformly for all .* 6. 6.
* satisfies Dalang Condition (1.2).*
We will fix the notation, introduced in Theorem 5, for both and from now on.
Interestingly enough, we are only aware of one proof. Though most of that proof can be translated into the language of classical function theory — specifically, the theory of Bernstein functions, for example, as described in Schilling, Song, and Vondraček [28] — our proof is decidedly probabilistic at a key point. The reason is that, thus far, the unimodality result (2.6) below only has a probabilistic derivation, as it depends crucially on the strong Markov property; see Khoshnevisan and Xiao [21, Lemma 4.1] for details.
From now on, is held fixed. We follow an idea of Khoshnevisan and Foondun [12], and first define an absolutely-continuous Borel measure on whose Radon–Nikodym density at blows up a little bit more slowly than as . Specifically, let
[TABLE]
Because
[TABLE]
the structure theory of Lévy processes — see Sato [27, Chapter 4] — tells us that is the Lévy measure of a subordinator such that and
[TABLE]
where
[TABLE]
The following lemma describes the asymptotic behavior of near infinity.
Lemma 2.1**.**
* as .*
Proof.
Thanks to scaling and a simple application of the dominated convergence theorem,
[TABLE]
as .111Indeed, for all and . Now write , plug this into the preceding integral and apply Tonelli’s theorem in order to deduce the lemma. ∎
Next let denote the 1-potential measure of the subordinator ; that is, for all Borel sets ,
[TABLE]
Evidently, is a Radon probability measure on . We refer to this property of many times in the sequel, and will sometimes even do so tacitly.
One can write (2.3) equivalently as follows: for all bounded Borel functions , where denotes an independent random variable with an exponential, mean-one distribution.
The following estimates the -measure of a small interval about the origin.
Lemma 2.2**.**
* for all .*
Proof.
The Laplace transform of can be computed easily as follows, thanks to several applications of the Fubini–Tonelli theorem: For all ,
[TABLE]
Therefore, Lemma 2.1 ensures that
[TABLE]
Now we apply a standard abelian argument as follows: First of all, because
[TABLE]
we can deduce from (2.5) that for all . In order to obtain the remaining converse bound, let us first recall that is “-weakly unimodal” in the sense that
[TABLE]
see Khoshnevisan and Xiao [21, Lemma 4.1]. Consequently,
[TABLE]
A second appeal to (2.5) completes the proof; to finish we simply set . ∎
Proof of Theorem 5.
Let denote the subordinator that we just constructed in Lemma 2.2, and let be an independent standard Brownian motion in . Then,
[TABLE]
is an isotropic Lévy process in . We can see, by first conditioning on , that the characteristic function of is given by
[TABLE]
Recall that the heat kernel — defined in (1.5) — is the probability density of at for every . Therefore, for every measurable function ,
[TABLE]
where
[TABLE]
This is the function that was announced in Theorem 5.
Clearly, on . Also, Fubini’s theorem and (2.4) together imply that the Fourier transform of is
[TABLE]
Among other things, this calculation shows that:
- (a)
; and in particular, 2. (b)
is positive semi definite.
It follows that is a correlation function, and Part 1 of the theorem is also proved.
Since , and because is bounded uniformly on for every , the continuity of and the dominated convergence theorem together prove that is continuous uniformly on for every , whence follows part 2 of the theorem.
Part 3 follows immediately from (2.7) and the isotropy and monotonicity properties of the heat kernel.
In order to verify part 4 of the theorem we decompose as follows:
[TABLE]
Because for all and ,
[TABLE]
We have used the weak unimodality [see (2.6)] of in order to deduce the second line from the first. Therefore, it remains to prove that as long as .
Lemma 2.2 implies the existence of two finite and positive constants and such that, uniformly for every ,
[TABLE]
Consequently, as long as we choose a large enough constant , the following holds uniformly when :
[TABLE]
Since is monotone, the preceding holds also when . Similarly, we can decompose
[TABLE]
This readily yields the complementary bound to (2.8) and completes the proof of part 4.
Part 5 was proved in Foondun and Khoshnevisan [12]; see the argument that led to Theorem 3.14 therein (ibid.).
In order to complete the proof we verify part 6 of the theorem. Let denote the resolvent of the heat semigroup on , run at twice the standard speed; that is,
[TABLE]
for all functions for which the preceding Lebesgue integral is defined. The theory of Foondun and Khoshnevisan [12, Theorem 1.2] implies that Dalang’s Condition (1.2) is equivalent to the condition that . Therefore, it remains to prove that is finite. This is a well-known calculation about the Newtonian potential in dimension three. The computations will be carried out here for the sake of completeness.
One can integrate in spherical coordinates as follows:
[TABLE]
Therefore, the lemma follows once one proves that ; that is, once we prove that has finite Newtonian potential.
Note that
[TABLE]
uniformly for all . It follows from the definition (2.7) of that the Newtonian potential of can be written as
[TABLE]
It remains to prove that is finite; this endeavor will complete the proof since is a probability measure. To see that is finite, one simply integrates by parts,
[TABLE]
and apply Lemma 2.2 together with the fact that . This completes the proof. ∎
3 Preliminary estimates
Recall that we are studying (1.1) for a Lipschitz-continuous, non-random function , subject to .
From now on, we restrict attention to a noise model for that corresponds to a spatial correlation function that satisfies properties 1–5 of Theorem 5; the choice of is otherwise arbitrary.
3.1 Existence, uniqueness, and moments
The following result follows from Theorems 1 and 5 (part 6).
Lemma 3.1**.**
The stochastic partial differential equation (1.1), subject to admits a predictable random field solution . Moreover, is unique, up to a modification, subject to the condition that for all and ,
[TABLE]
Remark 3.2**.**
Recall from (2.2) and note that . Thus, Lemma 3.1 follows from the fact that ; see the proof of Lemma 3.1. This sort of integrability condition for arose earlier in the context of hyperbolic SPDEs; see Dalang and Frangos [7].
Next we produce moment estimates for the solution to (1.1), all the time remembering that the spatial correlation function of satisfies the properties mentioned in Theorem 5, and is the underlying parameter that was used in the course of the construction of .
Theorem 6**.**
Let denote the solution to (1.1), and recall that is Lipschitz continuous and non random. Then, there exists a finite constant such that
[TABLE]
uniformly in and and . For a complementary bound, suppose that for all . Then, in that case, there exists a finite constant such that
[TABLE]
uniformly for all and all integers and .
Remark 3.3**.**
Inequality (3.2) is included here mainly because it shows that, for the spatial correlation function of the type studied here, the solution to (1.1) is “extremely intermittent.” One way to say this is as follows: Consider the [lower] moment Lyapunov exponents,
[TABLE]
Then, (3.2) proves that In other words, the Lyapunov moments exponents grow extremely rapidly with the moment numbers. For usual choices of the spatial correlation function , grows as , whereas it grows as here. This sort of extreme intermittency provides a certain amount of evidence toward the truth of Conjecture 2, though it certainly does not prove Conjecture 2.
In order to prove the upper bound (3.1) we will use a general result of Foondun and Khoshnevisan [12, Theorem 1.3]. For the lower bound (3.2) we first use a Feynman–Kac type moment formula to represent the solution, and then reduce the problem to a small-ball estimate for three-dimensional Brownian motion.
The proof of the upper bound requires two technical lemmas which we develop next.
Lemma 3.4**.**
* uniformly for all .*
Proof.
We find it more convenient to work with rather than ; a change of variables will adjust the constants for correct later use.
We integrate in spherical coordinates to see that, for all ,
[TABLE]
where
[TABLE]
both are functions of the time variable which we suppress.
The second quantity is bounded uniformly in . In fact, the monotonicity of — see Theorem 5 — yields
[TABLE]
Therefore, it remains to prove that for all , where is a sufficiently-small constant.
Choose and fix a constant . Thanks to part 4 of Theorem 5, we can write
[TABLE]
where
[TABLE]
If , then . Therefore,
[TABLE]
Similarly,
[TABLE]
In this way we have proved that , whence also
[TABLE]
for small values of .
The other bound is even simpler to establish since
[TABLE]
for all sufficiently-small values of . ∎
Let denote the resolvent of the Laplace operator ; compare with (2.9). We can write in terms of the heat kernel of Brownian motion as
[TABLE]
for all , , and Borel functions .
Lemma 3.5**.**
* for all .*
Proof.
First, let us observe that for all for the same sort of reason that showed that ; see the proof of Lemma 3.1.
Next we write , where [] are defined as follows:
[TABLE]
We estimate and separately.
A change of variable shows that
[TABLE]
Therefore, Lemma 3.4 ensures that
[TABLE]
Because (Theorem 5), it remains to prove that as .
By the semigroup property of the heat kernel,
[TABLE]
Since is a continuous, positive semi-definite function, it is maximized at the origin. Therefore, we can deduce from the preceding display that is non increasing. In particular,
[TABLE]
thanks to Lemma 3.4. This and the estimate for together imply that as , which completes the proof. ∎
Proof of Theorem 6.
First we prove the claimed upper bound on the moments of .
According to Lemma 3.5,
[TABLE]
uniformly for all and . If, in addition,
[TABLE]
for a sufficiently large , then the preceding simplifies to the following inequality:
[TABLE]
In particular, (3.3) tells us that there exists a positive and finite constant such that
[TABLE]
Theorem 1.3 of Foondun and Khoshnevisan [12] now shows that
[TABLE]
for all . This proves an asymptotic, large-, version of the stated upper bound (3.2) of the theorem. The asserted fixed- result holds because of the proof of Theorem 1.3 of Foondun and Khoshnevisan (ibid.); consult Lemmas 5.4 and 5.5 of that reference for details.
To prove the lower bound (3.2) let us recall the following Feynman–Kac formula for the moments of the parabolic Anderson model; see Hu and Nualart [17] and Conus [4]:
[TABLE]
where are independent, standard Brownian motions on . Let denote the event that for all and . Then clearly,
[TABLE]
Thanks to (2.2), if , then we can find a positive constant such that, uniformly for all and , almost surely on . Thus, we see that
[TABLE]
It is well known, and easy to see directly, that there exists a universal positive constant such that
[TABLE]
uniformly for all and . [The preceding probability can in fact be computed explicitly; see Ciesielski and Taylor [3, Theorem 2].] We plug this inequality into (3.4). A line or two of further computations conclude the proof. ∎
The proofs of Theorems 2 and 3 will rely on the following variation on the theme of Theorem 6.
Proposition 3.6**.**
Suppose, in addition, that is bounded. Then,
[TABLE]
uniformly for all .
Proof.
In accord with (1.6) and suitable form of the Burkholder–Davis–Gundy inequality [18],
[TABLE]
uniformly for all . Now, the boundedness of the function simplifies the preceding as follows:
[TABLE]
Since and are both positive semi-definite, so is their convolution. Moreover, is manifestly continuous. Therefore, by elementary properties of continuous, positive definite functions, is maximized at the origin. Therefore, Lemma 3.4 implies that
[TABLE]
Moreover, the semigroup property of the heat kernel implies that for all , whence
[TABLE]
uniformly for all . Consequently,
[TABLE]
uniformly for all . ∎
Remark 3.7**.**
In order to highlight the efficacy of Proposition 3.6, let us consider the case that is a constant function; say, . In that case, is a mean-one Gaussian random variable with variance,
[TABLE]
by the same sort of computation as the one used in the course of the proof of Proposition 3.6. Special properties of mean-zero Gaussian distributions then imply that when ,
[TABLE]
uniformly for all . One can conclude readily from this inequality that the statement of Proposition 3.6 is, in its essence, unimprovable.
3.2 Moment bounds for the spatial and temporal increments
In this subsection we give estimates for the quantity
[TABLE]
when and . These estimates will be used in an ensuing “local linearization argument” that will be highlighted in Proposition 5.1. Throughout this paper, we set for all .
Proposition 3.8**.**
Assume that is bounded. Then for all there exists a finite constant depending on such that
[TABLE]
uniformly for all distinct , and all real numbers .
Proof.
Choose and fix and . According to (1.6) and a suitable application of the BDG inequality (see [18] for details), for every real number ,
[TABLE]
where
[TABLE]
and
[TABLE]
Since is bounded, there exists a finite constant such that uniformly for all , , , and ,
[TABLE]
see (2.2) for the definition of . At first one might expect that the absolute values in the integral introduce additional logarithmic factors which can damage our estimates since the left-hand side is quite large already [remember that we are trying to prove that the left-hand side is at most a negative power of the iterated logarithm of ]. Remarkably, the introduction of the absolute values turns out to be harmless. In order to prove this we will use the following elementary inequality: Uniformly for all and ,
[TABLE]
For a detailed proof see Lemma 6.4 in [5]. Now we analyze (3.5).
Throughout the remainder of this calculation, let us define
[TABLE]
Theorem 5 and two back-to-back applications of (3.6) together show that
[TABLE]
Next we estimate the same integral as above, but with its region of integration replaced by . [It might help to consult (3.5) to see why.] With this aim in mind, define for all and for every integer ,
[TABLE]
By the monotonicity properties of [Theorem 5],
[TABLE]
all the time noting that the implied constant also does not depend on —whence also on —and
[TABLE]
The elementary properties of the heat kernel and the inequality (3.6) together allow us to write
[TABLE]
where the implied constant does not depend on . Therefore,
[TABLE]
where the implied constant does not depend on . In particular,
[TABLE]
where the implied constant does not depend on . In light of the preceding bound and (3.8), we find that
[TABLE]
where the implied constants do not depend on . Therefore, Theorem 5 ensures that
[TABLE]
and, as before, the implied constants do not depend on . In light of (3.5), (3.7), and (3.9), we can deduce the existence of a finite constant such that, uniformly for all and ,
[TABLE]
where is also independent of . We can replace by a possibly larger constant in order to complete the proof of the result. ∎
Next, let us consider bounds on the temporal increments of the solution to (1.1). The main result of the section is recorded as the following proposition.
Proposition 3.9**.**
Assume that is bounded. Then for all there exists a finite constant depending on such that
[TABLE]
valid uniformly for all distinct and all real numbers .
Proof.
We write where
[TABLE]
The proof readily follows from combining the subsequent Lemmas 3.10 through 3.12. ∎
Lemma 3.10**.**
Recall from (3.10). If is bounded, then there exists a finite constant such that
[TABLE]
uniformly for all , , , and .
Proof.
A suitable form of the BDG inequality for martingales implies that
[TABLE]
see [18]. By the boundedness of , we obtain,
[TABLE]
thanks to Parseval’s identity. Since for all , it then follows that
[TABLE]
The integral can be considered separately in two parts: Where and where . The first part is estimated as follows:
[TABLE]
The second bound is handled similarly, viz.,
[TABLE]
The lemma is a ready consequence of the preceding two displays and (3.11). ∎
In order to estimate the quantity — see (3.10) — let us define
[TABLE]
Lemma 3.11**.**
For some universal constant , it holds that
[TABLE]
Proof.
Because
[TABLE]
we apply the fundamental theorem of calculus to see that
[TABLE]
Integrate the preceding in order to see that
[TABLE]
Hence, by change of variable ,
[TABLE]
where . This proves the lemma. ∎
Lemma 3.12**.**
Recall from (3.10). If is bounded, then there exists a finite constant such that
[TABLE]
uniformly for all , , , and .
Proof.
We begin as in the proof of the preceding lemma. Namely, we begin by observing that a suitable form of the BDG inequality for martingales implies that
[TABLE]
By the boundedness of and the Cauchy–Schwarz inequality,
[TABLE]
where was defined earlier in (3.12); see the derivation of (3.11). Denote the triple integral in (3.13) by . The integral can be expressed as follows:
[TABLE]
Next, and are estimated separately, and in reverse order. Theorem 5 and Lemma 3.11 together imply that
[TABLE]
In order to estimate , one can use the trivial inequality in order to see that
[TABLE]
Because for all and , and since is a probability density, one can estimate the -integral in the preceding display as follows:
[TABLE]
Therefore,
[TABLE]
Now apply Theorem 5 to see that
[TABLE]
where . The lemma follows from this and (3.14). ∎
4 The constant-coefficient case
So far, everything that was considered held for any . From now on, we restrict the choice of the spatial correlation function further by assuming that comes from Theorem 5 in the special case that
[TABLE]
This assumption will be in place throughout the remainder of this paper, and used sometimes without mention.
In this section we study the [constant-coefficient] linearization of (SHE). That is, we consider the stochastic partial differential equation,
[TABLE]
subject to . As is well known, the solution is the following centered Gaussian random field:
[TABLE]
as the preceding Wiener integral has a finite variance. This can be seen from an application of Lemma 3.1 with .
Recall the function from (2.2). The elementary properties of Wiener integrals show us that is a centered Gaussian random field with covariance
[TABLE]
for all and . In particular, it follows readily that is a centered, stationary Gaussian random field — indexed by — for every fixed .
The following is the main result of this section.
Proposition 4.1**.**
For every real number there exists a finite such that
[TABLE]
Let us make a few remarks before we prove Proposition 4.1. First, we record the following ready corollary of Proposition 4.1, the stationarity of , and the restriction (4.1) on .
Corollary 4.2**.**
For every ,
[TABLE]
Therefore, Fubini’s theorem yields the following.
Corollary 4.3**.**
With probability one,
[TABLE]
The proof of Proposition 4.1 hinges on an -modulus of continuity of .
Proposition 4.4**.**
Uniformly for all and ,
[TABLE]
Proposition 4.4 implies that is continuous in , and hence in since the norm of a Gaussian random variable is controlled by its norm. In particular, Doob’s regularity theory implies that has a separable, in fact, Lebesgue measurable, version; see Chapter 5 of Khoshnevisan [19]. After we establish Proposition 4.4 we always tacitly refer to that separable version.
Proof of Proposition 4.4.
By Parseval’s identity,
[TABLE]
Therefore, an appeal to Lemma 4.1 of Foondun and Khoshnevisan [12] yields
[TABLE]
where
[TABLE]
Thanks to Theorem 5,
[TABLE]
Since for all ,
[TABLE]
where
[TABLE]
Integrate in spherical coordinates to find that
[TABLE]
Similar computations yield the following:
[TABLE]
and
[TABLE]
Therefore, we can combine (4.5), (4.6), and (4.7), and plug the end result into (4.4) to see that
[TABLE]
This and (4.2) together imply the upper bound for .
For the corresponding lower bound, we once again use (4.2) and (4.3). In this way we can show that
[TABLE]
see Lemma 4.8 of Foondun and Khoshnevisan [12] for an explanation of the last line. For we apply Theorem 5 in order to deduce the following:
[TABLE]
and for the case , we merely write
[TABLE]
Because of (4.8), the preceding and (4.2) together complete the task. ∎
Now we verify Proposition 4.1.
Proof of Proposition 4.1.
Recall that is fixed, and define for every ,
[TABLE]
Then, is the canonical metric that the Gaussian random field imposes on . And, in accord with Proposition 4.4,
[TABLE]
uniformly for all .
For every -compact set , let denote the metric entropy of in the metric ; that is, for every , the quantity denotes the minimum number of -balls of radius that are required to cover . We have noted already that is a centered and stationary Gaussian process. Therefore, the theory of Dudley [10] and Fernique [11] [for a pedagogic account see Marcus and Rosen [22]] together imply that
[TABLE]
uniformly for every compact set , where denotes the -diameter of and
[TABLE]
which makes sense, thanks to separability.
It is a noteworthy observation that the topology induced by the metric is Euclidean, thanks to (4.9). Therefore, (4.10) holds for every compact set .
We wish to apply the preceding to the finite set
[TABLE]
According to (4.9), uniformly for all integers . Moreover, for all and ,
[TABLE]
In particular, there exists a finite constant such that for all :
- •
If then ; and
- •
If then .
Let denote the smallest such that for two distinct points . The preceding remarks together imply that
[TABLE]
and
[TABLE]
Now apply (4.10) to see that
[TABLE]
uniformly for all . Finally, we apply Borell’s inequality in order to see that for all ,
[TABLE]
see Borell [1] and Sudakov and Tsirel’son [29]. This, (4.11), and Remark 3.7 together yield the proposition, after we make a judicious choice of . ∎
5 Local linearization
For every space-time function , and for every , define
[TABLE]
In other words, is a sort of discrete spatial gradient operator on a mesh of size . In particular, note that
[TABLE]
for all and , where is the heat kernel, as was defined in (1.5).
We may also observe that makes sense equally well when depends only on a spatial variable. In other words, whenever is a function on ,
[TABLE]
for all .
In the next section we show that, under some additional assumptions on , the solution to (1.1) can be discontinuous at any given space-time point. The idea is that, in a strong sense,
[TABLE]
for all and . Hence, the gloal discontinuity of — see Corollaries 4.2 and 4.3 — will force the local discontinuity of , as long as is not too small. As part of this work, it will be shown that the error in the approximation (5.1) to does not affect the discontinuity of the term . The following result makes this assertion more precise.
Proposition 5.1**.**
Assume that is bounded. For any , there exist positive and finite constants and such that
[TABLE]
uniformly for all and that satisfy , where is the bound for , i.e., for all .
The proof is somewhat long, and will be presented shortly. But first, let us make a few remarks on the content of Proposition 5.1.
According to Propositions 3.8, for every and ,
[TABLE]
uniformly for all and sufficiently small. This very inequality can be applied with replaced by and by the constant function in order to yield the following: For all and ,
[TABLE]
uniformly for all and such that is sufficiently small. Theorem 6 and the Lipschitz continuity of together imply that is bounded, for every and , uniformly over all . One can conclude from this discussion, and the Cauchy–Schwarz inequality, that for all and ,
[TABLE]
uniformly for all and sufficiently small. If this bound were proved to be sharp [it can be, in some cases], then Proposition 5.1 is telling us that, although and are both quite small in norm, their difference is smaller still. This is a quantitative way to say that the locally-linearized form is a very good approximation to the discrete gradient of the solution to (1.1). This general idea has recently played various roles in SPDEs; see, for example Hairer [14, 15] and Hairer and Pardoux [16], where this sort of local linearization is sometimes referred to as a “jet expansion,” and Foondun, Khoshnevisan, and Mahboubi [13] and Khoshnevisan, Swanson, Xiao, and Zhang [20], where this sort of local linearization is used to analyse the local structure of the solution to parabolic SPDEs that are much nicer than those that appear here.
Let us conclude this section with the following.
Proof of Proposition 5.1.
Let us first introduce some notation.
For every let
[TABLE]
As notational advice, let us point out that here and throughout, denotes a typically-small scalar and should not be confused with which is a 3-vector that typically has small norm.
For all and define
[TABLE]
to be a suitably-chosen, 4-dimensional, space-time box with “center” .
From now on we choose and fix a real number and consider an arbitrary that satisfies
[TABLE]
Let us consider the following decomposition of , valid thanks to (1.6)
[TABLE]
where is defined for all as follows:
[TABLE]
The -norms of the ’s are estimated next. The computations are somewhat long and tedious. Therefore, they are presented in five separate steps.
Step 1. A comparison estimate for . In the second step of the proof we establish an inequality that compares the moments of the random variable to moments of a certain mean-zero Gaussian random variable; see (5.5) below.
A suitable formulation of the Burkholder–Davis–Gundy inequality [18] implies that
[TABLE]
where and the triple integrals are computed over all points
[TABLE]
If is a random variable with the standard normal distribution, then uniformly for all . This fact and the previous inequality for together yield
[TABLE]
valid uniformly for all and , where was defined in (5.3).
Step 2. A Gaussian moment Estimate. Next we develop a moment inequality for the Gaussian stochastic integral on the right-hand side of (5.5); the precise statement can be found in (5.9) below. Since we are only interested in the behavior when , we will assume that from now on.
By Minkowski’s inequality,
[TABLE]
where:
[TABLE]
where for all .
After one or two changes of variables [, ],
[TABLE]
where
[TABLE]
see (2.2) for the definition of .
According to (5.2), for all sufficiently small. Therefore, (3.6) and the monotonicity of [Theorem 5] together imply that
[TABLE]
One can estimate using the same technique that was used in the proof of Proposition 3.8. More specifically, we proceed as follows: For all sufficiently small,
[TABLE]
An appeal to Theorem 5 and (5.2) yields
[TABLE]
by an integral test. This inequality and (5.7) together yield
[TABLE]
valid uniformly for all and all sufficiently small .
In order to bound , we change variables and then use the simple inequality,
[TABLE]
in order to deduce that for all sufficiently small,
[TABLE]
Because and are both positive semi-definite, so is . Moreover, is continuous and bounded. Therefore, elementary facts about positive definite functions tell us that is maximized at the origin. In this way we find that
[TABLE]
since for all when is a 3-vector of i.i.d. standard normal random variables. An appeal to Lemma 3.4 now yields
[TABLE]
thanks to the definition (5.2) of and . It is easy to deduce from the preceding that , and hence for every , uniformly for all sufficiently small [with room to spare]. This inequality, (5.6) and (5.8) together accomplish the main objective of Step 3; namely, they imply that there exists such that for some constant ,
[TABLE]
for all and .
Step 3. Estimates for and . It is now easy to find suitable estimates for the norm of and . The requisite bounds will appear in (5.10) and (5.12) below.
First of all we simply combine (5.5) with (5.9) to obtain the following estimate for :
[TABLE]
valid uniformly for all and .
Next, we estimate the norm of as follows: By the Cauchy–Schwarz inequality,
[TABLE]
Because is bounded, and recall that if has a standard normal distribution, then , uniformly for all . Therefore, the second quantity on the right-hand side of (5.11) can be bounded as follows:
[TABLE]
thanks to Step 2; see (5.9). We can combine the preceding inequalities to deduce the following estimate for : There exists such that
[TABLE]
uniformly for all and .
Step 4. Estimates for and . In this step we derive a bound for the moments of and ; the end results are (5.14) and (5.15) below.
Let us recall the sets from (5.4). By a suitable application of the Burkholder–Davis–Gundy inequality,
[TABLE]
where
[TABLE]
for all . Of course, the functions and depend also on the variables , but this dependency is not immediately relevant to the discussion.
Because of the Lipschitz condition of , Propositions 3.8 and 3.9 together imply that when is sufficiently small,
[TABLE]
uniformly for all , and to account for the possibilities and . Consequently, (5.13) yields
[TABLE]
the last line follows from (3.7) and (3.9) [simply apply the latter two inequalities with , for instance]. This readily yields the following, with room to spare: There exist finite and positive constants and such that
[TABLE]
uniformly for all and .
Finally, we obtain from (5.14), using the Cauchy–Schwarz inequality in the same way that was derived from in Step 4, in order to obtain
[TABLE]
uniformly for all and .
Step 5. Conclusion of proof. The proposition follows from an application of Minkowski inequality, using the results (5.10) through (5.15) of Steps 1 through 5. ∎
6 Proof of Theorems 2 and 3
The groundwork for the proof of the main results of the paper has been laid. We now are ready to prove the main results of the paper, which we do in order.
Proof of Theorem 2.
We start by observing that
[TABLE]
This is because , as can be deduced from (1.6).
Next we observe that one can reduce the scope of the problem to the case that for all without incurring any loss in generality. This is because is continuous and crosses zero at — and only at — the origin. A second appeal to the assumption reduces the problem to proving the following:
[TABLE]
for every , where the open ball was defined in (1.3).
Owing to (6.1), we can find two finite numbers such that
[TABLE]
We plan to prove that the following holds for every such pair of real numbers that satisfy (6.3):
[TABLE]
This will do the job since we may let and , using Doob’s martingale convergence theorem, to finish the proof. Thus, it remains to prove (6.4).
For the remainder of the proof let us choose and fix an arbitrary space-time point for which we plan to verify (6.4). Also, let us choose an arbitrary real number . Define
[TABLE]
and
[TABLE]
For every real number ,
[TABLE]
where the definition of is clear from context, and
[TABLE]
for every , and the mean-zero Gaussian random field is, as before, the solution to (1.1) with . We are going to prove that and both tend to zero as . Since is arbitrary, this will complete the proof.
Consider the Gaussian process
[TABLE]
As was demonstrated in Section 4, the canonical distance imposed on by satisfies
[TABLE]
for every . We plan to apply a metric entropy argument in order to estimate the quantity on the left-hand side of (6.7) below.
Recall from Dudley [10] and Fernique [11]—see also (4.10)—that
[TABLE]
where denotes the minimum number of -balls of radius that are needed to cover — this is the metric entropy of — and denotes the diameter of in the metric ; that is,
[TABLE]
It might help to also recall that the implied constants in (6.7) can be chosen to be universal and hence do not depend on the various parameters of our problem [10, 11].
If satisfy , then (6.6) assures us that
[TABLE]
and hence,
[TABLE]
And a combintorial argument that uses only (6.6) shows that there exists a universal constant — independently of — such that
[TABLE]
uniformly for every . In the same way, we can find a universal constant — independently of — such that
[TABLE]
One can plug the results of (6.8) and (6.9) into (6.7) in order to deduce the following bounds:
[TABLE]
where the parameter dependencies are, as before, uniformly over all choices of . Similarly, one derives a matching lower bound, thus leading to the following:
[TABLE]
Careful scrutiny of the parameter dependencies shows that does not depend on . Because ,
[TABLE]
By the Borell, Sudakov–Tsirel’son inequality [1, 29], for some small enough,
[TABLE]
where
[TABLE]
Owing to Proposition 4.4,
[TABLE]
uniformly for all . Therefore, we apply (6.10) one more time, and plug the end result in (6.12) in order to see that there exists a finite constant such that
[TABLE]
Consequently,
[TABLE]
thanks to (6.13), where is defined in (6.3). It follows from this fact that
In order to complete the proof, it remains to show that
[TABLE]
Let us recall (6.5) and write
[TABLE]
uniformly for all sufficiently-small , where denotes cardinality. We may notice that
[TABLE]
for a certain that satisfies , where the implied constant is universal and finite. Therefore, Proposition 5.1 implies that every random variable is sub Gaussian. In fact, there exists , small enough, such that, for all ,
[TABLE]
uniformly for all sufficiently-small .
Therefore, by Chebyshev’s inequality and (6.10),
[TABLE]
for a finite constant that depends only on . Since the cardinality of satisfies , it follows from the preceding displayed inequality that
[TABLE]
which tends to [math] as . A scaling argument implies that
[TABLE]
In particular, for all ,
[TABLE]
as . Thanks to (6.10) and Proposition 4.1, we can choose small enough to ensure that the right-most probability above also tends to zero as . In light of (6.11), this verifies (6.4) and hence concludes the proof of Theorem 2. ∎
The dervivation of Theorem 2 admittedly required some effort. But now we can adjust that derivation — without a great deal of additional effort — in order to verify Theorem 3.
Proof of Theorem 3 (sketch).
The conditioning in the equivalent statement (6.2) to Theorem 2 arose because, during the course of the proof of Theorem 2, we needed to prove that
[TABLE]
for a suitably-small choice of , and could, in principle, be frequently close to — or possibly even equal to — zero. In the present setting however, is bounded uniformly from below, away from zero. Therefore, in the present setting, (6.15) follows immediately Proposition 4.1, as long as is a small-enough [but otherwise fixed] positive constant. The remainder of the proof of Theorem 2 remains essentially intact. ∎
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Borell, Christer. The Brunn-Minkowski inequality in Gauss space, Invent. Math. 30 (1975) 207–216.
- 2[2] Chen, Le and Jingyu Huang. Comparison principle for stochastic heat equation on ℝ d superscript ℝ 𝑑 \mathds{R}^{d} . Preprint available at https://arxiv.org/abs/1607.03998 .
- 3[3] Ciesielski, Zbigniew and S. J. Taylor. First passage times and sojourn times for Brownian motion in space and the exact Hausdorff measure of the sample path. Trans. Amer. Math. Soc. 103 (1962) 434–450.
- 4[4] Conus, Daniel. Moments for the parabolic Anderson model: on a result by Hu and Nualart. Commun. Stoch. Anal. 7 (1) (2013) 125–152 pp.
- 5[5] Conus, Daniel and Joseph, Mathew and Khoshnevisan, Davar and Shiu, Shang-Yuan. On the chaotic character of the stochastic heat equation, II. Probab. Theory Related Fields. 156 3-4 (2013) 483–533.
- 6[6] Dalang, Robert C. Extending the martingale measure stochastic integral with applications to spatially homogeneous s.p.d.e.’s. Electron. J. Probab. 4 (6) (1999) 29 pp.
- 7[7] Dalang, Robert C. and Frangos, N. E. The stochastic wave equation in two spatial dimensions. Ann. Probab. 26 (1) (1998) 187–212.
- 8[8] Dalang, Robert C. and Olivier Lévêque. Second-order hyperbolic S.P.D.E.’s driven by boundary noises. Seminar on Stochastic Analysis, Random Fields and Applications IV , 83–93, In: Progr. Probab. 58 Birkhäuser, Basel, 2004.
