This paper investigates the long-term behavior of KPZ-like equations on a torus driven by ergodic noise, establishing synchronization and a one-force, one-solution principle using infinite-dimensional extensions of random matrix results.
Contribution
It introduces a novel analysis of KPZ equations' long-time behavior, proving synchronization and solution uniqueness in a new infinite-dimensional framework.
Findings
01
Established almost sure synchronization with exponential speed
02
Proved a one-force, one-solution principle for KPZ equations
03
Extended random matrix techniques to infinite-dimensional stochastic PDEs
Abstract
We study the longtime behavior of KPZ-like equations: ∂th(t,x)=Δxh(t,x)+∣∇xh(t,x)∣2+η(t,x),h(0,x)=h0(x),(t,x)∈(0,∞)×Td on the d−dimensional torus Td driven by an ergodic noise η (e.g. space-time white in d=1. The analysis builds on infinite-dimensional extensions of similar results for positive random matrices. We establish a one force, one solution principle and derive almost sure synchronization with exponential deterministic speed in appropriate H\"older spaces.
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.
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Full text
Synchronization for KPZ
Tommaso Cornelis Rosati
Humboldt-Universität zu Berlin
Abstract.
We study the longtime behavior of KPZ-like
equations:
[TABLE]
on the d−dimensional torus Td driven by an ergodic noise
η (e.g. space-time white in d=1). The analysis builds
on infinite-dimensional extensions of similar results for positive random
matrices. We establish a one force, one solution principle and derive almost
sure synchronization with exponential deterministic speed in appropriate Hölder spaces.
Key words and phrases:
KPZ Equation; Burgers’ Equation; Random dynamical systems;
Krein-Rutman theorem; One force one solution; Ergodicity
2010 Mathematics Subject Classification:
60H15; 37L55
This paper was developed within the scope of the IRTG 1740 /
TRP 2015/50122-0, funded by the DFG / FAPESP
Introduction
The present article concerns the study of stochastic partial differential
equations (SPDEs) of the form:
[TABLE]
where η is a random forcing and Td the d-dimensional torus.
In dimension d=1 with η space-time white noise the above is
known as the Kardar-Parisi-Zhang (KPZ) equation, and is a renowned model in the study of growing
interfaces. It is related to a universality conjecture
[35], according to which many asymmetric
growth models are described, on large spatial and temporal scales, by a common
universal object: the so-called KPZ fixed point. The KPZ equation is itself the
scaling limit of many such processes in a weakly asymmetric regime
and it is expected to converge to the mentioned fixed point on large
scales.
This picture motivates in part interest behind the longtime behavior
of equations of type (1). Another motivation comes
Burgers’-like equations. These are toy models in fluid dynamics, and are
formally linked to KPZ by v=∇xh:
[TABLE]
In the case of the original KPZ
equation, wellposedness
[25, 26, 22] was a
milestone.
Preceding these results there was no clear understanding of the quadratic nonlinearity in
(1), yet the equation could be studied through
the Cole-Hopf transform, by imposing that u=exp(h) solves the linear
stochastic heat equation (SHE) with multiplicative noise (a step that can be made rigorous for
smooth η but requires particular care and the introduction of
renormalization constants if η is space-time white noise):
[TABLE]
In addition to proving wellposedness of the KPZ equation, [26]
introduces the notion of subcriticality, which provides a formal condition on
η under which Equations (1) and (3) remain well-posed.
Recent works show that this condition is indeed sufficient
[7, 6, 12].
In consideration of these results, we will not discuss
questions regarding the wellposedness of (1). Instead, our aim is
to prove results concerning the longtime behavior
of solutions, under the assumption that a solution map to
the SHE (3) is given and satisfies some natural requirements
that will be introduced below.
The linearization of (1) provides additional
structure to the equation that allows to prove strong ergodic
properties. The first simple observation is that
(1) is shift invariant, meaning that any ergodic
property will be proved either “modulo constants”, that is identifying two
functions h,h′:[0,∞)×Td→R if there exists
a c:[0,∞)→R such that h(t,x)−h′(t,x)=c(t),∀t,x, or for the gradient v=∇xh,
which satisfies Burgers’ equation.
On one hand, unique ergodicity of the KPZ Equation “modulo constants” was
first established in [27] as a
consequence of a strong Feller property that holds for a wide class of SPDEs.
Moreover, for the KPZ equation the invariant measure
is known to be the Brownian bridge [21]. In
addition, [24] proves a spectral gap for
Burgers’ equation, implying
exponential convergence to the invariant measure, although the article
restricts to initial conditions that are “near-stationary”.
On the other hand, [36] considers the noise
η(t,x)=V(x)∂tβ(t) for V∈C∞(Td) and a
Brownian motion β. The article shows that there exists a random function
v(t,x) defined for all t∈R such that almost surely,
independently of the initial conditions v0 within a certain class:
[TABLE]
for all x∈Td and with v solving (2).
This property is referred to as synchronization.
In addition, if one starts Burgers’ equation at time −n with v−n(−n,x)=v0(x):
[TABLE]
This property is called a one force, one solution principle (1F1S) and it
implies that v is the unique (ergodic)
solution to (2) on R. Results of this
kind have subsequently been generalized in many directions, most notably to the
inviscid case
[38] or to infinite volume, for
example in [5] and
recently in [16], for specific classes
of noises.
We will attempt to understand and extend the results in
[36]
through an application of the theory of random dynamical systems. The power of
this approach lies in the capacity of treating any noise η such that:
(i)
The noise η is ergodic: see Proposition
6.1 for a classical condition if η is
Gaussian.
2. (ii)
Equation (3) is almost surely well-posed: there exists
a unique, global in time solution for every u0∈C(Td), the
solution map being a linear, compact, strictly positive operator on
C(Td).
In particular, η can be chosen
to be space-time white noise or a noise that is fractional in time.
In the original work [36],
the solution u to (3) evaluated at time n is
represented by u(n,x)=Anu0(x) for a compact strictly positive operator An. The proof of the
result makes use in turn of the explicit representation of the operator
An via the Feynman-Kac formula. Such representation becomes more technical when the noise η is
not smooth and requires some understanding of random polymers (cf.
[10, 15]
for the case of space-time white noise).
In this work we will avoid the
language of random polymers.
If η were a time-independent noise, the synchronization of the solution
v to (2) would
amount to the convergence, upon rescaling, of u to the random eigenfunction of
A1 associated to its largest eigenvalue: an instance of the Krein-Rutman
Theorem. We will extend this argument to the non-static case with
an application of the theory of random dynamical systems. The key tool is a
contraction principle for
positive operators in projective spaces under Hilbert’s projective metric (see
[8] for an overview). Such method was already deployed in [3] and later
refined by [28] in the study of random matrices. Their proofs
naturally extend to the infinite-dimensional case, giving rise to an ergodic
version of the Krein-Rutman theorem: see Theorem 3.4.
In this way one obtains exponential synchronization and
1F1S “modulo constants” for the KPZ equation: in an example with smooth noise we show
that the constants can be chosen time-independent, a fact that we expect to
hold in general. The exponential speed is deterministic and related to the
contraction principle.
Some complications show up when proving
convergence in appropriate Hölder spaces, depending on the regularity of the
driving noise: see Theorem 4.3. This step
requires for example a bound on the average:
[TABLE]
for fixed t>0. In concrete
examples we show how a control on this term can be obtained from a quantitative version
of a strong maximum principle for (3): in particular the case
of space-time white noise requires some care and the proof makes use of the
path-wise solution theory to the equation. Although the study of convergence in Hölder
spaces seems to be new, for different reasons moment bounds of the likes of the one above appeared already in
[3], but are simpler to
verify in the finite-dimensional case.
As we already mentioned, the examples we treat are the original KPZ equation, namely the case of
η being space-time white noise in d=1, and the case of
η(t,x)=V(x)dβtH for βH a fractional Brownian
motion of Hurst parameter H>21 and V∈C∞(T). In the latter
case the solution is not Markovian, and ergodic results are rare, see for
example [31] for ergodicity of linear SPDEs
with additive fractional noise.
There are several instances of applications of the
theory of random dynamical systems to stochastic PDEs. Particularly related to
our work is the study of order-preserving systems which admit some random
attractor [2, 17, 9]. The spirit of these results is
similar to ours. Yet, although the linearity of (3) on one hand
guarantees order preservation, on the other hand it does not allow the existence
of a single random attractor. In this sense, our essentially linear case appears to be a
degenerate example of the synchronization addressed in the works above.
Acknowledgements.
The author is very grateful to Nicolas Perkowski for
inspiring this work and providing numerous insights and helpful comments. Many
thanks also to Benjamin Gess for several interesting discussions, and to
the anonymous reviewer that has carefully read the work and suggested many
improvements.
1. Notations
Let N={1,2,…},N0=N∪{0},
R+=[0,+∞) and ι=−1. Furthermore,
for d∈N let Td be the torus \mathbb{T}^{d}={\raisebox{1.00006pt}{\mathbb{R}^{d}}\left/\raisebox{-1.00006pt}{\mathbb{Z}^{d}}\right.} (here Zd acts by translation on
Rd). The case d=1 is of particular interest, so we write
T=T1.
For a general set X and functions f,g:X→R write f≲g if f(x)≤Cg(x) for all x∈X and a constant C>0 independent of x. To clarify on which
parameters C is allowed to depend we might add them as subscripts to the
“≲” sign.
For α>0 let ⌊α⌋ be the smallest
integer beneath α and for a multiindex k∈Nd write
∣k∣=∑i=1dki.
Denote with C(Td) the space of continuous real-valued
functions on Td, and, for α>0, with Cα(T) the
space of ⌊α⌋− differentiable functions f such that
∂kf is (α−⌊α⌋)−Hölder
continuous for every multiindex k∈Nd such that ∣k∣=⌊α⌋, if α−⌊α⌋>0, or simply
continuous if α∈N0. For α∈R+ we obtain the
following seminorms on Cα(Td):
[TABLE]
We write C∞(Td)=⋂k∈NCk(Td).
Now, let X be a Banach space. We denote with B(X) the Borel
σ−algebra on X. Let [a,b]⊆R be an
interval, then define
C([a,b];X) the space of continuous functions f:[a,b]→X. For any O⊆R, we write Cloc(O;X) for the
space of continuous functions with the topology of uniform
convergence on all compact subsets of O. Given two Banach spaces
X,Y denote with L(X;Y) the space of linear bounded operators A:X→Y with the classical operator norm. If X=Y we write simply L(X).
Next we introduce Besov spaces. Following [4, Section
2.2] choose a smooth
dyadic partition of the unity on Rd (resp. Rd+1) (χ,{ϱj}j≥0) and define ϱ−1=χ and define the Fourier transforms for f:Td→R and
g:R×Td→R:
[TABLE]
These definitions extend naturally to
spatial (resp. space-time) tempered distributions S′(Td) (resp.
S′(R×Td)), which are the topological duals of Schwartz
functions: S(Td)=C∞(Td) and
[TABLE]
Similarly one defines the respective inverse Fourier transforms
FTd−1 and FR×Td−1. Then define the
spatial (resp. space-time) Paley blocks:
[TABLE]
Eventually one defines, for α∈R,a>0,p,q∈[1,∞], the spaces Bp,qα(Td) and
Bp,qα,a(R×Td) as the set of tempered distributions such
that, respectively, the following norms are finite:
[TABLE]
where we denote with ⟨(t,x)⟩ the weight ⟨(t,x)⟩=1+∣t∣. For p=q=2 one obtains the Hilbert spaces Hα(Td)=B2,2α(Td) and
[TABLE]
One can also consider functions that depend on time only and introduce, for the
same range of parameters, the spaces Bp,qα,a(R) via the norm:
[TABLE]
Here the Paley blocks are defined by Δjf(t)=FR−1(ϱj⋅FRf)(t), for a dyadic partition of the
unity {ϱj}j⩾−1 on R. As above we then define
[TABLE]
Finally, recall that for p=q=∞ and α∈R+∖N0: B∞,∞α(Td)=Cα(Td) (see e.g. [37, Chapter 2]).
2. Setting
This section, based on [8], introduces the projective space of positive continuous functions
and a related contraction principle for strictly positive operators. Let X be a Banach
space and K⊆X a closed cone such that K∩(−K)={0}. Denote with K˚ the interior of K
and write K+=K∖{0}. Such cone induces a partial order in X by
defining for x,y∈X:
[TABLE]
Consider for x,y∈K+:
[TABLE]
with the convention inf∅=∞. Then M(x,y)∈(0,∞] and m(x,y)∈[0,∞) so that one can define Hilbert’s
projective distance:
[TABLE]
This metric is only semidefinite positive on K+, and may be infinite. A
remedy for the first issue is to consider an affine
space U⊆X which intersects transversely K+, that is:
[TABLE]
Write λ(x) for the normalization constant above. As for the second
issue, one can observe that the distance is finite on the interior of
K, cf. [8, Theorem 2.1], and thus, defining E=K˚∩U, one has that (E,dH) is a metric space.
Consider now L(X) the set of linear bounded operators on
X, and for an operator A∈L(X) the following conventions define
different concepts of positivity:
[TABLE]
The projective action of a positive operator A on X is then defined by:
Aπx=Ax/λ(Ax). One can view Aπ as a map
Aπ:E→E and one then denotes with τ(A) the projective
norm associated to A:
[TABLE]
The backbone of our approach is Birkhoff’s theorem for positive operators
[8, Theorem 3.2], which is stated below.
Theorem 2.1**.**
Let Δ(F) denote the diameter of a set F⊆E:
[TABLE]
The following identity holds:
[TABLE]
Then denote with Lcp(X) the space of positive operators A
which are contractive in (E,dH):
[TABLE]
The only example considered in this work is X=C(Td) the space of
real-valued continuous functions on the torus, where K is the cone of positive
functions. Here the following holds.
Lemma 2.2**.**
Let X=C(Td) and K={f∈X:f(x)≥0,∀x∈Td}, and consider:
[TABLE]
For the associated metric space (E,dH) the following inequality
holds:
[TABLE]
In particular, (E,dH) is a complete metric space. In
addition, if a strictly positive operator A can be represented by a
kernel, i.e. there exists K∈C(Td×Td) such that:
[TABLE]
and there exits constants 0<α≤β<∞ such that
[TABLE]
then A is contractive, i.e. A∈Lcp(X).
Proof.
As for the inequality, since f,g∈U (and hence ∫f(x)dx=∫g(x)dx=1), there exists a point x0 such that
f(x0)=g(x0). In particular in the sum
[TABLE]
both terms are
positive an bounded by ∥log(f)−log(g)∥∞.
Conversely we have that:
[TABLE]
Completeness of (E,dH) is a consequence of
Inequality (7): for a given
Cauchy sequence fn∈E the sequence log(fn) is a Cauchy
sequence in C(Td). By completeness of the latter there exists a
g∈C(Td) such that log(fn)→g. By dominated
convergence exp(g)∈E, and hence fn→exp(g) in E.
The result regarding the kernel can be found in [8, Section
6].
∎
Remark 2.3**.**
For the sake of simplicity we did not address the general
question of completeness of the space (E,dH), since in the case of
interest to us completeness follows from
(7). Yet general criteria for
completeness are known, see for example [8, Section 4] and the
references therein.
Remark 2.4**.**
In view of (6), an application of Banach’s fixed
point theorem in (E,dH) to operators satisfying the conditions of
Lemma 2.2
delivers the existence of a unique
positive eigenfunction for A. This is a variant of the Krein-Rutman theorem. The
formulation we propose here is convenient because of its natural extension to
random dynamical systems.
3. A Random Krein-Rutman Theorem
In this section we reformulate the results of [3, 28], which refer to the case of positive random matrices, for positive
operators on Banach spaces.
An invertible metric discrete dynamical system (IDS) (Ω,F,P,ϑ) is a probability space (Ω,F,P) together with a
measurable map ϑ:Z×Ω→Ω such that ϑ(z+z′,⋅)=ϑ(z,ϑ(z′,⋅)) and ϑ(0,ω)=ω for all ω∈Ω, and such that P is invariant under
ϑ(z,⋅) for z∈Z. For brevity we write ϑz(⋅)
for the map ϑ(z,⋅). A set Ω⊆Ω is
said to be invariant for ϑ if ϑzΩ=Ω, for all z∈Z. An IDS is said to be
ergodic if any invariant set Ω satisfies P(Ω)∈{0,1} (cf. [1, Appendix
A]).
Consider X,E as in the previous section and, for a given IDS, a random
variable A:Ω→L(X). This
generates a measurable, linear, discrete random dynamical system (RDS) (see
[1, Definition 1.1.1]) φ on X
by defining:
[TABLE]
If A(ω) is in addition positive for every ω∈Ω (we
then simply say that A is positive), we can interpret φ as an RDS
on E via the projective action:
[TABLE]
Before we move on, let us recall the definition of invariant measures for
random dynamical systems, cf. [1, Section 1.4].
Definition 3.1**.**
In the same setting as above, we say that a measure μ on Ω×E is invariant for φπ if:
(i)
The marginal μΩ of μ on Ω satisfies
[TABLE]
2. (ii)
*The measure μ is *Θn−invariant, where
Θn is the skew-product
[TABLE]
Remark 3.2**.**
In most cases an invariant measure μ for a random dynamical system
φ admits a factorization of the form
[TABLE]
where A⊆Ω and B⊆X are measurable sets, and
ω↦μω(C) is a measurable function for every
measurable C⊆X. We then identify the measure μ with its
factor μω. In the setting of this article we will only deal with
random Dirac measures, of the form
[TABLE]
for a measurable map x0:Ω→X.
Assumption 3.3**.**
Assume we are given X,K,U,E as in the previous
section and that (E,dH) is a complete metric
space. Assume in addition that there exists an ergodic IDS (Ω,F,P,ϑ).
Let φn be a RDS defined via a random positive
operator A as above, such that:
[TABLE]
In this setting the following is a random version of the Krein-Rutman theorem.
Theorem 3.4**.**
Under Assumption 3.3
there exists a ϑ−invariant set Ω⊆Ω
of full P−measure and a random variable u:Ω→E such that:
(i)
For all ω∈Ω and f,g∈E:
[TABLE]
2. (ii)
u* is measurable w.r.t. to the *σ−field
F−=σ((A(ϑ−n⋅))n∈N) and:
[TABLE]
3. (iii)
For all ω∈Ω:
[TABLE]
as well as:
[TABLE]
4. (iv)
The measure δu(ω) is the unique
invariant measure for the RDS φπ on E.
Notation 3.5**.**
We refer to the first property as asymptotic synchronization and to
the third property as one force, one solution principle.
Remark 3.6**.**
Theorem 3.4 can be stated also in continuous
time. Suppose that ϑ:R×Ω→Ω generates an invertible,
measure-preserving and ergodic dynamical system over (Ω,F,P) and
[TABLE]
defines a linear (i.e. φt(ω)∈L(X),∀t≥0,ω∈Ω) random dynamical system (see [1, Definition
1.1.1]). Assume in addition that
[TABLE]
Then there exists a ϑ−invariant set Ω of full
P−measure, such that for all ω∈Ω:
[TABLE]
And similarly one can adapt the properties at the points (ii)−(iv) of
Theorem 3.4. This extension follows directly from the
discrete case, observing that for n=⌊t⌋, since
τ(⋅)⩽1:
[TABLE]
Then one can apply Theorem 3.4 since any
discrete random dynamical system has the
form (8), with A(ω)=φ1(ω).
The proof of Theorem 3.4 will rely on the following
lemma.
Lemma 3.7**.**
There exists a ϑ−invariant set Ω⊆Ω of full P−measure and an F−−adapted random variable
u:Ω→E such that:
[TABLE]
Moreover for all ω∈Ω:
[TABLE]
Proof.
We start by observing (as in [28, Proof of Lemma 3.3]) that the
sequence of sets Fn(ω)=φnπ(ϑ−nω)(E) is decreasing, i.e. Fn+1⊆Fn. Let us write
F(ω)=⋂n≥1Fn(ω). Hence by
Theorem 2.1:
[TABLE]
Now, by the ergodic theorem and Assumption 3.3 there exists a ϑ−invariant set Ω
of full P−measure such that for all ω∈Ω:
[TABLE]
In particular \lim_{n\to\infty}\tau\Big{(}\varphi_{n}(\theta^{-n}\omega)\Big{)}=0, and since arctanh(0)=0 we have that Δ(F)=0. By completeness of E it follows that
F is a singleton. Let us write F(ω)={u(ω)} and extend
u trivially outside of Ω: it is clear that
u is adapted to F−. Since for k∈N and n≥k
[TABLE]
passing to the limit with n→∞ we have: u(ϑkω)=φkπ(ω)u(ω).
Finally, as in the former result, a Taylor expansion guarantees that there
exists a constant c(ω)>0 such that:
Then, applying the logarithm and Birkhoff’s ergodic theorem we find:
[TABLE]
If \mathbb{E}\log{\big{(}\tau(A)\big{)}}={-}\infty we can instead follow the
previous computation with τ(A(ϑiω)) replaced by
τ(A(ϑiω))∨e−M and eventually pass to the limit
M→∞.
To obtain the result uniformly over f,g first observe that via
Theorem 2.1:
[TABLE]
and by a Taylor approximation, since limn→∞τ(φn(ω))=0, there exists a constant c(ω)>0 such
that
[TABLE]
Point (ii) as well as the first property of (iii) follow from
Lemma 3.7.
As for the second property of (iii) we observe that
[TABLE]
so that the estimate is now a consequence of point (i). As for
(iv), we have that for any two measurable A⊆Ω,B⊆E:
[TABLE]
which implies that δu(ω) is invariant (see
Definition 3.1). Finally, to see that
δu(ω) is the unique invariant measure, let μ be any
invariant measure. Then
[TABLE]
where in the last line we used dominated convergence and the results of point
(iii). In particular, we have found that
[TABLE]
implying that μ(dω,df)=δu(ω)(df)P(dω).
Note that the invariant sets in all points can be
chosen equal to the same Ω up to taking
intersections of invariant sets, which are still invariant.
∎
4. Synchronization for linear SPDEs
In this section we discuss how to apply the previous results to stochastic PDEs.
Concrete examples will be covered in the next section. For clarity, nonetheless,
the reader should keep in mind that we want to study ergodic properties of
solutions to Equation (1). Since the associated heat equation
with multiplicative noise (3) is linear and the solution map is
expected to be strictly positive (because the defining differential operator is
parabolic), we may assume that the solution map generates
a continuous, linear, strictly positive random dynamical system φ.
Definition 4.1**.**
A continuous RDS over a discrete IDS (Ω,F,P,ϑ) and on a measure space (X,B) is a map
[TABLE]
such that the following two properties hold:
(i)
Measurability:* φ is B(R+)⊗F⊗B-measurable.*
2. (ii)
Cocycle property:* φ(0,ω)=IdX, for
all ω∈Ω and:*
[TABLE]
We then formulate the following assumptions, under which our main result will
hold.
Assumption 4.2**.**
Let d∈N and β>0. Let (Ωkpz,F,P,ϑ) be a discrete ergodic IDS, over which is defined a continuous RDS
φ:
[TABLE]
There exists a ϑ−invariant set Ω⊆Ωkpz of full P−measure such that the following properties
are satisfied for all ω∈Ω and any T>S>0:
(i)
There exists a kernel K:Ωkpz→Cloc((0,∞);C(Td×Td)) such that for all S≤t≤T:
[TABLE]
2. (ii)
There exist 0<γ(ω,S,T)≤δ(ω,S,T) such that:
[TABLE]
which implies that \mathbb{P}\big{(}\varphi_{t}\in\mathcal{L}_{\mathrm{cp}}(C(\mathbb{T}^{d})),\forall t\in(0,\infty)\big{)}=1.
3. (iii)
There exists a constant C(β,ω,S,T) such that:
[TABLE]
4. (iv)
Consider (E,dH) as in
Lemma 2.2. The following moment estimates are satisfied for any f∈E:
[TABLE]
where φtπ is defined to be the identity outside of
Ω.
The first two assumptions allow us to use the results from the
previous section. The last two will guarantee convergence in appropriate
Hölder spaces. In view of the motivating example and in the setting of the previous
assumption, we say that for z∈Z and h0∈C(Td) the map
[TABLE]
solves Equation (1) if h^{z}(\omega,t)=\log{\big{(}\varphi_{t}(\vartheta^{z}\omega)\exp(h_{0})\big{)}} for φt as in the
previous assumption.
Theorem 4.3**.**
Under Assumption 4.2,
for i=1,2, h0i∈C(Td) and n∈N,
let hi(t)∈C(Td) be the random solution to Equation
(1)
started at time [math] with initial data h0i and evaluated at time t≥0.
Similarly, let hi−n(t)∈C(Td) be the solution started in
−n with initial data h0i and evaluated at time t≥−n.
There exists an invariant set Ω⊆Ωkpz of full P−measure such that for any
0<α<β, for any T>0 and any
ω∈Ω:
(i)
There exists a map
c(h01,h02):Ωkpz×R+→R such that:
[TABLE]
as well as:
[TABLE]
And uniformly over h0i:
[TABLE]
2. (ii)
There exists a random function h∞:Ωkpz→Cloc((−∞,∞);Cα(Td)) and a
sequence of maps c−n(h01):Ωkpz×R+→R for which:
[TABLE]
Passing to the gradient one can omit all constants and find the following
for Burgers’ Equation.
Corollary 4.4**.**
In the same setting as before, it immediately follows that also:
[TABLE]
where the space Cα−1(Td) is understood as the
Besov space B∞,∞α−1(Td) for α∈(0,1).
so that h_{i}(\omega,t)=\log{\big{(}\varphi_{t}^{\pi}(\omega)u_{0}^{i}\big{)}}{+}c_{i}(\omega,t), where ci(ω,t)∈R is the normalization constant:
[TABLE]
Let us write c(ω,t,h01,h02)=c1(ω,t)−c2(ω,t). Similarly, for −n≤t≤0 one has:
[TABLE]
where ci−n(ω,t)=ci(ϑ−nω,n+t).
Also, write c−n(ω,t,h01,h02)=c1−n(ω,t)−c2−n(ω,t). As a first step, we prove the following simpler
since it considers convergence in L∞ instead of Cα - version of
the required result:
[TABLE]
We observe that in view of Assumption
4.2, we can apply Theorem
3.4 in the setting of
Lemma 2.2 with A(ω)=φ1(ω) to see
that there exists a u∞=exp(h∞):Ωkpz→C(Td) such that φnπ(ω)u∞(ω)=u∞(ϑnω). In particular, we define for any t∈R:
[TABLE]
for
any n such that t+n>0 (note that the definition does not depend on
the choice of such n).
With this definition we proceed to prove (10). We start by eliminating the time supremum, since in view of
Inequality (7):
[TABLE]
where we used the definition of the contraction constant τ(⋅)
together with the fact that τ(⋅)≤1 (cf.
Theorem 2.1) to obtain
[TABLE]
so that one can estimate:
[TABLE]
Similarly, also for the backwards case:
[TABLE]
Now, again in view of Assumption 4.2,
we can apply Theorem 3.4 to obtain:
[TABLE]
which via the previous calculation implies
(10). In particular, this also proves the bound
uniformly over h0i at point (i) of the theorem.
Step 2. We pass to prove convergence in Cα(Td) for
0<α<β. Hence consider
α<β fixed and define θ∈(0,1) by α=βθ. As
convergence in C(Td) is already established, to prove
convergence in Cα(Td) one has to control the
α−seminorm [⋅]α of h1−h2. We treat the forwards and backwards
in time cases differently, starting with the first case.
Let us recall the bound
[TABLE]
which is proven in Lemma A.5.
With this bound one can estimate the Hölder seminorm via:
[TABLE]
Here we used that for the Hölder seminorm
[TABLE]
since the seminorm does not vary under translations by a constant.
Since we already proved that the first factor in the product vanishes exponentially fast, our aim will
be to prove that the second factor does not explode exponentially fast. This
amounts to proving the second bound at point (i). To this end, fix
n∈N,T>0 and t∈[n,n+T], and define σ by t=n−1+σ. We can use Lemma A.6 to bound
the last terms by:
[TABLE]
where m(⋅) indicates the minimum of a function and C(β) is the deterministic constant of
Lemma A.6. We can plug this
estimate into Equation (11) to obtain for some
deterministic C(α,β)>0:
[TABLE]
where in the last line we used that logmaxixi=maxilogxi and that ∥φn−1π(ω)u0i∥∞⩾1,
since φn−1π(ω)u0i∈E and hence
∫Tdφn−1π(ω)u0i(x)dx=1.
To conclude, in view of Equation (10), we have to prove
that for i=1,2:
[TABLE]
In particular, the latter inequality also implies the β-Hölder
norm bound of hi at point (i) of the theorem.
Now we observe that for n∈N,n≥1,T>0,t=n−1+σ∈[n,n+T] and for any f∈E:
[TABLE]
Here we used again that φsπ(ω)f lies in E for all
ω and s, and that for g∈E we have m(g)⩽1⩽∥g∥∞,
since it holds that ∫Tdg(x)dx=1. In fact this implies
[TABLE]
so that
[TABLE]
Hence we have reduced (12)
to proving the following:
[TABLE]
Let us start with the last term and bound:
[TABLE]
Here, in order to obtain the last inequality, we have iteratively applied
the following inequality, which holds for any j∈N:
[TABLE]
By Assumption 4.2E[sup1≤σ≤T+1dH(φσπf,f)]<∞, hence by the ergodic theorem for all ω∈Ω (up to reducing Ω):
Here we used that Ω is invariant under ϑ. So if
ω∈Ω, then also ϑ−jω∈Ω.
Now observe that by Lebesgue dominated convergence, since dH(φ1π(ω)f,f)∈L1(Ω) and since τ(⋅)⩽1 as well as limc→∞∏j=1cτ(φ1(ϑjω))=0,∀ω∈Ω, it holds that:
[TABLE]
Hence fix any ε>0 and choose a deterministic c(ε)∈N so that:
[TABLE]
Now we use the bound (14)
together with (15) and
the ergodic theorem to obtain:
[TABLE]
As ε is arbitrarily small we have proven that
[TABLE]
which is of the required order for (13).
To complete the proof of (13) we are left with the term containing
C(β,ϑnω,1,T+1). Once more Assumption
4.2 together with the ergodic
theorem and Lemma A.4 imply that:
[TABLE]
thus completing the proof of (13) and
hence of point (i) of our theorem.
Step 3. Now, let us pass to the convergence in Cα
backwards in time, which completes the proof of point (ii). The proof is
analogous to, but simpler than the one we presented in Step 2. The key
simplification consists in the fact that backwards in time the limit point h∞(ω,t) does not fluctuate (so the argument is essentially
deterministic, and does not rely on the law of large numbers), whereas forwards in time
all paths synchronize along the path h∞(ω,n), whose
distribution does not vary with n, but which fluctuates for fixed ω, as n varies.
Since in
Equation (10) we already proved convergence in the
∥⋅∥∞ norm, we now have to consider only the [⋅]α seminorm. Up to replacing T with
⌈T⌉ assume T∈N. Then, consider n∈N with T<n−1 and −T≤t≤T so that t=−T−1+σ with 1≤σ≤2T+1. As in (11) we define θ=βα∈(0,1) and use the interpolation bound of
Lemma A.5:
[TABLE]
Hence, in view of Equation (10) it suffices to prove
that
[TABLE]
which we can further reduce to
[TABLE]
Since the [⋅]β seminorm is invariant under constant shifts (i.e.
[f+ζ]β=[f]β for any f:Td→R,
ζ∈R), and since
[TABLE]
for some constant ζ(t,T,n,ω,u01)∈R, we can rewrite the term inside the limit as
[TABLE]
At this point we want to exploit the regularising effect of φσ, together with the fact that φn−T−1π(ϑ−nω)u01 is uniformly bounded in n
(depending on ω).
In fact, we observe that (10) implies the
convergence \log\Big{(}\varphi_{n{-}T{-}1}^{\pi}(\vartheta^{{-}n}\omega)u^{1}_{0}\Big{)}\to\log\Big{(}u_{\infty}(\omega,{-}T{-}1)\Big{)} in C(Td) uniformly
over u01. In addition, by the positivity of φ as in
Assumption 4.2 and the fact that
u∞ is invariant under φ, as in
Theorem 3.4, there exists
a c′(ω)>0 such that u∞(ω,−T−1)(x)⩾c′(ω),∀x∈Td. In particular, combining these
two observations we find a 0<c(ω)<c′(ω) and an n0∈N, such that
Hence, applying Lemma A.6 together with the
regularising effect of φσ as in point (iii) of
Assumption 4.2, we obtain for n⩾n0:
[TABLE]
with M(ω)=supn⩾n0∥φn−T−1π(ϑ−nω)u01∥∞<∞ in view
of (10). Hence (16)
is proven, and this concludes the proof of the theorem.
∎
5. Examples
We treat two prototypical examples, which show the range of applicability of the
previous results. First, we consider the KPZ equation driven by a noise that is
fractional in time but smooth in space. In a second example, we consider the
KPZ equation driven by space-time white noise.
5.1. KPZ driven by fractional noise
Fix a Hurst parameter H\in\big{(}\frac{1}{2},1\big{)} and consider
the noise η(t,x)=ξH(t)V(x) for some
V∈C∞(T) and where ξH(t)=∂tβH(t)
for a fractional Brownian motion βH of Hurst parameter
H. We restrict to H>21 because the case H=21 is identical to the setting in
[36], while for H<21 one encounters
difficulties with fractional stochastic calculus that lie beyond the scopes of this work.
For convenience, we let us define the noise ξH via its spectral
covariance function, see [34, Section 3], namely as the
Gaussian process indexed by functions f:R→R such that
∫R∣σ∣1−2H∣f^(σ)∣2dσ<∞ (with
f^ being the temporal Fourier transform), with covariance:
[TABLE]
For the statement of the following lemma, recall the definition of
Haα(R) given in (5).
Lemma 5.1**.**
Fix any H∈(21,1),α<H−1,a>21. Let
ξH be the Gaussian process as defined by
(17). Then, almost surely ξH takes
values in Haα(R). Next, define
Ωkpz=Haα(R) and F=B(Haα(R)) and let P be the law of ξH on
Ωkpz.
Furthermore, let {ϑz}z∈Z be the integer translation group,
which acts on smooth functions φ∈S(R) by:
[TABLE]
and which is extended by duality to all distributions ω∈Ωkpz:
[TABLE]
Then the space
(Ωkpz,F,P,ϑ) forms an ergodic IDS.
In addition, up to modifying ξH on a ϑ−invariant null-set
N0, for any ω∈Ωkpz there exists a βH(ω)∈Clocα+1(R) with:
[TABLE]
Moreover, (βtH)t≥0 has the law of a fractional
Brownian motion of parameter H.
Proof.
To show that ξH takes values in Haα almost surely,
observe that:
[TABLE]
Then one can bound:
[TABLE]
where in the first line we used that 2a>1. In the second line, we used that for j≥0ϱj(⋅)=ϱ(2−j⋅) for a function ϱ with support in an
annulus (i.e. a set of the form A={σ:A<∣σ∣<B} for some 0<A<B). This provides the required regularity estimate:
[TABLE]
The ergodicity is a consequence of the criterion in
Proposition 6.1 with B=Haα(R), provided that we can verify
condition (36) on the
covariances. Observe that Haα(R) is a separable Banach
space with dual (Haα(R))∗=H−a−α(R) (this
result follows with the same calculations of [37, Theorem 2.11.2]
for the unweighted case, see also the discussion in [37, Section 7.2]), and that
the space S(R) of Schwartz functions, i.e. smooth functions with polynomial
decay at infinity of any order, is dense in Hbβ(R) for any
value of β∈R and b>0 (see [37, Remark 7.2.2]).
In view of these facts, and since we have shown that E∥ξH∥B2<∞, by
condition (37) of
Proposition 6.1 it suffices to prove that for any
φ,φ′∈S(R):
[TABLE]
Here we can compute as follows:
[TABLE]
To obtain the last line we made use of the Riemann-Lebesgue lemma, since
f(σ)=∣σ∣1−2Hφ^(σ)φ′^(σ) satisfies f∈L1(R). In fact,
f is integrable near σ=0 because H∈(1/2,1) while
f(σ) decays polynomially fast for σ→±∞ since
φ,φ′∈S(R). Hence, ergodicity is proven.
Now, one can define the primitive
βH(ω) through
[TABLE]
so that following [34, Section 3] (βtH)t≥0 has the
law of a fractional Brownian motion. In particular, almost surely, the
process βtH(ω) has the required regularity. The null-set
N0 on which the result does not hold can be chosen to be
ϑ−invariant, by defining N0=⋃z∈ZϑzN0. Then one can set ξH=0 on N0.
∎
The next step is to show wellposedness of the SPDE:
[TABLE]
We will work pathwise: since our noise is sufficiently regular, i.e. H>21 we can use Young integrals to make sense of the solution
(for H=21, we would need Itô integration instead). We will use
the following result:
Lemma 5.2**.**
For any α,β,T>0 such that α+β>1 and f∈Cα([0,T]),g∈Cβ([0,T]) one can define the Young integral
[TABLE]
The map I is continuous between the spaces:
[TABLE]
satisfying the bound
[TABLE]
If g∈C1([0,T]) the integral coincides with
[TABLE]
An instructive proof of this result is given in [19, Proposition
6.11] (for
α1−variation spaces instead of Hölder spaces), or in
[18, Chapter 4].
Definition 5.3**.**
Consider H∈(21,1) and let Pt be the periodic heat semigroup:
[TABLE]
Fix
ω∈Ωkpz and ξH as in
Lemma 5.1. We
say that u:Ωkpz×R+×T→R is a mild solution to
Equation (18) if for any
α<H and S>0
[TABLE]
and if u satisfies:
[TABLE]
where, since the time regularities α<H of the integrand and
α′<H of t↦βtH(ω) can be chosen so that
α+α′>1, because H∈(1/2,1), the integral in (19) is
well-defined as a Young integral: see Lemma 5.2.
We can now prove the following result.
Lemma 5.4**.**
Consider H∈(21,1) and Ωkpz,ξH as in
Lemma 5.1. For all ω∈Ωkpz, for every u0∈C(T) there exists a unique
mild solution u to Equation (18) such that
for any α<H,k∈N,0<S<T<∞:
[TABLE]
Moreover, the solution u can be represented as:
[TABLE]
with
[TABLE]
and w a solution to
[TABLE]
*The solution map (φt(ω)u0)(x):=u(ω,t,x)
defines a continuous linear RDS on C(T).
*
Proof.
Let us fix any ω∈Ωkpz. Since all the
following arguments work pathwise, we will henceforth omit writing the
dependence on ω. To solve
Equation (18), observe that (s,x)↦Pt−sV(x)∈C∞([0,t]×T), since V is smooth.
We can then use Lemma 5.2 to define X(t,x) by
Equation (20), so that formally X(t,x) solves:
[TABLE]
We will require a bound on the temporal regularity of X. To this end, let us
write by integration by parts
[TABLE]
so that taking spatial derivatives in the above representation we obtain the
following regularity:
[TABLE]
for any α∈(21,H),T>0,k∈N0.
We also observe that for any other path f∈Cα([0,T];R), by
Lemma 5.2 (taking smooth approximations of
βH and using the continuity of the Young integral)
[TABLE]
Now, as a consequence of Lemma A.1 there exists a
unique mild solution w to Equation (21) and the same result implies that the
solution w satisfies:
[TABLE]
for any T>0,k∈N0.
At this point, let us define u as u=eXw. For any fixed S>0 we find that, by the chain rule
(which holds in view of Lemma 5.2, by taking smooth approximations
of the integrand and integrator)
for any k∈N0,α∈(21,H) and 0<S<T. In particular, we find that
[TABLE]
Then we can define u via the Young integral:
[TABLE]
An application of the chain rule show that u−u is a smooth
solution to (∂t−∂x2)(u−u)=0, and
hence u=u. To conclude that u satisfies
Equation (19) we need that
[TABLE]
which follows since limS→0w(S,⋅)=u0.
Conversely, one can follow the steps of this proof
backwards to find that every mild solution is of the required
form u=eXw.
Finally, Lemma A.1 also implies that the
solution map is, for fixed t≥0, an element of L(C(T)). To
conclude we have to show that the cocycle property holds for φ,
namely that for n∈N0:
[TABLE]
First observe that Xt+n(ω)−PtXn(ω)=Xt(ϑnω). Hence, recalling the decomposition of φ:
[TABLE]
so that the cocycle property is proven since one can check that wt(ω)=ePtXn(ω)wt+n(ω) solves
Equation (21) with X(ω) replaced by
X(ϑnω) and w0=φt(ω)u0.
∎
We can now prove that Equation (18) falls in the
framework of the theory developed in the previous sections.
Proposition 5.5**.**
The RDS φ introduced in
Lemma 5.4 satisfies, for any
β>0, Assumption 4.2.
In particular, for all ω∈Ωkpz, for any u0∈C(T),u0>0, the function t↦log(φt(ω)u0)=:ht(ω) is the unique mild solution to
[TABLE]
meaning that for any α<H,k∈N,0<S<T<∞:
[TABLE]
and for all 0<S⩽t,ζ>0 and x∈T:
[TABLE]
Such solution satisfies all the results of
Theorem 4.3.
Proof.
Let us prove that φ satisfies
Assumption 4.2. Points (i)−(iii) of this assumption have to be verified for any ω∈Ωkpz: to lighten the notation
we will consider such ω fixed and may not write explicitly the
dependence on it, as long as no confusion is possible.
(i). Let us start with the kernel representation of φ. Formally, one can
write:
[TABLE]
This can be made rigorous, if one can start
Equation (18) in δy. In
Lemma A.2 we show that that for any γ>0,{δy}y∈T⊆B1,∞−γ, and
∥δx−δy∥B1,∞−γ≲∣x−y∣γ. In addition, by Lemma 5.4 the solution φtu0=eXtwt, where X(t,x)=∫0tPt−s[V](x)dβsH does not depend on u0 and w is the solution to:
[TABLE]
As the coefficients (∂xX)2 and ∂xX are
smooth in space and continuous in time, Lemma A.1 implies that the equation for
w can be started also in u0=δy. Let us denote with
wy such solution. The same Lemma A.1
implies the following bound, for any η∈[0,2),t∈[S,T]
and some q>0:
[TABLE]
We can choose η,γ so that η−γ>1. In this case, by
Besov embeddings
[TABLE]
Hence K in Equation (26) is rigorously defined as K(t,x,y)=eX(t,x)wy(t,x). In particular, putting together the previous bounds,
we have that
[TABLE]
which implies that for any t>0,K(t)∈C(T×T). That K is a
fundamental solution for the PDE follows by linearity, thus concluding the
proof of (i) in
Assumption 4.2.
(ii). The fact that K is strictly positive, as required in point (ii) of the assumptions
is the consequence of a strong maximum principle (cf.
[30, Theorem 2.7]) applied to
w, since eX>0.
(iii). The smoothing effect of point (iii) in
Assumption 4.2 follows again from
the representation φtu0=eXtwt and the spatial
smoothness of both X and w, which we already showed in the proof of
Lemma 5.4.
(iv). In particular, the just quoted smoothing
effect can be made quantitative, via the estimate of
Lemma A.1, to obtain that for 0<S<T<∞ there exist deterministic constants C(S,T),q≥0 such that:
[TABLE]
Note that at first Lemma A.1 allows to
regularize at most by η<2, but splitting the interval [0,S] into
small pieces and applying iteratively the result on every piece provides the
result for arbitrary β.
Now observe that in view of (20) for any
k∈N:
[TABLE]
for any α∈(21,H), as an application of
Lemma 5.2. Since s↦Pt−s[∂xV](x) is smooth (since V is smooth), we have obtained:
[TABLE]
Now, for any q⩾0
[TABLE]
This follows from Kolmogorov’s continuity criterion, or via calculations
similar to those in Lemma 5.1
(note that we show E∥ξH∥Haα<∞, but
similar calculations show that E∥ξH∥B∞,∞α,aq<∞, for any q⩾0). We can conclude that:
[TABLE]
thus proving the first average bound of point (iv) in
Assumption 4.2.
As for the second bound, in view of
Lemma 2.2, one has:
[TABLE]
so that our aim is to bound
[TABLE]
On one side, one has the upper bound:
[TABLE]
which is integrable. As for the lower bound, observe that
log(φt(ω)f)=Xt(ω)+logwt(ω).
One can check that vt(ω)=logwt(ω) is a
solution to the equation:
[TABLE]
By comparison (cf. [30, Theorem 2.7]),
one has: v(t,x)≥−∥logf∥∞,∀t≥0,x∈T. So
assuming that q≥1, one has overall:
[TABLE]
which is once again integrable, completing the proof of (iv).
We conclude that the required assumptions are satisfied
and we can apply Theorem 4.3.
Finally, the fact that ht satisfies the claimed smoothness assumption and is a mild
solution to the KPZ equation driven by fractional noise follows by the same
steps of the proof of Lemma 5.4.
∎
Remark 5.6**.**
In the same setting as in
Proposition 5.5, for any h01,h02∈C(T) the
constant c(ω,t,h01,h02) in
Theorem 4.3 can be chosen
independent of time.
Proof.
Observe that it is
sufficient to prove that there exists a constant c(ω,h01,h02) such that for every ω∈Ω (for an invariant set Ω of full
P−measure) and any T>0:
In particular this implies that there exists a constant c(ω,h01,h02):=limt→∞c(ω,t,h01,h02) and in addition
[TABLE]
for any 0<c<-\mathbb{E}\log\big{(}\tau(\varphi_{1})\big{)}, which proves the required result.
∎
5.2. KPZ driven by space-time white noise
In this section we consider the random force η in (1)
to be space-time white noise ξ in one spatial dimension. That is, a Gaussian processes indexed by
functions in L2(R×T) such that:
[TABLE]
For the next result recall the definition of Haα(R×T)
from (4).
Lemma 5.7**.**
Fix any α<−1 and a>21. Let ξ be a Gaussian
process as defied in (29). Then, almost surely ξ takes values in
Haα(R×T). In particular
[TABLE]
Next, define Ωkpz=Haα(R×T),F=B(Haα(R×T))
and let P be the law of ξ on Ωkpz.
Furthermore, let {ϑz}z∈Z be the integer translation group,
which acts on smooth functions φ∈S(R×T) by:
[TABLE]
and which is extended by duality to all distributions ω∈Ωkpz:
[TABLE]
Then the space
(Ωkpz,F,P,ϑ) forms an ergodic IDS.
Proof.
We start by showing that ξ takes values in Haα(R×T) almost surely. By definition:
[TABLE]
and for the latter one has:
[TABLE]
where we used that 2a>1 and that for j≥0ϱj(⋅)=ϱ(2−j⋅) for a function ϱ with support in
an annulus. We can conclude that
[TABLE]
The last step in the proof is to show ergodicity of the IDS. Here we apply
Proposition 6.1, so we have to check that
condition (36). We have proven
that E∥ξ∥Haα2<∞, and (as in the proof of
Lemma 5.1) let us note that
(Haα(R×T))∗=Ha−α(R×T) and
S(R×T) is dense in Hbβ(R×T) for every
β∈R,b>0. Hence we can deduce ergodicity from the simplified
criterion (37), namely we have to prove
that for φ,φ′∈S(R×T):
[TABLE]
which is true because of the rapid decay at infinity of φ,φ′. This concludes the proof.
∎
Now we will consider h,u the respective solutions to the KPZ and
stochastic heat equation driven by space-time white noise:
[TABLE]
in the sense of [23, Theorem 6.15].
Here the presence of the infinity “∞” indicates the necessity of
renormalisation to make sense of the solution.
Wellposedness of the stochastic heat equation (31)
can be proven also with martingale techniques, which do not provide a solution
theory for the KPZ equation, though. Instead, here we make use of pathwise
approaches to solving the above equations [25, 26, 22], that require tools such as regularity
structures or paracontrolled distributions. The main reference for us will be
[23], which provides both a comprehensible
introduction (see for example Chapter 3) and a complete picture of the tools available in paracontrolled
analysis. Such theories consider smooth
approximations ξε of the noise ξ, for which the equations are
well-posed, and study the convergence of the solutions as ε→0. The
renormalisation can then be understood as a Stratonovich-Itô correction
term. We refer to the mentioned works as pathwise approaches, since
they are completely deterministic, given the realization of the noise and some
functionals thereof. These functionals are collected in a random variable
called the enhanced noiseY(ω).
In Lemma A.3 we recall the construction of the
enhanced noise and record its transformation under ϑz.
Lemma A.3 together with the existing
solution theory for the equation guarantee that the solution map forms a random
dynamical system. This is the content of the following result, which stands in
analogy to Lemma 5.4 for fractional noise.
Lemma 5.8**.**
Consider (Ωkpz,F,P) as in
Lemma 5.7. Then for every ω∈Ωkpz and u0∈C(T) there exists a unique
solution u to Equation (31) in the sense of
[23, Theorem 6.15], associated to the enhanced
noise Y(ω) as in Lemma A.3
and the solution map φt(ω)u0=ut defines a continuous
linear RDS on C(T).
Proof.
Fix ω∈Ω. The existence and uniqueness result [23, Theorem 6.15]
builds a solution to Equation (31) that depends continuously on the enhanced noise
Y(ω), and is continuous and linear with respect to initial
conditions u0∈C(Td) (in fact the theorem allows for u0∈B∞,∞−β for β>0 sufficiently small). The solution is
unique in a space of paracontrolled functions for which the product u⋅(ξ−∞) is defined in and appropriate pathwise sense.
What we have to prove is that the solution map satisfies the cocycle property:
φn+t(ω)u0=φt(ϑnω)∘φn(ω)u0. From [23, Theorem
4.5] (see the arguments that
precede the theorem for a proof), the solution φt+n(ω)u0 can be
represented as:
[TABLE]
where the terms inside the exponential are recalled in
Lemma A.3, and with wP solving
[TABLE]
in the paracontrolled sense of [23, Theorem 6.15].
Now one can use Equation (38) of
Lemma A.3 to obtain:
[TABLE]
where
[TABLE]
In turn, wP(ω) satisfies w0P(ω)=e−Y0(ϑnω)φn(ω)u0, and the proof of the cocycle property is complete if we show that wP(ω) is a solution to Equation (32) with ω replaced be
ϑnω and initial condition e−Y0(ϑnω)φn(ω)u0. If the enhanced noise Y is a vector of
smooth functions the fact that wP solves the required equation is
immediate. Hence the claim follows by taking smooth approximations and using
the continuity of the solution theory in [23, Theorem
6.15] with respect to the enhanced noise.
∎
The RDS φ introduced in the previous lemma falls into the framework
of Section 4. To prove this, we follow the same
approach of
Proposition 5.9, which
addresses the fractional noise case. First, we will construct the random kernel
K(ω,t,x,y) for the solution map φt(ω). Here the
key point is to use results from [23] to start
Equation (31) in u0(x)=δy(x). Then points (i)−(iii) of Assumption 4.2
follow by treating (31) as a pathwise perturbation of
the heat equation: these results have been already established, see e.g.
[11]. The most
challenging part of the proof is to prove the moments bounds of point
(iv) of Assumption 4.2. As in
Proposition 5.5 the proof of these
bounds relies on an appropriate decomposition φt(ω)u0=eZt(ω)wt(ω), where Zt is a functional of the noise,
together with a lower bound on wt (first established in
[33]), which is the consequence of a comparison
principle.
Proposition 5.9**.**
The RDS φ be defined as in Lemma
5.8 satisfies
Assumption 4.2 for any β<21. In particular, the results of Theorem
4.3 apply.
Proof.
We will check, one by one, the requirements of
Assumption 4.2. Since the first three
points are required to hold for every realization of the noise, let us fix ω∈Ωkpz.
(i). We start by checking the first property of
Assumption 4.2. We can define the kernel by K(ω,t,x,y)=φt(ω)(δy)(x), where δy indicates a
Dirac δ centered at y. Here
φt(ω)(δy) is the solution to
(31) with u0=δy. This solution
exists in view of
[23, Theorem 6.15]: in fact, this result shows
that for any 0<β,ζ<21, and any p∈[1,∞]
the solution map φ(ω) can be extended to a map
[TABLE]
where we used that, in the language of [23], the space
Drheexp,δ of paracontrolled distributions,
in which the solution lives, embeds in Cloc((0,∞);Bp,∞β), for suitable values of δ
as described in the quoted theorem. Near t=0 one expects that
∥φt(ω)u0∥Bp,∞β blows up, if
u0∈Bp.∞−ζ. The exact speed of this blow-up is
provided as well in the theorem, but since we are not interested in quantifying the
blow-up, we can exploit the result we wrote to deduce the apparently stronger:
[TABLE]
This follows by Besov embedding: for p≤q: Bp,∞α(Td)⊆Bq,∞α−d(p1−q1)(Td). Assuming without loss of generality that β,ζ>41, uniformly over 0<S≤t≤T<∞ one can
bound:
Now since {δy}y∈T⊆B1−ζ for any
ζ>0, as proven in Lemma A.2, the kernel
K(ω,t,x,y) is well-defined. The continuity in t,x follows
from the previous estimates, while the continuity in y follows from
(34) together with
Lemma A.2.
(ii). We can pass to the second property of
Assumption 4.2. The upper bound δ(ω,S,T) is a
consequence of the continuity of the kernel K. The lower bound
γ(ω,S,T) is instead a consequence of a strong maximum
principle which, implies that K(ω,t,x,y)>0,∀t>0,x,y∈T. In this pathwise setting, the strong maximum principle is proven in
[11, Theorem 5.1]
(it was previously established in
[32] with probabilistic techniques).
(iii). The third property is a consequence of
Equation (34), by defining C(ω,β,S,T):=C(ω,β,41,∞,S,T), so we are left with only the last
property to check.
(iv). We start with the fact that
[TABLE]
To see that this is the case, observe that there exists some deterministic
A(β,S,T),q≥1 such that:
[TABLE]
that is we can choose C(ω,β,S,T):
[TABLE]
Inequality (35) is implicit in the proof of [23, Theorem
6.15], since the proof relies on a Picard
iteration and a Gronwall argument. The bound can be found explicitly in
[33, Theorem 5.5 and Section 5.2]: here the
equation in set on the entire line R, which is a more general setting,
since one can always extend the noise periodically.
Thus we have \mathbb{E}\log{C(\beta,S,T)}\lesssim_{\beta,S,T}1+\mathbb{E}\big{[}\|\mathbb{Y}\|_{\mathcal{Y}_{\mathrm{kpz}}}^{q}\big{]}, so that the result is
proven if one shows that for any q≥0: E∥Y∥Ykpzq<∞, which is the content of
[23, Theorem 9.3].
We then pass to the second bound in (iv). Since by the triangle inequality the bound
does not depend on the choice of f, set f=1. It is thus enough to
prove that:
[TABLE]
We proceed as in the proof of
Proposition 5.9. On one
side one has the upper bound:
[TABLE]
which is integrable by the arguments we just presented. As for the lower bound, the approach of
Proposition 5.9 has to
be adapted to the present singular setting. One way to perform a similar
calculation has been already developed [33, Lemma 3.10]. We sketch again the
argument here for clarity, assuming that the elements of Y(ω) are
smooth. We will eventually refer to the appropriate wellposedness results to complete the proof.
Recall that φt(ω)u0=eYt(ω)+Yt\scalebox0.8\leavevmodeto4.85pt\vboxto5.2pt\pgfpicture\makeatletter\lower-0.2ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke\pgfsys@roundcap\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@moveto0.0pt0.0pt\pgfsys@lineto-1.4726pt4.0459pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@moveto-0.7226pt4.0459pt\pgfsys@curveto-0.7226pt4.46011pt-1.05838pt4.7959pt-1.4726pt4.7959pt\pgfsys@curveto-1.88681pt4.7959pt-2.2226pt4.46011pt-2.2226pt4.0459pt\pgfsys@curveto-2.2226pt3.63168pt-1.88681pt3.2959pt-1.4726pt3.2959pt\pgfsys@curveto-1.05838pt3.2959pt-0.7226pt3.63168pt-0.7226pt4.0459pt\pgfsys@closepath\pgfsys@moveto-1.4726pt4.0459pt\pgfsys@fillstroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.0-1.4726pt4.0459pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@moveto0.0pt0.0pt\pgfsys@lineto1.4726pt4.0459pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@moveto2.2226pt4.0459pt\pgfsys@curveto2.2226pt4.46011pt1.88681pt4.7959pt1.4726pt4.7959pt\pgfsys@curveto1.05838pt4.7959pt0.7226pt4.46011pt0.7226pt4.0459pt\pgfsys@curveto0.7226pt3.63168pt1.05838pt3.2959pt1.4726pt3.2959pt\pgfsys@curveto1.88681pt3.2959pt2.2226pt3.63168pt2.2226pt4.0459pt\pgfsys@closepath\pgfsys@moveto1.4726pt4.0459pt\pgfsys@fillstroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.01.4726pt4.0459pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\lxSVG@closescope\endpgfpicture(ω)+2Yt\scalebox0.8\leavevmodeto7pt\vboxto8.92pt\pgfpicture\makeatletter\lower-0.2ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke\pgfsys@roundcap\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@moveto0.0pt0.0pt\pgfsys@lineto1.4726pt4.0459pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@moveto2.2226pt4.0459pt\pgfsys@curveto2.2226pt4.46011pt1.88681pt4.7959pt1.4726pt4.7959pt\pgfsys@curveto1.05838pt4.7959pt0.7226pt4.46011pt0.7226pt4.0459pt\pgfsys@curveto0.7226pt3.63168pt1.05838pt3.2959pt1.4726pt3.2959pt\pgfsys@curveto1.88681pt3.2959pt2.2226pt3.63168pt2.2226pt4.0459pt\pgfsys@closepath\pgfsys@moveto1.4726pt4.0459pt\pgfsys@fillstroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.01.4726pt4.0459pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@moveto0.0pt0.0pt\pgfsys@lineto-2.15277pt3.72871pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@moveto-2.15277pt3.72871pt\pgfsys@lineto-0.68018pt7.77461pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@moveto0.06982pt7.77461pt\pgfsys@curveto0.06982pt8.18883pt-0.26596pt8.52461pt-0.68018pt8.52461pt\pgfsys@curveto-1.09439pt8.52461pt-1.43018pt8.18883pt-1.43018pt7.77461pt\pgfsys@curveto-1.43018pt7.3604pt-1.09439pt7.02461pt-0.68018pt7.02461pt\pgfsys@curveto-0.26596pt7.02461pt0.06982pt7.3604pt0.06982pt7.77461pt\pgfsys@closepath\pgfsys@moveto-0.68018pt7.77461pt\pgfsys@fillstroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.0-0.68018pt7.77461pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@moveto-2.15277pt3.72871pt\pgfsys@lineto-3.62537pt7.77461pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@moveto-2.87537pt7.77461pt\pgfsys@curveto-2.87537pt8.18883pt-3.21115pt8.52461pt-3.62537pt8.52461pt\pgfsys@curveto-4.03958pt8.52461pt-4.37537pt8.18883pt-4.37537pt7.77461pt\pgfsys@curveto-4.37537pt7.3604pt-4.03958pt7.02461pt-3.62537pt7.02461pt\pgfsys@curveto-3.21115pt7.02461pt-2.87537pt7.3604pt-2.87537pt7.77461pt\pgfsys@closepath\pgfsys@moveto-3.62537pt7.77461pt\pgfsys@fillstroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.0-3.62537pt7.77461pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\lxSVG@closescope\endpgfpicture(ω)wtP, where
wP solves Equation (32). Then define:
[TABLE]
Assuming that b(Y),c(Y) are smooth one sees that hP=logwP solves:
[TABLE]
By comparison, hP≥−hP, with the latter solving:
[TABLE]
In particular
[TABLE]
where wP solves:
[TABLE]
Note that with respect to the equation in the proof of
[33, Lemma 3.10] some factors 2 are out of
place: this is because here we consider the operator ∂x2 instead of 21∂x2.
The equation for wP is almost identical to the one for
wP and admits a paracontrolled solution
as an application of [33, Proposition 5.6]. In
particular the quoted result implies that:
[TABLE]
for some C,q≥1. Since ∥Y∥∞+∥Y\scalebox0.8\leavevmodeto4.85pt\vboxto5.2pt\pgfpicture\makeatletter\lower-0.2ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke\pgfsys@roundcap\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@moveto0.0pt0.0pt\pgfsys@lineto-1.4726pt4.0459pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@moveto-0.7226pt4.0459pt\pgfsys@curveto-0.7226pt4.46011pt-1.05838pt4.7959pt-1.4726pt4.7959pt\pgfsys@curveto-1.88681pt4.7959pt-2.2226pt4.46011pt-2.2226pt4.0459pt\pgfsys@curveto-2.2226pt3.63168pt-1.88681pt3.2959pt-1.4726pt3.2959pt\pgfsys@curveto-1.05838pt3.2959pt-0.7226pt3.63168pt-0.7226pt4.0459pt\pgfsys@closepath\pgfsys@moveto-1.4726pt4.0459pt\pgfsys@fillstroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.0-1.4726pt4.0459pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@moveto0.0pt0.0pt\pgfsys@lineto1.4726pt4.0459pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@moveto2.2226pt4.0459pt\pgfsys@curveto2.2226pt4.46011pt1.88681pt4.7959pt1.4726pt4.7959pt\pgfsys@curveto1.05838pt4.7959pt0.7226pt4.46011pt0.7226pt4.0459pt\pgfsys@curveto0.7226pt3.63168pt1.05838pt3.2959pt1.4726pt3.2959pt\pgfsys@curveto1.88681pt3.2959pt2.2226pt3.63168pt2.2226pt4.0459pt\pgfsys@closepath\pgfsys@moveto1.4726pt4.0459pt\pgfsys@fillstroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.01.4726pt4.0459pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\lxSVG@closescope\endpgfpicture∥∞+∥Y\scalebox0.8\leavevmodeto7pt\vboxto8.92pt\pgfpicture\makeatletter\lower-0.2ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke\pgfsys@roundcap\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@moveto0.0pt0.0pt\pgfsys@lineto1.4726pt4.0459pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@moveto2.2226pt4.0459pt\pgfsys@curveto2.2226pt4.46011pt1.88681pt4.7959pt1.4726pt4.7959pt\pgfsys@curveto1.05838pt4.7959pt0.7226pt4.46011pt0.7226pt4.0459pt\pgfsys@curveto0.7226pt3.63168pt1.05838pt3.2959pt1.4726pt3.2959pt\pgfsys@curveto1.88681pt3.2959pt2.2226pt3.63168pt2.2226pt4.0459pt\pgfsys@closepath\pgfsys@moveto1.4726pt4.0459pt\pgfsys@fillstroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.01.4726pt4.0459pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@moveto0.0pt0.0pt\pgfsys@lineto-2.15277pt3.72871pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@moveto-2.15277pt3.72871pt\pgfsys@lineto-0.68018pt7.77461pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@moveto0.06982pt7.77461pt\pgfsys@curveto0.06982pt8.18883pt-0.26596pt8.52461pt-0.68018pt8.52461pt\pgfsys@curveto-1.09439pt8.52461pt-1.43018pt8.18883pt-1.43018pt7.77461pt\pgfsys@curveto-1.43018pt7.3604pt-1.09439pt7.02461pt-0.68018pt7.02461pt\pgfsys@curveto-0.26596pt7.02461pt0.06982pt7.3604pt0.06982pt7.77461pt\pgfsys@closepath\pgfsys@moveto-0.68018pt7.77461pt\pgfsys@fillstroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.0-0.68018pt7.77461pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@moveto-2.15277pt3.72871pt\pgfsys@lineto-3.62537pt7.77461pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@moveto-2.87537pt7.77461pt\pgfsys@curveto-2.87537pt8.18883pt-3.21115pt8.52461pt-3.62537pt8.52461pt\pgfsys@curveto-4.03958pt8.52461pt-4.37537pt8.18883pt-4.37537pt7.77461pt\pgfsys@curveto-4.37537pt7.3604pt-4.03958pt7.02461pt-3.62537pt7.02461pt\pgfsys@curveto-3.21115pt7.02461pt-2.87537pt7.3604pt-2.87537pt7.77461pt\pgfsys@closepath\pgfsys@moveto-3.62537pt7.77461pt\pgfsys@fillstroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.0-3.62537pt7.77461pt\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\lxSVG@closescope\endpgfpicture∥∞≲∥Y∥Ykpz, one has overall that:
[TABLE]
Together with the previous results and the moment bound on E∥Y∥q we already recalled, this proves that:
[TABLE]
Hence the proof is complete.
∎
Remark 5.10**.**
As an alternative to our proof of a lower bound to ht=logφt(ω)u0, it
seems possible to use an optimal control representation of
h, see [23, Theorem 7.13]. Both
approaches rely crucially on the
pathwise solution theory for the KPZ equation.
Remark 5.11**.**
In the previous proposition we have proven that we can apply Theorem
4.3. The latter guarantees synchronization up to
subtracting time-dependent constants c(ω,t). In fact it seems possible to choose
c(ω,t)≡c(ω) for a time-independent c(ω). For fractional noise we could show this in
Remark 5.6, but in the argument we made use of the spatial
smoothness of the noise to write an ODE for the constant c(ω,t):
Equation (28).
It seems reasonable to expect that the approach of Remark 5.6 can be
lifted to the space-time white noise setting by defining the product which
appears in the ODE for example in a paracontrolled way. To complete the
argument one would need to control the paracontrolled, and not only the
Hölder norms in the convergences of Theorem
4.3. This
appears feasible, but falls beyond the aims of the present paper.
6. Mixing of Gaussian fields
Let us state a general criterion which ensures that a possibly
infinite-dimensional Gaussian field is mixing (and hence ergodic). This is a
generalization of a classical result for one-dimensional processes, cf.
[13, Chapter 14]. We indicate with
B∗ the dual of a Banach space B and write ⟨⋅,⋅⟩ for the dual pairing.
Proposition 6.1**.**
Let B be a separable Banach space. Let μ be a Gaussian
measure on (B,B(B)) and ϑ:N0×B→B a dynamical system which leaves μ
invariant. Let ξ be any random variable with values in
B and law μ. The condition
[TABLE]
implies that the system is mixing, that is for all A,B∈B(B):
First, we reduce ourselves to the finite-dimensional case. Indeed, note that
the sequence (ξ,ϑnξ) is tight in B×B, because ϑ leaves μ invariant. Furthermore,
tightness
implies that the sequence is flatly concentrated (cf. [14, Definition
2.1]), that is for every ε>0 there exists a
finite-dimensional linear space Sε⊆B×B such that:
[TABLE]
Hence, it is sufficient to check the mixing property for A,B∈B(Sε).
This means that there exists an n∈N and φi∈B∗ for i=1,…,n such that we have to check the mixing
property for the vector:
[TABLE]
In this setting and in view of our assumptions the result on the mixing
property follows from [20, Theorem 2.3].
Finally, we have to prove that if E∥ξ∥B2<∞, then it suffices to check
condition (37) for φ,φ′∈S. Indeed take any ψ,ψ′∈B∗. Since S is dense, consider for any ε∈(0,1) a pair φε,φε′∈S such that
[TABLE]
Then define M>0 by
[TABLE]
We can bound, for every n∈N:
[TABLE]
In particular, since by assumption φε,φε′ satisfy
condition (37), we have proven that:
[TABLE]
As ε is arbitrary this proves that
condition (36) is true.
∎
Appendix A
Lemma A.1**.**
Let Pt be the heat semigroup. One can estimate, for α∈R,β∈[0,2),p∈[1,∞] and any T>0:
[TABLE]
In addition, if one chooses parameters α,γ∈R such that for
some β∈[1,2) and for ζ:=γ∧α+β it
holds that
[TABLE]
then, for any b∈L∞([0,T];B∞,∞γ(Td;Rd)),c∈L∞([0,T];B∞,∞γ(Td)) and w0∈Bp,∞α(Td), for any
p∈[1,∞), there exists a unique mild solution w to:
[TABLE]
meaning that
[TABLE]
Moreover, there exists a q≥0 and, for any time horizon T>0, a
constant C(T)>0 such that:
[TABLE]
Proof.
The estimate regarding the heat kernel is classical. For a reference from the
field of singular SPDEs see [22, Lemma
A.7]. Let us pass to the PDE. Here consider
any w such that M:=sup0≤t≤Tt2β∥w∥Bp,∞ζ<∞, and let N:=\sup_{0\leq t\leq T}\Big{\{}\|b_{t}\|_{B^{\gamma}_{\infty,\infty}(\mathbb{T}^{d};\mathbb{R}^{d})}+\|c_{t}\|_{B^{\gamma}_{\infty,\infty}(\mathbb{T}^{d})}\Big{\}}. Then consider:
[TABLE]
It follows from the smoothing effect of the heat kernel that:
[TABLE]
Now from our condition on the coefficient and estimates on products of
distributions (see [4, Theorem 2.82 and
2.85]) the latter term can in
turn be bounded by:
[TABLE]
It follows that for small T>0 the map I is a contraction providing
the existence of solutions for small times. By linearity and a Gronwall-type
argument, this estimate also provides the required a-priori bound.
∎
Lemma A.2**.**
For any γ>0, the inclusion {δy}y∈Td⊆B1,∞−γ holds. Moreover, there exists an
L(γ)>0 such that:
[TABLE]
Proof.
We divide the proof in two
steps. Recall that by definition we have to bound supj≥−12−γj∥Δj(δx−δy)∥L1.
Hence we choose j0 as the smallest integer such that 2−j0≤∣x−y∣. We first look at small scales j≥j0 and then
at large scales j<j0. For small scales, by the Poisson summation formula,
since ϱj(k)=ϱ0(2−jk), and by defining
Kj(x)=FR−1ϱj(x)=2jK(2jx) for some
K∈S(R) (the space of tempered distributions):
[TABLE]
While for large scales, since we have ∣2j(x−y)∣≤1, applying the
Poisson summation formula, by the mean value theorem and since K∈S(R) (the Schwartz space of functions):
[TABLE]
The result follows.
∎
Lemma A.3**.**
Fix any α<21. Consider the space
[TABLE]
with the norm ∥⋅∥Ykpz as in [23, Definition
4.1]. There exists a random variable Y:Ωkpz→Ykpz which coincides almost surely
with the random variable constructed in [23, Theorem
9.3] and is given by:
[TABLE]
where the latter solve (formally):
[TABLE]
Here Π×f=f−∫f(x)dx and f\varodotg=∑∣i−j∣≤1ΔifΔjg is the resonant product
between two distributions (which is a-priori ill-defined). Finally, the
presence of infinity indicates the necessity of Wick renormalisation, in the
sense of [23, Theorem 9.3]. Y is started in
invariance, that is:
[TABLE]
while all other elements are started in Yτ(0)=0. In particular
Y changes as follows under the action of ϑn, for n∈N0,t≥0,ω∈Ωkpz:
[TABLE]
Proof.
The only point that requires a proof is the action of the translation
operator. By taking into account the initial conditions and using [23, Theorem 9.3],
Equation (38) holds for fixed
n, for all ω∈Nn and all t≥0, for a given null-set
Nn (since the random variables are constructed in
L2(Ωkpz;Ykpz)). Considering
N=⋃n∈NNn and setting Y(ω)=0 for
ω∈N, one obtains the result for all ω∈Ωkpz.
∎
Lemma A.4**.**
Consider a sequence {ak}k∈N of positive (ak⩾0) real numbers. Suppose that
[TABLE]
converges, namely that there exists a σ∈[0,∞) such that
[TABLE]
Then
[TABLE]
Proof.
Since Sn is convergent fix any ε>0 and let n(ε)∈N be
such that
[TABLE]
We can assume, up to taking a larger n(ε), that n(ε)⩾εσ+ε. Now consider n⩾n(ε)+1. We can
compute
[TABLE]
which implies that nan⩽2ε for all
n⩾n(ε)+1. Since ε is arbitrary this completes the proof.
∎
Lemma A.5**.**
Consider any β∈(0,∞),α∈(0,β) and let θ=βα∈(0,1). Then there exists a
constant C(α,β)>0 such that for every f∈Cβ:
[TABLE]
Proof.
We start by recalling, for k∈{1,…,d}, the one-dimensional Landau-Kolmogorov inequality
(see for example [29] or many online resources):
[TABLE]
Iterating this inequality one obtains that for any n,l∈N and
ki∈{1,…,d},∀i=1,…,l:
[TABLE]
Since (both identities can be proven by induction over l):
[TABLE]
we have proven that
[TABLE]
which is the desired inequality for integer α,β. To pass to the
fractional case we will first prove that for β⩾n,n∈N:
[TABLE]
We can further simplify this by considering β∈(1,2) and proving:
[TABLE]
To obtain this let ek be the unit vector in the k−th direction, and
consider for h>0,x∈Td:
[TABLE]
Since
[TABLE]
for some ξ∈[x,x+hek] (were [x,x+hek] is the line
between x and x+hek), we can bound the rest term by:
[TABLE]
Hence we have
[TABLE]
by setting h=(∥f∥∞/[f]β)β1. Next, we
deduce (40) for
any β>1 and n=⌊β⌋. Using all the estimates we already derived:
[TABLE]
for
[TABLE]
so that the last estimate implies
(40) for the chosen β and
n. To conclude the proof
of (40) we have to consider the
case β>1,n⩽⌊β⌋. We find that:
[TABLE]
At this point, we can collect all our results to complete the proof. Consider
k,n∈N0 such that α∈[k,k+1) and β∈[n,n+1).
Of course n⩾k. Furthermore, define
[TABLE]
Step 1: n=k. Note that one can bound
[TABLE]
In fact, if n⩾1,f∈Cα, for every μ with ∣μ∣=n there
exists an x0∈Td such that ∂μf(x0)=0, so
that
[TABLE]
Hence, using (40) we can compute (defining [f]0=∥f∥∞ if n=0):
[TABLE]
which is the required result.
Step 2: k<n. Here we compute, following the same steps as above:
[TABLE]
which completes the proof of the result.
∎
Lemma A.6**.**
Fix any α∈(0,∞) and f∈Cα with f(x)>0,∀x∈Td and ∫Tdf(x)dx=1.
Then defining m(f)=minx∈Tdf(x) one can bound for some
C(α)>0, uniformly over f:
[TABLE]
Proof.
First, observe that for any multiindex μ with ∣μ∣=k∈N and
f sufficiently smooth we have a decomposition of the form
[TABLE]
where Ai(p,μ)⊆Nd are finite sets of multiindices such
that
[TABLE]
and
C(i,p,μ)∈R are some coefficients (here ∣Ai(p,μ)∣ indicates the
cardinality of the set). One can check by hand that this
decomposition holds true if ∣μ∣=1. In addition, assuming the decomposition holds true
for some μ∈Nd, one has for any i∈{1,…,d}
[TABLE]
which is again of the required form. Hence by induction the decomposition holds
true for all μ.
To conclude the proof of our result we will now need the following to
inequalities. Fix any α′∈(0,1),f,g∈C(Td) as
well as any smooth function φ:U→R,
where U⊆R is an open set such that
f(Td)⊆U. Then:
[TABLE]
Both inequalities are immediate consequences of the definition of the Hölder
seminorm. For the first one:
[TABLE]
while for the second
[TABLE]
Now we can complete the proof. We find
via (41) that for α⩾1,α′=α−⌊α⌋:
[TABLE]
where in the last step we used (42).
Now, since ∫f(x)dx=1 we have that m(f)⩽1. In
addition we have that ∣Ai(p,μ)∣⩽⌊α⌋, so
overall we have that:
[TABLE]
which is the required inequality. The case α∈(0,1) is much simpler
and follows directly from (42).
∎
Bibliography38
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[1] L. Arnold. Random dynamical systems . Springer Monographs in Mathematics. Springer-Verlag, Berlin, 1998.
2[2] L. Arnold and I. Chueshov. Order-preserving random dynamical systems: equilibria, attractors, applications. Dynamics and Stability of Systems , 13(3):265–280, 1998.
3[3] L. Arnold, V. M. Gundlach, and L. Demetrius. Evolutionary formalism for products of positive random matrices. Ann. Appl. Probab. , 4(3):859–901, 1994.
4[4] H. Bahouri, J.-Y. Chemin, and R. Danchin. Fourier analysis and nonlinear partial differential equations , volume 343 of Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences] . Springer, Heidelberg, 2011.
5[5] Y. Bakhtin, E. Cator, and K. Khanin. Space-time stationary solutions for the Burgers equation. J. Amer. Math. Soc. , 27(1):193–238, 2014.
6[6] Y. Bruned, A. Chandra, I. Chevyrev, and M. Hairer. Renormalising SPD Es in regularity structures. ar Xiv e-prints , page ar Xiv:1711.10239, November 2017.
7[7] Y. Bruned, M. Hairer, and L. Zambotti. Algebraic renormalisation of regularity structures. Invent. Math. , 215(3):1039–1156, 2019.
8[8] P. J. Bushell. Hilbert’s metric and positive contraction mappings in a Banach space. Arch. Rational Mech. Anal. , 52:330–338, 1973.