A Wong-Zakai theorem for the stochastic mass critical NLS
Chenjie Fan, Weijun Xu

TL;DR
This paper establishes a Wong-Zakai theorem for the stochastic mass-critical nonlinear Schrödinger equation, addressing the convergence of solutions under approximations of stochastic noise in a dispersive PDE setting.
Contribution
It provides the first Wong-Zakai type result for the mass-critical stochastic NLS, highlighting key differences from SDEs and parabolic SPDEs.
Findings
Proves convergence of solutions under noise approximation
Identifies key subtleties in dispersive stochastic PDEs
Differentiates between large-n and limiting cases
Abstract
We prove a Wong-Zakai theorem for the defocusing mass-critical stochastic nonlinear Schr\"odinger equation (NLS) on . The main ingredient are careful mixtures of bootstrapping arguments at both deterministic and stochastic levels. Several subtleties arising from the proof mark the difference between the dispersive case and corresponding situations in SDEs and parabolic stochastic PDEs, as well as the difference between the large- case and the limiting () case.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Mathematical Physics Problems · Advanced Harmonic Analysis Research · Navier-Stokes equation solutions
11institutetext: Academy of Mathematics and Systems Science and Hua Loo-Keng Key Laboratory of Mathematics, Chinese Academy of Sciences, Beijing, 100190, China, 11email: [email protected] 22institutetext: Beijing International Center for Mathematical Research, Peking University, China, 22email: [email protected]
A Wong-Zakai theorem for the stochastic mass-critical NLS
Chenjie Fan1 and Weijun Xu2
Abstract
We prove a Wong-Zakai theorem for the defocusing stochastic mass-critical nonlinear Schrödinger equation (NLS) on . The main ingredient are careful mixtures of bootstrapping arguments at both deterministic and stochastic levels. Several subtleties arising from the proof mark the difference between the dispersive case and corresponding situations in SDEs and parabolic stochastic PDEs, as well as the difference between the large- case and the limiting () case.
Contents
1 Introduction
1.1 Statement of the result
We continue our study of the defocusing mass-critical stochastic nonlinear Schrödinger equation on with a conservative noise. Consider the model
[TABLE]
Here, is a Wiener process on real-valued functions with proper integrability conditions, and denotes the Stratonovich product. This choice of noise and product assures pathwise mass conservation.
Assumption 1.1**.**
Throughout, we assume the initial data , and there exists such that
[TABLE]
The Wiener process has the form
[TABLE]
where are independent standard Brownian motions on the probability space , and is a sequence of real-valued functions on . Furthermore, they satisfy
[TABLE]
for some .
Remark 1.2*.*
From the view point of the assumption (1.4) and the fact that the topic of this article is of well-posedness nature, the noise we considered is not very different from the special form for . However, non-degenerate noise does arise in some other situations, so we emphasize that our results also work for infinite dimensional noise. It should be remarked we do not require any smoothness of the noise in the space variable.
It may also be of interest to extend our results to more general noise based on the language of -Radonifying operators. We do not handle this technical issue here, though we believe most of our arguments can also work in that situation. Also, this paper does not aim to handle very singular noise (such as space-time white noise) that requires renormalisation.
Equation (1.1) is called mass-critical since its deterministic version (in general dimension ) has the following scaling property: suppose satisfies
[TABLE]
then for every , the rescaled function satisfies the same equation with initial data , whose norm is invariant under the scaling. It is called defocusing since the associated Hamiltonian is coercive.
The well-posedness for (1.5) is highly non-trivial for general initial data. It was proved by Dodson ([Dod13, Dod16b, Dod16a]) that for every initial data in , has a global space-time bound in a suitable Strichartz space. As a consequence, scatters.
These results are crucial if one wants to construct global solutions to the stochastic equation. In [FX21b, FX19, Zha18], a global solution to (1.1) was constructed. The purpose of this article is to present a Wong-Zakai type result for (1.1).
Let be a sequence of partitions of of the form
[TABLE]
such that \|\pi^{(n)}\|:=\max_{j}\big{|}t_{j+1}^{(n)}-t_{j}^{(n)}\big{|}\rightarrow 0 as . For every , let be such that for every , and linearly interpolates in between. Let be the solution to
[TABLE]
Unlike the SPDE (1.1) which needs to be formulated via Itô’s stochastic integration, (1.7) is well defined in the classical sense since is piecewise linear. Thus, (1.7) is simply a classical PDE (with randomness), and we can rewrite as
[TABLE]
Given the results of Dodson ([Dod13],[Dod16b],[Dod16a]), for every realization of , one can see that is globally well-posed. Such global existence of can be derived from a purely perturbative viewpoint (see Remark 2.7). Our main result is the following.
Theorem 1.3**.**
Let be the solution to (1.1) as constructed in [FX21b, FX19]. Let be the solution to (1.7) with the same initial data u(0,\cdot)\in L_{\omega}^{\infty}\big{(}\Omega,L_{x}^{2}(\mathbb{R})\big{)}. Then for every , we have
[TABLE]
as , where we used the shorthand notation
[TABLE]
Remark 1.4*.*
Even to ensure the convergence (1.9) for a single fixed , it is crucial to assume our initial data to be in rather than no matter how large is. Also, the convergence (1.9) works for any finite but not for .
Remark 1.5*.*
The above result can be extended to sub-critical models.
Remark 1.6*.*
Due to the mass-critical nature of the problem and the fact we are working with general data, the dynamics in the time interval should not be understood as a short time dynamics, but rather a truly nonlinear one (instead of being a perturbation of some linear dynamics). In fact, the exactly same argument works for for any . On the other hand, our result does not give information on the asymptotic behaviour of the solution. One needs strong decay estimates for the solutions in order to have a solution theory on the time interval of the whole . It is still out of reach at this moment, but see [FX21a] for the linear case with small noise and [FZ20] for the critical nonlinear case with a noise with a time-decay noise.
Remark 1.7*.*
One can also understand this result as an alternative construction of the solution to (1.1). The convergence (1.9) has two levels of meanings. First, it says converges in and the limit solves (1.1). Second, the limiting process coincides with the process constructed in [FX21b]. The second point is meaningful for the following reason: even though the construction in [FX21b] is canonical in the sense that it is the unique limit under a natural class of approximations (see Theorem 1.9 for more details), the uniqueness is not in the sense of a prescribed function space. Hence, Theorem 1.3 could also serve as a demonstration that the solution constructed in [FX21b] is the right one to consider.
Remark 1.8*.*
Pathwise mass conservation is not strictly necessary as long as one can control the growth of -norm of the solution independent of the realization of the path. Nevertheless, from the viewpoint of dispersive PDEs, we still restrict ourselves to the model where pathwise mass conservation law holds for the future study of long time behavior.
On the other hand, such (deterministic) a priori control does play an essential role in this article (especially for convergence). One may also want to state and prove similar results for energy (sub-)critical problems with initial data, but in that case one may only get convergence in probability instead of due to the lack of such control for energy growth.
1.2 Review of the construction of solution to (1.1)
The Itô form of (1.1) is formally given by
[TABLE]
where the product between and is in the Itô sense, and is the Itô-Stratonovich correction.
Let such that , on and vanishes outside the interval . For every , let . We summarize the construction in [FX21b] in the following.
Theorem 1.9** ([FX21b]).**
Fix . For every and , there exists a unique adapted to the filtration generated by such that
[TABLE]
where the integral with respect to is in the Itô sense, and the formula holds in .
As a consequence, we deduce that the same belongs to for every . Furthermore, , is Cauchy in as , and the limit satisfies the Duhamel formula
[TABLE]
where the stochastic integral is again in the Itô’s sense, and the two sides are equal in .
Remark 1.10*.*
In [FX21b], the results were stated for spatially smooth noise, but they are valid with essentially same proof only with Assumption 1.1 in this article. Furthermore, the current article considers a large class of discretisations of the model (1.1) with stronger estimates, and hence one can also use the arguments here to recover the results in [FX21b] with the noise in Assumption 1.1.
Remark 1.11*.*
Note that the construction of solution to (1.12) does not follow from a Picard iteration regime, but rather via sub-critical approximations. But we do have natural uniqueness for (1.12) in the sense that there is only one element in the prescribed space which satisfies the formula (1.12).
On the other hand, as already mentioned in Remark 1.7, the uniqueness of is not in the sense of prescribed function space but rather as the unique limit of natural approximations. But this solution should not be understood as a weak solution derived from compactness arguments, which are usually not unique for a given initial data. We finally remark that it is natural to expect for , where is the stopping time when the -norm of hits . We do not have a proof for this. If this is true, then we will also have uniqueness for the original equation (1.1) in the sense of prescribed function space.
1.3 Background
1.3.1 Mass-critical NLS
Mass-critical NLS is a typical model for nonlinear dispersive equations. The local well-posedness is well known, and can be established via a Picard iteration scheme with Strichartz estimates. One may refer to [CW89] as well as the textbooks [Caz03] and [Tao06]. Global well-posedness for the (defocusing) mass-critical NLS with general initial data has been a famous open problem, and was finally solved by Dodson in [Dod13, Dod16b, Dod16a] (see also the reference therein for more background). We summarize Dodson’s result for the 1D model below.
Theorem 1.12** (Dodson).**
Let solve the equation
[TABLE]
Then is global and
[TABLE]
where we recall from (1.10) that \mathcal{X}_{2}(\mathcal{I})=L_{t}^{5}\big{(}\mathcal{I},L_{x}^{10}(\mathbb{R})\big{)}. As a consequence, there exists depending on such that
[TABLE]
as .
1.3.2 Well-posedness of stochastic NLS
We mainly focus on the stochastic NLS with a multiplicative noise on the whole space. The study of stochastic NLS with a multiplicative noise was initiated in the work of de Bouard and Debussche ([dBD99], [dBD03]), where local and global well-posedness for sub-critical non-linearities was established. See also refinements and further developments in [BRZ14, BRZ16, Hor18]. In [FX21b, FX19], we extended the result of [dBD99], and proved global well-posedness for 1D mass-critical model with initial data. Later, Zhang ([Zha18]) generalised the results for the mass-critical model to all dimensions and also proved well-posedness for the energy-critical model via a different method (rescaling method) and with different assumptions on the noise as well as different notions of solution.
Note that if one is interested in bounds as in the works [dBD99, FX21b, FX19], it should be expected mass-critical model is very different from energy-critical models. Indeed, such bounds are not yet available for the latter.
We conclude with a short discussion on the difference between (local) well-posedness for deterministic and stochastic NLS. Note that such difference will arise even for very simple noise and sub-critical nonlinearity.
Following the local well-posedness of deterministic NLS, one may want to use Duhamel formula (1.13) to construct solutions via a Picard iteration scheme in space of the type for some (space-time) metric space . However, such a procedure fails for the following reason. If , then the nonlinear term (which is in our case) is expected to live in , no matter which spaces one chooses. To overcome this difficulty, one needs to explore the so-called pathwise mass conservation law in the model. Thus, even in the local theory of [dBD99, FX21b], some non-perturbative information is used.
Finally, we remark that there are different notions of local solutions in stochastic NLS. Some are easier to construct, but may have more difficulty to be extended globally. On the other hand, if one uses the notions of solutions as in [dBD99, FX21b], then those local solutions are very easy to be extended to be global, but indeed long time dynamics do appear even in very short time (though with small probability). It is natural to expect these solutions should agree with each other. One motivation of this article is that, by showing a Wong-Zakai convergence, we demonstrate the solution constructed in our previous work [FX21b] is natural in the sense it can be approximated by classical solutions of PDEs.
1.3.3 Wong-Zakai convergence
The classical Wong-Zakai type theorem refers to a series of pioneering results by Wong and Zakai ([WZ65a, WZ65b]) on one dimensional SDEs and by Stroock and Varadhan ([SV72]) on multidimensional SDEs, which roughly assert that if converges to a (finite dimensional) Brownian motion , then the solution to the multidimensional SDE
[TABLE]
converges to the solution to the Stratonovich SDE
[TABLE]
The convergence statement as well as the rate (in terms of ) is directly related to sample path continuity of .
As for analogous questions for parabolic stochastic PDEs, it is natural to consider the model
[TABLE]
for some Wiener process . The linear operator has a strong smoothing effect (it immediately turns any initial data into a smooth function). Hence, as long as the noise is not too singular and the nonlinear effect is not too strong, the dissipative system essentially behaves like high dimensional ODEs, and it is reasonable to expect the Wong-Zakai approximations to converge.
On the other hand, if the noise is singular (for example, being cylindrical Wiener process on ), then the problem becomes much subtler as the singularity of the noise is strong enough so that the Stratonovich formulation does not exist. The question for singular parabolic SPDEs has been open for a long time, and was successfully handled in [HP15] with the framework of regularity structures (with proper renormalizations).
The aim of this article is to prove a Wong-Zakai type theorem for the nonlinear dispersive PDEs (1.1) (in contrast to dissipative PDEs). In some sense, dispersive equations behave less like high dimensional ODEs than dissipative ones since the linear propagator does not have smoothing effects on initial data. In particular, it does not smooth out high frequencies of the solution flow, especially when one has a critical nonlinearity. Indeed, even the solution to the linear deterministic equation does not have any Hölder continuity as a flow in . Also, we point out here the nonlinearity we are considering are -critical, so it is strong enough that all levels of frequencies should be taken into account. On the other hand, the noise we consider here, though not smooth, is essentially finite dimensional and does not require subtle renormalization treatments as in singular parabolic PDEs.
Since typical Wong-Zakai convergences are intimately related to the time regularity of the solution flow, and that even the linear Schrödinger flow is not Hölder continuous in , it is a priori unclear whether Wong-Zakai convergence is true even if the limiting equation is well defined. Hence, it is our interest to show that this is indeed true, though our convergence statement does not have a rate.
1.4 Sketch of proof of the main theorem
In order to show the convergence of to , we introduce the intermediate process which solves the equation
[TABLE]
We first make a simple observation. Unlike and (in (1.12) and (1.13)) whose formulations rely on stochastic integral, the processes and are pathwisely defined for every finite , and one easily verifies on , where is such that .
The main ingredient to prove Theorem 1.3 is the following uniform bound on and .
Theorem 1.13**.**
Given Assumption 1.1 for the noise and initial data, let and solve (1.7) and (1.20). Then for every , we have
[TABLE]
uniformly in and .
Most of the estimates in this article involve constants depending and . Since they are fixed, we do not emphasize these dependences in the rest of the article.
The uniform bound (1.21) implies the following stability result, which will allow us to reduce the problem to the one with regular noise and initial data.
Corollary 1.14**.**
Let and denote the solutions to (1.20) and (1.12) with initial data and noise
[TABLE]
satisfying also Assumption 1.1 with the same . Note that is the discretization of defined in the same way as with respect to the same partition . Then for every and , there exists depending on and such that if for every , one has
[TABLE]
then
[TABLE]
and the same is true for . All the proportionality constants are uniform in both and .
Remark 1.15*.*
We will only need some finite choices of in (1.23). However, since we assume a priori bounds for and , the validity of (1.23) for any already implies the same is true for all (with a different proportionality constant depending on ).
To prove Theorem 1.3, we split into
[TABLE]
where all the norms are . By the construction in [FX21b] (which we stated in Theorem 1.9 above), as . Note that once uniform boundedness on (and hence ) is established, the convergence of to the limit does not use the regularity of the noise any more (see [FX21b, Section 5]). Hence the convergence also holds in our situation. It then remains to show the convergence of the first two terms, which will be the material of the following two propositions. The convergence follows from the our uniform bound (1.21) and the aforementioned observation if the norm of the latter is smaller than .
Proposition 1.16**.**
For every initial data , we have
[TABLE]
as .
Proof.
Let
[TABLE]
Recall the definitions of and from (1.7) and (1.20). Note that on . Hence, we have
[TABLE]
By Theorem 1.13, we have
[TABLE]
for all . Hence the claim follows. ∎
The convergence of the second term in (1.25) is the following proposition.
Proposition 1.17**.**
For every initial data and every , we have
[TABLE]
as .
The proof of the above proposition is another main ingredient of the article. It is in this step we see the Wong-Zakai type convergence. It will be proved in Section 5.
The basic idea is that uniform bound (1.21) allows us to reduce the study of to , which essentially linearizes the dynamics. This is in particular important since we are working on stochastic problems, where the nonlinearity causes extra difficulties due to loss of integrability in probability space. Wong-Zakai convergence is nontrivial even for linear stochastic Schrödinger equations, since the propagator does not have time regularity in . This is the reason why we need the stability statement (Corollary 1.14) to regularize the initial data and noise. The proof of Proposition 1.17 is similar to that of Corollary 1.14.
1.5 Organization of the article
According to the above sketch, the proof of the main result (Theorem 1.3) will be complete if we prove Theorem 1.13, Corollary 1.14 and Proposition 1.17. The rest of the article is thus organized as follows.
In Section 2, we present some preliminary bounds and lemmas. We will prove Theorem 1.13 in Section 3, Corollary 1.14 in Section 4, and finally Proposition 1.17 Section 5.
Notations
We introduce some notations that will be frequently used in the rest of the article, including those that have been mentioned above. For any time interval , we let
[TABLE]
We let in the sense that . For , we write L_{\omega}^{\rho}\mathcal{Y}=L^{\rho}\big{(}\Omega,\mathcal{Y}\big{)}. We also write for the nonlinearity.
In what follows, we will fix the (large) discretization parameter . We either obtain bounds that do not depend on , or we compare and with their candidate limits and . In particular, at most one is involved in this article, and we will never compare with two different and . Hence, for points in the partition , we drop the superscript and write for simplicity. For , we let be the integer in such that . We also let for . Finally, for , we write .
We will write if there exists independent of the quantities and such that . When such a depends on some parameter (say ), we will write . In what follows, we do not keep track of explicit dependence on , and , and we will simply write instead of for example. Finally, we use and to denote constants whose values may change from line to line.
Acknowledgements
WX acknowledges the support from the Engineering and Physical Sciences Research Council through the fellowship EP/N021568/1. CF thanks Carlos Kenig and Gigliola Staffilani for discussion and encouragement. CF also thanks Yanqi Qiu for discussion on geometry of Banach spaces. Part of this work was done when the authors were at the Universities of Chicago and Oxford respectively, which provide ideal environment for mathematical research.
2 Preliminaries
2.1 Dispersive and Strichartz estimates
We start with the by-now standard dispersive and Strichartz estimates. Let be the free propagator of linear Schrödinger equation. Then we have the following dispersive and Strichartz estimates. All the bounds below are for dimension one.
Lemma 2.1**.**
We have
[TABLE]
for every and is the conjugate of .
We call an admissible pair (in dimension one) if . We have the following Strichartz estimates.
Lemma 2.2**.**
We have
[TABLE]
for any admissible pairs and , where and are conjugates of and .
We refer to [Caz03], [KT98] and [Tao06] and reference therein for more details.
2.2 Standard and modified stability for critical NLS
In this section, we present several stability results for deterministic NLS. We focus on for simplicity, but this part has natural generalizations to higher dimensions. We remark that the estimates below do not rely on the choice of time interval . We start with the standard and most frequently used stability results for NLS. We refer to Lemmas 3.9 and 3.10 in [CKS*+*08] for example.
Proposition 2.3**.**
Suppose solves
[TABLE]
where
* ,* 2. 2.
* .*
Then there exists depending on and only such that if solves (1.5) with
[TABLE]
then
[TABLE]
This in particular implies
[TABLE]
While Proposition 2.3 is purely perturbative, one can combine it with Dodson’s global well-posedness result (Theorem 1.12) to improve to the following statement.
Proposition 2.4**.**
Suppose solves
[TABLE]
on with . Then there exists depending on only such that if
[TABLE]
then
[TABLE]
Remark 2.5*.*
In other words, the assumption for in Proposition 2.3 is actually a consequence of the boundedness of and the smallness of the perturbation (depending on the size of ).
Proposition 2.4 implies the following a priori bound.
Corollary 2.6**.**
Suppose solves
[TABLE]
on with and . Then we have
[TABLE]
Remark 2.7*.*
The above a priori bound is enough for one to establish the pathwise global well-posedness for (1.7).
We finally present a stability argument which will be useful in the study of stochastic dispersive equations, in particular when it is combined with the so-called Da Prato-Debussche method ([DPD03]).
Proposition 2.8**.**
Let be an interval and satisfying and
[TABLE]
Then for every , there exists such that if
[TABLE]
then we have
[TABLE]
This proposition has played an important role in the construction of the solution to (1.1) (see [FX21b, Proposition 4.6]). It was stated in a more complicated way there since we took into account of the truncation. But the estimates are uniform in the truncation parameter , they also work here straightforwardly.
Remark 2.9*.*
For the stochastic NLS of the current form, it is not clear whether one can write the solution in the form (2.3) so that the error term can be well estimated. Instead, one needs to study the stability in the form of its integral version as in Proposition 2.8.
Remark 2.10*.*
We finally point out that we also deal with NLS with time dependent truncated nonlinearity of form . Propositions 2.3, 2.4, 2.8 and Corollary 2.6 all hold if one replaces the nonlinearity by , and all the implicit constants involved remain unchanged (in particular they are all uniform in ).
2.3 Burkholder inequality
The Burkholder inequality ([BDG72, Bur73]) is a very useful tool in controlling supremum of martingales. Because of the summability condition (1.4), we will only need the following simple version.
Proposition 2.11**.**
Let be a standard Brownian motion. For every and , and every right-continuous adapted process (to ) in , we have
[TABLE]
The proof of this inequality, including its more general version involving -Radonifying operators, can be found in [BP99, Theorem 2.1]. We also refer to [Brz97, vNVW07] for more details. We show two typical examples where the bound (2.15) is used in this article. Let be the Wiener process as in the assumption (1.4).
A discrete version111It can be checked as an application of (2.15), but strictly speaking, (2.15) is derived from this discrete version. of (2.15). Let , let be a sequence in and , and let . Then
[TABLE] 2. 2.
Estimate regarding the Duhamel formula for Schrodinger equation. Let be an adapted process in , let , and (this simply means ), then for any ,
[TABLE]
In the last step, we have used dispersive estimate (2.1).
2.4 Kolmogorov’s criterion
We will need the following Kolmogorov’s continuity criterion.
Proposition 2.12**.**
Let and . Let be a Banach space, and let be a stochastic process such that
[TABLE]
For every , let be the random variable defined by
[TABLE]
Then we have
[TABLE]
In particular, for the noise satisfying Assumption 1.1, applying Burkholder inequality (2.15), (2.16) and the above Kolmogorov’s continuity criterion, we see that for all and , we have
[TABLE]
3 Uniform boundedness of – proof of Theorem 1.13
The aim of this section is to prove the uniform bounds in Theorem 1.13. For simplicity of presentation, we prove the second bound in (1.21) only, which corresponds to . Uniform-in- bounds for can be obtained in essentially exactly the same way.
3.1 Overview of the proof
We start by recalling some notations that will be used below, as well as introducing some new ones. We fix a large , and will obtain bounds that do not depend on . We assume so that . Recall that we fix throughout, so we write for simplicity, and . For , we let such that . We also write . Finally, we write for simplicity.
We first observe that for every and , we have
[TABLE]
Also, by mass conservation law, we have
[TABLE]
Recall that satisfies the classical PDE (1.8). Expanding by Duhamel formula at , we get
[TABLE]
We now separate out the martingale part in the last term in (3.3). To do this, we further expand via Duhamel formula at time . Observe that for any , we have . Thus, we have the expansion
[TABLE]
Combining (3.3) and (3.4), we get
[TABLE]
To simplify the above expression, we define the following quantities:
[TABLE]
and
[TABLE]
and
[TABLE]
The expression (3.5) can then be simplified to
[TABLE]
We will view and as source terms and \widetilde{N}\big{(}v;s\big{)} as a small perturbation. Roughly speaking, we want to get supreme-in- bounds for and . For , we will explore the martingale structure. For , we will use the fact as long as is a reasonable space norm which will be specified later. As for \widetilde{N}\big{(}v;s\big{)}, we observe that at least formally, its norm is of size \|W(t_{j+1})-W_{t_{j}}\|\cdot\|\mathcal{N}\big{(}v(s)\big{)}\|\sim|t_{j+1}-t_{j}|^{1/2}\|\mathcal{N}(v(s))\|, which can be treated perturbatively via a bootstrap argument. Again, all the norms and bounds will be specified later.
We fix a small parameter (independent of ), and separate two situations depending on whether or not, and the norm used will be specified later. In the (very rare) event it is bigger than , we view as a perturbative term, and use brute force stability arguments for (1.8) together with a quantitative estimate implying such an event is rare. In the more common situation when , we use maximal estimates for and to combine sub-intervals in and run bootstrapping arguments on these joint intervals.
We start with the maximal estimates for and .
3.2 Control of source term ,
Let and be defined as
[TABLE]
and
[TABLE]
It is clear that
[TABLE]
The main technical bound in this subsection is the following lemma.
Lemma 3.1**.**
For every , we have
[TABLE]
where we have omitted the dependence on and for notational simplicity.
We only need to prove the above lemma for . By Minkowski inequality and that our interval is (having finite length), we have the embedding
[TABLE]
Hence, (3.13) will follow from the bounds
[TABLE]
and
[TABLE]
Fix . Before we start the proof of (3.15) and (3.16), we first prove the following technical lemma which handles fluctuation in any small interval .
Lemma 3.2**.**
For any , we have
[TABLE]
Proof.
Note that for , we have and . Thus, we have
[TABLE]
Here, we applied the dispersive estimate (2.1) in the third line above, and also used . In the fourth line, we have applied Hölder . The claim (3.17) then directly follows from (2.21) by taking -norm on both sides and employing the definition that . ∎
We are now ready to prove the bound for .
Proof of (3.15).
Splitting the integral in into and , we have
[TABLE]
The second term could be controlled directly via Lemma 3.2. Hence, we only need to prove the bound (for the first term)
[TABLE]
Note that
[TABLE]
is a discrete martingale in , so by Burkholder inequality (2.15), we have
[TABLE]
Using the dispersive estimate (2.1) and arguing similarly as in (3.18), we get
[TABLE]
Plug (3.23) into (3.22), we see that (3.20) will follow if we can prove
[TABLE]
Indeed, using triangle inequality to insert -norm inside the sum and then employing (3.1), we have
[TABLE]
where we have used Hölder to create a whole power of in the third inequality. This completes the proof. ∎
Remark 3.3*.*
In the last step of (3.25), we used . If we work on an small interval rather than , we will gain a small power of form . In this situation we would have , but in general this term is subcritical and one can gain a positive power of .
Now we turn to the control of .
Proof of (3.16).
Unlike (3.15) which relies on the martingale structure, the proof of (3.16) is more straight forward. Proceeding similarly as in (3.18), for , we have
[TABLE]
We thus get
[TABLE]
This completes the proof. ∎
Remark 3.4*.*
Similar as in Remark 3.3, one can gain a positive power of if one is working in a small interval instead of all of .
3.3 A crude upper bound – controlling large oscillations
We give a crude bound on . This bound will used only when the size of is not small in that interval.
Lemma 3.5**.**
For every , we have
[TABLE]
Proof.
Note that
[TABLE]
The claim then follows from (3.2) and Corollary 2.6. ∎
Remark 3.6*.*
Although Lemma 3.5 is true for all and all realizations of , we will use it only for the rare event when has size of at least order .
Remark 3.7*.*
We discuss how one can use -norm of for , and not assuming norm. To do this, we can replace the norm by any in Propositions 2.3, 2.4 and Corollary 2.6. For example, if one uses the pair , then the same argument gives
[TABLE]
which is still good for us since has typical size .
3.4 Deriving the desired bound
We are ready to prove the desire bound for , that is,
[TABLE]
The part is automatic since we have mass conservation law (3.2). We fix a small constant whose value (independent of ) will be specified later.
Recall that the partition is fixed throughout. For every , we partition the interval into a union of almost disjoint subintervals (only their boundary points can intersect), and divide those subintervals into two types as follows.
First, type-A intervals are selected from the original partition . An interval is called a type-A interval if . The remaining set (where we only take the interior of type-A intervals here) is a union of disjoint closed intervals, each of the form where and are end and beginning points of two consecutive type-A intervals. We now further partition the remaining set into type B intervals as follows. For any such (maximal) interval in the remaining set, let . Suppose is defined, let , and define
[TABLE]
This procedure necessarily ends with a finite . We repeat this procedure for every maximal closed interval . In this way, we have partitioned the remaining set into a disjoint union of intervals (only boundary points can overlap) such that
[TABLE]
Here, we have abused the index by relabelling all such intervals. By construction, one also has the estimate
[TABLE]
for every . For convenience, we further separate type-B intervals into subtypes B-I and B-II as follows:
- •
We call type B-I if
[TABLE]
- •
All the remaining type-B intervals are of type B-II.
Thus, we have defined a random variable where is the number of type-B intervals.
We now state two lemmas to summarize the properties of those partitions. First,we claim can not be too large in average sense.
Lemma 3.8**.**
[TABLE]
Second, when the is chosen small enough, (such smallness only depends on and the fact is small enough), we have
Lemma 3.9**.**
If in some interval so that (3.34) holds, then we have the (deterministic) estimate
[TABLE]
Assuming Lemma 3.8, 3.9 at the moment, we conclude the proof of (3.31).
Proof of (3.31) assuming Lemmas 3.8 and 3.9.
If some interval is of type-A, we apply Lemma 3.5. All the intervals of type-B are partitioned into sub-intervals in which (3.34) hold, and we apply Lemma 3.9. To summarize, we derive
[TABLE]
Thus, we derive
[TABLE]
The first term is controlled by Lemma 3.8. For the second one, using the fact that for each , we have
[TABLE]
where depends on only. Thus, we derive
[TABLE]
Note that since is fixed and independent of (but depending on and only), we can thus conclude the proof. ∎
We are left with the proofs of Lemmas 3.8 and 3.9. We first prove Lemma 3.8.
Proof of Lemma 3.8.
Let be the number of intervals of Type B-I, and be the number of intervals of Type B-II. And . Note that
[TABLE]
Applying Lemma 3.1, the desired estimate follows for .
On the other hand, we have
[TABLE]
Taking on both side, and recalling that the probability of being Type A is , the desired estimate for follows. We can then conclude Lemma 3.8. ∎
Finally, we present the proof of Lemma 3.9. Implicitly, part of the proof is in the same spirit of so-called Da Prato-Debussche trick.
Proof of Lemma 3.9.
Let us fix and denote by . We assume without loss of generality that is a point in the partition so that . If not, then by our definition of , the interval is not of type-A, and we can apply Lemma 3.5 to control the dynamics of in , and we only need to study the dynamics of in , which satisfies all the assumption for , which we will use below. Similarly, we also assume .
Recall that satisfies (3.9) for . Let
[TABLE]
and . By the choice of and (3.34), we observe that
[TABLE]
If there were no term, then Lemma 3.9 follows from the modified stability Proposition 2.8.
In our current situation, we treat perturbatively. To do this, we will follow a bootstrap scheme. Let in Proposition 2.8 be the same as , hence the corresponding and in Proposition 2.8 depends on only. We first assume the following bootstrap lemma.
Lemma 3.10**.**
For sufficiently small , if for , one has the bootstrap assumption
[TABLE]
then one has the bootstrap estimate
[TABLE]
Lemma 3.9 follows from Lemma 3.10 by standard continuity argument. ∎
It then remains to prove Lemma 3.10.
Proof of Lemma 3.10.
We first choose small enough such that (we will make even smaller if necessary). Lemma 3.10 follows from Proposition 2.8 if we can show that (3.46) implies
[TABLE]
By Strichartz estimate (2.2), we have
[TABLE]
Note that since we assume and , the in the integrand is always in , also note that must be of Type-B.
Note that we have the pointwise estimate
[TABLE]
Hence, by (3.49) and (3.50), we conclude that
[TABLE]
We have (3.48) when is small enough. This completes the proof. ∎
Remark 3.11*.*
Before we end this subsection, we give a brief sketch on how one can modify the above arguments so that one does not need closeness in to prove stability. As already mentioned in Remark 3.7, one can replace the in Lemma 3.5 by . Later, one may define an interval to be of type A if . And finally, in the proof of Lemma 3.10, one replaces the -norm by , which is the dual of the Strichartz pair .
4 Proof of Corollary 1.14
4.1 Overview of the proof
We first point out, it is very natural that if one can prove Theorem 1.13, then one can prove a stability result as in Corollary 1.14. It may be of some concern since in Corollary 1.14, we only assume closeness between and in for (and an a priori control of ), while the proof of Theorem 1.13 does use -norm in several places. However, we use -norm of only for the convenience of presentation, and as explained in Remark 3.11, one only needs a little modification of the arguments to turn the assumption from into . The only place not covered by that remark is in (3.27), where also appear. But since the quantity in that expression was multiplied by , and since Corollary 1.14 assumes closeness in but boundedness in , this is already good enough for stability arguments to go through. We emphasize here again that the assumption in Corollary 1.14 includes a priori bound in , but closeness in for .
Due to the above discussion and for simplicity and conciseness of numeric, we will only present the proof of Corollary 1.14 replacing (1.23) by the following stronger assumption
[TABLE]
Fix and , and arguing similarly as Proposition 1.16, one can show that
[TABLE]
for all sufficiently large . Thus, we only need to prove Corollary 1.14 for any fixed (and also allowing dependence on ). Also recall the bound in Theorem 1.13 is uniform in both and .
We also note we can further freely assume is small enough and such smallness can depend on this . Indeed, fix , we can choose so that (4.2) holds. For any given number , we can reduce the proof of Corollary 1.14 into the case and . If . We directly prove Corollary 1.14 without reducing the . And what we are left is the case for stability of with .
We may only consider large, whose value may depend on . Again for notational simplicity, we fix and . We fix and , and denote by , by , and denote by as usual. Let
[TABLE]
We will need a small constant similarly as in the previous section. Also recall are fixed throughout this article. Note that since is fixed, the nonlinearity essentially behaves linearly.
We finally recall, since we a priori have bound for all , we are free to drop small probability sets. We need the following lemma.
Lemma 4.1**.**
There is , such that when is chosen small enough, one can always find ,in (4.1), small enough (depending on ), such that if
[TABLE]
and , then one has,
[TABLE]
Once we have Lemma 4.1, we can then iterate it times and the desired stability follows. It should be expected , and .
For technical convenience, we will only consider the case for some . This does not cause problems since we assume is small enough, and such smallness could depend on . Lemma 4.1 will be reduced to the following bootstrap lemma.
Lemma 4.2**.**
Given the assumption of Lemma 4.1, one can find such that if for , we have the bootstrap assumption
[TABLE]
then one has
[TABLE]
The value of could depend on , which is fixed in this section.
We first derive a few useful estimates before finally turning to the proof of Lemma 4.2 at the end of this section.
4.2 Equation for and a collection of estimates
We first write down the equation for . For any (recalling (3.5)), we have
[TABLE]
Here, is defined similarly as . We will treat all the terms with sign before them perturbatively, so the exact choices of the sign do not matter in the analysis. We introduce some notation to simplify the above expression. Let
- •
;
- •
;
- •
;
- •
e_{2}(a,t):=\pm i\int_{a}^{t}e^{i(t-s)\Delta}\Big{(}\big{(}\phi_{m}(\|v\|_{\mathcal{X}_{2}(0,s)})-\phi_{m}(\|\widetilde{v}\|_{\mathcal{X}_{2}(0,s)})\big{)}\mathcal{N}(\widetilde{v}(s))\Big{)}{\rm d}s;
- •
;
- •
;
- •
;
- •
.
Now, we can write (4.8) as
[TABLE]
We first present all the estimates for and . Since the estimates are of same nature as in the proof of Theorem 1.13, we make a sketch of the arguments and highlight only the differences. We will work on time interval .
We start with and . Similarly as (3.12), Lemma 3.1 (see also Remarks 3.3 and 3.4), we can find and such that the following lemma holds.
Lemma 4.3**.**
For such that , we have
[TABLE]
We will not keep track of the exact value of , and in fact, we allow it to change line by line (but with a positive lower bound). We need a similar control for the norm for . This is indeed easier since
[TABLE]
The last term does not depend on . Similar observation works for . Then, one may derive the following analogue of Lemma 4.3,
Lemma 4.4**.**
There exists , such that
[TABLE]
The bounds are uniform in .
We finally collect the estimates for the ’s. All the bounds are allowed to depend on .
Lemma 4.5**.**
Let . We have
- •
Estimate for :
[TABLE]
- •
Estimate for :
[TABLE]
- •
Estimate for :
[TABLE]
- •
Estimate for . There exists and such that
[TABLE]
[TABLE]
Sketch proof of Lemma 4.5.
The estimate for is similar to (3.50). By Strichartz estimate (2.2), we have
[TABLE]
Thanks to the truncation , one always has
[TABLE]
If , then the desired estimate follows. Otherwise, if , we further obtain
[TABLE]
That means that the truncations for and are essentially same. We split the term in concern as
[TABLE]
and observe
[TABLE]
then estimate (4.13) follows.
The estimate for follows from Strichartz estimate and the observation
[TABLE]
The estimate for is similar to that for except we replace by , and we use the estimate
[TABLE]
For terms , , and , we can treat similarly as in Lemmas 4.4 and 4.3, but here we do not need to restrict the analysis in small intervals222Such smallness is not useful here. In some sense, the extra smallness is not small enough.. However, we do observe in all those term, there is one been replaced by , which gives a in the left hand due to (4.1). ∎
4.3 Proof of Lemma 4.2
Now we are ready to prove Lemma 4.2, which will conclude the proof of Corollary 1.14. Note that once is fixed, we are allowed to take as small as we want (by choosing even smaller), but we will never use estimates of the form .
Recall we will need a small universal constant . For almost surely every , we will take a (random) partition of the interval into such that for every , the following properties for and hold:
- •
Either or if ,
- •
Either or if .
Thus, there can be most such intervals. In every such interval , we use Strichartz and triangle inequalities to get
[TABLE]
Plug in the estimate for ’s and use the definition of , (also note that the appearance of means ), we get
[TABLE]
Note that when is small enough, the two terms and will be absorbed into the left side. Iterating the above formula times (possibly with a different value of ), we get
[TABLE]
Taking -norm on both sides, we obtain
[TABLE]
Here, we use the fact there exists such that . One could choose . By choosing small enough according to , and small enough according to and , Lemma 4.2 follows.
5 Proof of Proposition 1.17
5.1 Some reduction by Corollary 1.14
By Corollary 1.14, instead of Assumption 1.1, we only need prove Proposition 1.17 for smooth initial data , and to study the noise which is finite dimensional (thanks to the summability condition (1.4)) and smooth in space. We can assume without loss of generality that
[TABLE]
where and are Schwartz functions on , since this already covers the treatment of both diagonal and cross terms, which will be of no difference to general finite dimensional case. The regularity assumptions on the initial data and noise give some Hölder regularity in time of the flow and , which is essential to establish Wong-Zakai convergence.
Note that we deal with the truncated equation only (with in front of the nonlinearity, and all the bounds are allowed to depend on (the fixed) . Again, we use to denote a generic constant depending on but its value may change from line to line.
Let . Similar to the previous section, we reduce the proof of Proposition 1.17, with the stronger assumption (5.1), to the following claim.
Lemma 5.1**.**
There exists such that when is small enough, one can always choose sufficiently small depending on , , , , and such that if , and if one has
[TABLE]
and , then one has the bound
[TABLE]
Note that , and hence Proposition 1.17 follows from iterating the above lemma. Lemma 5.1 in turn follows from the following bootstrap Lemma.
Lemma 5.2**.**
Given the assumptions of Lemma 5.1, one can find (allowed to depend on ) such that if one has the bootstrap assumption
[TABLE]
then one has the bootstrap estimate
[TABLE]
It then remains to prove Lemma 5.2, for which the rest of this section is devoted to.
5.2 Well-posedness results in
Before we start proving Lemma 5.2, we need some further well-posedness for and in high regularity space. We start with he following two propositions on the persistence of regularity.
Proposition 5.3**.**
With enhanced assumption (5.1), there exists C=C\big{(}m,\rho,\Lambda_{\text{ini}},\Lambda_{\text{noi}}^{\prime},\|f\|_{L_{\omega}^{\rho}H_{x}^{1}}\big{)} such that
[TABLE]
Proof.
The bound for is proved in [FX21b, Proposition 3.2]. The uniform-in- bound for can be proved by following exactly the same procedure as that for and by further local Duhamel expansion as in Section 3. We omit the details here. ∎
Proposition 5.4**.**
Let . For every and , there exists C=C\big{(}m,\rho,\Lambda_{\text{ini}},\Lambda_{\text{noi}}^{\prime}\big{)} such that
[TABLE]
As a consequence, we have
[TABLE]
for every . In the second claim, the constant also depends on . The same bounds are true for .
Proof.
Again, for simplicity, we prove the bounds for only. For every , we have
[TABLE]
The last three terms above can be controlled directly via dispersive estimates and in the stochastic integral case, also with Burkholder inequality. To bound the first term, one really uses the flow being in , so that
[TABLE]
Hence, one get the desired bound on . The bound for follows from Kolmogorov criteria. ∎
5.3 Equation for and , and a collection of estimates
We rewrite the equation for so that it will be suitable to do comparison of to . Again, we short for , and let and be the same as the previous sections. We denote by and denote by . We will present the arguments with consistent notations in the previous sections.
Note that solves (3.5) except that we need to use to replace .
We recall (1.12), and rewrite the equation of as a perturbation of the equation which satisfies. We have
[TABLE]
Note that the above is the expansion of (which satisfies (1.12)) in terms of the Duhamel formula for in (3.5) with some additional error terms. The error terms are those with the signs above. They will be treated in a purely perturbative way, and the actual signs will not matter. We use to denote .
Recall that , we have
[TABLE]
We again introduce some notations to simplify the above expression. Let
- •
,
- •
,
- •
,
- •
,
- •
,
- •
,
- •
.
Now, we may rewrite the equation for as
[TABLE]
We first summarize the estimates for and in the following lemma, which is analogues to Lemma 4.3, 4.4, and 4.5.
Lemma 5.5**.**
Let and . We have the following:
- •
Estimates for , and . There exist and such that
[TABLE]
uniformly in and for all , and
[TABLE]
- •
Estimates for and . There exist and for such that
[TABLE]
and
[TABLE]
- •
Estimates for .
[TABLE]
- •
Estimate for
[TABLE]
All the bounds are allowed to depend on , but are uniform in .
Remark 5.6*.*
The exact value of may change from line to line, but we only need such be positive. The point is that when and are small enough (depending on ), the terms and could always overcome the loss of any large constant (depending on ).
Proof of Lemma 5.5.
Since the structure of the proof is very similar to Lemma 4.5, we will sketch for he parts which are similar and only focus highlight the difference. The main difference will be in the estimates for and , which rely on the Hölder continuity of the flow. turns out to be the most technically complicated term.
The estimates for and are completely the same as those for and .
For , one may take , and . Arguing similarly as the bound for , we get
[TABLE]
where we have enlarged the factor to order . Using the Hölder continuity of the flow in Proposition 5.4, and observe that , we obtain
[TABLE]
Now we turn to the estimate for . We spit it as
[TABLE]
where
[TABLE]
and
[TABLE]
We only need to find the associated and for , . Recall we are working on the simple noise and are Schwartz functions.
We first give the estimate for . Recall from Proposition 5.4 that is Hölder continuous with the estimate
[TABLE]
which also implies .
Observe that , and for all . We may use the pointwise estimates
[TABLE]
where we have used the dispersive estimate , the unitarity of in , and the estimate for the difference between and in Lemmas A.1 and A.2. Thus, we get
[TABLE]
We can take and both to be right hand side of (5.27), the desired estimate then follows from (5.25) and the observation that .
We now turn to for . Observe
[TABLE]
We further split it as
[TABLE]
where
[TABLE]
and .
The idea is because of Lemma A.1, we can trade some regularity to replace the in by . The estimate of is similar to , and we omit the details. We focus on the estimate of , and construct the associated and . Observe that
[TABLE]
where for , and [math] otherwise. For notation convenience, we short as . Let
[TABLE]
The key observation is that has mean [math]. Thus, the two quantities in inside the norms above are discrete martingales (in ) in and respectively (fixing ).
The remaining arguments are similar to that for in Lemma 3.1. We sketch the estimate for but skip that of .
Again, by (3.14), we may fix , and just estimate . It follows from the Burkholder inequality (2.15) that
[TABLE]
Also note that are independent for different . Observe
[TABLE]
The estimate for now follows, and we can conclude the bound for .
The estimate for is exactly the same as that for , and we omit the details.
We now turn to . One can directly apply the triangle inequality and dispersive estimate (2.1) to derive
[TABLE]
where we have used and .
We finally turn to . This estimate is similar to (3.49), (3.50) as well as the term in Lemma 4.5. Observe
[TABLE]
and the desired estimate follows. We have thus completed the proof for all the bounds in Lemma 5.5. ∎
5.4 Proof of Lemma 5.2
We are now ready to prove Lemma 5.2, which will then conclude this section. The arguments are very similar to those for Lemma 4.2.
Let be a small parameter (independent of ). For almost surely every , we take a (random) partition of the interval into such that for every , the following properties hold:
- •
For , either or for ,
- •
For , either or for .
Thus, there can be most such intervals. Observe that in every , one has
[TABLE]
To see why the above bound is true, one just needs to consider the following cases separately:
- •
Both and are [math] for . Then there is nothing to prove.
- •
Neither nor is [math], then one has and . We then split the whole term as
[TABLE]
and estimate separately with observation .
- •
Without loss of generality, we only consider for and . We observe
[TABLE]
and observe again . The bound for this situation also follows.
Now, in every interval , using Strichartz and triangle inequalities, we have
[TABLE]
Absorbing into , and applying the estimates in Lemma 5.5, we get
[TABLE]
Iterating the above bound times, we get
[TABLE]
Taking -norm on both sides, we obtain
[TABLE]
We now choose sufficiently small depending on , and small enough depending on and . The desired bound then follows.
Appendix A Some useful inequalities
We will need following regularity estimate for the linear Schödinger estimate, it is natural in the sense the natural scaling of Schrödinger will trade two space derivative into one time derivative.
Lemma A.1**.**
For every , we have
[TABLE]
uniformly over .
Proof.
Applying Plancherel Theorem, we have
[TABLE]
Split the into the and , use in the first region, and in the second one, then the desired estimate follows. ∎
This has an immediate consequence which will be useful in our analysis, we summarize it as the following lemma
Lemma A.2**.**
Let be some nice Schwartz function, let , , then we have
[TABLE]
The bounds depend on but are uniform in and the ’s.
\endappendix
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[BDG 72] D. Burkholder , B. Davis , and F. Gundy . Integral inequalities for convex functions of operators on martingales. Proc. Sixth Berkeley Symp. on Math. Statist. and Prob 2 , (1972), 223–240.
- 2[BP 99] Z. Brzeźniak and S. Peszat . Space-time continuous solutions to SPDE’s driven a homogeneous Wiener process. Stud. Math. 137 , no. 3, (1999), 261–290.
- 3[Brz 97] Z. Brzeźniak . On stochastic convolution in Banach spaces and applications. Stochast. Stochast. Rep. 61 , (1997), 245–295.
- 4[BRZ 14] V. Barbu , M. Röckner , and D. Zhang . Stochastic nonlinear Schrödinger equations with linear multiplicative noise: rescaling approach. J. Nonlinear Sci. 24 , no. 3, (2014), 383–409.
- 5[BRZ 16] V. Barbu , M. Röckner , and D. Zhang . Stochastic nonlinear Schrödinger equations. Nonlinear Anal. Theory Methods Appl. 136 , (2016), 168–194.
- 6[Bur 73] D. Burkholder . Distribution function inequalities for martingales. Ann. Prob. 1 , no. 1, (1973), 19–42.
- 7[Caz 03] T. Cazenave . Semilinear Schrödinger equations . Courant Lecture Notes in Mathematics. American Mathematical Society, 2003.
- 8[CKS + 08] J. Colliander , M. Keel , G. Staffilani , H. Takaoka , and T. Tao . Global well-posedness and scattering for the energy-critical nonlinear Schrödinger equation in ℝ 3 superscript ℝ 3 \mathbb{R}^{3} . Ann. Math. 167 , no. 3, (2008), 767–865.
