Oscillatory Breuer-Major theorem with application to the random corrector problem
David Nualart, Guangqu Zheng

TL;DR
This paper introduces an oscillatory version of the Breuer-Major theorem motivated by the random corrector problem, leading to new insights into Gaussian fluctuations and a variant involving homogeneous measures.
Contribution
It develops an oscillatory Breuer-Major theorem and applies it to analyze Gaussian fluctuations in the random corrector problem, including a new variant with homogeneous measures.
Findings
Proves an oscillatory Breuer-Major theorem.
Establishes Gaussian fluctuation results for the random corrector.
Provides a variant involving homogeneous measures.
Abstract
In this paper, we present an oscillatory version of the celebrated Breuer-Major theorem that is motivated by the random corrector problem. As an application, we are able to prove new results concerning the Gaussian fluctuation of the random corrector. We also provide a variant of this theorem involving homogeneous measures.
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.
Oscillatory Breuer-Major theorem with application to the random corrector problem
David Nualart and Guangqu Zheng
David Nualart: University of Kansas, Mathematics department, Snow Hall, 1460 Jayhawk blvd, Lawrence, KS 66045-7594, United States
Guangqu Zheng: University of Kansas, Mathematics department, Snow Hall, 1460 Jayhawk blvd, Lawrence, KS 66045-7594, United States
Abstract.
In this paper, we present an oscillatory version of the celebrated Breuer-Major theorem that is motivated by the random corrector problem. As an application, we are able to prove new results concerning the Gaussian fluctuation of the random corrector. We also provide a variant of this theorem involving homogeneous measures.
D. Nualart is supported by NSF Grant DMS 1811181.
1. Introduction and main results
Our work is motivated by the following random homogenization problem. Consider a one-dimensional equation with highly oscillatory coefficients of the form
[TABLE]
where . In the literature (see e.g. [1, 2, 8, 10]), the random potential is often assumed to be ergodic, uniformly elliptic (i.e. positive and bounded with bounded inverse). Notice that, under the following hypothesis:
For all , and almost surely, (H)
we can solve (1.1) explicitly:
[TABLE]
where is the antiderivative of vanishing at zero and
[TABLE]
Throughout this note, we assume that satisfies (H) and has the following form
[TABLE]
where
(i) is a centered stationary Gaussian process with a correlation given by \rho(x-y)=\mathbb{E}\big{[}W_{x}W_{y}\big{]}, and we assume that is continuous with ;
(ii) has the following orthogonal expansion
[TABLE]
with denoting the th Hermite polynomial. Here and is called the Hermite rank of .
The quantity is known as the harmonic mean or effective diffusion coefficient of the random potential, see [10, 17].
Remark 1*.*
Assuming the structure , our hypothesis (H) holds provided almost surely, for all . Note that the local integrability of follows immediately from its structure: Indeed, for any ,
[TABLE]
which implies that is almost surely finite. It is clear that our hypothesis (H) holds in presence of uniform ellipticity of and the latter is equivalent to the boundedness of ; as one can see from page 276-277 in [11], one can easily construct bounded measurable function with given Hermite rank. Note that if (this is unbounded with Hermite rank ) and , then satisfies the assumption (H) but not the uniform ellipticity.
Under some mild assumptions on and , we can derive the following result concerning the asymptotic behavior of as well as the associated fluctuation.
Theorem 1.1**.**
Let the above notation prevail. We assume that satisfies (H) and has the form (1.3) such that , given as in (1.4), has Hermite rank and the correlation function of the centered stationary Gaussian process belongs to with . Then the following statements hold true:
- (1)
For every , converges in probability to , as , where solves the following deterministic homogenized equation
[TABLE]
- (2)
For every , with ,
[TABLE]
Moreover, if in addition for some , then
[TABLE]
where the above weak convergence takes place in ,
[TABLE]
for and is a standard Brownian motion. Here .
The difference is known as the random corrector in the homogenization theory, see [1] and references therein. Our Theorem 1.1 complements findings in the literature, see the following Remark 2: Points (i)-(iii) sketch some relevant history and points (iv)-(v) summarize the novelty of our results.
Remark 2*.*
(i) The authors of [4] considered the short-range case where the random potential satisfies certain (strong) mixing conditions: With the above notation, mixing conditions and uniform ellipticity in [4] imply that is bounded by for some . Since the correlation function of is also bounded by , it is integrable, which guarantees that the random corrector is of order ; properly scaled, the random corrector converges to a Wiener integral with respect to Brownian motion; see also Theorem 2.6 in [1].
(ii) In [1], the result has been extended to a large family of random potential with long-range correlation (i.e. for some ): It was shown that when the Hermite rank of is one, the corrector’s amplitude is of order and after properly scaled, the random corrector converges in law to a stochastic integral with respect to the fractional Brownian motion with Hurst parameter ; see also Theorem 2.3 in [8].
(iii) Following [1], the authors of [8] studied the random corrector problem for the case where the Hermite rank of is two and as , with . They established that the corrector’s amplitude is of order and the random corrector, after proper rescaling, converges in law to a stochastic integral with respect to the Rosenblatt process; see [8, Theorem 2.2]. In the end of the paper [8], the authors conjectured that when the Hermite rank of is three or higher, the properly rescaled corrector is expected to converge in law to some stochastic integral with respect to the so-called Hermite process and this is confirmed in the work [11].
(iv) Note that all the references mentioned in (i)-(iii) assume that is stationary ergodic such that almost surely for some numerical constants (so is bounded), while we do not assume the uniform boundedness of . Instead, we only assume hypothesis (H) and for some . In our framework, the correlation function belongs to , with being the Hermite rank of , which ensures that the correlation function of is integrable. So similar to [4], we are in the short-range setting and we establish that the corrector’s amplitude is of order and properly rescaled corrector converges in law to a Gaussian process.
(v) For the functional convergence (1.7), we impose the condition in order to have moment estimates of order that imply tightness. These moment estimates are derived using Meyer’s inequalities. The aforementioned example belongs to for any . Our proof of Theorem 1.1 uses techniques from Malliavin calculus and Gaussian analysis, which might be helpful for other more complicated problems in random PDEs.
Our Theorem 1.1 is a special case of the following more general result. We denote by the collection of bounded closed sets in . For any we put . Also, f.d.d. means convergence of the finite-dimensional distributions of a given family of random variables depending on a parameter , which tends to .
Theorem 1.2**.**
Let be a centered Gaussian stationary process with continuous covariance such that and . Let be given as in (1.4) with Hermite rank . Then, with , we have
[TABLE]
where denotes the standard Gaussian white noise on and
[TABLE]
If in addition for some . Then, the following functional central limit theorems hold true:
(1)* With and any finite ,*
[TABLE]
where the above weak convergence holds on the space C\big{(}[0,\ell]^{d}\big{)} and given ;
(2) **
[TABLE]
where the above weak convergence takes place on .
Roughly speaking, the random corrector from Theorem 1.1 can be written as a sum of an oscillatory integral and a negligible term so that an easy application of Theorem 1.2 gives us Theorem 1.1, see Section 3 for more details. We will proceed the proof of (1.8) by following the usual arguments for the chaotic central limit theorem (see e.g. [9, 13]), while the functional central limit theorem in (1.10) is established with the help of Malliavin calculus techniques, notably Meyer’s inequality (see [6, 12]).
Remark 3*.*
(i) Theorem 1.2 is a generalization of the celebrated Breuer-Major theorem [5] that corresponds to the case where , see also [6, 12]. The integral on the left-side of (1.8) is known as an oscillatory random integral, so we call our result an oscillatory Breuer-Major theorem and this explains our title.
(ii) The functional limit theorem described in (1.9) is new and the limit is a -parameter Gaussian process with covariance given by
[TABLE]
while the limit in (1.10) is a Gaussian martingale with quadratic variation given by
[TABLE]
Our approach is quite flexible and we can provide another variant of Breuer-Major’s theorem that involves an homogeneous measure. Let us first recall the definition of homogeneous measure (see e.g. [7]).
Definition 1.3**.**
Given , a measure on is said to be -homogeneous if
, for any and Borel measurable,
where sA:=\big{\{}x\in\mathbb{R}^{d}\,:s^{-1}x\in A\big{\}}. For example, defines a -homogeneous measure on for any . Note that for general , the measure is not necessarily homogeneous.
Theorem 1.4**.**
Fix and consider an -homogeneous measure on such that . Let be given as in (1.4) with Hermite rank and let be a centered Gaussian stationary process with continuous covariance such that and . Then
[TABLE]
where stands for the Gaussian random measure with intensity on and
[TABLE]
Moreover, if additionally for some and , then we have the following functional central limit theorem:
[TABLE]
One can refer to the book [14] for any unexplained notation and definition. We would like to point out that if the function is a finite sum of Hermite polynomials, then, the Stein-Malliavin approach implies that, in the framework Theorem 1.4, the convergence of the one-dimensional distributions hold in the total variation distance (see for instance, the monograph [13]).
The rest of this article consists of three more sections: Section 2 is devoted to some preliminary material. In Section 3, we present the proof of Theorem 1.2 and then as anticipated, we demonstrate how Theorem 1.2 implies Theorem 1.1. We will sketch the proof of Theorem 1.4 in Section 4.
Note that all random objects in this note are assumed to be defined on a common probability space and we will use to denote a generic constant that is immaterial to our estimates and it may vary from line to line.
2. Preliminaries
Recall that is a centered stationary Gaussian process such that it has a continuous covariance function . The continuity of is equivalent to the -continuity of process . In what follows, we first build the isonormal framework for later Gaussian analysis. Note that the Gaussian Hilbert space generated by is the same as the one generated by due to the continuity, so the resulting Gaussian Hilbert space is a real separable Hilbert space. By a standard fact in real analysis, it is isometric to and we denote this isometry by . By isometry, there exists a sequence such that
[TABLE]
By continuity again, the above equality extends to every . It is clear that is an isonormal Gaussian process over the real separable Hilbert space . By construction, has unit norm and for any . Note that is a continuous map and this can save us away from measurability issues.
In what follows, we introduce some standard notation from Malliavin calculus; see the basic references [13, 14, 15] for more details. For a smooth and cylindrical random variable F=f\big{(}X(h_{1}),\ldots,X(h_{n})\big{)} with and , we define its Malliavin derivative as the -valued random variable given by
[TABLE]
By iteration, we can define the th Malliavin derivative of as an element in . Here denotes the th tensor product of and we denote by the space of symmetric tensors in . For any and , we define the Sobolev space as the closure of the space of smooth and cylindrical random variables with respect to the norm defined by
[TABLE]
The divergence operator is defined as the adjoint of the derivative operator . An element belongs to the domain of , denoted by if there is a constant that only depends on such that
[TABLE]
For , the existence of is guaranteed by the Riesz representation theorem and it satisfies the following duality relation
[TABLE]
Similarly, we can define the iterated divergence : For , is characterized by the following duality relation
[TABLE]
The well-known Wiener-Itô chaos decomposition states that any admits the following expression
[TABLE]
with uniquely determined by ; is also called the th multiple integral with kernel . Note that given any unit vector , we have . We call , the closed linear subspace of generated by \big{\{}H_{p}(X(e))\,:\,e\in\mathfrak{H} and \|e\|_{\mathfrak{H}}=1\big{\}}, the th Wiener chaos associated with the isonormal Gaussian process and we write for the projection operator onto . Then we define Ornstein-Uhlenbeck semigroup and its generator by putting
[TABLE]
and we write for the pseudo-inverse of , that is,
[TABLE]
Note that these operators enjoy the following nice relation: for any centered . Now let us record an important consequence of this relation. Let be given as in (1.4) and have Hermite rank . We define the shifted function
[TABLE]
which satisfies the following properties:
(A) \Phi_{m}(W_{x})=\Phi_{m}\big{(}X(e_{x})\big{)}\in\mathbb{D}^{m,2} and \Phi(W_{x})=\delta^{m}\big{(}\Phi_{m}(W_{x})e_{x}^{\otimes m}\big{)} for any ;
(B) and applying Meyer’s inequality, we have for every , and ,
[TABLE]
This inequality is a consequence of Lemmas 2.1, Lemma 2.2 in [12] (see also [6, (2.7)]).
Let be an orthonormal basis of . For and (), we define the -contraction as the element in () given by
[TABLE]
In particular, and if , .
In the end of this section, we present a multivariate version of the chaotic central limit theorem [9] that we borrow from [6, Theorem 2.1].
Proposition 2.1**.**
Fix an integer and consider a family \big{\{}G_{R},R>0\big{\}} of random vectors in such that each component of belongs to and has the following chaos expansion
[TABLE]
Suppose the following conditions (a)-(d) hold:
- (a)
For each and for every , converges to some , as
- (b)
For each , .
- (c)
For each , and , we have that, as , \big{\|}g_{q,i,R}\otimes_{r}g_{q,i,R}\big{\|}_{\mathfrak{H}^{\otimes 2q-2r}} converges to zero.
- (d)
For each , .
Then converges in law to as , where \Sigma=\big{(}\sigma_{i,j}\big{)}_{i,j=1}^{n} is given by .
The above proposition is essentially a consequence of the Fourth Moment Theorems due to Nualart, Peccati and Tudor (see [16, 18]): In 2005, Nualart and Peccati discovered that for (), if , then the asymptotic normality of this sequence is equivalent to . Soon later, Peccati and Tudor provided a multidimensional extension, which asserts that for a sequence of random vectors with covariance matrix convergent to some covariance matrix , if for each , , , then the joint convergence ( converges in law to ) is equivalent to the marginal convergence ( converges in law to for each ). The latter boils down to checking the fourth moment condition. For example, in the setting of Proposition 2.1, let us look at the convergence of : conditions (b) and (d) ensure that it suffices to consider finite many chaoses, conditions (a) and (b) guarantee the convergence of the covariance matrix of the random vectors formed by these finitely many chaoses. In view of the product formula for multiple integrals, verifying the fourth moment condition would lead to the computation involving the contractions, where we need condition (c) for this to work; see [6] for a proof and we refer the interested readers to the monograph [13] for a comprehensive introduction to this line of research.
3. Proof of Theorem 1.2 and Theorem 1.1
In this section, we first prove the convergence of finite-dimensional distributions in the framework of Theorem 1.2. Next, we will establish the tightness property under the additional assumption that for some , which is needed to establish (1.9) and (1.10). These two steps will conclude the proof of Theorem 1.2, and in the end of this section, we demonstrate how one can derive Theorem 1.1 from Theorem 1.2.
3.1. Convergence of finite-dimensional distributions
For each and , we put
[TABLE]
Then, it is enough to consider bounded Borel sets , , and establish the following limit result
[TABLE]
where \Sigma=\big{(}\sigma_{i,j}\big{)}_{i,j=1}^{n} is defined by
[TABLE]
For , we can rewrite using the Hermite expansion (1.4) as follows:
[TABLE]
where
[TABLE]
(a) For any , we have
[TABLE]
Making the change of variables yields
[TABLE]
Taking into account that is continuous and is closed, we deduce from the dominated convergence theorem that
[TABLE]
(b) For each ,
[TABLE]
Note that the quantity as defined in the statement of Theorem 1.2 is finite, because is bounded by and . So we just verified the condition (b).
(c) For each , and , we have,
[TABLE]
and therefore,
[TABLE]
where . In view of the elementary inequality for any , we can write
[TABLE]
Our goal is to show
[TABLE]
Then by symmetry, it is enough to show that for each ,
[TABLE]
Recall that is bounded, so we can assume for some . Taking the continuity of into account yields
[TABLE]
It suffices to show that for each ,
[TABLE]
One can establish the above limit as follows. Fix , we first decompose the above integral into two parts: With ,
[TABLE]
By Hölder’s inequality, we have
[TABLE]
and
[TABLE]
Therefore, it is clear that due to , for any fixed , the second term in (3.4) goes to zero, as ; and the first term in (3.4) can be made arbitrarily small by choosing sufficiently small . This completes our verification of condition (c) from Proposition 2.1.
(d) For each , we can see from the computations from step (a) that
[TABLE]
which converges to zero (uniformly in ), as goes to infinity.
Therefore, the limit in (3.2) is proved. In particular, (1.8) is established.
Remark 4*.*
If we only assume that is continuous except at finitely many points, we can still obtain (1.8). This observation will be helpful in the proof of Theorem 1.1.
3.2. Tightness
This part is split into two portions, dealing with proofs of (1.10) and (1.9) respectively.
Proof of (1.10).
For each , we recall that and put
[TABLE]
Clearly is a random variable with values in . We know from Billingsley’s book [3] that in order to have the tightness of , it is sufficient to prove the following moment estimate: There exists some constant such that for any ,
[TABLE]
where is the fixed index in the statement of Theorem 1.2. To simplify the presentation, we assume that .
Using the notation from Section 2, we first write \Phi(W_{xR})=\delta^{m}\Big{(}\Phi_{m}(W_{xR})e_{xR}^{\otimes m}\Big{)}. Then for any ,
[TABLE]
with . Now we apply the Meyer’s inequality (see [14, Proposition 1.5.4]), to get
[TABLE]
Keeping in mind the fact that , we have
[TABLE]
where we also applied Minkowski’s inequality in the last inequality. Therefore, Cauchy-Schwarz inequality and property (B) from Section 2 imply that the quantity in (3.6) is bounded by
[TABLE]
It follows that \big{\|}X_{R}(t)-X_{R}(s)\big{\|}_{L^{p}(\Omega)}\leq C\sqrt{t^{d}-s^{d}}\leq C\sqrt{t-s}\,. ∎
Now we show the weak convergence described in (1.9).
Proof of (1.9) .
To simplify the notation, we assume . For , we put
[TABLE]
and in what follows, we will focus on establishing the tightness of by proving the following estimate
[TABLE]
here denotes the Euclidean norm and . We write
[TABLE]
Following the same arguments as in the proof of (1.10), we have
[TABLE]
The same arguments yields the estimate , so that (3.7) holds true. ∎
3.3. Proof of Theorem 1.1
Put and recall that the solution to (1.1) is given by
[TABLE]
where and
[TABLE]
Note that for any and each , we obtain, by using the Hermite expansion, that
[TABLE]
That is,
[TABLE]
It follows that
converges in to , as .
In particular, the random vector
[TABLE]
converges in to
[TABLE]
Put , then it follows from continuous mapping theorem that in probability, as , where
[TABLE]
It is easy to see that solve equation (1.5), so part (1) of Theorem 1.1 is established.
Following the decomposition given in [8, pages 1082-1085], we rewrite the rescaled corrector as follows:
[TABLE]
where , and
[TABLE]
with F(x,y)=\big{(}c^{\ast}-F(y)\big{)}{\bf 1}_{[0,x]}(y)+x\big{(}F(y)-c^{\ast}\big{)}{\bf 1}_{[0,1]}(y). Therefore, it follows from Theorem 1.2 and the observation in Remark 4 that converges to a centered Gaussian distribution with variance . Let us show that the terms and do not contribute to the limit.
(i) Estimation of : We know that converges in law to a Gaussian random variable and converges in probability to zero, as . It follows that converges in probability to zero, as . Moreover, under the additional assumption that with , we can apply (1.9) with and and conclude that, as ,
[TABLE]
Thus, the process converges in law, hence also in probability, to the zero process.
(ii) Estimation of : Similarly,
[TABLE]
It is clear that both
[TABLE]
converge to zero in probability, while both
[TABLE]
weakly converge to some processes in , as . This implies the process \big{\{}\varepsilon^{-1/2}\rho_{\varepsilon}(x)\,:x\in[0,1]\big{\}} converges in probability to the zero process. Then it follows immediately that
converges in probability to the zero, for every ;
and under the additional assumption ,
converges in probability to the zero process.
(iii)Endgame: In view of Slutsky’s theorem, we have just established (1.6) and to reach (1.7), it suffices to prove as ,
[TABLE]
where is a standard Brownian motion on . Now we write for every ,
[TABLE]
Then applying (1.9) again yields
[TABLE]
Note that we can write with \kappa_{\varepsilon}=\varepsilon^{-1/2}\int_{0}^{1}\big{(}F(y)-c^{\ast}\big{)}q(y/\varepsilon)dy bounded in in view of (3.8). It is also clear that as , converges in law to \mu\int_{0}^{1}\big{(}F(y)-c^{\ast}\big{)}dA_{y}. As a consequence, the f.d.d. convergence of is trivial and the tightness follows from the fact that
[TABLE]
Thus,
[TABLE]
It follows that the sequence is tight, and so is . That is, is tight. Now consider and for and any . We have
[TABLE]
This proves the convergence of the finite-dimensional distributions for and conclude our proof with the above tightness of \big{\{}\mathcal{U}_{\varepsilon},\varepsilon>0\big{\}}.
4. Proof of Theorem 1.4
The proof follows similar arguments as in the proof of Theorem 1.2. Here we first sketch the proof of (1.11). For any , we first rewrite using Hermite expansions
[TABLE]
By the orthogonality of Hermite polynomials, we have
[TABLE]
where we used the -homogeneity and made a change of variable in the last equality: . Making another change of variable yields
[TABLE]
In view of the -homogeneity, the quantity converges to as , for each . Indeed, given , we can write
[TABLE]
By the dominated convergence theorem, our assumptions ensure that
[TABLE]
This gives us the limiting variance. To show the central convergence, it is routine to verify the contraction conditions, which can be done in the same way as before. We omit the details here and point out that we need to use the following limiting result instead of (3.3): for each ,
[TABLE]
The above limit can be verified in the same way, by using Hölder’s inequality and the fact that . In this way, we can obtain the f.d.d. convergence described in (1.11), and we leave this as an easy exercise for the interested readers.
In the following, we sketch the arguments for tightness. For every , we put
[TABLE]
In the sequel, we show the tightness for .
For fixed , we can obtain, by similar arguments as before, that
[TABLE]
see proof of (1.10). Note that for any and any , it holds that ; for any and , there exists a constant that only depends on such that . This gives us
[TABLE]
Since , we can deduce the tightness of .
Acknowledgement: We would like to thank two anonymous referees for their valuable suggestions that help us to improve the presentation of our results.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] G. Bal, J. Garnier, S. Motsch and V. Perrier (2008). Random integrals and correctors in homogenization. Asymptot. Anal. 59 1-26.
- 2[2] G. Bal and Y. Gu (2015). Limiting models for equations with large random potential: A review. Communications in Mathematical Sciences 13 , no. 3, pp. 729-748. Special Issue in Honor of George Papanicolaou’s 70th Birthday, edited by L. Borcea, J.-P. Fouque, S. Jin, L. Ryzhik, and J. Xin.
- 3[3] P. Billingsley (1999). Convergence of Probability Measures . 2nd Edition, Wiley.
- 4[4] A. Bourgeat and A. Piatnitski (1999). Estimates in probability of the residual between the random and the homogenized solutions of one-dimensional second-order operator. Asymptot. Anal. 21, 303-315.
- 5[5] P. Breuer and P. Major (1983). Central limit theorems for non-linear functionals of Gaussian fields. Journal of Multivariate Analysis , vol. 13, pp. 425-441.
- 6[6] S. Campese, I. Nourdin and D. Nualart (2019+). Continuous Breuer-Major theorem: tightness and non-statinarity. To appear in: Ann. Probab.
- 7[7] S. N. Evans and I. Molchanov (2018). Polar decomposition of scale-homogeneous measures with application to L vy measures of strictly stable laws. J. Theoret. Probab. 31, 1303-1321.
- 8[8] Y. Gu and G. Bal (2012). Random homogenization and convergence to integrals with respect to the Rosenblatt process. J. Diff. Equa. 253 , no. 4, pp. 1069-1087.
