Weak convergence on Wiener space: targeting the first two chaoses
Christian Krein

TL;DR
This paper establishes necessary and sufficient conditions for the convergence in law of sequences of random variables in the sum of the first two Wiener chaoses, using Malliavin calculus and Gamma-operators, extending prior results.
Contribution
It provides a complete characterization of convergence in law for sequences in the first two Wiener chaoses, including multiple Wiener integrals, and explores stable convergence and limitations on target variables.
Findings
Conditions for convergence in law are characterized precisely.
Results extend previous work by Azmoodeh, Peccati, and Poly (2014).
Certain classes of target variables are shown to be unattainable.
Abstract
We consider sequences of random variables living in a finite sum of Wiener chaoses. We find necessary and sufficient conditions for convergence in law to a target variable living in the sum of the first two Wiener chaoses. Our conditions hold notably for sequences of multiple Wiener integrals. Malliavin calculus and in particular the Gamma-operators are used. Our results extend previous findings by Azmoodeh, Peccati and Poly (2014) and are applied to central and non-central convergence situations. Our methods are applied as well to investigate stable convergence. We finally exclude certain classes of random variables as target variables for sequences living in a fixed Wiener chaos.
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.
Weak convergence on Wiener space:
targeting the first two chaoses
Christian Kreinlabel=e1][email protected] [ Mathematics Research Unit
University of Luxembourg
Luxembourg
Abstract
We consider sequences of random variables living in a finite sum of Wiener chaoses. We find necessary and sufficient conditions for convergence in law to a target variable living in the sum of the first two Wiener chaoses. Our conditions hold notably for sequences of multiple Wiener integrals. Malliavin calculus and in particular the -operators are used. Our results extend previous findings by Azmoodeh, Peccati and Poly (2014) and are applied to central and non-central convergence situations. Our methods are applied as well to investigate stable convergence. We finally exclude certain classes of random variables as target variables for sequences living in a fixed Wiener chaos.
60F05; 60G15; 60H07,
Brownian motion, Malliavin calculus, multiple Wiener integrals, weak convergence, limit theorems, cumulants, stable convergence,
keywords:
[class=MSC]
keywords:
Contents
1 Introduction
1.1 Overview
The aim of this paper is to provide new criteria for non-central convergence in law for sequences of polynomial functionals of a Brownian motion . In particular, we consider the convergence in law of a sequence of random variables to a target variable , where:
- •
the random variables have a representation of the form for a fixed , where is the Wiener integral of order with respect to the Brownian motion ;
- •
the target variable lives in the sum of the first two Wiener chaoses associated with and can be represented as:
[TABLE]
where all coefficients , and are non-zero and are independent standard normal variables for and . We shall see that this representation covers in particular random variables of the form:
[TABLE]
where all coefficients are non-zero, are independent standard normal variables and is a standard normal variable which may be correlated to .
Our main result (Theorem 1.1) gives a necessary and sufficient criterion for the convergence in law to :
Theorem 1.1**.**
Consider and
[TABLE]
where . Suppose that at least one of the parameters is non-zero. Consider a sequence of non-zero random variables such that for fixed and for . Define:
[TABLE]
As , the following conditions (a) and (b) are equivalent:
-
(a)
-
(1)
, 2. (2)
\displaystyle{\operatorname{\mathbb{E}}\left[\left|\operatorname{\mathbb{E}}\left[\sum_{r=1}^{\textrm{deg}(P)}\frac{P^{(r)}(0)}{r!2^{r-1}}\left(\Gamma_{r-1}(F_{n})-\operatorname{\mathbb{E}}[\Gamma_{r-1}(F_{n})]\right)\Big{|}F_{n}\right]\right|\right]\to 0}, 2. (b)
, as .
In this paper, we consider functionals of a Brownian motion. By a standard isometry argument (see e.g. [21, Section 2.2]), the results immediately extend to the framework of an isonormal Gaussian process on a general real separable Hilbert space .
The notations used in this theorem are introduced in Section 2. In particular, the representation of in Eq. (1.1) is detailed in Eq. (3.3) and (3.5), is the -th cumulant of a random variable and the sequence is defined recursively using Malliavin operators. In Section 3 the representation of the target random variable in Eq. (1.1) is derived.
Our main result unifies, generalizes and extends previous findings. More precisely, Theorem 1.1:
- •
further extends to a non-central setting the seminal paper [21] and in particular [15, Theorem 5.3.1] by dealing with central limit theorems for sequences living in a finite sum of Wiener chaoses,
- •
extends [16, Theorem 3.4] by considering a sequence of random variables which are no longer restricted to the second Wiener chaos but live in a finite sum of Wiener chaoses,
- •
extends [13, Theorem 1.2], [4, Theorem 3.2] and [6, Proposition 1.7] by considering target variables involving linear combinations of independent distributed random variables and adding a possibly correlated normal variable,
- •
improves [4, Theorem 3.2] by replacing -convergence with -convergence and finding thus a necessary and sufficient criterion for convergence in law for a large class of target variables, in particular for linear combination of independent central distributed target variables.
In addition to these applications which are discussed in Section 4, Theorem 1.1 is used to investigate stable convergence in Section 5.
1.2 History and motivation
The study of convergence in law for sequences of multiple Wiener integrals, by variational techniques, has been the object of an intense study in recent years. The starting point of this line of research is [21]. In this reference and later in [20], the authors gave necessary and sufficient criteria for the convergence in law of a sequence of multiple Wiener integrals to a standard normal variable : If the functions are symmetric in the variables with , as , then the following conditions are equivalent:
- (i)
, as , 2. (ii)
, as , for every , 3. (iii)
, as , 4. (iv)
, as .
Notice that is the standard Malliavin derivative operator and is the contraction of order , see Section 2.2. The equivalence of (i), (ii) and (iv) has been found in [21], the equivalence of either one of these conditions with (iii) has been proved later in [20]. Considering the proof of [20, Theorem 4], it is easy to see that condition (iii) above can be replaced by:
- (iii’)
, as .
This is remarkable since conditions of this form play a crucial role in [4] and in the main result of the present paper. Since this characterisation has been published, limit theorems have been extended beyond standard normal target variables. In [13], the authors establish, for even, necessary and sufficient conditions for a sequence of multiple Wiener integrals to converge in law to a Gamma random variable. The conditions found by Nourdin and Peccati use contractions, convergence of the first moments of and Malliavin derivatives. In particular, the results of [13] cover the convergence in law of a sequence of multiple Wiener integrals to a random variable with independent standard normal variables and . has a centered law with degrees of freedom. The authors also prove that the convergence is stable in this case. More results about stable convergence can be found in [22] and in the more recent work [11].
For the case , linear combinations of independent centered distributed random variables are important since it is known that every element of the second Wiener chaos has a representation of the form , where and is a sequence of independent standard normal variables, see [9, Theorem 6.1]. It is proved in [16], that every sequence which converges in law has a limit of the form , where are independent standard normal variables. In [16, Theorem 3.4] the authors use cumulants and a polynomial to characterise this convergence in law if .
The idea of using polynomials to find necessary and sufficient conditions for the convergence in law has proved to be useful. In [4], the authors consider the more general problem of finding necessary and sufficient conditions for a sequence to converge to a random variable with a representation of the form
[TABLE]
where are random variables living in a (fixed) finite sum of Wiener chaoses, see Section 2.1. For , their main finding, [4, Theorem 3.2] provides a necessary and a sufficient condition for , as , in terms of Malliavin operators , defined in Section 2.3.
Linear combinations of independent centered distributed random variables as in Eq. (1.2) are of great interest because of their role within the second Wiener chaos. This class of random variables is important in stochastic geometry as well. In [10], the authors consider the two-dimensional torus and prove the weak convergence of the normalized nodal length of the so-called ‘arithmetic random waves’, to a target variable defined by:
[TABLE]
where are independent standard normal variables. An important element of the proof is the fact that the Wiener chaos expansion of the normalised nodal length is dominated by its fourth order chaos component.
Another line of research, which is closely connected to the previous results, investigates the convergence of sequences living in a finite sum of Wiener chaoses by using distances between probability measures. In this context, the distance between two laws and is defined as:
[TABLE]
where is a class of functions. Different classes lead to distances such as the Wasserstein, total variation and Kolmogorov distance, see [15, Appendix C] for details. Upper bounds for the total variation and smooth distances are proved in [14] and [17]. For most of these results, the distance of a distribution to a centered normal distribution or a centered distribution with degrees of freedom is considered. Recently, in [6] a new estimate is proved for the Wasserstein distance of a distribution to a centered distribution with degrees of freedom. In particular, the authors find a new necessary and sufficient criterion for sequences living in a fixed Wiener chaos to converge in law to defined above.
In [1] the authors consider target variables of the form given in Eq. (1.2):
[TABLE]
where the coefficients are not necessarily pairwise distinct and are independent standard normal variables. The authors discuss Stein’s method for this class of target variables and apply a new and original Fourier-based approach to derive a Stein-type characterisation. The polynomials used in [16, 4] and -operators, see [4, 15], are combined with the integration by parts formula of Malliavin calculus to derive a Stein operator which allows to characterise target variables as in Eq. (1.2). The authors consider a linear combination of -operators which shall be generalized in the present paper and the 2-Wasserstein distance. In general, the 2-Wasserstein distance between the laws of random vectors and is defined as follows:
[TABLE]
where the infimum is taken over all joint distributions of and with respective marginals and , and stands for the Euclidean norm on , see [2, Definition 1.1]. It is shown that:
[TABLE]
where is independent of , the quantity can be expressed in terms of cumulants and polynomials, the sequence must satisfy several conditions which hold in particular for sequences living in the second Wiener chaos. It is proved in particular that:
[TABLE]
if , see Eq. (1.2). This shows that , as , is sufficient for convergence in the 2-Wasserstein metric which implies convergence in law. In [2], it is shown that the convergence of the cumulants can not be omitted in the general case. In addition to the upper bound found in [1], a lower bound for the 2-Wasserstein metric is derived in [2], namely:
[TABLE]
where is independent of and the sequence lives in the second Wiener chaos. In other words, for sequences living in the second Wiener chaos, weak convergence to is equivalent to , as , if . The so-called Stein-Tikhomirov method is considered in [3]. This method can be seen as a combination of Stein’s method with other methods to measure the rate of convergence of a sequence of random variables. The authors consider in particular the Stein-type characterisation found in [1, Theorem 2.1] and apply their version of the Stein-Tikhomirov method. The same linear combination of -operators as in [1] is used and the so-called transfer-principle allows to find upper bounds on smooth Wasserstein distances using upper bounds on the difference of the characteristic functions of the approximating sequence and the target variable. For sequences living in the sum of the first Wiener chaoses and constants depending only on , the following bound is proved:
[TABLE]
where is expressed in terms of cumulants and -operators. In particular, if in Eq. (1.2), we have for the Kolmogorov distance that . Finally the authors find bounds for if lives inside a fixed Wiener chaos and in Eq. (1.2). Even though the aforementioned papers present important new results for target variables living in the second Wiener chaos, none of them considers target variables living in the sum of the first two Wiener chaoses with possibly correlated first and second order components.
The results of [4, Theorem 3.2] are the starting point of the present work. As anticipated, we shall consider a sequence of random variables living in a finite (fixed) sum of Wiener chaoses and provide necessary and sufficient conditions for , as , where and has the following, more general form:
[TABLE]
The representation in Eq. (1.4) is equivalent to one in Eq. (1.1), where we have dropped all vanishing coefficients and regrouped independent normal variables. Both representations (1.1) and (1.4) are useful for the discussion to follow. Random variables as in Eq. (1.4) are important since every random variable living in the sum of the first two Wiener chaoses has a representation of this form, with , see [9, Theorem 6.2]. Our conditions make, as in [4], use of the operators . Clearly such a result can be seen as extension of [4, Theorem 3.2]. For sequences of random variables living in a finite sum of Wiener chaoses, we shall apply our methods and results to derive necessary and sufficient criteria to prove stable convergence to target variables with representations as in Eq. (1.4)
1.3 Results and plan
The paper is organized as follows:
In Section 2, we introduce the necessary notations and give a brief introduction to Malliavin calculus. The basic elements of this theory shall be needed in the forthcoming proofs. 2. -
In Section 3, we prove our characterisation in Theorems 3.8 and 3.11. The main Theorem 1.1 is then a direct consequence of these theorems. 3. -
In Section 4, we apply Theorem 1.1 to several situations, such as the convergence in law to a normal variable or a centered distributed random variable with degrees of freedom. We shall also recover the results of [4]. In Theorem 4.6, we give sufficient conditions, based only on cumulants and contractions. We conclude this section by giving a criterion which excludes certain classes of target variables for sequences living in a chaos of odd order. 4. -
In Section 5, we give criteria which can be used to determine whether a sequence converges stably.
2 Preliminaries
2.1 Multiple Wiener integrals
The reader is referred to [15], [19] or [5] for a detailed introduction to multiple Wiener integrals. Consider the real Lebesgue space , where is the Lebesgue measure on . The real separable Hilbert space is endowed with the standard scalar product for all . We write for , where , and define as the subspace of containing exactly the functions which are symmetric on a set of Lebesgue measure . Consider a complete probability space and a standard Brownian motion with respect to and the filtration . Define for every :
[TABLE]
then , in other words is square-integrable. We have for :
[TABLE]
More generally the -th Wiener chaos is defined as closed linear subspace of which is generated by the random variables of the form where with and is the -th Hermite polynomial. The elements of the -th Wiener chaos can be represented as multiple Wiener integrals. For every :
[TABLE]
It is well known that every has a representation of the form , where and the right-hand side converges in . We have moreover for :
[TABLE]
For two function and , the contraction of indices is defined for by:
[TABLE]
We have . The symmetrization of is . We shall also need the multiplication formula for multiple Wiener integrals. For and , we have:
[TABLE]
2.2 Malliavin calculus
The reader is referred to [15], [19] or [4] for a detailed introduction to Malliavin calculus. Let and be a random variable with where is an infinitely differentiable rapidly decreasing function on and . Then is called a smooth random variable and is the set containing exactly the smooth random variables. The Malliavin derivative of is defined by:
[TABLE]
We have that is closable from to , that is (see [5] or [19, Proposition 1.2.1]): If a sequence converges to [math], that is as , and converges in as , then . We write Dom for the closed domain of . Moreover the Malliavin derivative has a closable adjoint (under ). The operator is called the divergence operator or, in the white noise case, the Skorohod integral. The domain of is denoted by Dom , it is the set of square-integrable random variables with:
[TABLE]
for a constant (depending on ) and all where is the closure of the class of smooth random variables with respect to the norm:
[TABLE]
With the scalar product is a Hilbert space. If Dom , then is the element of characterised by
[TABLE]
This relation is often called the integration by parts formula. We have the more general rule (see [15, Proposition 2.5.4]) for , Dom such that Dom :
[TABLE]
For multiple Wiener integrals and , we have (see for instance [19, p.35]):
[TABLE]
Formula (2.3) can be generalized for the multiple divergence (see [15, p.33]): If Dom and :
[TABLE]
see [15] or [19] for details. For , and the -th Malliavin derivative , we can define as the closure of the class of smooth random variables with respect to the norm defined by:
[TABLE]
We define .
2.3 Cumulants and -operators
The reader is referred to [4] or [15] for a detailed introduction to cumulants, Malliavin operators and -operators in particular. The -th cumulant of a random variable exists if the -th moment of exists and is defined as . The operator , defined as , is the infinitesimal generator of the Ornstein-Uhlenbeck semi-group where is the orthogonal projection operator on the -th Wiener chaos. The domain of is . admits a pseudo-inverse and for any , we have . For , the sequence of random variables is recursively defined as follows:
[TABLE]
and . For and , we define: .
2.4 Stable convergence
The concept of stable convergence is used in Section 5. The reader can find an extensive discussion of this topic in [8] or [7], the basic facts are resumed in [11]. Consider a sequence of real random variables on the complete probability space , see Section 2.1. Let be a real random variable defined on some extended probability space . We say that converges stably to , written , as , if:
[TABLE]
for every and every bounded -measurable random variable . Obviously, stable convergence implies convergence in law, whereas the converse does not hold in general. We notice that the -completion of the -field generated by the set is . We have thus the following useful characterisation of stable convergence:
if and only if for every with .
3 Main results
We start with an example in order to motivate the reader.
Example 3.1*.*
Consider sequences for and for and . Suppose that the sequences , and converge in law to a standard normal variable and that , for any distinct sequences and chosen among for and .
We have then, see [23, Theorem 1], as :
[TABLE]
where has a -dimensional standard normal distribution. The continuous mapping theorem yields that, as :
[TABLE]
where . It is easy to see that the expression in Eq. (3.1) has a representation of the form for , , and . We find with Slutsky’s theorem that , as .
Remark 3.2*.*
In the present paper we give necessary and sufficient conditions for weak convergence towards target variables as in Eq. (3.2). We illustrate now why this class of target variables is important.
Consider a random variable living in the sum of the first two Wiener chaoses:
[TABLE]
with and . It is known, see [9, Theorem 6.1] or [15, Proposition 2.7.13], that for an orthonormal system . Suppose from now on that for and for every . Consider the projection of on , then we find , where and . Hence:
[TABLE]
Since , we have that is a set of independent standard normal variables and some of the coefficients may be equal to 0. The representation of found in Eq. (3.4) is thus equivalent to the representation in Eq. (3.2):
[TABLE]
where for and are independent standard normal variables living in the first Wiener chaos. A similar argument applied together with the multiplication formula for Wiener integrals shows that for:
[TABLE]
for a set of orthonormal functions .
If , we set for every and the empty sum in the representations above is removed. Notice that an empty product equals 1. We proceed similarly if . If on the other hand , we suppose that for every . We proceed similarly if .
The following Lemma shows that random variables with a representation as in Eq. (3.5) extend the class of random variables with a representation as in Eq. (1.2) by adding a (possibly correlated) normal variable.
Lemma 3.3**.**
Consider the following families of random variables:
- (A)
, where , and for if and for if . 2. (B)
* where for if and is a centered normal vector such that .*
*Then class (A) coincides with class (B). In other words every random variable in (A) has a representation as in (B) and vice versa. *
Proof.
- (1)
Consider as in (A), then, if :
[TABLE]
Define:
[TABLE]
and drop the corresponding terms if or . After renaming the coefficients, we find the following representation with :
[TABLE]
and is clearly centered and normal since every linear combination is normal. This last property follows directly from , . The definition of yields that . If , then . The equivalence of both representations is trivial in this case. 2. (2)
Consider as in (B). Since the case is clear, we suppose that and . Let for a positive semi-definite matrix . Since , we have:
[TABLE]
We suppose first that then for defined by:
[TABLE]
Consider a -dimensional standard normal vector , then . Hence:
[TABLE]
Noticing that some of the covariances may be zero, Eq. (3.7) yields the representation (A) after renaming the independent standard normal random variables and the coefficients.
Consider now the case , a standard normal vector and define :
[TABLE]
Then and , hence:
[TABLE]
The statement follows now as above.
∎
Remark 3.4*.*
The random variable in (A) may lead to a degenerate normal vector in (B). In particular , leads to and the corresponding normal vector is degenerate. It can be easily deduced from the proof of Lemma 3.3 that is non-degenerate if or . In order to simplify our calculations, we shall consider in this paper target variables of class (A).
We shall need the characteristic function and the cumulants of , defined in Eq. (3.3) and (3.5).
Lemma 3.5**.**
Consider and
[TABLE]
as defined in Eq. (3.3) and (3.5) where . We have with for the characteristic function of :
[TABLE]
where, as usual, an empty product equals 1 and an empty sum equals 0. Moreover is the unique solution of the initial value problem and:
[TABLE]
Proof.
Using the characteristic function of the non-central distribution and the representation:
[TABLE]
we find for the characteristic functions:
[TABLE]
Hence, with the independence of the standard normal random variables:
[TABLE]
Notice that for every real constant , thus equals:
[TABLE]
Multiplying by yields:
[TABLE]
Thus is a solution of the initial value problem. The uniqueness of the solution follows with the Cauchy-Lipschitz theorem since
[TABLE]
is continuous and bounded on every (real) interval.∎
Remark 3.6*.*
Notice that it may be possible to simplify the differential equation if not all coefficients are pairwise different. In Theorem 1.1, 3.8 and 3.11, this simplification may yield a polynomial of smaller degree. For a special case, this problem is discussed in Theorem 4.9 and Remark 4.10. For the rest of this section we shall allow that not all coefficients are pairwise different. In the case of pairwise different coefficients, the differential equation cannot be simplified and the same observation holds for the polynomials in the previously cited theorems.
Lemma 3.7**.**
Consider and
[TABLE]
as defined in Eq. (3.3) and (3.5) where . Then, for :
[TABLE]
Proof.
We have , for and . We notice:
[TABLE]
hence for :
[TABLE]
Using the formula for the cumulants of the non-central distribution, we have for :
[TABLE]
thus:
[TABLE]
The result follows now with the independence of the random variables. ∎
We can now prove the first part of our main result: a sufficient criterion for the convergence in law to .
Theorem 3.8**.**
Consider and
[TABLE]
as defined in Eq. (3.3) and (3.5) where . Suppose that at least one of the parameters is non-zero. Consider a sequence of non-zero random variables with for fixed and for . Define:
[TABLE]
If the following conditions hold, as :
- (1)
, 2. (2)
\displaystyle{\operatorname{\mathbb{E}}\left[\left|\operatorname{\mathbb{E}}\left[\sum_{r=1}^{\textrm{deg}(P)}\frac{P^{(r)}(0)}{r!2^{r-1}}\left(\Gamma_{r-1}(F_{n})-\operatorname{\mathbb{E}}[\Gamma_{r-1}(F_{n})]\right)\Big{|}F_{n}\right]\right|\right]\to 0},
then , as .
Proof.
Notice that an empty product equals 1 and an empty sum equals 0. We prove the result for , the other case can be treated similarly. We shall use and extend an idea of Nourdin and Peccati, see [13, Paragraph 3.5]. Since , we have with Chebychev’s inequality that the sequence is tight. We shall use the following corollary of Prokhorov’s Theorem: Consider a tight sequence of random variables. If every subsequence which converges in law has the same limit , then the initial sequence converges in law to . We consider thus a subsequence which converges in law to some random variable . We notice that , hence . Since lives in a fixed finite sum of Wiener chaoses, the hypercontractivity property implies for every . With , as , we have . Hence is a non-zero random variable and we have for every . On the other hand we have for , thus:
[TABLE]
To simplify the notations and to avoid complicated indices we shall write from now on for the subsequence. By the previous corollary, the proof is complete if we can prove that converges to . We shall prove this by showing that solves the initial value problem of Lemma 3.5. This implies that and hence . The proof is divided in 5 steps:
- •
Step 1: We show that and find an alternative representation for .
- •
Step 2: We calculate:
[TABLE]
and:
[TABLE]
- •
Step 3: We calculate .
- •
Step 4: We find an expression for:
[TABLE]
- •
Step 5: The proof is completed by showing that the expressions found in the last two steps are equal. Then is the unique solution to the initial value problem in Lemma 3.5, and are thus equal in distribution and , as .
For the ease of notation, we define and
Step 1. The random variable is non-zero and has moments of every order. We notice that for , the differential equation of Lemma 3.5 holds for if we can prove . We notice that , hence . On the other hand for every since and by the continuous mapping theorem. We have thus . We suppose now that and calculate for . For :
[TABLE]
and for :
[TABLE]
Iteration yields:
[TABLE]
Step 2. We calculate now the sum in (3.9). We have:
[TABLE]
With Eq. (3.11) we have thus:
[TABLE]
We calculate the sum in (3.10) using and :
[TABLE]
Step 3. We have thus for the limit of the expression on the right-hand side of Eq. (3.13), as :
[TABLE]
We have with , as :
[TABLE]
hence:
[TABLE]
using Eq. (3.12) and Eq. (3.14), we have with for :
[TABLE]
We have used that pointwise. This can be seen using the continuous mapping theorem and . Multiplying Eq. (3.15) by yields:
[TABLE]
Step 4. We have:
[TABLE]
Step 5. We have that if and only if the right-hand side of Eq. (3.17) equals or, using the previous results and Eq. (3.16) in particular, if the following equality holds:
[TABLE]
If , we can divide by and compare the coefficients of on the left- and right-hand side of Eq. (3.18). For this final part of the proof, see Appendix. Considering the previous remarks, this concludes the proof. ∎
Remark 3.9*.*
- (1)
Notice that the proof of Eq. (3.18) for the general case is rather lengthy and technical. This is basically due to the differential equation derived in Lemma 3.5 from which follows Eq. (3.18). For special cases, such as the case considered in [4], the differential equation simplifies considerably and therefore a relatively simple recurrence for the moments of the target variable can be proved. In [4], the authors have used this recurrence to prove their main result. In the general case however, this recurrence is hard to handle, therefore we have chosen to use differential equations rather than recurrence relations.
We illustrate now how the proof of the crucial equation can be simplified for the class of target variables considered in [4]. Notice that for , and with , we have to check the following equation:
[TABLE]
where . We use the following relation which can be proved by induction over :
[TABLE]
where and:
[TABLE]
and , see Definition 6.1 for details. We have thus for the left-hand side of Eq. (3.19):
[TABLE]
and for the right-hand side of Eq. (3.19):
[TABLE]
This proves that Eq. (3.19) holds.
In the general case, the calculation of is lengthy. The following relations are needed and can be proved by induction over , for the ease of notation define :
[TABLE]
and:
[TABLE]
where and are defined similarly to with the coefficients replaced by , see Definition 6.1 for details.
In particular, equations (3.21) and (3.22) imply that the proof of Eq. (3.18) is technical. In Proposition 6.2 we present a proof of the latter equation which does not require Eq. (3.21) and (3.22). The coefficients of the polynomials on both sides of Eq. (3.18) are compared directly. This proof still remains complicated and lengthy. As mentioned above, this is due to the form of the differential equation for the characteristic function of the target variable in the general case. 2. (2)
Theorem 3.8 extends [4, Theorem 3.2,(ii) (i)] since it holds for a more general set of target random variables and we have -convergence instead of -convergence. 3. (3)
We notice that for the proof it is essential that, as :
[TABLE]
Since , the triangle inequality shows that it is sufficient to have:
[TABLE]
as . This -convergence is weaker than -convergence which results typically from the Cauchy-Schwarz inequality, used to control unbounded factors. 4. (4)
Different random variables may lead to the same polynomial . Let be a standard normal variable, and with non-zero, then Theorem 3.8 yields the polynomial . A similar observation holds for [16, Theorem 3.4] where the constant only appears in the limit of the second cumulant. In our case, the condition (1) of Theorem 3.8 discerns both cases. For special cases it may be useful to consider a polynomial which is different from the ‘standard polynomial’ defined in Theorem 3.8. This observation is founded in the initial value problem established in Lemma 3.5. It can be shown that the differential equation in Lemma 3.5 can be simplified if the or the are not pairwise different. For instance, if and , Lemma 3.5 yields a differential equation which can be simplified to yield [13, Eq. (1.9)].
We proceed now to the proof of the converse of Theorem 3.8. We shall need the following Lemma which generalizes [4, Eq. (3.6)].
Lemma 3.10**.**
Let and , see Eq. (3.3), then:
[TABLE]
Proof.
In this proof all the equalities between random variables hold with probability 1. We consider iterated contractions recursively defined as follows for :
[TABLE]
for . We use the representation for given in Eq. (3.3) and Eq. (3.6).
- (1)
We prove by induction over :
[TABLE]
Notice that all iterated contractions on the right hand side of Eq. (3.23) run over functions.
For , we have with the stochastic Fubini theorem and the multiplication formula for multiple Wiener integrals:
[TABLE]
The claim follows since the expectation of every multiple Wiener integral is 0. Suppose now that the claim holds for some , then:
[TABLE]
Hence Eq. (3.23) follows for . 2. (2)
For , we have the following equalities:
[TABLE]
where the last equality holds if exactly one of the functions equals , all remaining functions being equal to . We notice that and and . Hence and, generally:
[TABLE]
To prove Eq. (3.25), we suppose first that and . Then:
[TABLE]
Since , it is now easy to see that:
[TABLE]
If, on the other hand for , we can use Eq. (3.24) to see that
[TABLE]
and we can proceed as above to see that Eq. (3.25) holds. 3. (3)
Considering Eq. (3.23), it is easy to see that
[TABLE]
lives in the sum of the first two Wiener chaoses. We consider the projection of the random variable above on the first respectively on the second Wiener chaos. We have with Eq. (3.23):
[TABLE]
If , we have:
[TABLE]
If , we have , hence Eq. (3.26) holds in both cases and:
[TABLE]
We have for the projection on the second Wiener chaos with Eq. (3.24):
[TABLE] 4. (4)
Since equals , the claim of the Lemma follows now directly.
∎
Theorem 3.11**.**
Consider and
[TABLE]
as defined in Eq.(3.3) and Eq. (3.5) where . Suppose that at least one of the parameters is non-zero. Consider a sequence of non-zero random variables with for fixed and for . Define:
[TABLE]
If , as , then the following limits hold, as :
- (1)
, 2. (2)
\displaystyle{\operatorname{\mathbb{E}}\left[\left|\operatorname{\mathbb{E}}\left[\sum_{r=1}^{\textrm{deg}(P)}\frac{P^{(r)}(0)}{r!2^{r-1}}\left(\Gamma_{r-1}(F_{n})-\operatorname{\mathbb{E}}[\Gamma_{r-1}(F_{n})]\right)\Big{|}F_{n}\right]\right|\right]\to 0}.
Proof.
The proof of this theorem is identical to [4, Theorem 3.2, Proof of (i) (iii) ]. It is enough to replace [4, Lemma 3.1] by Lemma 3.10. ∎
Proof of Theorem 1.1
The main result of this paper is now a direct consequence of Theorem 3.8 and Theorem 3.11.∎
Remark 3.12*.*
- (1)
We notice that, for any sequences of integrable random variables and , we have that implies , as :
[TABLE]
Hence, with the notations of Theorem 1.1, a set of sufficient conditions for , as , is:
- (1’)
, 2. (2’)
,
where . If ,we can use Eq. (2.1) to calculate the expectation in (2’). 2. (2)
For , conditions (1’) and (2’) can be expressed in terms of conditions for contractions. However the resulting conditions are usually complicated as indicates the following example:
Consider even, , and a sequence of functions such that, as :
[TABLE]
Define sets and for every even integer with :
[TABLE]
and:
[TABLE]
Define for every even integer a condition by:
[TABLE]
If conditions hold for every even integer with , we have, as :
[TABLE]
The proof of this result is omitted, another example for such conditions can be found in [4, Theorem 4.1].
4 Applications
We notice that our results about convergence in law of sequences living in a finite sum of Wiener chaoses can be extended to match convergence in total variation, see for instance [15, Appendix C]. Indeed a direct application of our results together with [4, Lemma 3.3] or [17, Theorem 3.1] proves that we can replace the convergence in law of sequences living in a finite sum of Wiener chaoses by convergence in total variation.
4.1 Recovering classical criteria
As a direct consequence of Theorem 1.1, we get the following Corollary 4.1 which extends [4, Theorem 3.2]. We have proved that (2) is necessary and sufficient for convergence in law whereas the authors in the cited reference need -convergence of the conditional expectation to prove , as . As pointed out in Remark 3.9 this results from the Cauchy-Schwarz inequality. Moreover, Corollary 4.1 extends the first part of [6, Proposition 1.7] to more general linear combinations of independent central distributed random variables. As anticipated, if , the polynomial can be simplified.
Corollary 4.1**.**
Consider for and for , see Eq. (3.3) and (3.5). Define . Let be a sequence of non-zero random variables such that each lives in a finite sum of Wiener chaoses, i.e. for and fixed, for . The following two asymptotic relations (1) and (2) are equivalent, as :
- (1)
; 2. (2)
- (a)
, for , 2. (b)
\displaystyle{\operatorname{\mathbb{E}}\left[\left|\operatorname{\mathbb{E}}\left[\sum_{r=1}^{k+1}\frac{P^{(r)}(0)}{r!2^{r-1}}\left(\Gamma_{r-1}(F_{n})-\operatorname{\mathbb{E}}[\Gamma_{r-1}(F_{n})]\right)\Big{|}F_{n}\right]\right|\right]\to 0}.
Proof.
Use Theorem 1.1 with . ∎
We come now to the seminal paper [21] of Nualart and Peccati in which the authors have characterised the convergence in law to a standard normal random variable. Since this first paper, the conditions given in [21] have been extended, see for instance [13]. Taking and , we have with Theorem 1.1 the following characterisation which corresponds to condition cited in Section 1.2:
Corollary 4.2**.**
Consider for and . Let be a sequence of non-zero random variables such that each lives in a finite sum of Wiener chaoses, i.e. for and fixed, for . The following two asymptotic relations (1) and (2) are equivalent, as :
- (1)
, 2. (2)
- (a)
, 2. (b)
\displaystyle{\operatorname{\mathbb{E}}\left[\left|\operatorname{\mathbb{E}}\left[\langle DF_{n},-DL^{-1}F_{n}\rangle_{H}-a^{2}\Big{|}F_{n}\right]\right|\right]\to 0}.
Proof.
The equivalence of (1) and (2) follows directly from Theorem 1.1 with , since:
[TABLE]
If (2) holds, we have clearly . If (1) holds, the latter limit follows from [4, Lemma 3.3]. ∎
Remark 4.3*.*
The equivalence of (1) and (2) in the last corollary can be extended to sequences living in if some assumptions on the boundedness of the -operator is added. Indeed we can prove that (1) implies (2) if . It is unsure whether the equivalence of (1) and (2) holds without any additional assumptions if .
We use now Remark 3.12 to recover more criteria for the convergence in law, see Corollary 4.4. Notice that (1) is [15, Theorem 5.3.1] for the case of a sequence living in a fixed sum of Wiener chaoses, whereas (2) is the sufficient part of the criterion given in [13, Eq. (1.3)] with -convergence replaced by -convergence. Since all -norms inside a fixed sum of Wiener chaoses are equivalent, the criterion given in (2) below is thus necessary and sufficient.
Corollary 4.4**.**
Consider for and . Let be a sequence of non-zero random variables with , as .
- (1)
If for , fixed with for and, as :
[TABLE]
then , as . 2. (2)
If with and, as :
[TABLE]
then , as .
4.2 New applications
For the rest of the section we suppose that is even. Notice that if is odd, we cannot have:
[TABLE]
as for , and . This can be checked using the third cumulant and Eq. (2.1), see [13, Remark 1.3]. More generally, if is odd, we can exclude a large set of possible target random variables by using the fact that all odd-order cumulants are zero, see Remark 4.10 for details.
The following Lemma shall be needed to prove a sufficient criterion based on the convergence of some contractions and cumulants.
Lemma 4.5**.**
Consider , , and . We have for :
[TABLE]
Proof.
The first inequality is a standard result. The first equality follows from [18, Eq. (2.5)]. The next inequality follows from the Cauchy-Schwarz inequality. The last inequalities follow from the following general result:
[TABLE]
which is, again, a consequence of the Cauchy-Schwarz inequality. ∎
Theorem 4.6**.**
Consider and
[TABLE]
as defined in Eq. (3.3) and Eq. (3.5) where . Suppose that at least one of the parameters is non-zero. Consider a sequence of non-zero random variables with for fixed, even, and . Define:
[TABLE]
[TABLE]
As , we have if the following hold:
[TABLE]
Proof.
- (1)
We notice that, for even, condition (4.2) is equivalent to:
[TABLE]
see [13, Proposition 3.1]. If , we have necessarily and the convergence in law of sequences is completely characterised by necessary and sufficient criteria in [16], see Remark 4.7. 2. (2)
We first prove that, except for the contractions for , all the contractions, appearing in the representation of for , converge to zero (in the corresponding Hilbert-space norm). With [4, Proposition 2.1], we have for that equals:
[TABLE]
where is the set of elements such that:
[TABLE]
and is defined recursively, see [4, Proposition 2.1]. For , we prove that, as :
[TABLE]
If , we have , as , since . If and , let and with . We have , since otherwise the definition of yields the following contradictions:
[TABLE]
and:
[TABLE]
Thus, with Lemma 4.5:
[TABLE]
Since and , we have that and . Thus , as , since , Eq. (4.4) is proved. 3. (3)
With Eq. (4.4), we have for , as :
[TABLE]
where we have used the definition of and [4, Proposition 2.1]. For , we have trivially . Thus with , as :
[TABLE]
On the other hand, as :
[TABLE]
The result follows with Eq. (4.5) and (4.6), the reverse triangle inequality, Theorem 1.1 and Remark 3.12.
∎
Remark 4.7*.*
If and , it is known that as implies that has a representation as in Eq. (1.2) with and . In particular, if , and , Theorem 4.6 holds and is the sufficient part of [4, Proposition 3.1]. It is shown in [4] that the conditions of Theorem 4.6 are also necessary for the case . The case , , and is not covered by [4] but it can be shown that the conditions given in Theorem 4.6 are also necessary conditions for this case. This can be proved using [16, Theorem 3.4] and [15, Eq. (2.7.17)].
We give now an example for the use of Theorem 4.6 in the case where the approximating sequence lives in a fixed Wiener chaos. We notice that it is so far unknown whether a sequence living in a fixed chaos can converge to a target variable as in Theorem 4.6 with , see Remark 4.10.
Example 4.8*.*
Consider and sequences of non-zero functions , and such that the sequences , and converge in law to a standard normal variable. We also suppose that , as . We have then, see [23, Theorem 1], as :
[TABLE]
where has a -dimensional standard normal distribution. Using the continuous mapping theorem, [21, Theorem 1] and proceeding as in [13, Proposition 4.1], it is easy to see that, as :
[TABLE]
where . Alternatively the latter convergence in law can be proved using Theorem 4.6. Define:
[TABLE]
We shall need the following limits, as :
- (a)
, 2. (b)
and , 3. (c)
, 4. (d)
and , 5. (e)
for , 6. (f)
for and .
These statements (a)-(f). can be proved using [21, Theorem 1] and [13, Theorem 1.2] We check the conditions of Theorem 4.6.
- (1)
We prove that . The convergence of the cumulants of order 2 and 3 can be seen similarly using (a)-(f) and [13, Eq. (3.4)]. We use and [13, Eq. (3.6)]:
[TABLE]
The fifth equality follows from [13, Theorem 1.2.(iv)]. For the last equality we have used that, for independent random variables, the cumulant of the sum equals the sum of the cumulants and for every . We have thus proved Eq. (4.1). Notice that Eq. (4.2) holds because of (f). We have and:
[TABLE]
We check now Eq. (4.3):
[TABLE]
as . Theorem (4.6) yields now , as .
We consider now the convergence in law to random variable with a centered law and compare the new criterion of Theorem 4.6 with the main result of [13]. We shall see that in this case, both criteria are equivalent.
Theorem 4.9**.**
Consider , and as defined in Eq. (3.3) and Eq. (3.5), where . Consider a sequence of non-zero random variables with for even fixed and . Define and suppose that , as . The following conditions a., b. and c. are equivalent, as :
- a.
, 2. b.
, 2. 2)
** 3. c.
, 2. 2)
** 3. 3)
**
Proof.
The equivalence of a. and b. is proved in [13]. We prove the equivalence of b. and c. for since b. and c. are clearly equivalent if .
Suppose that b. holds, than a. holds as well and together with the hypercontractivity property yields that for every , thus for every . Hence c.3) holds. We have with :
[TABLE]
where we have used that . We have for , as :
[TABLE]
hence c.2) follows with the triangle inequality. Suppose now that c. holds. We have to prove that , as , or equivalently:
[TABLE]
We have used in the last step that:
[TABLE]
for all integers with and . This can be checked directly using the integral representation of the contractions.
- •
If , c.2) yields that, as :
[TABLE]
hence, since , as :
[TABLE]
The linearity of the scalar product yields that relation (4.8) holds.
- •
If , the calculations made in the proof of Theorem 4.6, together with [15, Theorem 8.4.4] and c.3) show that:
[TABLE]
for . Thus:
[TABLE]
This completes the proof. ∎
Remark 4.10*.*
- (1)
The equivalence of a. and b. above is the main result of [13, Theorem 1.2]. Theorem 4.9 shows that, although the polynomials defined throughout this paper may not always be of minimal degree if some of the coefficients are equal, the criterion of Theorem 4.6 is necessary and sufficient in some situations. It is yet unknown if the conditions of Theorem 4.6 are always necessary and sufficient. 2. (2)
Notice that the problem of characterising possible target variables amongst all random variables with a representation as in Eq. (3.5) is far from being solved if the approximating sequence lives in a fixed Wiener chaos. Indeed further research on this topic is needed in order to make a comprehensive statement, but it seems doubtful that with is a possible target for a sequence living in a chaos of fixed order. For every sequence living in a Wiener chaos of odd order, all moments of odd order vanish which reduces the class of possible target variables with considerably. The following criterion allows to exclude such target variables by just considering the coefficients and . Suppose without loss of generality that the coefficients satisfy the following conditions:
- •
,
- •
,
- •
the coefficients are sorted in increasing order of their absolute values and:
[TABLE]
where .
Then , as , for odd, implies that:
- (i)
is even, 2. (ii)
is even for every and, more precisely:
[TABLE] 3. (iii)
we have for every :
[TABLE]
An analogue version holds for target variables in class (B) of Lemma 3.3.
5 Stable convergence
In this section we consider sequences of non-zero random variables living in a finite sum of Wiener chaoses. The sequences are supposed to converge in law to a non-zero target variable and we ask whether the sequence also converges stably. Our first result follows from [12, Theorem 1.3]. As before, we shall write for the characteristic function of a random variable .
Theorem 5.1**.**
Consider and the random variable where . Assume that and, as :
[TABLE]
If , as , then:
[TABLE]
or, equivalently, for every -measurable random variable :
[TABLE]
where is introduced in Section 2.1, and is independent of the underlying Brownian motion.
Proof.
Consider with . We have to prove that, as :
[TABLE]
see Section 2.4, where is independent of . Since is a non-zero random variable, we have for every . Define for every , then , as , where . We have and with Eq. (5.1), as :
[TABLE]
[12, Theorem 1.3] yields with , as :
[TABLE]
We have with for every :
[TABLE]
as . Hence:
[TABLE]
and with :
[TABLE]
Since is the characteristic function of where is independent of , we have that Eq. (5.3), or equivalently Eq. (5.2) holds. Since with is arbitrary, the statement follows with the remarks of Section 2.4. ∎
Remark 5.2*.*
The proof of the previous theorem was straightforward since the converging sequence of random variables lives in a fixed Wiener chaos. Under these assumptions, [12, Theorem 1.3] yields the desired stable convergence. If the sequence of random variables is allowed to live in a finite sum of Wiener chaoses or if assumption (5.1) does not hold, the conditions ensuring stable convergence involve -operators.
For the next results, the target variables are (again) supposed to have the form:
[TABLE]
where are independent standard normal variables and for , as well as for . We suppose that at least one of the parameters is positive. We shall use the convention .
Theorem 5.3**.**
Consider , and as defined in Eq. (5.4). Suppose that for and:
[TABLE]
Define and suppose that, as :
[TABLE]
If the following two conditions hold, as , for every with and :
[TABLE]
then , as , and is independent of the underlying Brownian motion.
Proof.
Theorem 3.12, Eq. (5.5) and Eq. (5.6) imply that , as . Define:
[TABLE]
The obvious dependence of is dropped in the first equalities. The proof is divided in three steps:
- •
we derive two equations involving derivatives of ,
- •
we prove that the sequence is tight and that we have , as , where is independent of ,
- •
we conclude that , as , and is independent of the underlying Brownian motion.
- (1)
Consider . Then for :
[TABLE]
We have used the integration by parts rule and for every . Repeating this first calculations once again if , we find:
[TABLE]
and iteration yields finally for :
[TABLE]
With , we find:
[TABLE]
Hence, for all :
[TABLE]
With , we find for :
[TABLE] 2. (2)
We prove that the sequence is tight. We have with the Markov inequality, for :
[TABLE]
Consider a subsequence which converges in law to a random vector . If we have that is the same for every converging subsequence and , where and are independent, then we have that converges in law to the same limit. We have that , as . Since we have Eq. (5.6) and Eq. (5.8), we have for and with Eq. (5.9):
[TABLE]
Notice that, as , we have by the continuous mapping theorem and , as , since Eq. (5.5) holds. We have:
[TABLE]
hence:
[TABLE]
To see this, apply Eq. (5.8) with . We find similarly . Multiplying Eq. (5.11) by , we find the following equation for :
[TABLE]
with and . From Eq. (5.10), we find with replaced by and , for :
[TABLE]
We have used that condition (5.7) implies that converges to 0 in Eq. (5.10). Since , the differential equation (5.13) holds for every . We have thus a system of partial differential equations, given by Eq. (5.12) and Eq. (5.13), with the conditions and . We notice that the calculations in the proof of Theorem 3.8, in particular Step 1, Eq. (3.12) and Eq. (3.13) show that the function satisfies Eq. (5.12) and we have as well as . For a standard normal random variable , the function satisfies Eq. (5.13) and we have as well as . A solution of the system is given by the function . Suppose that is another solution of the system. Define . Notice that for . For , Eq. (5.12) yields an expression of the form , where is a function which depends only on . Since Eq. (3.12) and Eq. (3.13) hold, we have with the same function the representation . Hence:
[TABLE]
We find since . A similar calculation shows that , hence on . We conclude that is constant and since , we have that:
[TABLE] 3. (3)
We have finally that every subsequence which converges in law, has the same limit with independent of . Since the -completion of the -field generated by is the -field of the Brownian motion, an application of [11, Lemma 2.3.] concludes the proof, see Section 2.4.
∎
The following Corollary 5.4 is a special case of the implication in [12, Theorem 1.3].
Corollary 5.4**.**
*Consider , and as defined in Eq. (5.4). Suppose that , define and suppose that, as : *
[TABLE]
If the following condition holds, as , for every with :
[TABLE]
then , as , and is independent of the underlying Brownian motion.
Proof.
We prove that Eq. (5.7) and Eq. (5.8) hold, Theorem 5.3 yields then the statement.
- (1)
We have, as :
[TABLE]
We have used the stochastic Fubini theorem for multiple Wiener integrals, and Eq. (5.7) holds since . 2. (2)
To prove that Eq. (5.8) holds, we notice that has a representation as a finite linear combination of random variables of the following form with :
[TABLE]
see [4, Proposition 2.1] for details and the set containing in particular. We can represent as finite linear combination of terms having the following form:
[TABLE]
- •
Let , then we can represent
[TABLE]
as finite linear combination of integrals of the following form:
[TABLE]
where is a summation index, and represent collections of variables such that:
- –
contains elements and every element is in exactly two of the (non-empty) sets ,
- –
,
- –
.
We have then with and [18, Lemma 2.3], as :
[TABLE]
- •
Let , then we can represent
[TABLE]
as linear combination of integrals as in Eq. (5.16) and all but one set is empty. Assume without loss of generality that is the non-empty set, containing the integration variable, say . Hence, with [18, Lemma 2.3], as :
[TABLE]
Combining these results, we find with that:
[TABLE]
converges to 0, as , hence:
[TABLE]
since can be represented as linear combination of integrals as in Eq. (5.15). Eq. (5.8) follows since .
∎
Remark 5.5*.*
Eq. (5.14) holds if , as . This follows directly from Lemma 4.5.
We have the following converse of Theorem 5.3.
Theorem 5.6**.**
With the notations of Theorem 5.3, consider , and as defined in Eq. (5.4). Suppose that for , and:
[TABLE]
If condition (5.6) holds and , as , where is independent of the underlying Brownian motion, then for every with :
- (1)
Eq. (5.7) and Eq. (5.8) hold, 2. (2)
.
Proof.
- (1)
Consider an arbitrary element with . The stable convergence and the independence property imply that , as , where is independent of . Hence:
[TABLE]
and Eq. (5.9) together with Eq. (3.11) implies that Eq. (5.8) holds for every . With Eq. (5.10), we have that Eq (5.7) holds for every . To see that Eq. (5.7) holds for , calculate the derivative with respect to :
[TABLE]
hence:
[TABLE]
By the continuous mapping theorem, we have:
[TABLE]
as , and is independent of . Since , we have:
[TABLE]
thus, as :
[TABLE]
We prove that Eq. (5.7) holds for :
[TABLE]
as .We have used Eq. (2.4) in the last step, the convergence follows as above and Eq. (5.7) holds for . In the case , we find with the independence property and Eq. (2.3) that Eq. (5.7) holds.
We see similarly that:
[TABLE]
On the other hand, Eq. (5.8) yields for the following condition:
[TABLE]
as . Since , the convergence in Eq. (5.18) follows clearly from Eq. (5.17). We conclude that Eq. (5.7) and (5.8) hold for every . 2. (2)
Consider an arbitrary element with . Since , as , where is independent of , we have that , as , by the continuous mapping theorem, hence , as . We have that:
[TABLE]
this follows from the hypercontractivity property and the Cauchy-Schwarz inequality. Hence:
[TABLE]
since is independent of . With Eq. (5.20):
[TABLE]
and with the stochastic Fubini theorem for multiple Wiener integrals:
[TABLE]
Hence with Eq. (5.21):
[TABLE]
The last equality can be checked directly using the definition of contractions.
∎
Corollary 5.7**.**
Let the notations and assumptions of Theorem 5.6 prevail and suppose that , as , where is independent of the underlying Brownian motion. Consider arbitrary.
If , then we have . 2. 2.
If , for every , then we have , for every . 3. 3.
If , then we have .
We can recover [13, Proposition 4.2. and Remark 4.3.].
Proposition 5.8**.**
Consider even and a sequence such that , as , where is a standard normal variable. Then , as , and is independent of the underlying Brownian motion.
Proof.
[13, Theorem 1.2.] implies with , as :
[TABLE]
Moreover the convergence in law implies that , as . Notice that in condition (5.8) in Theorem 5.3 we must have and condition (5.8) is then satisfied if condition (5.7) holds. We check now condition (5.7).
[TABLE]
as . ∎
6 Appendix
Definition 6.1**.**
- (1)
Consider . If , we suppose that for every . We set:
[TABLE]
and for :
[TABLE]
If , we set for every , and for all other values of and . 2. (2)
Consider . If , we suppose that for every . We set:
[TABLE]
and for :
[TABLE]
If , we set for every , and for all other values of and .
Proposition 6.2**.**
Proof of Eq. (3.18).
Proof.
We prove that Eq. (3.18) holds for . Suppose that and divide Eq. (3.18) by :
[TABLE]
We determine an alternative representation for and calculate . We have with
[TABLE]
If for instance , we have and the formula above holds also for the cases , and . Hence:
[TABLE]
We compare now the terms in , on the left-hand side of Eq. (6.1) we have:
[TABLE]
and for the right-hand side of Eq. (6.1):
[TABLE]
the desired equality for the terms in follows. The term in on the left-hand side of Eq. (6.1) is , and on the right-hand side of Eq. (6.1) we have:
[TABLE]
We have for the term in and on the left-hand side of Eq. (6.1):
[TABLE]
We use the relations and if , and set . We consider the powers of in Eq. (6.2) and suppose that for the next calculation.
[TABLE]
hence:
[TABLE]
Notice that, with our settings, the previous equality holds also if or We consider now the powers of in Eq. (6.2) and suppose that for the next calculation.
[TABLE]
Hence the expression in Eq. (6.3) equals:
[TABLE]
The resulting equality holds also if or . In the latter case, we have and an empty sum in (6.3) equals 0. For the terms of the form in Eq. (6.2), we can make a similar calculation. For the calculation below, we suppose that .
[TABLE]
The resulting equality holds also if or . We have finally for the term in and on the left-hand side of Eq. (6.2):
[TABLE]
Consider now the term in for on the right-hand side of Eq. (6.1). Define:
[TABLE]
is thus the projection of a series (or a polynomial) on its term of degree . The terms in for on the right-hand side of Eq. (6.1) are given by:
[TABLE]
We calculate now the projections appearing in the expression above.
[TABLE]
Notice that these equalities hold if and . The following equalities can be derived as above:
[TABLE]
We have thus for expression (6.5):
[TABLE]
This equality holds (again) for and . Comparing Eq. (6.4) and Eq. (6.6), we find the desired equality of the terms in on the left-hand and the right-hand side of Eq. (6.1).∎
Acknowledgements
I would like to thank two anonymous referees for their comments and remarks, as well as Prof. Dr. G. Peccati and Prof. Dr. A. Thalmaier for their time and many interesting discussions and suggestions.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Benjamin Arras, Ehsan Azmoodeh, Guillaume Poly, and Yvik Swan. Stein’s method on the second Wiener chaos : 2-Wasserstein distance. Ar Xiv e-prints , January 2016.
- 2[2] Benjamin Arras, Ehsan Azmoodeh, Guillaume Poly, and Yvik Swan. A bound on the 2-Wasserstein distance between linear combinations of independent random variables. Ar Xiv e-prints , April 2017.
- 3[3] Benjamin Arras, Guillaume Mijoule, Guillaume Poly, and Yvik Swan. A new approach to the Stein-Tikhomirov method: with applications to the second Wiener chaos and Dickman convergence. Ar Xiv e-prints , May 2016.
- 4[4] Ehsan Azmoodeh, Giovanni Peccati, and Guillaume Poly. Convergence towards linear combinations of chi-squared random variables: a Malliavin-based approach. In In memoriam Marc Yor—Séminaire de Probabilités XLVII , volume 2137 of Lecture Notes in Math. , pages 339–367. Springer, Cham, 2015.
- 5[5] Giulia Di Nunno, Bernt Øksendal, and Frank Proske. Malliavin calculus for Lévy processes with applications to finance . Universitext. Springer-Verlag, Berlin, 2009.
- 6[6] Christian Döbler and Giovanni Peccati. The Gamma Stein equation and non-central de Jong theorems. Ar Xiv e-prints , December 2016.
- 7[7] Erich Häusler and Harald Luschgy. Stable convergence and stable limit theorems , volume 74 of Probability Theory and Stochastic Modelling . Springer, Cham, 2015.
- 8[8] Jean Jacod and Albert N. Shiryaev. Limit theorems for stochastic processes , volume 288 of Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences] . Springer-Verlag, Berlin, second edition, 2003.
