Rate of Convergence in the Breuer-Major Theorem via Chaos Expansions
Sefika Kuzgun, David Nualart

TL;DR
This paper provides new estimates for convergence rates in the Breuer-Major theorem using advanced probabilistic techniques, enhancing understanding of normal approximation in Gaussian functionals.
Contribution
It introduces novel bounds for total variation and Wasserstein distances by combining Stein's method, Malliavin calculus, and Wiener chaos expansions.
Findings
Improved convergence rate estimates for the Breuer-Major theorem.
Enhanced bounds for total variation and Wasserstein distances.
Application of combined probabilistic techniques to Gaussian functionals.
Abstract
We show new estimates for the total variation and Wasserstein distances in the framework of the Breuer-Major theorem. The results are based on the combination of Stein's method for normal approximations and Malliavin calculus together with Wiener chaos expansions.
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.
Rate of convergence in the Breuer-Major theorem via chaos expansions
Sefika Kuzgun
University of Kansas, Department of Mathematics, USA
and
David Nualart
University of Kansas, Department of Mathematics, USA
Abstract.
We show new estimates for the total variation and Wasserstein distances in the framework of the Breuer-Major theorem. The results are based on the combination of Stein’s method for normal approximations and Malliavin calculus together with Wiener chaos expansions.
Mathematics Subject Classifications (2010): 60H15, 60H07, 60G15, 60F05.
D. Nualart is supported by the NSF Grant DMS 1811181.
1. Introduction
Suppose that is a centered stationary Gaussian sequence of random variables with unit variance. For all , set if and if . We say that a function , where is the standard Gaussian measure, has Hermite rank if
[TABLE]
where and is the -th Hermite polynomial. We will make use of the following condition that relates the covariance function to the Hermite rank of a function :
[TABLE]
The Breuer-Major theorem (see [4]) says that, under condition (1.2), the sequence
[TABLE]
converges in law to the normal distribution , where
[TABLE]
The aim of this paper is to estimate the rate of convergence to zero of the total variation and Wasserstein distances between the normalized sequence
[TABLE]
and the standard normal law , assuming minimal regularity and integrability conditions on the function . To show these results we will apply a combination of Stein’s method for normal approximations and techniques of Malliavin calculus, and we will make use of the Wiener chaos expansion of the random variable . The combination of Stein’s method with Malliavin calculus to study normal approximations was first developed by Nourdin and Peccati (see the pioneering work [9] and the monograph [10]). For random variables on a fixed Wiener chaos, these techniques provide a quantitative version of the Fourth Moment Theorem proved by Nualart and Peccati in [16].
Given a function with expansion (1.1), we denote by the function in , whose Hermite coefficients are the absolute values of the coefficients of , that is,
[TABLE]
For any integer and any real , we denote by the Sobolev space of functions which are times weakly differentiable, such that together with their derivatives up to order , they have finite moments of order with respect to the measure . Also, we denote by and the total variation and Wasserstein distances, respectively. Along the paper, will denote a random variable. Our first result is the following.
Theorem 1.1**.**
Assume that has Hermite rank and satisfies . Suppose that (1.2) holds true and let be the random variable defined in (1.5). Then we have the following estimates:
- (i)
If , then
[TABLE]
- (ii)
If , we have
[TABLE]
The proof of these results is based on Proposition 2.1, that requires the estimation of , where is such that . Here and are the derivative and divergence operators associated with the Malliavin calculus for the Gaussian sequence . Following the ideas developed in [8] and [17], we construct the sequence using the operator that shifts in one unit the Hermite expansion of . A basic ingredient of the proof is an explicit computation of the variance , using Wiener chaos expansions. For this we need a result on the convergence in of powers of truncated Wiener chaos expansions established in Proposition 3.1, which has its own interest. A sufficient condition for a function to satisfy for any integer , is given in Lemma 3.3.
Let us compare Theorem 1.1 with the existing results in the literature. For , the estimate (1.7) coincides with the estimate obtained in [17] (see Theorem 4.3 (iii)), assuming . This is the best estimate that one can obtain using Proposition 2.1 (it coincides with the bound for ). In [17] this estimate is obtained applying Poincaré inequality to estimate the variance plus twice the integration-by-parts formula and for this reason one requires the function to be four times differentiable. Here, we only need one derivative, but for the function . In a recent note (see [12]), the authors have obtained the weaker bound
[TABLE]
assuming only and applying Gebelein’s inequality, instead of Poincaré’s inequality, to estimate the variance of . Notice that the bound (1.9) holds, for example, for the function , which belongs to .
In the case , the estimate (1.8) coincides with the estimate obtained in [17, Theorem 4.5], assuming , and applying the integration-by-parts argument several times. Again our estimate requires only one derivative (for ) instead of derivatives. Also, computing the third and fourth cumulants in the case , leads to the optimal bound (see [2])
[TABLE]
The second part of the paper is devoted to showing two improvements of the above bound for . First we establish the following upper bound for the Wasserstein distance, using a new estimate (see Proposition 2.3) and the representation of as an iterated divergence .
Theorem 1.2**.**
Assume that has Hermite rank and satisfies . Suppose that (1.2) holds true and let be the random variable defined in (1.5). Then we have the following estimate
[TABLE]
Going back to the total variation distance, we recall first that the optimal bound for is
[TABLE]
This estimate was obtained for in [11], with a matching lower bound, and it was extended to in [17]. This upper bound, however, cannot be obtained as a consequence of Proposition 2.1 and requires a more intensive application of Stein’s method (see [11, 17]). Using Proposition 2.2, we have obtained the following result.
Theorem 1.3**.**
Assume that has Hermite rank and satisfies . Suppose that (1.2) holds true and let be the random variable defined in (1.5). Then the estimate (1.11) holds true.
Notice that the first term in (1.10) coincides with the first term in (1.7), while the second term is precisely the optimal rate for the total variation distance (1.11).
The paper is organized as follows. Section 2 reviews some preliminaries on the Malliavin calculus for an isonormal Gaussian process and Stein’s method. Section 3 presents a new result on the convergence in of powers of Wiener chaos expansions, which has its own interest. Finally, Sections 4, 5 and 6 contain the proofs of Theorems 1.1, 1.2 and 1.3, respectively.
Along the paper we will denote by a generic constant that may vary from line to line.
2. Preliminaries
In this section, we briefly recall some elements of the Malliavin calculus associated with a Gaussian family of random variables. We refer the reader to [10, 13, 14] for a detailed account on this topic. We will also recall two basic inequalities for the total variation distance proved using Stein’s method and we present a new inequality for the Wasserstein distance.
2.1. Malliavin calculus
Let be a real separable Hilbert space. For any integer , we use and to denote the -th tensor product and the -th symmetric tensor product of , respectively. Let denote an isonormal Gaussian process over the Hilbert space . That means, is a centered Gaussian family of random variables, defined on some probability space , with covariance
[TABLE]
We assume that is generated by .
We denote by the closed linear subspace of generated by the random variables , where is the -th Hermite polynomial defined by
[TABLE]
and . The space is called the Wiener chaos of order . The -th multiple integral of is defined by the identity for any with . The map provides a linear isometry between (equipped with the norm ) and (equipped with norm). By convention, and .
The space can be decomposed into the infinite orthogonal sum of the spaces . Namely, for any square integrable random variable , we have the following expansion,
[TABLE]
where , and are uniquely determined by . This is known as the Wiener chaos expansion.
For a smooth and cylindrical random variable , with and ( and its partial derivatives are bounded), we define its Malliavin derivative as the -valued random variable given by
[TABLE]
By iteration, we can also define the -th derivative , which is an element in the space . For any real and any integer , the Sobolev space is defined as the closure of the space of smooth and cylindrical random variables with respect to the norm defined by
[TABLE]
We define the divergence operator as the adjoint of the derivative operator . Namely, an element belongs to the domain of , denoted by , if there is a constant depending on and satisfying
[TABLE]
for any . If , the random variable is defined by the duality relationship
[TABLE]
which is valid for all . In a similar way, for each integer , we define the iterated divergence operator through the duality relationship
[TABLE]
valid for any , where .
Let be the standard Gaussian measure on . The Hermite polynomials form a complete orthonormal system in and any function admits an orthogonal expansion of the form (1.1). If has Hermite rank , for any integer , we define the operator by
[TABLE]
To simplify the notation we will write .
Suppose that is a random variable in the first Wiener chaos of of the form , where has norm one. Then has the representation
[TABLE]
Moreover, if for some and , then . We refer to [17] for the proof of these results.
Consider , the probability space and the isonormal Gaussian process . For any and , denote by the corresponding Sobolev spaces of functions. Notice that if is an element in the first Wiener chaos with , then if and only if .
2.2. Stein’s method
We refer to [6] for a complete presentation of this topic. Let be a Borel function such that . The ordinary differential equation
[TABLE]
is called the Stein’s equation associated with . The function
[TABLE]
is the unique solution to the Stein’s equation satisfying . Moreover, if is bounded by , satisfies and . On the other hand, if ( is Lipschitz with a Lipschitz constant bounded by ), then is continuously differentiable, and (see [19, Lemma 3]) . We refer to [10] and the references therein for a complete proof of these results.
We recall that the total variation distance between the laws of two random variables is defined by
[TABLE]
where the supremum runs over all Borel sets . Substituting by in Stein’s equation (2.6) and using the estimate for lead to the fundamental estimate
[TABLE]
Furthermore, the Wasserstein distance between the laws of two random variables is defined by
[TABLE]
and using Stein’s equation leads to
[TABLE]
where is the set of functions such that and .
In the framework of an isonormal Gaussian process , we can use Stein’s equation to estimate the total variation distance between a random variable and . A basic result is given in the next proposition (see [15, 10]), which is an easy consequence of (2.7) and the duality relationship (2.2).
Proposition 2.1**.**
Assume that , and . Then,
[TABLE]
An iterative application of the Stein-Malliavin approach leads to the following result, which requires the random variable to be three times differentiable (see [17, Proposition 3.2.]).
Proposition 2.2**.**
Assume that , and . Then,
[TABLE]
where we have used the notation and for .
In the next proposition we present a new estimate for the Wasserstein’s distance between a random variable and a random variable obtained using Stein’s method and Malliavin calculus.
Proposition 2.3**.**
Assume that , and . Then,
[TABLE]
Proof.
By the duality relation (2.3), . As a consequence, using (2.8) we can write
[TABLE]
Now, since , using Cauchy-Schwarz inequality, we get
[TABLE]
which concludes our proof. ∎
2.3. Some basic inequalities
In this subsection we recall several inequalities proved in [17] (see Lemmas 6.6, 6.7 and 6.8), which can be deduced from the Brascamp-Lieb inequality (see [3]) or just using Hölder’s and Young’s convolution inequalities.
Lemma 2.1**.**
Fix an integer . Let be a non-negative function on the integers and set . Then, we have:
- (i)
For any vector whose components are or
[TABLE]
- (ii)
For any vector whose components are [math], or , assuming ,
[TABLE]
- (iii)
Suppose . Let be linearly independent vectors, whose components are [math], or . Suppose . Then,
[TABLE]
3. Some remarks on Wiener chaos expansions
In this section we present some useful results on Wiener chaos expansions. We first recall a formula for the expectation of the product of multiple stochastic integrals.
Lemma 3.1**.**
Let be integers, and consider functions , . Then,
[TABLE]
where
[TABLE]
* is the set of nonnegative integers , satisfying*
[TABLE]
and denotes the contraction of indexes between and , for all .
Proof.
The product formula for multiple stochastic integrals (see, for instance, [18, Theorem 6.1.1], or formula (2.1) in [1] for ) says that
[TABLE]
where denotes the set of all partitions , where for any , and have the same cardinality, is a bijection between and and . Moreover, denotes the contraction of the indexes and for any and any . Then, the expectation corresponds to the case , and, if we specify the number of partitions for fixed cardinalities , we obtain the desired formula. ∎
3.1. Convergence of truncated expansions
In general, given a random variable with chaos expansion (2.1), the fact that for some does not imply that the chaos expansion converges in . The next proposition provides a partial result in this direction for and in the one-dimensional case, assuming that all the coefficients are nonnegative.
Proposition 3.1**.**
Consider a function , with an expansion of the form . Suppose that for each and for some . Consider the truncated sequence
[TABLE]
Then converges in to .
Proof.
The proof will be done by induction on . The result is clearly true for . Suppose that and the result holds for . Using the product formula for Hermite polynomials, which is a particular case of (3.1), we can write
[TABLE]
where
[TABLE]
and is the set of nonnegative integers , and , , satisfying
[TABLE]
As a consequence, we obtain
[TABLE]
where
[TABLE]
The function belongs to . Therefore, it will have an expansion of the form
[TABLE]
In order to compute the coefficients , taking into account that and, by the induction hypothesis, converges to in as , we can write
[TABLE]
To compute the expectation we need the chaos expansion of :
[TABLE]
where
[TABLE]
and is the set of ’s and ’s such that (3.3) holds for and
[TABLE]
As a consequence,
[TABLE]
and, taking into account that the coefficients are nonnegative and putting ,
[TABLE]
We claim that for any there exist a unique element such that
[TABLE]
Indeed, it suffices to take if , for , , and for . It follows that . This implies that converges in to and allows us to complete the proof. ∎
3.2. The absolute value operator.
Recall that , defined in (1.6) is the operator acting on which replace the Hermite coefficients by its absolute values. Clearly, for any integer , and for any , we have
[TABLE]
Therefore, belongs to if and only if . If we consider functions in for some real number , we do not know whether implies . However, the following result holds.
Lemma 3.2**.**
Suppose that for some integers and . Then .
Proof.
We will show the result only for , the case being similar. Let and define and . Then . We will show that , and in the same way one can prove that . Using Proposition 3.1, we can write
[TABLE]
where is the set of nonnegative integers , , satisfying . Clearly, this implies that . ∎
The next lemma provides a criterion for a function to satisfy for integers , .
Lemma 3.3**.**
Fix integers and . Let be a function in , with Hermite expansion . Then, if
[TABLE]
Proof.
We have
[TABLE]
Applying the estimate (see, for instance, [7])
[TABLE]
we obtain
[TABLE]
Therefore, taking into account that converges in to as tends to infinity, we conclude that if (3.4) holds. ∎
4. Proof of Theorem 1.1
Proof.
Consider a centered stationary Gaussian family of random variables with unit variance and covariance for . We put for . Suppose that is a Hilbert space and , , are elements such that, for each , we have . In this situation, if is an isonormal Gaussian process, then the sequence has the same law as and we can assume, without any loss of generality, that .
Consider the sequence introduced in (1.5), where has Hermite rank and let . Under condition (1.2), it is well known that as , , where has been defined in (1.4). Set . Notice that implies that is bounded below for large enough. Taking into account (2.5), we have the representation , where
[TABLE]
and is the shifted function introduced in (2.4).
As a consequence of Proposition 2.1, we have the estimate
[TABLE]
Then, we can write
[TABLE]
The random variable belongs to , but we do not know its chaos expansion. For this reason, we need to use a limit argument. We have
[TABLE]
where the convergence holds in and
[TABLE]
Therefore, by Fatou’s lemma
[TABLE]
We can write
[TABLE]
The next step is to compute the covariance appearing in the previous formula. To do this we will write the Hermite polynomials in terms of stochastic integrals and apply Lemma 3.1. That is,
[TABLE]
and using Lemma 3.1,
[TABLE]
where
[TABLE]
and is the set of nonnegative integers , satisfying
[TABLE]
On the other hand,
[TABLE]
if and , and zero otherwise. Notice that (4.6) is precisely the term in the sum (4.4) with , and . As a consequence, we obtain
[TABLE]
where is the set of elements , where the ’s are nonnegative integers satisfying (4.5) and
[TABLE]
Substituting (4.7) into (4.3) yields
[TABLE]
Replacing and by and , the above equality can be rewritten as
[TABLE]
where
[TABLE]
and is the set of nonnegative integers , , satisfying , , and
[TABLE]
This leads to the estimate
[TABLE]
where
[TABLE]
and the supremum is taken over all sets of nonnegative integers , , satisfying , , , for and
[TABLE]
To complete the proof we need to show the following claims:
- (a)
We have
[TABLE]
- (b)
If , then is bounded by a constant times the right-hand side of (1.7).
- (c)
If , then is bounded by a constant times the right-hand side of (1.8).
Proof of (4.8): The main idea here is to identify the sum in (4.8) as the variance of a truncated function composed with a fixed random variable . From our previous computations it follows that
[TABLE]
where for each integer , we denote by and the truncated expansions of and , respectively, introduced in (3.2). By Proposition 3.1, and are convergent in to and , respectively. Therefore,
[TABLE]
Proof of (b): We will use ideas from graph theory to show the bound in the first part of Theorem 1. Recall the supremum is taken over all sets of nonnegative integers , , satisfying , , , for and
[TABLE]
The exponents induce an unordered simple graph on the set of vertices by putting an edge between and if . There are edges connecting the pairs of vertices and and condition means that the graph is connected. Without any loss of generality, we can assume that there is an edge between the vertices and . Then, condition (4.9) implies that the degree of each vertex is at least two. The worse case is when the number of edges is minimal and the corresponding nonzero coefficients are equal to one. So far we have edges in , and . There must be more edges because each vertex must have at least degree two. There are two possible cases:
- (i)
. In this case we have
[TABLE]
After making the change of variables , , and and using the inequality (2.9) with and , we obtain
[TABLE]
- (ii)
Suppose that we add two more edges to the graph formed by the edges , and . In this case, we obtain
[TABLE]
Making the change of variables , , and , we obtain
[TABLE]
where and are two linearly independent vectors in and . Using (2.11), we obtain
[TABLE]
which completes the proof of (b).
Proof of (c): This estimate can be obtained by exactly the same arguments as in the proof of Theorem 4.5 in [17]. We omit the details. ∎
Remark 4.1**.**
We can show that both bounds in (1.7) are not comparable. In the particular case as , with , we obtain:
[TABLE]
5. Proof of Theorem 1.2
Proof.
As in the proof of Theorem 1.1, we can assume that , where , are elements in a Hilbert space such that, for each , we have and is an isonormal Gaussian process.
Consider the sequence introduced in (1.5), where has Hermite rank and let . Set . Taking into account (2.5), we have the representation , where
[TABLE]
Under condition (1.2), it is well known that as , , where has been defined in (1.4). As a consequence of Proposition 2.3, we have the estimate
[TABLE]
Therefore, we need to estimate the quantities and .
(i) Estimation of . We will follow similar arguments as in the proof of Theorem 1.2. First, we write
[TABLE]
Using a limit argument, we obtain
[TABLE]
where the convergence holds in and
[TABLE]
Therefore, by Fatou’s lemma
[TABLE]
We can write
[TABLE]
With a very similar calculation as in the proof of Theorem 1.1, we have
[TABLE]
where is the set of nonnegative integers , , satisfying
[TABLE]
and
[TABLE]
Substituting (5.4) into (5.3) yields
[TABLE]
Replacing and by and , the above equality can be rewritten as
[TABLE]
where
[TABLE]
and is the set of nonnegative integers , , satisfying , , and
[TABLE]
We can write
[TABLE]
where
[TABLE]
and the supremum is taken over all sets of nonnegative integers , , satisfying , , , for and
[TABLE]
Then, in this case we have
[TABLE]
where and . After making the change , , and , we obtain
[TABLE]
Now, it is left to show that
[TABLE]
We have
[TABLE]
By Hölder’s inequality, we obtain
[TABLE]
From the hypothesis and the Proposition 3.1, and converge to and in respectively. Hence, (5.6) holds.
*(ii) Estimation of . * We can write
[TABLE]
We have, in the sense,
[TABLE]
where
[TABLE]
Therefore, by Fatou’s lemma
[TABLE]
We can write
[TABLE]
Using Lemma 3.1, we obtain
[TABLE]
where
[TABLE]
and is the set of nonnegative integers , , satisfying
[TABLE]
Replacing (5.8) into (5.7) yields
[TABLE]
Substituting , , and by , , and , respectively, we can write
[TABLE]
where
[TABLE]
and is the set of nonnegative integers , , satisfying
[TABLE]
Hence
[TABLE]
where
[TABLE]
and the supremum is taken over all sets of nonnegative integers , , , satisfying , , , and
[TABLE]
As in the proof of Theorem 1.1, we can show that
[TABLE]
In fact,
[TABLE]
where, as before, and are the truncated expansions of and , respectively. By Hölder’s inequality, we can write
[TABLE]
From our hypothesis and in view of Proposition 3.1, and converge in to and , respectively. Thus, (5.11) holds true.
To complete the proof, it remains to show that,
[TABLE]
As in the proof of Theorem 1.1, in order to show this estimate we will make use of some ideas from graph theory. The exponents induce an unordered simple graph on the set of vertices by putting an edge between and whenever . Because , , and , there are edges connecting the pairs of vertices , , and . Condition (5.10) means that the degree of each vertex is at least . Then we consider two cases, depending whether graph is connected or not.
Case 1: Suppose that the graph is not connected. This implies that , and there is no edge between the sets and . The worse case is when and all the other exponents are zero. In this case we have the estimate
[TABLE]
Using (2.9), we obtain
[TABLE]
Case 2: Suppose that the graph is connected. This means that there is an edge connecting the sets and . Suppose that , where and . We have then nonzero coefficients : , , , and . Because all the edges have at least degree , there must be at least two more nonzero coefficients . Let us denote them by and .
Then, the worse case will be when and all the other coefficients are zero. Consider the change of variables , , , , . Then, and , where and , are -dimensional linearly independent vectors whose components are [math], or . Then, we can write, using (2.11) and Hölder’s inequality,
[TABLE]
∎
Remark 5.1**.**
In the case , the term is zero because is deterministic, and for the second term we get the estimate (1.11).
Remark 5.2**.**
We can show that both bounds in (1.10) are not comparable. In the particular case as , with , we obtain:
[TABLE]
6. Proof of Theorem 1.3
Proof.
With the notation used in the proof of Theorem 1.1 and using Proposition 2.2, we can write
[TABLE]
Now, we want to estimate each of these terms separately.
Step 1. From Theorem 1.1 we know that
[TABLE]
*Step 2. * We claim that
[TABLE]
We can write
[TABLE]
Truncating the Wiener chaos expansion of the random variables , as in the proof of Theorem 1.1, we obtain
[TABLE]
where the convergence holds in due to Proposition 3.1 because . Therefore,
[TABLE]
We can write
[TABLE]
Using Lemma 3.1, we obtain
[TABLE]
where
[TABLE]
and is the set of nonnegative integers , , satisfying
[TABLE]
Then,
[TABLE]
where
[TABLE]
and the supremum is taken over all sets of nonnegative integers , , satisfying for and
[TABLE]
It is easy to see that to satisfy the above conditions, for all . Hence, we have
[TABLE]
After making the change of variables , , and using the inequality (2.9) with and , we obtain
[TABLE]
To complete the proof of (6.3), we need to show that:
[TABLE]
In fact,
[TABLE]
taking into account Proposition 3.1 and the fact that .
Step 3. We proceed now with the estimation of . We can write
[TABLE]
and
[TABLE]
Therefore,
[TABLE]
Because the random variables , , , and appearing in the above expression belong to , their truncated Wiener chaos expansions convergence in , and, as a consequence, in probability, where
[TABLE]
Making the change of variables and in the second sum allows us to put the two terms together, and we obtain
[TABLE]
Therefore, by Fatou’s lemma,
[TABLE]
Then,
[TABLE]
where
[TABLE]
Using the product formula for multiple integrals (see Lemma 3.1), we get
[TABLE]
where
[TABLE]
and
[TABLE]
Replacing by for , yields
[TABLE]
where
[TABLE]
and
[TABLE]
Then, we can write
[TABLE]
where
[TABLE]
and the supremum is taken over all sets of nonnegative integers , , satisfying , for and
[TABLE]
Then, the estimation follows as in the proof of the last part of Theorem 1.2.
Now, we need to show that
[TABLE]
In fact,
[TABLE]
Since , and converge to and , respectively, in by (3.1). Then, (6.8) is true.
Step 4. We proceed to the estimation of . Taking the derivative in (6.7), yields
[TABLE]
This implies
[TABLE]
Notice that the second, third and fourth terms are identical. This allows us to write
[TABLE]
Then, we have
[TABLE]
where the convergence holds in probability and
[TABLE]
with
[TABLE]
We can combine the first and third terms with the change of variables and . In this way we obtain
[TABLE]
with
[TABLE]
Then, by Fatou’s lemma,
[TABLE]
We are going to treat each term , , separately.
Case . Let us first estimate . We have
[TABLE]
where
[TABLE]
This yields
[TABLE]
where
[TABLE]
and
[TABLE]
Changing the exponents in to for , we can write
[TABLE]
where
[TABLE]
with and
[TABLE]
Then, we obtain
[TABLE]
where
[TABLE]
and the supremum is taken over all sets of nonnegative integers , , satisfying , for and
[TABLE]
We need to estimate and to show that
[TABLE]
Estimation of : We claim that
[TABLE]
As in the proof of Theorem 1.2, we will make use of ideas from graph theory. The exponents induce an unordered simple graph on the set of vertices by putting an edge between and whenever . Because , , and , there are edges connecting the pairs of vertices , , , , and . Condition (5.10) means that the degree of each vertex is at least . Then we consider two cases, depending whether graph is connected or not.
Case 1: Suppose that the graph is not connected. This means that if and and there is no edge between the sets and . Therefore,
[TABLE]
where
[TABLE]
and the nonnegative integers , , satisfy , for and
[TABLE]
As a consequence, , and . This means that at least two of the indices , and is larger or equal to . Considering the worst case, we can assume that and . This leads to
[TABLE]
Using (2.11) and Hölder’s inequality we obtain
[TABLE]
Case 2: Suppose that the graph is connected. This means that there is an edge connecting the sets and . Suppose that , where and . We have then nonzero coefficients : , , , , , and . Because all the edges have at least degree , there must be another nonzero coefficient . Assume it is . Then, the worse case will be when and all the other coefficients are zero. Consider the change of variables , , , , , , . Then, it is easy to show that , where and is a -dimensional vector whose components are [math], or . Applying (2.10) and Hölder’s inequality yields
[TABLE]
This completes the proof of (6.10).
Proof of (6.9): We have
[TABLE]
Applying Hölder’s inequality, yields
[TABLE]
By Proposition 3.2 and our hypothesis, taking the limit as tends to infinity, it follows that
[TABLE]
Case . For we have
[TABLE]
where
[TABLE]
This yields
[TABLE]
where
[TABLE]
and
[TABLE]
Changing the exponents in to for , we can write
[TABLE]
where
[TABLE]
with and
[TABLE]
Then, we have
[TABLE]
where
[TABLE]
and the supremum is taken over all sets of nonnegative integers , , satisfying , for and
[TABLE]
We need to estimate and to show that
[TABLE]
Estimation of : We claim that
[TABLE]
As in the proof of Theorem 1.2, we will make use of ideas from graph theory. The exponents induce an unordered simple graph on the set of vertices by putting an edge between and whenever . Because , , , and , there are edges connecting the pairs of vertices , , , and . Condition (5.10) means that the degree of each vertex is at least . Then we consider two cases, depending whether graph is connected or not.
Case 1: Suppose that the graph is not connected. This means that if and and there is no edge between the sets and . Therefore,
[TABLE]
where
[TABLE]
and the nonnegative integers , , satisfy , for and
[TABLE]
As a consequence, and . This means or both and are larger or equal than one. There are two possible cases:
- (i)
Suppose , Considering the worst case, we can assume that . Then, applying (2.9) and Hölder’s inequality, we obtain
[TABLE]
By Hölder’s inequality, we can show that
[TABLE]
- (ii)
Suppose and . Then,
[TABLE]
and this case can be treated as (6.11).
Case 2: Suppose that the graph is connected. This means that there is an edge connecting the sets and . Suppose that , where and . We have then nonzero coefficients : , , , , , and . Because all the edges have at least degree , there must be another nonzero coefficient . Assume it is . Then, the worse case will be when and all the other coefficients are zero. Consider the change of variables , , , , , , . Then, it is easy to show that , where and is a -dimensional vector whose components are [math], or . Then, using (2.10) and Hölder’s inequality, we obtain
[TABLE]
Proof of (6.12): We have
[TABLE]
which converges as to
[TABLE]
Case . The term can be handled in a similar way and we omit the details. ∎
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] D. Bell and D. Nualart (2017). Noncentral limit theorem for the generalized Hermite process. Electron. J. Probab. 22 ,no. 2, 1-13.
- 2[2] H. Biermé, A. Bonami, I. Nourdin and G. Peccati (2012). Optimal Berry-Esseen rates on the Wiener space: the barrier of third and fourth cumulants. ALEA , 9 , no. 2, 473-500.
- 3[3] H. J. Brascamp and E. H. Lieb (1976). Best constants in YoungÕs inequality, its converse, and its generalization to more than three functions. Adv. Math. 20 , 151-173.
- 4[4] P. Breuer and P. Major (1983). Central limit theorems for non-linear functionals of Gaussian fields. J. Mult. Anal. 13 , 425-441.
- 5[5] S. Campese, I. Nourdin and D. Nualart: Continuous Breuer-Major theorem: tightness and non-stationarity. Preprint.
- 6[6] L. H. Y. Chen, L. Goldstein and Q.-M. Shao (2011). Normal approximation by Stein’s method . Springer-Verlag, Berlin.
- 7[7] L. Larsson-Cohn (2002). L p superscript 𝐿 𝑝 L^{p} -norms of Hermite polynomials and an extremal problem on Wiener chaos. Arkiv för Matematik 40 , no. 1, 133–144.
- 8[8] I. Nourdin and D. Nualart (2018). The functional Breuer-Major theorem. Preprint
