Invariance of white noise for KdV on the line
Rowan Killip, Jason Murphy, and Monica Visan

TL;DR
This paper proves that solutions to the KdV equation with white noise initial data on the real line exist almost surely, preserve white noise distribution over time, and satisfy the group property, also providing new insights for the torus case.
Contribution
It establishes the invariance of white noise for KdV on the line and offers a novel proof for the torus setting, advancing understanding of stochastic PDE invariance.
Findings
Solutions exist almost surely with white noise initial data.
Solutions obey the group property over time.
White noise law is preserved at all times.
Abstract
We consider the Korteweg--de Vries equation with white noise initial data, posed on the whole real line, and prove the almost sure existence of solutions. Moreover, we show that the solutions obey the group property and follow a white noise law at all times, past or future. As an offshoot of our methods, we also obtain a new proof of the existence of solutions and the invariance of white noise measure in the torus setting.
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.
Invariance of white noise for KdV on the line
Rowan Killip
Department of Mathematics, University of California, Los Angeles
,
Jason Murphy
Department of Mathematics and Statistics, Missouri University of Science and Technology
and
Monica Visan
Department of Mathematics, University of California, Los Angeles
Abstract.
We consider the Korteweg–de Vries equation with white noise initial data, posed on the whole real line, and prove the almost sure existence of solutions. Moreover, we show that the solutions obey the group property and follow a white noise law at all times, past or future.
As an offshoot of our methods, we also obtain a new proof of the existence of solutions and the invariance of white noise measure in the torus setting.
1. Introduction
The Korteweg-de Vries equation
[TABLE]
takes its name from the paper [26] where it is derived as a model for long waves of small amplitude in shallow water. Since that time, it has grown to be one of the central models in mathematical physics because it sits at the nexus of numerous strands of research, both pure and applied. It is one of the simplest models synthesizing nonlinear and dispersive effects, it is Hamiltonian, it supports solitons, and it is completely integrable.
In seeking to consider statistical ensembles of initial data for a mechanical system, one is naturally led to Gibbs measures, which model such a system in thermal equilibrium. Such measures are constructed directly from the Hamiltonian structure and the temperature. (More commonly, the temperature is expressed through the inverse temperature where is the temperature and is the Boltzmann constant.)
The KdV equation admits multiple Hamiltonian descriptions; this is a common symptom of being completely integrable. The best known of these descriptions is the following (cf. [20]): The Hamiltonian
[TABLE]
generates the dynamics (1.1) via the Poisson bracket
[TABLE]
(Regarding our notation for functional derivatives, see (2.5).)
The second description is based on the Magri–Lenard bracket (cf. [30]):
[TABLE]
under which (1.1) is generated by
[TABLE]
Evidently, (1.2) and (1.5) both define conserved quantities for the KdV flow. We should also mention the simplest of all the conserved quantities:
[TABLE]
which in the water-wave setting represents any surplus/deficit of water relative to equilibrium and thereby conservation of matter.
These three quantities, , , and , are merely the first members of an infinite hierarchy of such conservation laws; see [35]. In fact, the full list can be reconstructed via the Lenard recursion: the flow generated by (1.4) for one entry in the list agrees with the flow generated by (1.3) for the next entry in the list. In particular, is a Casimir for (1.3), but generates translations under (1.4); generates translations under (1.3), but KdV under (1.4); lastly, generates KdV under (1.3), but 5th order KdV under (1.4).
One is naturally lead to ask which Poisson structure is the ‘physical’ one. The answer depends on which physical system one is modeling. In fact, Olver [46] has shown that even in the case of waves in a shallow channel, the answer depends on which approach one takes to deriving KdV from the full water waves system. Far from creating a paradox, his arguments actually present a compelling resolution of one, namely, why KdV is completely integrable.
Thus, in place of discussing which Hamiltonian structure is more physical, we should really be focusing our attention on the question of which Gibbs measure is most satisfactory. Here the answer is more clear cut. Because the highest order term (in powers of ) in has an indefinite sign, the corresponding Gibbs measure is unnormalizable, even in finite volume; moreover, this cannot be remedied by passing to a free energy of the form .
On the other hand, if one adopts as the Hamiltonian, then the proper meaning of the Gibbs measure is trivial: it is the Gaussian process with covariance given by the identity operator! This process is more popularly referred to as white noise. The ‘white’ property of this process is that it inhabits all frequencies to an equal degree. (For a more rigorous definition of white noise, see subsection 2.2; for the equipartition property, see (2.10).) We set the temperature parameter in our definition of white noise, since other temperatures can be recovered by scaling (which also respects the dynamics).
It is our belief that white noise provides the best realization of a ‘soliton soup’ available at this time. As we will describe shortly, a number of measures have been constructed in finite volume that compete for this moniker; however, none seem to survive in the thermodynamic limit. On the other hand, since the measure itself captures none of the soliton’s behavior, it is essential to consider the dynamics. That is precisely the ambition of this paper: to construct dynamics for the soliton soup in the thermodynamic limit. More precisely, we will show the following:
Theorem**.**
The KdV dynamics generates a measure-preserving one-parameter group of transformations on the space of tempered distributions on endowed with white noise measure.
Further clarification of the meaning of this assertion will be provided as we proceed. The impatient reader may also refer directly to Section 7, with particular attention to Theorem 7.1 and Corollaries 7.4 and 7.5.
It is natural to ask if white noise measure is, in fact, supported on solitons as opposed to radiational waves. The only way that seems reasonable to distinguish these possibilities is to look at the spectrum of the associated Lax operator, that is, the one-dimensional Schrödinger operator with white noise potential. In the case of KdV with smooth localized data, we see that solitons accompany eigenvalues of the Lax operator, while dispersive wave phenomena are captured by the absolutely continuous portion of the spectrum. For stationary (i.e. translation invariant) random potentials, the phenomenon of Anderson localization (i.e. pure point spectrum with localized eigenfunctions) has proven to be essentially universal in one spatial dimension; for the case of white noise potential, it was proved by Minami in [34]. This suggests that our ‘soup’ is indeed comprised solely of solitons, undiluted by radiation.
We turn now to a brief discussion regarding other constructions of invariant measures. This subject has grown explosively in recent years and so we will need to curtail our discussion rather sharply. We would like to focus our attention on two concrete scenarios: focusing equations and the thermodynamic limit.
The dominant model in the study of invariant measures for focusing equations (essentially those supporting solitons) has been the nonlinear Schrödinger equation, stimulated by the pioneering work [29]. In this setting, the physical field is complex-valued and the Hamiltonian takes the form
[TABLE]
As with , this Hamiltonian is not coercive and the usual Gibbs measure is unnormalizable. Working on the torus and with , Lebowitz, Rose, and Speer constructed a modified Gibbs measure by incorporating a sharp (i.e. compactly supported) mass cutoff. Here ‘mass’ refers to , which is invariant under the NLS flow. The almost sure existence of solutions for such initial data was shown by Bourgain [4]. In the same paper, Bourgain also shows the invariance of the -truncated -Gibbs measure under the KdV flow on the torus.
Two ways of modifying the sharp mass cutoff are suggested in [29] and analyzed more thoroughly in [8, 43], namely, (i) introducing a super-exponentially decaying weight in the mass and (ii) restricting to a constant mass sphere. Once again, this is set on the one-dimensional torus. For the two-dimensional torus, see [6]. The existence and invariance of analogous cutoff Gibbs measures in finite volume has also been actively pursued for other focusing equations,[2, 17, 7, 21, 57, 45, 39, 40, 38, 56, 16, 58, 59], with particular attention paid to Benjamin–Ono and Derivative NLS, both of which are completely integrable.
We turn now to the question of taking the infinite-volume limit of these measures. This has been investigated by Rider [49, 50], who considers the thermodynamic limit of NLS in one dimension, and by Chatterjee [9], who considers a simultaneous continuum and infinite-volume limit of discretized NLS in general dimension at fixed mass and energy. In both cases, the limit was proven not to exist. More precisely, the statistical ensembles of initial data were shown to increasingly collapse upon a single solitary wave (randomly placed) and background noise of negligible magnitude. We believe that these important works illuminate a universal truth, namely, that no such cutoff statistical ensembles for focusing equations admit a thermodynamic limit.
By contrast, the construction of Gibbs measures in the thermodynamic limit and of corresponding almost-sure dynamics has been very successful for defocusing Hamiltonian PDE. We note, in particular, the work on nonlinear wave equations in one dimension by McKean and Vaninsky [32, 33], by Xu [60] in three dimensions with spherical symmetry, and the work by Bourgain [5] on NLS in one dimension. Of these, the work of Bourgain is most pertinent to the problem discussed herein, because unlike NLS and KdV, the wave equation enjoys finite speed of propagation.
As is natural for any process describing thermal equilibrium, white noise is invariant under translation (more formally, it is a stationary process). In fact, the process is not only ergodic under translation but (strong) mixing. (This is easily deduced from independence on disjoint intervals, cf. Remark 2.8.)
As we will briefly discuss, there has been a recent surge in activity regarding KdV with initial data sampled from almost periodic processes [3, 13, 18, 28]. Recall that almost periodicity means that translates of the initial data form a precompact set in . This should be regarded as antithetical to mixing; indeed, representative examples are periodic and quasi-periodic functions. A major goal of these investigations of almost periodic initial data is to resolve a conjecture of Deift [14, 15], namely, that such initial data leads to almost periodic flows in time. By comparison, white noise is mixing under translations and it is natural to believe that it is also mixing under the KdV flow. By constructing almost-sure solutions in this paper, we are able to make this assertion precise; see Conjecture 7.6. This seems a very challenging problem. For a typical linear flow, one can prove that the evolution of white noise is mixing directly from the Fourier transform. The only nonlinear result we know of in this direction is that of McKean [32] regarding the -Gordon equation on the line with Gibbs-distributed initial data, which relies heavily on both the complete integrability and the causal structure/Lorentz invariance of that model.
The state of affairs laid out above explains our great enthusiasm for studying the KdV equation with white noise initial data. Indeed, we are not the first to be so intrigued. In particular, invariance of white noise for KdV on the torus has been resolved (in several different ways) in a series of papers by Oh, Quastel, and Valkó [41, 42, 44, 47]. The existence of global dynamics for KdV on the torus with white noise initial data predates these works, since Kappeler and Topalov [23] show that KdV is globally well-posed in . This result is used crucially in the approach of [47], but not in the other papers. We shall present one further solution of this problem in Section 3 as an offshoot of the main thrust of our argument.
Incidentally, while it is now known [25] that KdV is also globally wellposed in , this is of little direct relevance to the question of white noise initial data on the line, which has no decay at infinity. Indeed, periodic data is a better proxy for white noise, since both are ergodic under translations; no law on has this property. This ergodicity also forbids any local smoothing effect, which is one of the key tools usually employed in the study of dispersive equations in infinite volume.
While it is tempting to try to take the infinite-volume limit of the torus situation (which is completely settled), this seems absolutely hopeless at this time. We have no control on the transportation of norm from one spatial location to another. Moreover, the central trick of exploiting Fubini to convert statistical conservation into space-time bounds is useless if one cannot make sense of the nonlinearity pointwise in time, as is the case here — one simply cannot square white noise (with or without Wick ordering).
For the state of the art in this approach, see [5], in which Bourgain treats Gibbs measures for one-dimensional defocusing NLS (with nonlinearity not exceeding cubic) by taking the infinite-volume limit of torus dynamics. Note that sample paths from the Gibbs measure considered in [5] are essentially bounded; indeed, the defocusing nonlinearity confines the paths no less tightly than for the Ornstein–Uhlenbeck process, for which one already has at most logarithmic growth.
We should also note that in treating such infinite-volume problems, taking a limit of some cutoff model is one of the few methods that have any chance of success. Direct local wellposedness arguments are hopeless: if the length of the time interval (on which the solution is constructed) needs to depend on any facet of the initial data, then by ergodicity, it must be zero. Or, to put it more colloquially, for an ergodic process, anything bad that can happen, will happen (and with positive density in space).
By this reasoning, the first step in our analysis must be to find the right cutoff model. It is in this regard (and almost no other) that what we do here builds fundamentally on the work [25]. We will use (a modification of) the commuting flows we introduced in [25] as our cutoff model. The fundamental obstruction to be overcome in [25] is very low regularity, common to both line and circle, and (by scaling) it suffices to consider initial data of small norm. On the other hand, white noise is rather more regular (it belongs to ), but has no decay and cannot be considered small. (For any threshold and norm, there is somewhere in space for which the norm exceeds that threshold.) In light of these distinctions, we view the problem of white noise on the whole line as an independent test of the methodology based on commuting flows.
The commuting flows employed in [25] were defined through the Gardner bracket (1.3) and their Hamiltonians:
[TABLE]
where the parameter and the integral is taken over one period in the periodic case or over the whole real line. Here,
[TABLE]
where denotes the diagonal Green’s function at energy :
[TABLE]
It is not difficult to see that the Hamiltonians are well defined for small data in and that the resulting flows are well defined for small data in ; see [25] for details. The smallness assumption here depends on and is necessary; indeed, for large potentials (of indefinite sign) the spectrum of the Schrödinger operator can collide with and it will not be possible to define nor the resulting flow. In the case of white noise, for example, it is relatively easy to show that the spectrum of the whole-line Schrödinger operator is the entire real axis!
Our remedy here is not terribly surprising: We move off the real axis, calling the new parameter ; see (3.3) for the precise Hamiltonian and (3.4) for the resulting dynamics. On the other hand, the underlying size problem (that forced us to change the flows) also breaks all the technology developed in [25], which was based on a perturbative analysis about . Setting aside for the moment how this is to be resolved, let us continue with the overarching plan of this paper.
We begin with the flow on the torus of circumference . The well-posedness of the flow is elementary since the nonlinearity is Lipschitz on ; see Proposition 3.1. We show that this flow preserves (periodized) white noise measure in Theorem 3.3. While this could also be proved by the (now standard) method of finite-dimensional approximation, it is more efficient to prove it directly using integration by parts in Gauss space.
The last result of Section 3 is a new proof of the invariance of white noise under the KdV flow on the torus; see Theorem 3.4. The argument is rather elementary; we simply exploit the fact that the flows conserve white noise and converge to the KdV flow as .
The key strategic decision in treating white noise initial data on the whole line is to first send the volume to infinity (at fixed ) and then to send to recover the KdV flow. The virtue of this choice is that the flow effectively has finite speed of propagation; the effective speed limit is of order . This allows us to minimize the effect of the discrepancy between the two initial data, namely, periodic white noise and infinite-volume white noise. To prove almost sure convergence, it is necessary to couple the finite-volume and infinite-volume initial data together in an appropriate way. We do this by starting with a sample of white-noise in infinite volume, truncating it to the interval , and then extending it periodically thereafter.
A concrete manifestation of finite speed of propagation for the flows can be found, for example, in the proof of Lemma 6.3. There we see that the exponentially weighted norm grows at most exponentially in time with a rate that is bounded by . We have no such control on the transport of local norm in the KdV setting. Indeed, as shown in [25, §7], the transport of such a quantity is mediated by the local norm of the solution, which is guaranteed to be infinite in the white noise setting.
To prove convergence, we first need estimates. Indeed, here lies the fundamental challenge in sending for the flow. The price to pay for limiting the propagation speed and for improving the regularity of the nonlinearity is that the evolution equation has become nonlocal. This is apparent in (3.4) through the appearance of the diagonal Green’s function. In this way, we see that the spectre of far-away, low-probability, bad events ruining everything remains; nevertheless, we claim it has been ameliorated (and this is why we will ultimately succeed).
Sections 4 and 5 are devoted to obtaining the bounds we need for the diagonal Green’s function, both to send at fixed in Section 6 and then to send in Section 7. The key phenomenon to leverage in controlling bad events is the exponential decay of the Green’s function (away from the diagonal) — this is the backbone of Fröhlich–Spencer [19] multiscale analysis, which we will adapt to our needs. Various forms of multiscale analysis have grown to be central tools in the study of the Anderson model; see [27] for a survey. While is true that the Schrödinger operator with white noise potential is a natural form of Anderson model, the needs of our dispersive analysis are rather different from those of proving Anderson localization. First, we work with energies at a positive distance from the real axis; thus, we do not need the potential to generate the exponential decay, we only have to prevent the potential from destroying the decay already present in the free resolvent. This distinction manifests, for example, in the development of our initial length scale estimates Propositions 4.6 and 4.7.
On the other hand, for our purposes, the mapping properties of the resolvent (particularly ) are far more important than the mere decay of the Green’s function. This is vital, for example for controlling the dependence of the resolvent upon the potential, due to the extreme irregularity of our potentials. The need for such operator bounds is also a reason to prefer multiscale analysis of the resolvents over transfer matrix techniques (commonly used in 1D models), which work at the level of the Green’s function. The desire for clean resolvent bounds also influences our decision to eschew the traditional technique of Dirichlet decoupling in our treatment of the multiscale analysis.
A second (and more decisive) reason for wishing to avoid Dirichlet decoupling is the need (in Section 7) for lower bounds on the diagonal Green’s function. Evidently, a Dirichlet boundary condition will drive to zero. In the proof of Proposition 5.6, we see that even obtaining pointwise lower bounds on the diagonal Green’s function in expectation requires significant control on the resolvents (including Lemma 5.5), as well as considerable additional gymnastics.
Our approach to multiscale analysis is to work consistently on the whole real line and to successively reveal the potential in dyadic windows centered on the origin. This leads to the following expansion of resolvents:
[TABLE]
and denotes the resolvent with potential . We then obtain our infinite-volume bounds (Proposition 5.1 and 5.2) by combining this expansion (both at finite and infinite ) with the initial length scale estimates of Section 4. Although the estimates of Section 4 demonstrate good exponential decay, they contain prefactors depending (weakly but unfavorably) on . Removing these prefactors is essential for taking the limit and this is what multiscale analysis achieves.
There is one further wrinkle in this story that we have omitted, namely, that in order to prove the convergence of the flows, we need bounds not only in infinite volume, but also on finite tori, but with bounds independent of the circumference. To do this, we need a two-parameter version of the argument outlined above, where denotes the length of potential revealed near the origin (as in (1.8)) and then this section of potential is repeated in each period cell, which has length ; see (4.1) for the precise formula.
Let us now turn our attention to Section 6, which considers the flow on the whole line. The main result here is Theorem 6.2, which summarizes the results of Propositions 6.7 and 6.8. The former proposition constructs solutions of the flow obeying certain additional bounds (that hold almost surely); the latter shows that solutions obeying such bounds are unique. One important consequence of the uniqueness statement is that it allows us to ensure that almost surely the full trajectory avoids the null set of initial data on which we do not construct solutions. (This would be trivial for a discrete dynamical system, but our set of times is uncountable.) In particular, it is meaningful to ask if our flows have the group property. They do! See Corollary 6.9 for details.
There are two main components to our construction of solutions to the flows in infinite volume as limits of the corresponding flows on ever-larger tori. The first is to obtain bounds on the finite-volume solutions that are uniform on compact time intervals. This is the content of Lemmas 6.3 and 6.5, which rely crucially on the effective speed limit discussed above. The second component is to demonstrate convergence of the dynamics by controlling the time derivative (3.4), which ultimately means showing convergence of the diagonal Green’s functions. The first step in this direction is Lemma 6.4; however, this only provides information pointwise in time. The reason is that the ‘Lipschitz constant’ of the mapping involves the norms of resolvents, which (since we need volume-independent bounds) can only be provided through the multiscale analysis, which in turn yields bounds in expectation only. The remedy is to prove equicontinuity in time, for which we employ methods closely connected with the Kolmogorov continuity theorem; see Lemmas 2.4 and 2.5 for the underlying idea and Lemma 6.6 for the specific implementation.
In Section 7, we show solutions to the flows on the whole line with white noise initial data converge uniformly on compact time intervals (almost surely) as ; see Theorem 7.1. In view of existing deterministic results, it is natural to simply declare that these limits are the solutions to KdV with white noise initial data. However, in Corollary 7.4 we go one step further and verify that the limit and its associated diagonal Green’s function obey the same integral equation as in the deterministic case, namely, (7.17). Thus is a solution of KdV in the only intrinsic sense that we currently know makes sense. One further virtue of our flows is that they obey the group property; see Corollary 7.5. This is a further indication of uniqueness — the evolution of a state is independent of how (or when) it appears in the limiting process.
Needless to say, the difficulty in making direct sense of the KdV flow for highly irregular data also makes it difficult to show convergence of the flows. We adopt here an idea from [25], namely, to use the diagonal Green’s function. A key difference between and is that all the terms in the differential equation obeyed by under the KdV flow make sense as tempered distributions pointwise in time. By employing all the estimates proved in the preceding sections, we are able to show that the diagonal Green’s functions associated to the flows converge as . Initially (see Proposition 7.2), this convergence is only in expectation and in a weighed Sobolev space with regularity. These defects are removed by demonstrating equicontinuity in time (in the manner used in Section 6) and by employing the extra spatial regularity proved in Proposition 5.6. In this way, we are able to upgrade the convergence to a weighted norm in space, uniformly on compact time intervals.
In the setting of [25], the convergence of the Green’s functions guaranteed the convergence of the solutions themselves by virtue of the diffeomorphism property; see [25, Proposition 2.2]. That result is proved by the inverse function theorem and as such, is confined to small initial data. Thus, we need here a new way of connecting the diagonal Green’s function back to the potential. As is now complex, we no longer can expect a diffeomorphism ( is complex-valued and real-valued); at best one may hope for an embedding. This is what we prove in Lemma 2.14, albeit in the limited setting of . The key new relation is (2.25); indeed, it is this relation that we show is retained as we send and then . And it is this relation that ultimately allows us to prove Theorem 7.1 by deducing convergence of the solutions (uniformly on compact time intervals in weighted ) from the behavior of their diagonal Green’s functions.
The remainder of Section 7 is devoted to proving the auxiliary properties of our solutions outlined above and to describing two interesting (but challenging) directions for further investigation. First, we highlight open questions related to uniqueness for KdV at low regularity. This is open both in the deterministic and random settings. In particular, it is currently unknown whether Kappeler–Topalov [23] or Killip–Visan [25] solutions are unique in some intrinsic sense, independent of their appearance as the unique limit of Schwartz-class solutions. The second major question we raise is whether the KdV flow with white noise initial data is mixing (in time). We refer here specifically to the whole-line case. This clearly fails on the torus; known conservation laws show that the torus flow is not even ergodic.
Acknowledgements
R. K. was supported by NSF grant DMS-1600942. J. M. was supported by a Simons Collaboration grant. M. V. was supported by NSF grants DMS-1500707 and DMS-1763074.
The authors are also grateful to Changxing Miao for hosting us at the Institute of Applied Physics and Computational Mathematics in Beijing, where part of this work was completed.
2. Notation and preliminaries
We write or to denote for some . Dependence on various parameters will be indicated by subscripts. If and , we write . The other common notation for this relation, namely , is used in this paper to indicate the law of a random variable. We employ the Japanese bracket notation . We write and
Throughout, primes will represent derivatives with respect to the spatial variable .
Our convention for the Fourier transform is
[TABLE]
For and , we define
[TABLE]
We have the simple but useful estimate
[TABLE]
For , we write for the Schatten class of compact operators whose singular values lie in . We will primarily use the Hilbert–Schmidt class . Recall that an operator on is Hilbert–Schmidt if and only if it admits an integral kernel ; moreover,
[TABLE]
The product of two Hilbert–Schmidt operators and is in the trace class ; moreover,
[TABLE]
Hilbert–Schmidt operators form a two-sided ideal in the algebra of bounded operators; concretely,
[TABLE]
We refer the reader to [51] for more information.
Given a function , the corresponding multiplication operator satisfies
[TABLE]
We will employ the pairing throughout the paper. This also informs our notation for functional derivatives:
[TABLE]
2.1. Probabilistic preliminaries
Throughout the paper we fix a probability space with probability measure . Expectation (i.e. integration with respect to ) is denoted by .
The hypercontractive property of polynomials in multivariate Gaussian random variables is well understood thanks to the definitive work of Nelson. We need here only the most basic manifestation of this phenomenon, whose proof we include for completeness.
Lemma 2.1**.**
Let be a positive semidefinite quadratic form in jointly Gaussian random variables. Then
[TABLE]
Consequently, for we have
[TABLE]
Proof.
Let us write , where and is positive semidefinite. We choose so that and let be an orthogonal matrix diagonalizing . We write for the eigenvalues (repeated with multiplicity) of .
If , then (computing the characteristic function, say) one finds that (the law of ). Moreover,
[TABLE]
Thus the left-hand side of the stated inequality can be estimated as
[TABLE]
Here we have used for , which follows from computing the Gaussian integral.
From (2.6), Tchebychev’s inequality yields
[TABLE]
Choosing , we then deduce (2.7) in the usual way.∎
Lemma 2.2**.**
Let be a collection of random variables satisfying
[TABLE]
for some . Then
[TABLE]
Proof.
For as given, . ∎
Our next lemma follows from what is shown in any elementary probability text under the rubric of uniform integrability. However, as there is no catchy name for this result, we write it out in full here:
Lemma 2.3**.**
If for every and in probability, then also in for each .
The next lemma encapsulates the idea of the Kolmogorov Continuity Theorem (cf. [55, §2.1]) in a form that will be useful to us.
Lemma 2.4**.**
Given , , a Banach space , and a process that is almost surely continuous,
[TABLE]
Proof.
We provide details for ; this can then be iterated to yield the result for larger . If is continuous and then
[TABLE]
and consequently,
[TABLE]
Thus, (using Hölder’s inequality on the sum in ),
[TABLE]
The result now follows by taking expectations and exploiting its linearity. ∎
While the estimates we prove in Section 7 do yield Hölder continuity in time of solutions to KdV (in some weighted Sobolev spaces) via this lemma, our principal reason for including it here is to provide the requisite equicontinuity to upgrade convergence in probability at each time to convergence. We may encapsulate what we need in the following way:
Lemma 2.5**.**
Given , a Banach space , and a sequence of processes satisfying
[TABLE]
for all and all , there is a limit process with
[TABLE]
Remark 2.6**.**
In view of the bound, one may trivially upgrade the convergence to for any . On the other hand, convergence in may fail even for deterministic sequences.
Proof.
For fixed, we have that are bounded in for any and converge in probability (because they are Cauchy in this sense). Thus, by Lemma 2.3, these random variables converge in sense for any and
[TABLE]
On the other hand, given natural numbers ,
[TABLE]
Thus, taking large and then large (depending on ), we obtain
[TABLE]
This shows that is Cauchy in and so convergent there. ∎
2.2. White noise
For concreteness, we record here some well-known basic properties of white noise. Note that we consider here only real-valued white noise.
Theorem 2.7**.**
A random variable taking values in is said to be white noise distributed if
[TABLE]
for all real-valued Schwartz functions . Moreover, given any orthonormal basis of and i.i.d. random variables,
[TABLE]
converges almost surely in and follows the white noise law.
Remark 2.8**.**
In view of (2.9), we may say that white noise is the Gaussian process with covariance
[TABLE]
This shows that and are independent whenever and are orthogonal in . In particular, if and are disjoint intervals, then and are independent. This independence property immediately yields the ergodicity (indeed, mixing property) of white noise under spatial translations.
Outline of Proof.
The existence and uniqueness of a cylinder measure on obeying (2.9) follows from the Minlos Theorem; see, for example, [52, Theorem I.2.3].
We turn now to (2.10). For any finite set ,
[TABLE]
Thus -convergence in this weighted Sobolev space is guaranteed. Almost-sure convergence in this weighted Sobolev space (and so also in ) can then be deduced from the maximal inequality for martingales in Hilbert space (see [54, Theorem 5.3.27]). The fact that the limit satisfies (2.9) is elementary. ∎
A more precise version of the calculation (2.2) is the following: For ,
[TABLE]
The construction (2.10) works equally well on any torus, say . Equivalently, one may begin with white noise on , restrict to the interval and then construct by periodizing (as in (4.1) with ). The analogue of Remark 2.8 in this setting is
[TABLE]
Arguing as in (2.12), one readily sees that
[TABLE]
for any , by using Lemma 2.1.
The following result represents integration by parts in Gauss space; see [31] for further details.
Lemma 2.9**.**
Let be white noise and suppose belongs to , which is to say
[TABLE]
Then for any we have
[TABLE]
2.3. Resolvents and the diagonal Green’s function
For with , the free resolvent
[TABLE]
has integral kernel
[TABLE]
Definition 2.10**.**
We call nonzero admissible if . For any admissible , we set
[TABLE]
For , we define
[TABLE]
We say an admissible is strictly admissible if
[TABLE]
Here is an absolute constant large enough to ensure that Lemma 2.12 below holds for all strictly admissible . Note that for a strictly admissible we have .
We have the basic estimate
[TABLE]
uniformly over all admissible . For , is positive and self-adjoint and hence has a unique positive square root. For admissible we define as a Fourier multiplier operator, with symbol analytically continued from . We then have
[TABLE]
uniformly over admissible .
We record a few estimates for the free resolvent.
Lemma 2.11**.**
For ,
[TABLE]
Proof.
Direct computation (as in [25, Proposition 2.1]) shows
[TABLE]
as desired. ∎
The following lemma is easily verified from the explicit kernel of . However, we use this opportunity to introduce the Combes–Thomas argument that will be very important later in the paper. For a pedagogical introduction to this technique, see [22].
Lemma 2.12**.**
For admissible with large enough and ,
[TABLE]
Proof.
We write with . The inverse of the operator appearing in the lemma can be written
[TABLE]
where
[TABLE]
By duality, one has
[TABLE]
Thus for large enough we have
[TABLE]
and so we may write
[TABLE]
This implies the result. ∎
We next discuss the existence of the resolvent for , where may be finite or infinite. Note that when is finite, we still regard the operator as acting on the line, albeit with periodic potential.
Proposition 2.13**.**
Fix and . There is a unique semi-bounded self-adjoint operator on such that
[TABLE]
Indeed,
[TABLE]
The resolvent exists as a jointly analytic function of on the domain
[TABLE]
taking values in the space of bounded operators from to .
Moreover, the diagonal Green’s function and its reciprocal are jointly analytic functions on the same domain, taking values in .
Proof.
Everything in the first paragraph was observed already in [25, Sections 2 and 6]. As was also discussed there, for , one may construct the resolvent via the series
[TABLE]
which converges in the space of bounded operators from to . Indeed, one sees that the form domain of is precisely . Boundedness of from to for general then follows abstractly, as one sees from the resolvent identity
[TABLE]
Analyticity in and follows from the resolvent identities.
That belongs to and is jointly analytic now follows from the expansion
[TABLE]
see [25] for the details in the case .
That belongs to and is analytic will follow from the analogous statements for , once one shows that is nowhere vanishing. This non-vanishing property follows immediately from the spectral theorem; indeed, is a (non-isometric) isomorphism of and so we have
[TABLE]
as well as
[TABLE]
We use here that . ∎
Let us recall some basic facts about the resolvent. For strictly admissible, we have
[TABLE]
In what follows, we define via the spectral theorem, again choosing the branch by analytic continuation from .
By using the series expansion (2.16) and Lemma 2.11, we deduce that
[TABLE]
In particular,
[TABLE]
A computation using the resolvent identity yields
[TABLE]
The diagonal Green’s function satisfies the following important diffeomorphism property. A local version of this property was detailed in [25, Proposition 2.2], which considered only the -ball in and required .
Lemma 2.14** (Global diffeomorphism property).**
Fix a strictly admissible and . Then the mappings
[TABLE]
are diffeomorphisms from onto their ranges in , which are smoothly embedded submanifolds. In particular, one may recover from via
[TABLE]
Proof.
The central point here is to prove (2.25). In view of Proposition 2.13, both sides of this equality are analytic -valued functions of . Thus, it suffices to restrict attention to , in the case that is finite, or to Schwartz class , when . In this setting (see [11]), we may express the Green’s function in terms of the Weyl solutions
[TABLE]
which we normalize to have Wronskian
[TABLE]
and to be square-integrable at , respectively. In this way, we have
[TABLE]
which is nowhere-vanishing. Now we simply compute:
[TABLE]
and thus
[TABLE]
by using the Wronskian relation. This proves (2.25).
We are now ready to show that both maps are global embeddings. From Proposition 2.13 we know that the two mappings are smooth (indeed, real analytic). On the other hand, (2.25) shows not only that the mappings are injective but so is the differential:
[TABLE]
Note that the operator in square brackets is bounded from ; thus, the implicit function theorem guarantees that the mappings are indeed smooth embeddings. ∎
3. Invariance of white noise under the flow on the torus
As in [25], an essential ingredient in our analysis will be the use of a suitable Hamiltonian approximation to the flow (1.1). We now introduce the key quantities in our analysis, adapted from their definition in [25] to allow complex parameters . Specifically, for , , and strictly admissible, we define
[TABLE]
Naturally, many identities derived in [25] carry over immediately, either by analytic continuation, or by simply repeating the earlier arguments. Note that
[TABLE]
The necessity of considering complex stems from the fact that we must simultaneously avoid the spectrum of for all samples of white noise in order to define the resolvents as random variables (cf. Proposition 2.13). In particular, while white noise almost surely belongs to on the torus (in fact, the distribution of its norm has exponential tails), there is no choice of such that exists almost surely for all .
Note that formally, at least, the flows approach the KdV flow as . Indeed, as was discussed in [25], for Schwartz functions one has
[TABLE]
where is the momentum (i.e. generator of translations).
We first establish an global well-posedness result for the flows on the torus. For and data small in , this appears already in [25]. The argument here differs in two ways from that in [25]: is complex and (more significantly) we consider arbitrarily large data.
Proposition 3.1**.**
Fix and strictly admissible. Then the Hamiltonian flow induced by ,
[TABLE]
is globally well-posed on and commutes with the KdV flow. If evolves according to (3.4), then for any strictly admissible the diagonal Green’s function obeys
[TABLE]
Proof.
The derivation of (3.4) and (3.5) is easily adapted from the corresponding statements in [25, Proposition 3.2], where were real with .
We turn to the question of well-posedness. We rewrite (3.4) in Duhamel form:
[TABLE]
To establish local well-posedness, it suffices to prove that is Lipschitz from any ball in into . Equivalently, we may show that is Lipschitz from any ball in into . To this end, we let in and endeavor to estimate
[TABLE]
where is a unit vector, , and we have utilized (2.24). To proceed, we omit the dependence on (using only that ), write , and let to be chosen below. Using (2.17), we estimate
[TABLE]
We first use (2.22) to get
[TABLE]
provided . Similarly, using (2.23) and (2.21), we can bound
[TABLE]
and
[TABLE]
We conclude that is Lipschitz from any ball in into , which implies local well-posedness for the flow.
Global well-posedness follows from the conservation of , which in turn follows from (3.5) as in [25, Proposition 3.2]. Indeed, as
[TABLE]
(cf. [25, Equation (2.20)] and [25, Equation (6.10)]), conservation of yields
[TABLE]
for some absolute constant .
As and the momentum are both conserved by the and KdV flows, we see that not only do KdV and commute, but so do and for any strictly admissible . ∎
Next, we wish to observe that for a given initial data, the flows converge to the KdV flow as . In the case where , this was proved both on the line and on the torus in [25, Theorem 5.1]. With Proposition 3.1 in place, minor modifications are needed to treat complex .
Proposition 3.2** (Convergence of flows).**
Fix and . Given strictly admissible, let denote the global solution to the flow with initial data and let denote the solution to KdV with the same initial data. For any , we have
[TABLE]
As white noise on the torus is almost surely in , Proposition 3.1 allows us to solve the flow (3.4) on any torus with white noise initial data. We next prove that this flow preserves white noise measure.
Theorem 3.3**.**
Fix and strictly admissible. The flow (3.4) preserves white noise measure on .
Proof.
Suppose, contrary to the theorem, that white noise is not preserved by the flow (3.4). Then there is a Schwartz function and a time so that
[TABLE]
Here denotes the solution to the flow with white-noise initial data.
Proceeding with this choice of and , we define by
[TABLE]
Note that by the proof of Proposition 3.1, the data-to-solution map for the flow is smooth on with derivatives growing at most polynomially. Correspondingly, is smooth and
[TABLE]
uniformly for and some absolute constant .
Given the manner in which is defined and the fact that is white noise distributed, we may recast (3.13) as
[TABLE]
The remainder of this proof is devoted to refuting this assertion by proving that
[TABLE]
Using the group property of a well-posed flow and translation invariance of white noise, we have
[TABLE]
On the other hand, by the Duhamel formula (3.6),
[TABLE]
In this way, we deduce that is differentiable with respect to and
[TABLE]
Thus, it suffices to show that
[TABLE]
for any function ; see (2.14). Note that satisfies (2.14) by virtue of (3.14).
In order to verify (3.16), it suffices to treat a dense class of functions in . A convenient class of such functions are ‘polynomials’, that is, finite linear combinations of functions of the form where are (not necessarily distinct) finitely many Schwartz functions. In fact, the Hilbert space admits an orthogonal basis of such polynomials, namely, finite products of Hermite polynomials in the individual appearing in (2.10); see [31, Chapter V].
In what follows, we write and . We begin with the case of monomials: , where is fixed. Differentiating and then integrating by parts, we are left to prove
[TABLE]
We proceed by induction. If , the desired result follows from translation invariance of white noise, which guarantees that the law of is also translation invariant. Indeed, we have
[TABLE]
where .
Now suppose and that (3.17) holds for monomials of lesser degree. By translation invariance,
[TABLE]
Using this identity and then applying Lemma 2.9 in the direction , the fact that , and (2.24), we get
[TABLE]
On the other hand, applying Lemma 2.9 in the direction , using (2.24), and recalling the inductive hypothesis, we compute
[TABLE]
Comparing with (3), we deduce
[TABLE]
as desired. This concludes the proof of (3.16) for the case of monomials.
Simple algebra (applying the above to linear combinations of test functions) allows one to pass from the case of monomials to multinomials and thence to polynomials, as desired. ∎
We are now in a position to present a new proof of the invariance of white noise for KdV on the torus. As noted in the introduction, this result was shown previously in [41, 42, 44, 47] by different methods. The problem of constructing dynamics for white noise initial data was resolved earlier in [23], which proved well-posedness on the whole space . Note that while our construction of the solutions follows [25], the solutions themselves coincide with the Kappeler–Topalov solutions; they are the unique limits of smooth solutions.
Theorem 3.4** (Invariance of white noise for KdV on the torus).**
Fix and let be white noise distributed on . Let denote the global solution to KdV with initial data . Then is white noise distributed for all .
Proof.
As almost surely, we can solve both the flow (for any strictly admissible) and KdV with initial data , yielding global solutions and , respectively. By Theorem 3.3, we have that is white noise distributed at each .
For , Proposition 3.2 yields
[TABLE]
In particular, for any we have
[TABLE]
Thus, by dominated convergence and the fact that is white noise distributed, we deduce
[TABLE]
which completes the proof. ∎
Remark 3.5**.**
In the preceding argument, we approximated KdV on the torus using flows with strictly admissible . This anticipates the approach we will take later when we consider KdV on the line, in which case it is necessary to restrict to complex .
However, if one is only interested in the torus, then it is enough to use flows with real , even though these flows cannot be defined for all samples of white noise. Fixing , we define ,
[TABLE]
where is a small constant dictated by the results of [25]. From that paper we see that for , the flow is globally well-posed on the set which is invariant under the flow. Moreover, is also invariant for the KdV flow and the flows converge to KdV on as . As the probability of is exponentially small, this is sufficient to prove that the solution to KdV is white noise distributed at each . Indeed, for any , one has
[TABLE]
Sending yields the result.
4. Single scale analysis
Throughout this section we restrict and let be white noise distributed on . For dyadic , we define
[TABLE]
which produces a distribution that is -periodic. If and , we set
[TABLE]
We further define
[TABLE]
for strictly admissible , where is the Schrödinger operator with potential (cf. Proposition 2.13).
Given a sample from white noise on the line, the case of (4.1) provides a recipe for constructing a copy of white noise on the torus . Indeed, this is precisely the manner in which we will ultimately couple our evolution problems on the line and on the torus. The rationale for allowing will not be apparent in this section; rather, it is inspired by the needs of the multiscale analysis in the next section. In fact, the ‘multiple scales’ are precisely the different values of , as we successively ‘reveal’ ever more of the potential by sending .
The main results of this section are probabilistic estimates for the operators . While the bounds we obtain in this section do deteriorate as , they provide the crucial foundation for the next section, where we employ multiscale analysis to obtain bounds independent of and . We begin with the following lemma.
Lemma 4.1**.**
For , white noise distributed, , and ,
[TABLE]
Proof.
Lemma 2.11 implies
[TABLE]
As is white noise distributed, we have that
[TABLE]
uniformly in . Continuing from (4.2) we deduce
[TABLE]
which settles . To extend this to , we use the fact that the square of the Hilbert–Schmidt norm is a quadratic form in Gaussian random variables (cf. (2.10)) and Lemma 2.1. ∎
Before we state the next lemma, we remind the reader of the notation from Definition 2.10.
Lemma 4.2**.**
There exists such that
[TABLE]
uniformly for , , and .
Consequently, for and ,
[TABLE]
Proof.
We begin by choosing satisfying
[TABLE]
as well as for . Consider
[TABLE]
and observe the following large deviation bound
[TABLE]
which holds for some fixed , uniformly over . Indeed, arguing as in the proof of Lemma 4.1 (see (4.4)) and performing a change of variables, we may write
[TABLE]
Thus, by Lemma 2.1, we have
[TABLE]
for some , which guarantees (4.7).
Next, we observe that odd and even are sets of only -many distinct random variables. Moreover, each set is comprised of independent random variables; see Remark 2.8. Thus, by Lemma 2.2,
[TABLE]
for some absolute .
Next, fix and define
[TABLE]
which satisfy
[TABLE]
Exploiting self-adjointness and writing
[TABLE]
we get
[TABLE]
We can now apply Cauchy–Schwarz to deduce
[TABLE]
By duality and polarization, (4.9) implies
[TABLE]
Using this together with
[TABLE]
and (4.8), we deduce
[TABLE]
uniformly for , , and . This finally implies (4.5), as we have the bound
[TABLE]
uniformly for with . This then yields (4.6) by the standard argument. ∎
We now turn to our first key result of this section.
Proposition 4.3**.**
The following holds uniformly for finite satisfying : There exists such that for any , there is an event on which
[TABLE]
uniformly for strictly admissible , where we used the notations (2.15). Moreover,
[TABLE]
Before proving this proposition, let us record a useful corollary.
Corollary 4.4**.**
Define
[TABLE]
There exists such that
[TABLE]
uniformly for finite satisfying and strictly admissible . Consequently, for , we have
[TABLE]
uniformly in and strictly admissible . In particular,
[TABLE]
Proof.
Let be the constant appearing in Proposition 4.3. Given , we may choose for some small (meant to defeat the implicit constants appearing in (4.11)) and apply Proposition 4.3 to deduce
[TABLE]
uniformly in and over strictly admissible .
For we estimate as follows:
[TABLE]
The result follows by choosing . ∎
Proof of Proposition 4.3.
Our task is to estimate the random variables
[TABLE]
Given , let denote the event
[TABLE]
Note that the event grows as grows.
By Lemma 4.2 we have the estimate
[TABLE]
In the following, we work on the set . On this set and for , we may construct via the series expansion
[TABLE]
In particular, we have the estimate
[TABLE]
We next observe that
[TABLE]
where
[TABLE]
Writing , this is a consequence of the fact that
[TABLE]
along with the spectral theorem.
We first consider the case and seek to prove the estimate
[TABLE]
Note that in this case, .
We begin with the identity
[TABLE]
where each resolvent is evaluated at . The contribution to (4.18) of the last term on the right-hand side of (4.19) is straightforward to estimate: applying (4.17) again, we get
[TABLE]
which is acceptable.
The contributions of the second and third terms on the right-hand side of (4.19) can be handled similarly; we present here the details for the second term. We begin with the estimate
[TABLE]
To estimate these norms we first observe that , so that
[TABLE]
By (2.1), we also have the estimate
[TABLE]
Thus, as , we may continue from above and use (4.16) to deduce
[TABLE]
By the triangle inequality, this gives the acceptable contribution
[TABLE]
Finally, for the first term on the right-hand side of (4.19), an analogous argument yields the estimate
[TABLE]
whence
[TABLE]
which is acceptable.
It remains to consider the case , where (4.11) will follow from
[TABLE]
We will split the integral in into the regions and .
We begin with the region . Defining
[TABLE]
and observing that , we can change variables and bound
[TABLE]
As for , we are in a position to estimate the term on the right-hand side exactly as we did for (4.18). In particular, we deduce
[TABLE]
We turn to the region . Using the resolvent identity
[TABLE]
we find that it suffices to estimate the following three terms:
[TABLE]
For (4.22), we observe that (4.16) implies
[TABLE]
Combining this with (2.1), we estimate which is acceptable.
Next, we have
[TABLE]
Using (2.21) with , (2.1), and the fact that (4.11) is already proved for , we get
[TABLE]
which is an acceptable contribution to (4.21).
Finally we turn to (4.24). Estimating in the same way,
[TABLE]
which is acceptable.
This completes the proof of (4.21) and hence the proof of Proposition 4.3.∎
The remaining three propositions in this section are devoted to exhibiting decay of the resolvent away from the diagonal. We begin by running the Combes–Thomas argument with a generic weight for belonging to the class
[TABLE]
for . We then employ certain concrete choices of weight to obtain our main results, namely, Propositions 4.6 and 4.7. Recall that we employed the Combes–Thomas argument earlier when proving Lemma 2.12.
Proposition 4.5**.**
There exists such that
[TABLE]
uniformly over finite satisfying , strictly admissible , and .
Proof.
Let and take as in Proposition 4.3. In view of (4.15), it suffices to show that for we have
[TABLE]
provided and are chosen appropriately.
Given , we may write
[TABLE]
where is the differential operator
[TABLE]
Note that
[TABLE]
By duality, one can readily show that
[TABLE]
for any . Thus for and , Proposition 4.3 yields
[TABLE]
Hence, choosing for a small , which is consistent with if we choose appearing in (4.26) sufficiently small, we deduce
[TABLE]
on for all strictly admissible and for all . Thus, with ,
[TABLE]
on . The result follows by choosing and suitably small. ∎
To continue, let be a bump function satisfying
[TABLE]
For we define
[TABLE]
which yields the smooth partition of unity
[TABLE]
Note that for , is supported in . In particular, for .
By construction we have
[TABLE]
which by (2.4) implies
[TABLE]
Proposition 4.6**.**
Fix . For , we have
[TABLE]
uniformly for with , finite satisfying , and strictly admissible .
Proof.
The two operators under consideration have the same norm since they are transposes of one another. Thus we only consider in what follows.
Fix and strictly admissible . We define the weight via
[TABLE]
and by linear interpolation in the remaining intervals. By construction,
[TABLE]
and thus with (cf. (4.25)). By (2.4),
[TABLE]
We define to be the event
[TABLE]
where is as in Proposition 4.5.
We estimate
[TABLE]
which is an acceptable contribution.
Next, using Proposition 4.5, (4.13), and (4.29), we estimate
[TABLE]
which is also acceptable. This completes the proof of Proposition 4.6. ∎
At this point a word of explanation is warranted regarding the sub-exponential decay appearing in Proposition 4.6 and recurrently through the remainder of the paper. First, and most important, is the fact that this type of decay suffices to prove all the results we need. On the other hand, polynomial weights do not suffice. This is most evident in the dynamical arguments of Section 6 where Gronwall arguments need to be applied. In this setting, unavoidable logarithmic losses in the volume (cf. Lemma 2.2) raised to a power greater than one must be exponentiated. Thus one needs decay that is stronger than polynomial in order to defeat them.
On the other hand, pure exponential decay of the resolvent would be a much more difficult goal to pursue, and ultimately unnecessary. In particular, when concatenating exponential decay from one cube to a second, and then on to a third (which is an essential technique in multi-scale analysis), one has to be extremely vigilant to avoid continually accumulating losses in the rate of decay. The strict subadditivity of fractional powers, makes this a breeze in the sub-exponential regime.
Proposition 4.7**.**
Fix , , and . Then
[TABLE]
uniformly in finite satisfying , with , and strictly admissible .
Proof.
By transpose symmetry, it suffices to consider only the upper signs. Moreover, the preceding proposition allows us to restrict our attention to the case . We define
[TABLE]
with continuous and constant on each remaining interval. Note that
[TABLE]
In particular, for .
Let denote the event
[TABLE]
The restriction allows us to apply Proposition 4.5 and obtain
[TABLE]
Using Proposition 4.5 and (4.29), we now estimate
[TABLE]
Applying Cauchy–Schwarz and using Corollary 4.4 as well, we estimate
[TABLE]
This completes the proof. ∎
5. Multiscale analysis
The key idea of the multiscale analysis is to tame bad behavior in by exploiting decay of the resolvent away from the diagonal. Note that ergodicity of white noise under translation on the line guarantees that such bad behavior is inevitable. Our approach to multiscale analysis is to successively reveal the potential on dyadic shells using the resolvent identity; archetypal examples appear in (5.2) and (5.4) below. In both cases, the sum in will be controlled using decay of the resolvent in the form exhibited in Proposition 4.6.
The ultimate goal of the multiscale analysis is to obtain bounds independent of the volume , such as those appearing in Proposition 5.2. These are evidently essential if we are to send , which is what will be done in Section 6. However, our first application of this technique is Proposition 5.1, which removes the limitations on and in the formulation of Proposition 4.7. In this setting, a logarithmic loss in is unavoidable, as it originates from contributions near the diagonal.
Proposition 5.1**.**
Fix and let be a smooth cutoff satisfying
[TABLE]
For and , we have
[TABLE]
uniformly for finite satisfying and strictly admissible .
Proof.
Recall the cutoffs introduced in (4.28). We begin by using the triangle inequality to estimate
[TABLE]
Using (2.4) and Proposition 4.6, we can estimate the contributions of and by
[TABLE]
which is acceptable.
It remains to estimate the contribution near the diagonal, namely when . We distinguish two cases; the case will be discussed at the end of the proof.
If , we use the decomposition
[TABLE]
We first consider the contribution of . If so that , we use Proposition 4.7 to estimate
[TABLE]
which is acceptable. In the remaining case , we have by (2.4) and (4.13) that
[TABLE]
which is acceptable, as well.
We treat an individual summand in (5.2) using (2.4):
[TABLE]
where we have employed the following cutoff to the support of :
[TABLE]
Recalling that and using Hölder’s inequality, (4.6), and Proposition 4.6, for we estimate the above by
[TABLE]
which sums in with a final bound of order . If , a similar argument yields the bound
[TABLE]
which also sums in with a final bound of order .
It remains to consider the contribution near the diagonal in the case . This can be handled using (4.13) and Proposition 4.7 in the same way as when controlling the contribution of above. ∎
Proposition 5.2**.**
For , we have the following:
[TABLE]
uniformly over , , and strictly admissible .
Proof.
By transpose symmetry, it suffices to consider only the cases or . At the outset, we assume that . The remaining case will be discussed at the end of the proof. As in (5.2), we write
[TABLE]
If we use (4.13) to bound
[TABLE]
which is acceptable. If instead , then Proposition 4.6 yields
[TABLE]
which is also acceptable.
For , we use Proposition 4.6, (4.6), (4.13), and Hölder’s inequality to estimate
[TABLE]
where is as in (5.3). Summing over yields an acceptable contribution.
It remains to consider the case . In this case, the claim follows readily from (4.13) and Proposition 4.6, in the same way that we treated the contribution of above. ∎
Proposition 5.2 leads to several useful estimates, which we record here.
Corollary 5.3**.**
Fix . The following holds uniformly over and strictly admissible :
[TABLE]
where the implicit constant in (5.8) is uniform over and is as in (5.1).
Proof.
The estimate (5.5) follows from Proposition 5.2 by writing and then splitting into the regimes , , and .
The estimate (5.6) follows from (5.5). Indeed, writing , we estimate
[TABLE]
Observing that defines a bounded operator on , the result follows from (5.5) and the fact that is summable over .
To obtain (5.7) we insert and use that multiplication by
[TABLE]
are bounded operators on uniformly for . Thus, invoking Proposition 5.2 we get
[TABLE]
where we use that in order to control the contribution near the diagonal.
We turn now to (5.8). By the triangle inequality, we estimate
[TABLE]
Using Proposition 5.2, we estimate the contributions away from the diagonal by
[TABLE]
To estimate the contribution of , we repeat the argument covering this case in the proof of Proposition 5.1, using the decomposition
[TABLE]
in place of (5.2). ∎
As discussed in the introduction and manifested already in our treatment of the torus problem, the diagonal Green’s function and its reciprocal play essential roles in our analysis. The two remaining propositions in this section provide the essential volume-independent bounds on these objects. We begin with itself:
Proposition 5.4**.**
Fix and . For strictly admissible,
[TABLE]
uniformly in .
Proof.
As all estimates will be uniform in , it will be convenient to drop the subscript everywhere in what follows.
By translation invariance of white noise, (5.10) will follow readily from
[TABLE]
Recall from (2.3) that
[TABLE]
As is white noise distributed,
[TABLE]
Using Lemma 2.1, we deduce
[TABLE]
Next, we estimate
[TABLE]
Thus, using Lemma 2.12, (4.6), and (5.6), we get
[TABLE]
This completes the proof of (5.13).
We turn now to (5.11). Using again (2.3), we write
[TABLE]
The contribution of the first term on the right-hand side of (5.14) is straightforward to estimate. Indeed,
[TABLE]
where denotes the Fourier transform of the function . As , we have
[TABLE]
which readily implies that
[TABLE]
Invoking Lemma 2.1, this gives
[TABLE]
which is an acceptable contribution to (5.11).
To estimate the contribution of the second term on the right-hand side of (5.14), we argue by duality. For with and ,
[TABLE]
To continue, we write
[TABLE]
and
[TABLE]
For , Lemma 2.12 yields
[TABLE]
Thus, using (4) we get
[TABLE]
provided and . By Lemma 2.1, this gives
[TABLE]
which combined with (5.15) and (5.6) yields
[TABLE]
for all and . This completes the proof of (5.11).
To prove (5.12), we argue as for (5.11). Starting from (5.14), we estimate
[TABLE]
Invoking Lemma 2.1, we thus obtain
[TABLE]
To estimate the contribution to (5.12) of the second term on the right-hand side of (5.14), we argue by duality. For ,
[TABLE]
where we used Lemma 2.12 in the last step. Using also Lemma 4.1 together with (5.6), we obtain
[TABLE]
provided . This completes the proof of (5.12). ∎
We turn now to obtaining bounds on that are independent of the volume. Evidently, the new difficulty is obtaining lower bounds on the diagonal of the resolvent. This is quite at odds with what is usually investigated in the Anderson model. Regions where the potential is extremely large (and positive) improve localization; indeed, they act as de facto Dirichlet boundary conditions. This is advantageous for localization, but an enemy in our setting, since this drives the Green’s function to zero!
As our bounds on need to be volume-independent, multiscale analysis again plays an essential role. We encapsulate precisely what we need in the following lemma.
Lemma 5.5**.**
Let . For , we have
[TABLE]
uniformly over and strictly admissible .
Proof.
We recall from (4.17) that
[TABLE]
where once again we write and .
To proceed, we write
[TABLE]
where is chosen so that . As , we have
[TABLE]
where the resolvents are all evaluated at .
We first consider the contribution of (5.16). Applying (4.17) once again, followed by (2.4) and Corollary 4.4, we estimate the contribution of (5.16) by
[TABLE]
which is acceptable.
By (2.4), Corollary 4.4, (4.6), Proposition 4.6, (4.20), and Hölder’s inequality, we estimate the contribution of (5.17) by
[TABLE]
where is a cutoff to the support of as defined in (5.3). The penultimate step is immediate when . When is finite, one must first introduce an additional sum over as in the proof of Propositions 5.1 and 5.2, which is then easily seen to be controlled by the summand.
Arguing similarly, we estimate the contribution of (5.18) by
[TABLE]
which is acceptable. This completes the proof. ∎
We are now ready to prove the bounds we need on the reciprocal of the diagonal Green’s function; these are optimal in , as we can see already from the case .
Proposition 5.6**.**
Fix . For strictly admissible, we have
[TABLE]
uniformly in .
Proof.
As the arguments to be presented do not depend on , we suppress it in the notation below.
By translation invariance of white noise, (5.19) will follow readily from
[TABLE]
To prove (5.21), we use
[TABLE]
and (recalling that )
[TABLE]
Using Hölder (with respect to the spectral measure), we estimate
[TABLE]
and so
[TABLE]
We now let satisfy
[TABLE]
By Cauchy–Schwarz,
[TABLE]
In particular,
[TABLE]
We now let be a bump function with . As is a local operator and all operators involved are normal,
[TABLE]
Thus,
[TABLE]
By (2.12),
[TABLE]
which (appealing to Lemma 2.1) then implies
[TABLE]
for all . Using this together with Lemma 5.5, we get
[TABLE]
for any .
We turn to the remaining term in (5.23). We recall the notation from the proof of Proposition 4.3 and write for . We begin by observing
[TABLE]
where denotes the spectral measure for . Thus, using (5.13), we get
[TABLE]
Continuing from (5.23) and using (5.26) and (5.27), we finally derive
[TABLE]
since , by strict admissiblity. This completes the proof of (5.21).
Turning to (5.20), we first consider the case . By (5.19), Sobolev embedding, and (5.11), for we get
[TABLE]
provided . On the other hand, by (5.21) and either Jensen’s or Hölder’s inequalities,
[TABLE]
Combining the two bounds above we get
[TABLE]
To treat , we observe that by the fractional (and usual) product rule and Sobolev embedding,
[TABLE]
The result now follows from (5.11) and (5.28) by taking and . ∎
6. Invariance of white noise for the flow on the line
Our main objective in this section is to ‘send ’ and deduce invariance of white noise under the flow (3.4) on the entire real line. The precise meaning of a solution in this context will be given in Definition 6.1 below. First, however, we must settle some notational conventions.
Starting in this section (and continuing until the end of the paper), we work only with the fully revealed potential, which corresponds to setting in (4.1).
Throughout this section, we freeze the parameter :
[TABLE]
with large enough so that is strictly admissible. Like the choice of opening angle in the definition of strict admissibility, this is essentially arbitrary; we prefer concrete numbers purely for expository reasons. One caveat on this generality (and rationale for choosing specificity) is that in order to prove Lemma 6.6 below in the requisite generality, we do need to lie in a slightly narrower sector than that used in the preceding sections.
Definition 6.1**.**
We say that is a global good solution to the flow (3.4) if for every there exist and such that
[TABLE]
and
[TABLE]
for all and all . Here is the resolvent associated to the potential with and denotes a smooth cutoff as in (5.1).
This notion of good solution is motivated by the fact that if is white noise distributed at each time , then satisfies the bounds in (6.3) and (6.4) not only almost surely, but even in expectation. Indeed, this is a consequence of Corollary 5.3.
The main results of this section are Propositions 6.7 and 6.8. Taken together they yield
Theorem 6.2**.**
For almost every sample of white noise on the real line, there exists a unique global good solution to the flow (3.4) on the real line with initial data . As a random variable, is white noise distributed at each .
The remainder of this section is dedicated to the proof of this theorem, as well as certain additional conclusions that will be needed in the next section.
Given white noise on the line and , we define
[TABLE]
which is -periodic white noise. Using Proposition 3.1, we define to be the global -periodic solution to the flow (3.4) with initial data . Theorem 3.3 yields that as a random variable, is -periodic white noise for all . In particular, obeys the bounds (6.3) and (6.4) almost surely. Below we will also show that satisfies (6.2), so that is a global good solution to (3.4).
We will prove that almost surely, the solutions converge to a limit for all in a suitable norm as ; see Lemma 6.3 below. We will then show that is white noise distributed for each and that is a global good solution to the flow (3.4) on the line; see Proposition 6.7. Finally, we will demonstrate the uniqueness of good solutions to the flow in Proposition 6.8; this implies, in particular, that the solution is independent of the particular sequence used to construct it.
We begin with the following convergence result.
Lemma 6.3**.**
Fix , , and . Then almost surely,
[TABLE]
Proof.
For and , we define
[TABLE]
As on , using (2.12) we obtain
[TABLE]
In what follows, we will show
[TABLE]
where is a quantity that satisfies
[TABLE]
uniformly for . By (4.13) and Proposition 5.1, for any ,
[TABLE]
Assuming (6.9) and (6.11) for the moment, let us show that (6.7) holds. In view of (6.8) and (6.11), we have that both
[TABLE]
are almost surely finite (indeed, the sum in has finite expectation). Building on this, (6.7) follows from (6.9).
It remains to prove (6.9) and (6.10). We start with (6.9), which we will prove using the equation (3.4) and Gronwall’s inequality. In particular, we will establish the bound
[TABLE]
for a nonnegative quantity obeying (6.10).
To this end, we write and for the diagonal Green’s functions associated to and . Using (3.4) and the identity
[TABLE]
we compute
[TABLE]
Applying Hölder in (6.13) and using that multiplication by is bounded on to handle (6.14), we get
[TABLE]
In this way, the proof of (6.9) and thence also (6.7) will be complete once we show
[TABLE]
As both and are -periodic,
[TABLE]
where is as in (5.1). We estimate this norm by duality. For , we use the resolvent identity
[TABLE]
to write
[TABLE]
Cycling the trace and using Lemma 2.11, we get
[TABLE]
Taking the supremum over unit vectors , we conclude that (6.15) holds. ∎
Our next result shows convergence in probability for the diagonal Green’s function at each time. This is a crucial stepping stone to the stronger convergence we will demonstrate in Proposition 6.7 below.
Lemma 6.4**.**
Given , , , and strictly admissible,
[TABLE]
where is the diagonal Green’s function associated to .
Proof.
Recall from (6.15) that
[TABLE]
Thus, letting and defining
[TABLE]
and
[TABLE]
we get
[TABLE]
Using Lemma 6.3 and the fact that and have comparable norms, we get
[TABLE]
almost surely and so also in probability. On the other hand, by (4.13) and Proposition 5.1,
[TABLE]
Noting that for every ,
[TABLE]
this gives
[TABLE]
which proves the lemma. ∎
To continue, for fixed , the estimate (6.7) implies that almost surely, there exists a limit on satisfying
[TABLE]
Taking a sequence , we can find a full probability event on which converges to for all . We wish to prove that as a random variable, is white noise distributed for all . Due to the extremely rapid decay of the weight (which is essential for proving Lemma 6.3), we do not yet know enough about to even make sense of it as a tempered distribution. To remedy this, we establish improved bounds for , which will be inherited by .
Lemma 6.5**.**
For any , , and ,
[TABLE]
uniformly over .
Proof.
The proof of (6.16) is similar to that of Lemma 6.3. We define
[TABLE]
Using the equation (3.4) and the identity
[TABLE]
we derive
[TABLE]
We estimate the norm by duality: for and ,
[TABLE]
Taking the supremum over unit vectors , we get
[TABLE]
Thus by Gronwall’s inequality,
[TABLE]
As is white noise distributed for each time, the claim follows from (2.12), Lemma 2.1, and (5.6). ∎
It is our intention to employ Lemma 2.5 to upgrade the convergence given in Lemma 6.4. Our next lemma provides the requisite equicontinuity (cf. Lemma 2.4).
Lemma 6.6**.**
Fix . For any strictly admissible with ,
[TABLE]
uniformly in and .
Proof.
To ease notation, throughout the proof we omit the subscript . All our estimates will be independent of .
We will first prove (6.17) under the additional restriction that . The significance of the absolute constant here is that it guarantees that even after doubling the radius of the omitted ball, it is still contained inside the strictly admissible sector. This restriction on will be removed later.
Using (3.5), we write
[TABLE]
Thus, by Hölder, (5.12), (5.19), and (5.28) we get
[TABLE]
whenever , which settles (6.17).
To remove the restriction on , we recall that is an analytic function of . Thus its values in the omitted ball can be reconstructed from the values on the boundary of the doubled ball and the Cauchy (or Poisson) integral formula. That (6.17) continues to hold (albeit with a slightly larger constant) then follows just by using the triangle inequality.
Interpolating between (6.17) and (5.19), we get
[TABLE]
whenever , uniformly in . The claim (6.18) now follows from this and (5.11), by observing
[TABLE]
This completes the proof of the lemma. ∎
We are now ready to formulate our result concerning the existence of good solutions to the flow. The question of uniqueness will be discussed later.
Proposition 6.7**.**
*For almost every initial data , there is a global good solution of the flow on the line that satisfies all of the following:
(a) For any , , and ,*
[TABLE]
(b)* For every , is white noise distributed.
(c) Given a strictly admissible with and writing , we have*
[TABLE]
uniformly in , for any , , , , and some . Moreover, if in addition , then
[TABLE]
*in as .
(d) and are related by (2.25) and solves (3.5).*
Proof.
We first define as the almost sure limit guaranteed by Lemma 6.3. Consequently,
[TABLE]
almost surely. Combining this with Lemmas 6.5 and 2.3, we immediately deduce that (6.23) also holds in sense, that is,
[TABLE]
This can then be upgraded to (6.20) using Lemma 6.5 together with the fact that
[TABLE]
for any and .
Recall from Theorem 3.3 that is -periodic white noise for each ; thus part (b) follows from (6.20) via the characterization (2.9).
We turn now to part (c). Combining (5.11) (with ) and (6.18) we deduce that
[TABLE]
Using again (5.11) and invoking Lemma 2.4, we obtain
[TABLE]
for some .
Taking in (6.26) together with Lemma 6.4 provides the prerequisites to apply Lemma 2.5 and so deduce that there is some process so that
[TABLE]
We will verify that in a moment; first, we observe that the exponential weight may be replaced by the polynomial weight appearing in (6.22) by the same argument we used to do this for in part (a) above.
In view of the preceding, to verify that , it suffices to show
[TABLE]
To this end, we note that the resolvent identity gives
[TABLE]
This then yields (6.28) by taking expectation, using (6.24) and (5.7), and then integrating in time.
As noted above, the identification completes the proof of the first claim in (6.22). Combining this with (6.26) also yields the first claim in (6.21).
We turn now to the claims regarding in (6.21) and (6.22). The former claim follows by the same argument used to prove (6.26), by employing (5.20) and (6.17) in place of (5.11) and (6.18). The latter claim follows from (6.21), the identity
[TABLE]
and the convergence shown above.
We next show that is a good solution (cf. Definition 6.1). Property (6.2) follows already from part (a), while properties (6.3) and (6.4) follow from (5.7) and (5.8), respectively, because we have shown that is white noise distributed at every time. That obeys (6.5) follows from the fact that obey this identity at finite and the convergence shown in parts (a) and (c).
Consider now part (d). By Lemma 2.14 and Proposition 3.1, (2.25) and (3.5) both hold at finite . These results then carry over to infinite volume by virtue of parts (a) and (c). This completes the proof of Proposition 6.7. ∎
To complete the proof of Theorem 6.2, it remains to establish uniqueness within the class of good solutions.
Proposition 6.8** (Uniqueness of good solutions).**
Suppose are global good solutions to the flow (3.4) on . If , then for all .
Proof.
Evidently, it suffices to work on an interval for an arbitrary . We proceed similarly to the proof of Lemmas 6.3 and 6.5. For , we define
[TABLE]
where and are the parameters attendant to the two solutions and appearing in Definition 6.1. By symmetry, we may assume .
By assumption, . Computing the time derivative leads to the estimate
[TABLE]
where denote the diagonal Green’s functions for and , respectively. As before, we estimate the -norm by duality. For and ,
[TABLE]
where denotes a smooth cutoff as in (5.1) and are the resolvents corresponding to and , respectively.
Using Lemma 2.11, we first estimate
[TABLE]
Similarly, using (6.2), (2.4), and Lemma 2.11, we estimate
[TABLE]
for some . (We use here that if (6.2) holds with , it also holds with .)
Continuing from above, we deduce
[TABLE]
Applying Gronwall’s inequality and the bounds (6.3) and (6.4) for good solutions, we deduce
[TABLE]
Sending , we deduce , which completes the proof.∎
This uniqueness statement allows us to quickly dispel any concerns that our notion of the flow is not truly a flow (i.e., a one-parameter group). In proving this, it will be convenient to adopt the abbreviation
[TABLE]
where is fixed.
Corollary 6.9** (Group property for ).**
There is a one parameter group of transformations preserving white noise measure so that
[TABLE]
where denotes the solution to the flow with initial data and is chosen at random following a white noise law.
Proof.
Let denote the subset of comprised of initial data for which the flow admits a good global solution. In view of Proposition 6.7, . On this set we define in the obvious way; on the complement of we define to be the identity.
The definition of good solution guarantees that if is a good solution, so is for any . Thus the set is invariant under . As good solutions are unique, we may also deduce that for all . ∎
7. Invariance of white noise for KdV on the line
Our goal in this section is to complete the proof of the main result of the paper, namely, the existence of KdV dynamics for white noise initial data on the whole line and the invariance of white noise measure under these dynamics; see Theorem 7.1 below. Our procedure for doing this is to take a limit of the flows, as . Recall that for initial data, this limit was shown to coincide with the KdV flow in [25]. For concreteness, we shall send along the sequence
[TABLE]
Any other sequence with would serve equally well and would lead to the same limit. The sparseness imposed on this sequence is purely so that we may prove convergence by summing increments; this restriction is readily removed via Urysohn’s subsequence principle.
Theorem 7.1** (Invariance of white noise for KdV on the line).**
Given initial data following the white noise distribution on the line, let denote the corresponding global good solution to the flow (3.4) on the line, whose existence is guaranteed by Theorem 6.2. For any , converges to a limit in the following sense: for any and ,
[TABLE]
Moreover, is white noise distributed for every .
While the early part of this section is devoted to the proof of this theorem, we also include a further discussion on the nature of our solutions and two results, namely, Corollaries 7.4 and 7.5, that illustrate important virtues of these solutions.
The path to proving Theorem 7.1 is as follows: we first control the both the diagonal Green’s function and its reciprocal and then use Lemma 2.14 to deduce control on the solutions themselves. As a first step, we treat .
Proposition 7.2**.**
Fix and let be strictly admissible so that . Then for ,
[TABLE]
Proof.
In view of Proposition 6.7, it suffices to prove the result in finite volume with a bound independent of . Henceforth, we will regard as fixed and suppress the dependence of and on .
As the flows commute on , we may write
[TABLE]
Using invariance of white noise under the flow, we may therefore replace
[TABLE]
in (7.2), where and
[TABLE]
Applying the fundamental theorem of calculus and Minkowski’s inequality, we get
[TABLE]
As white noise is invariant under the difference flow, the expectation here is actually independent of . With this in mind, we suppress the dependence in what follows.
Using (3.5), we now write
[TABLE]
It remains to estimate the contribution of each of these terms. In what follows, implicit constants are allowed to depend on .
We start with (7.5) and (7.6). By symmetry, it suffices to consider the second term in (7.5). Using (5.10) and (5.19), we estimate this contribution by
[TABLE]
Using Cauchy–Schwarz and (5.19), we estimate the contribution of (7.7) by
[TABLE]
It remains to treat (7.3) and (7.4). By symmetry, it suffices to consider (7.3). Using (2.3), we write
[TABLE]
We first consider (7.8). By an explicit computation, (5.20), and Hölder’s inequality, we estimate the contribution of (7.8) by
[TABLE]
As is white noise distributed, a computation using (2.10) shows
[TABLE]
and hence by Lemma 2.1,
[TABLE]
Thus the contribution of (7.8) is controlled by , which is acceptable.
It remains to treat the contributions of (7.9) and (7.10). By symmetry, it suffices to consider (7.10). We expand to one order higher in and estimate it by
[TABLE]
We estimate
[TABLE]
where, as before, . As is white noise distributed, we may use (2.12) followed by Lemma 2.1 to obtain
[TABLE]
for any . Thus, using translation invariance of white noise, we deduce
[TABLE]
To handle the contribution of the final term in (7), we use Lemma 2.12, (4.6), and (5.6) to estimate
[TABLE]
By translation invariance of white noise, we get
[TABLE]
Thus, continuing from (7), we deduce
[TABLE]
which is acceptable. This completes the proof of the proposition.∎
Proposition 7.2 provides the key input to complete the
Proof of Theorem 7.1.
Throughout this proof, we write . Combining (7.2) and (6.21), we see that
[TABLE]
Thus, invoking (6.21) again, we may apply Lemma 2.5 to deduce that there is a process so that for ,
[TABLE]
In view of (6.21) and the identity
[TABLE]
it now follows that in the same topology:
[TABLE]
provided .
A posteriori, we may relax the condition on in (7.14) and (7.15) to merely , by interpolating with (6.21).
We now turn our attention to . Recall from Proposition 6.7(d) that
[TABLE]
As both and are convergent in the senses (7.14) and (7.15), respectively, for , it follows that are convergent in the sense (7.1) for .
It remains to show that is white noise distributed. This follows immediately from the characterization (2.9), (7.1), dominated convergence, and the fact that each is white noise distributed (see Proposition 6.7). ∎
In [25] it is shown that solutions to KdV constructed as the (unique!) limit of Schwartz solutions are in fact distributional solutions. Nevertheless, the uniqueness question for distributional solutions remains open at this time. In the torus setting, it is currently unknown if the Kappeler–Topalov solutions (constructed in [23]) are distributional solutions in any sense. The work [10] of Christ gives strong evidence that distributional solutions may not be unique at negative regularity.
The time integration inherent in the definition of distributional solutions is essential in making any sense of the KdV equation (1.1) for such irregular data, due to the impossibility of defining pointwise in time. It is natural to ask if the solutions constructed in Theorem 7.1 are distributional solutions. We believe that they are; nevertheless, verifying this seems to be a challenging problem. Before presenting what additional properties of our solutions we can prove at this time (namely Corollaries 7.4 and 7.5) we would like to devote a little space to sharing our current perspective on this topic.
Essential to showing that the solutions to KdV constructed in [25] are distributional solutions is the local smoothing effect, which guarantees that
[TABLE]
This immediately yields that the nonlinearity can be interpreted as a space-time distribution.
White noise solutions cannot obey (7.16), even under stronger space-time localization. Indeed, by invariance of white noise measure, the local norm is almost surely infinite at every time. The intuitive picture here is analogous to the failure of local smoothing for periodic initial data (i.e., the torus).
A naive explanation for the divergence of the square is that it originates in low frequencies and will be subdued by the derivative outside the nonlinearity. Indeed, the most obvious way to remove the divergence in expectation is to Wick-order the nonlinearity, which will not affect the dynamics precisely due to this derivative. However, the underlying divergence of the square of white noise is much more severe than that. Indeed, choosing trigonometric series in the representation (2.10) of white noise on the circle, one immediately sees that the average value of the zero Fourier mode diverges, while that of other modes remains zero. However, the fluctuations of all modes diverge (the probability laws lose tightness)!
Nevertheless, we still believe that our solutions are distributional solutions. The primary source of this hope comes from a subtly different dispersive effect, which by analogy with local smoothing, we would call the local averaging effect. A simple computation with the Airy equation reveals its underlying phenomenology: Let us write for the solution of the Airy equation with initial data , which is white noise distributed. Then is a Gaussian process with covariance
[TABLE]
where denotes the Airy function. It is now reasonably easy to verify that for any Schwartz function ,
[TABLE]
where colons represent Wick ordering, yields a well-defined random variable with second moment
[TABLE]
See [53, Theorem I.3]. The intuitive explanation behind this is that the time integration averages out some of the divergence by exploiting the rapid oscillation in time of waves of high wave number.
One word of warning seems appropriate at this point, namely, that the local averaging effect of the flows is too weak to make sense of the square of these solutions (with white noise initial data) as space-time distributional solutions in the above sense. Therein, we already see the first major obstacle to be overcome in treating the question of distributional solutions by the methods of this paper.
Nevertheless, we will demonstrate that the solutions constructed in Theorem 7.1 are solutions in at least one intrinsic sense. By ‘intrinsic’ we mean determined by the solution itself, independent of any limiting procedures used to construct it. The idea stems from Proposition 3.1 in [25] and as such, let us first articulate it in the setting of solutions on the line and on the circle:
Definition 7.3**.**
We say that is a green solution to (1.1) if for all sufficiently large, the associated diagonal Green’s function obeys
[TABLE]
Note that this is inherently meaningful as an identity of functions.
The arguments of [25] give immediately that the solutions constructed therein are green solutions. It is also our belief that green solutions are unique in that setting; however, this is a challenging open problem (cf. [10, 12]). Nevertheless, we do know that green solutions are unique and coincide with classical notions of solution already for . More explicitly, sending in (7.17), one finds that green solutions are distributional solutions, which are then unique by the results of [1, 61].
As our next result, we observe that the solutions constructed in Theorem 7.1 are green solutions in the sense natural to this problem; once again, the almost sure uniqueness of such solutions is an interesting open problem.
Corollary 7.4** (Intrinsic solutions).**
Let denote the ensemble of solutions constructed in Theorem 7.1, let be strictly admissible, and let . Then the couple obeys (7.17) for all times (as an equality of tempered distributions), excepting perhaps a set of initial data of probability zero.
Proof.
Recall (6.19), which is merely a rewriting of (3.5). In view of this identity obeyed by solutions of the flow, we may recover (7.17) for solutions of the KdV equation employing (7.1), (7.14), and by verifying that (after excluding a set of initial data of probability zero)
[TABLE]
as for every and some . Here and denote the solution of the flow and its associated diagonal Green’s function, as earlier in this section.
By the resolvent identity and direct simplification of the term linear in ,
[TABLE]
The second and third terms in this expansion have already been estimated in a satisfactory manner; see (7.12) and (7.13), respectively. We turn our attention to the first term:
[TABLE]
Putting everything together, we deduce that
[TABLE]
for sufficiently large. The conclusion (7.18) that we seek now follows by Fubini and the Borel–Cantelli lemma. ∎
Next, we would like to confirm that the solutions of KdV we have constructed have the group property. What we show here is slightly weaker than what we proved for the flow; nevertheless, it suffices for the questions of immediate interest to us. In particular, the realization of the Koopman operators as a strongly continuous unitary group is precisely what is needed for the standard proof of the mean ergodic theorem and also suffices to characterize weak/strong mixing; see [48], for example.
For more sophisticated questions one may wish to realize the Koopman operators as coming from an honest one-parameter group in a concrete Polish space. (By ‘honest’ here, we mean that the group property holds without exceptional null sets.) This can be done by invoking a classical theorem of Mackey (see [62, Appendix B]).
Corollary 7.5** (Group property for KdV).**
The Koopman operators
[TABLE]
form a strongly continuous one-parameter unitary group. Here denotes white-noise measure on endowed with the Borel algebra.
Proof.
From Theorem 7.1, we know that our flow preserves white noise measure and that the trajectories are almost surely continuous in the Hilbert space defined in (6.31), but now with . (Note that the standard theorems of measure theory apply on because it is completely metrizable and separable; see [24, §17]).
By the measure-preserving property and the density of bounded continuous functions in , strong continuity of the Koopman operators follows from the almost-sure continuity of trajectories and the dominated convergence theorem. The measure-preserving property also immediately guarantees that the Koopman operators are isometries. Unitarity will follow once we verify the group property:
[TABLE]
This in turn will follow if we show
[TABLE]
for fixed and fixed Schwartz function . Here denotes the data-to-solution map constructed (on a set of full probability) in Theorem 7.1. The fact that was constructed as the a.e. limit of a sequence of one-parameter groups , namely the flows, will be pertinent to completing the present proof. In truth, we have only explicitly proved convergence along the original sequence of parameters ; thus, we should now to pass to a subsequence so as to guarantee almost sure convergence. (Actually, with more attention to the minute details, one could avoid passing to a subsequence, but this is of no consequence.)
As the map , for each , Lusin’s and Tietze’s theorems combine to guarantee the existence of an that is continuous, bounded, and satisfies
[TABLE]
In view of Corollary 6.9, we have also have
[TABLE]
Thus, recalling also that and are measure preserving at any fixed time,
[TABLE]
Note that these last three terms converge to zero by virtue of Theorem 7.1, the continuity of , and Lemma 2.3. As was arbitrary, this completes the proof of (7.19) and hence that of Corollary 7.5. ∎
Corollary 7.5 also allows us to rigorously formulate our loftiest ambition with regard to the model discussed in this paper:
Conjecture 7.6**.**
The KdV flow is mixing, namely, as , the operators converge to the projection onto constants in the weak operator topology.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] A. V. Babin, A. A. Ilyin, and E. Titi, On the regularization mechanism for the periodic Korteweg-de Vries equation. Comm. Pure Appl. Math. 64 (2011), no. 5, 591–648.
- 2[2] J. T. Brereton, Invariant measure construction at a fixed mass. Nonlinearity 32 (2019), no. 2, 496–558.
- 3[3] I. Binder, D. Damanik, M. Goldstein, and M. Lukic, Almost periodicity in time of solutions of the Kd V equation. Duke Math. J. 167 (2018), no. 14, 2633–2678.
- 4[4] J. Bourgain, Periodic nonlinear Schrödinger equation and invariant measures. Comm. Math. Phys. 166 (1994), no. 1, 1–26.
- 5[5] J. Bourgain, Invariant measures for NLS in infinite volume. Commun. Math. Phys. 210 (2000), 605–620.
- 6[6] D. C. Brydges and G. Slade, Statistical mechanics of the 2-dimensional focusing nonlinear Schrödinger equation. Comm. Math. Phys. 182 (1996), no. 2, 485–504.
- 7[7] N. Burq, L. Thomann, and N. Tzvetkov, Remarks on the Gibbs measures for nonlinear dispersive equations. Ann. Fac. Sci. Toulouse Math. (6) 27 (2018), no. 3, 527–597.
- 8[8] E. A. Carlen, J. Fröhlich, and J. Lebowitz, Exponential relaxation to equilibrium for a one-dimensional focusing non-linear Schrödinger equation with noise. Comm. Math. Phys. 342 (2016), no. 1, 303–332.
