On statistics of bi-orthogonal eigenvectors in real and complex Ginibre ensembles: combining partial Schur decomposition with supersymmetry
Yan V Fyodorov
Introduction
Let be a component column vector, real or complex. We will use to denote the corresponding transposed row vector ( and similar notation for matrices), and for the Hermitian conjugate, with bar standing for complex conjugation. The inner product of two such vectors will be denoted as .
Let be a matrix which we assume to be non-selfadjoint and not normal : . We will further assume that all eigenvalues of this matrix, which are in general complex numbers, have multiplicity one. Then the matrix is diagonalizable by a similarity transformation: where and is in general non-unitary: . The associated right eigenvectors defined by are columns of the matrix , whereas their left counterparts satisfying form the rows of , and generically . The sets and of left and right eigenvectors can always be chosen to satisfy the bi-orthonormality condition for , but non-unitarity of implies that and similarly . Then the simplest informative object characterizing the eigenvector non-orthogonality is the so-called ’overlap matrix’ . In particular, the real diagonal entries are known in the literature on numerical analysis as eigenvalue condition numbers and characterize sensitivity of eigenvalues to perturbation of entries of , see e.g. . Namely, consider a family of matrices , with being an arbitrary matrix whose norm is fixed as , whereas is a real parameter controlling the magnitude of the perturbation. Denote, for a given , the eigenvalues of as and consider . A standard calculation using bi-orthonormality shows that and therefore showing indeed that controls the speed of change of eigenvalues under perturbation. As for some classes of non-normal matrices , their eigenvalues could be much more sensitive to perturbations in comparison with their normal counterparts.
If the matrix is random, it makes sense to be interested in statistics of . This line of research originated from the influential papers by Chalker and Mehlig who were the first to evaluate asymptotically, for large , the lowest moments of the form
where stands for the appropriate Dirac delta-distribution (so that e.g. the empirical density of eigenvalues at a (in general, complex) point is given by ). The brackets denote here the expectation with respect to the probability measure on known as the complex Ginibre ensemble, which we denote in this paper as to reflect that ensembles with complex entries are usually characterized by the Dyson index , see below. The probability measure on with real entries known as the real Ginibre ensemble will be denoted correspondingly with .
For Chalker and Mehlig were able to extract the leading asymptotic behaviour of and in the limit. In particular, they found that inside the’ Ginibre circle’ characterized by the asymptotic mean eigenvalue density for and zero otherwise. This suggests that typically one should expect for eigenvalues inside the circle, which is parametrically larger than typical for normal matrices.
In the last decades there was steady growth of interest in understanding properties of non-orthogonal random eigenvectors in theoretical physics, see , with emphasis on calculating the Chalker-Mehlig correlators (1.1) and related objects beyond the framework of the complex Ginibre ensemble. One motivation comes from the abovementioned relevance of eigenvector correlations for describing the motion of complex eigenvalues under perturbations of the ensemble, see e.g. , and associated Dysonian dynamics, see e.g. and Appendix A of . Note that the non-orthogonality factors reflect non-normality of the matrix, which in the context of dynamical systems is known to give rise to a long transient behaviour, see a general discussion in . In a related setting non-symmetric matrices appear very naturally via linearization around an equilibrium in a complicated nonlinear dynamical system , and the non-orthogonality factors then control transients in a relaxation towards equilibrium . Non-orthogonality also plays some role in analysis of spectral outliers in non-selfadjoint matrices, see e.g. and references therein. Another strong motivation comes from the field of quantum chaotic scattering, where non-selfadjoint random matrices of special type (different from the Ginibre ensembles) play a prominent role, see e.g. for the background information. The corresponding non-orthogonality overlap matrix shows up in various scattering observables, such as e.g. decay laws , ’Petermann factors’ describing excess noise in open laser resonators , as well as in sensitivity of the resonance widths to small perturbations . Unfortunately, main progress in understanding properties of the bi-orthogonal eigenvectors for such ensembles relied on treating non-Hermiticity perturbatively in a small parameter, whereas non-perturbative results are scarce .
In the Mathematics community a systematic rigorous research in this direction seems to have started only recently . In a very recent development Bourgade and Dubach demonstrated a possibility to find the law of the random variable for the complex Ginibre ensemble, asymptotically for large , and provided a valuable information about the off-diagonal correlations between the two different eigenvectors at various scales of eigenvalue separation (the so-called ’microscopic’ vs. ’mesoscopic’ scales). That work motivated the present paper, where we use a rather different approach to consider the following object
Naturally, the JPD function can be defined for a general random matrix and, in particular, may be used to quantify the statistics of eigenvalue sensitivity parameters for such matrices. To give an example, consider again the family of matrices , but choose the perturbation to be a random matrix independent of . For simplicity one may take to be proportional to a random complex Ginibre matrix, and normalized in such a way that its entries are i.i.d. mean zero complex numbers with the variance . Then the eigenvalue sensitivity to such a perturbation is given by and for a fixed becomes a complex Gaussian variable with mean zero and variance . Define now the probability density of the eigenvalue sensitivity at a point of the complex plane via where the ensemble averaging goes both over and over . Since the complex Gaussian variable has the density with respect to the Lebesgue measure and recalling we immediately see that
relating the statistics of the eigenvalue sensitivity in that case to the knowledge of .
In this paper we concentrate on finding explicit expressions for for Ginibre matrices, both real and complex. We first consider in Section 3 the case of real Ginibre matrices with . To this end it is useful to recall that real-valued matrices may have either purely real eigenvalues or pairs of complex conjugate eigenvalues. As the result, for real Ginibre ensemble necessarily has the form , where the non-singular part describes the mean density of complex eigenvalues, whereas describes the mean density of purely real eigenvalues, so that stands for the mean number of real eigenvalues in an interval of the real axis. As a consequence, the introduced JPD inherits the same structure .
The organization of the paper is as follows. A summary of the main results and discussion of possible directions for the future work is presented in the Section 2. We start our consideration with demonstrating in Section 3 a way to evaluate , which describes non-orthogonality factor for eigenvectors associated with a real eigenvalue of the real Ginibre ensemble. First, we reduce the problem of finding to a problem of evaluating certain ratios of determinants of random real-symmetric matrices with block structure, which as one may eventually see are intimately related to a deformed version of the so-called real chiral ensemble. Technical calculations within a framework of the supersymmetry approach which proves to be an efficient technical tool for dealing with such ratios of determinants are presented in Section 3.3. Our approach yields exact and explicit formula for any size , which is then amenable to extracting the appropriate ’bulk’ and ’edge’ scaling limits as . The problem of evaluating for real Ginibre matrices remains presently outstanding, and we hope to be able to address it in a future publication.
In the next Section 4 we apply essentially the same method for evaluating in the complex Ginibre ensemble , i.e. . The computations and results become somewhat more technically involved, and considerably simplify only for the special case . General case is treated again by the supersymmetry approach outlined in Section 4.4. Eventually, we present an explicit finite- expression for any , and then extract the corresponding ’bulk’ and ’edge’ scaling limits.
Acknowledgements. The author is most grateful to Paul Bourgade and Guillaume Dubach for generously communicating their unpublished results at an early stage which stimulated his own research on the topic. Ramis Movassagh is acknowledged for an interesting discussion and bringing reference to the author’s attention, Gernot Akemann for pointing out and Peter Forrester for mentioning . Jacek Grela and Eugene Strahov are acknowledged for their collaboration on the associated analysis of Eq.(2.30) using different methods . The present paper was started when preparing a lecture course for PCMI Summer School 2017, and essentially completed during the Beg Rohu Summer School 2017. The author would like to thank the organizers and participants of the schools for creating a stimulating atmosphere, and for the financial support of his participation in the events, in particular from the NSF grant DMS:1441467. The research at King’s College London was supported by EPSRC grant EP/N009436/1 ”The many faces of random characteristic polynomials”.
Discussion of the main results
Note that the left and right eigenvectors of real-valued matrices corresponding to real eigenvalues can be chosen real as well. Hence we may write instead of .
In what follows we will frequently omit the index in eigenvectors to lighten the notations, simply writing or .
The above expression is a generalization of the exact mean density of purely real eigenvalues for real Ginibre matrices of size explicit expression for which is known due to Edelman, Kostlan and Schub , see also :
and then introducing as the integration variable, cf. (3.31) below.
Being exact, the expression (2.2) can be further analyzed in interesting scaling limits as . In fact, we find the form (2.5) most suitable for such an analysis. In particular, by rescaling (which is standard to call the bulk scaling limit), then considering as fixed when and exploiting the appropriate asymptotic behaviour of the incomplete -function:
one easily finds that where
and otherwise, in full agreement with being the limiting mean density of real eigenvalues within the bulk of the spectrum of the real Ginibre ensemble, which is known to be uniform inside its support.
Another natural edge scaling limit arises in the vicinity of the edge of the support of limiting spectral measure for real eigenvalues, that is for , with being fixed. It is easy to understand that the variable needs to be rescaled in this regime as , keeping fixed. A straightforward calculation using the well-known asymptotics
then yields where
In particular, integrating the above over gives
where . This expression is in full agreement with one for the limiting mean density of real eigenvalues at the edge of the spectrum of the real Ginibre ensemble, see .
2 Complex Ginibre ensemble
For the case of complex Ginibre ensemble the corresponding joint probability density of the non-orthogonality variable and the associated complex eigenvalue can be found in explicit form for finite as well, but turns out to be given by a much more cumbersome expression in comparison with the real Ginibre case.
Let be a complex eigenvalue of . Then the joint probability density of the self-overlap non-orthogonality variable and the associated complex eigenvalue for is given by
where and are defined as
and , are functions of explicitly defined via the relations to the incomplete function as
Note that and depend only on but not on the variable .
The expression (2.13) is a generalization of the well-known mean density of eigenvalues of the complex Ginibre ensemble, see e.g. :
The joint density at fixed decays at large arguments as as was already anticipated by Mehlig and Chalker on the basis of example and informal eigenvalue repulsion arguments . In contrast to the real Ginibre case such density does have the finite first moment. Only for the special value the above joint density significantly simplifies and is given by
Despite the relative complexity of (2.13), its bulk rescaling limit , with being fixed when , can be straightforwardly extracted. To this end, it is convenient to use the following integral representations for and (following from combining (2.16) and (2.17) with (2.4) and appropriate rescaling):
which for large are easily amenable to the standard asymptotic analysis by the Laplace method. In this way we find in the ’bulk’ scaling limit for the following independent asymptotic behaviour:
where means . This implies and then via (2.14) and (2.15) we further find
We then see that in the ’bulk’ limit the first term in the brackets of (2.13) is dominant in comparison with the other two, and taking the limit one finds
and zero otherwise. This expression agrees with results obtained by P. Bourgade and G. Dubach in a different approach to the problem. Its first moment is precisely inside the bulk of the spectrum, in agreement with the expression by Chalker and Mehlig.
Finally, one also can extract the corresponding edge asymptotics by replacing and and performing the limit . With a help of the Mathematica packageThe author is grateful to J. Grela for his help with utilizing Wolfram Mathematica for that purpose. one then finds that
and we denoted . In particular, one can check that integrating over yields a well-known formula for the mean edge density of complex eigenvalues:
One also can see that the ’bulk’(2.24) and ’edge’ (2.25) asymptotics match by replacing in the latter and and letting for fixed and , checking that
3 Discussion of the method and open problems.
Our approach consists of two steps. In the first step we show that the partial Schur decomposition of Ginibre matrices employed in works and allows one to represent the JPD’s and , Laplace-transformed with respect to the variable , in terms of the following object:
where is an integer, , the parameter stands for the complex Ginibre ensemble and for the real Ginibre one (in the latter case is real), and standing for the identity matrix. In fact, the goals of the present paper require evaluation of (2.26) only for , but it is interesting to consider a more general problem, see below.
Note that for we deal here with expectation values involving integer powers of characteristic polynomials for non-selfadjoint matrices in both numerator and denominator. Studying similar objects for self-adjoint random matrices has a long history, see e.g. for a background discussion and further references. At the same time, for a half-integer power in the denominator is involved. To deal with the latter challenge we employ one of very few techniques available in that case, the so-called supersymmetry approach, see for concise introductions and also for earlier computations involving half-integer powers of characteristic polynomials for real symmetric Gaussian random matrices. We find it convenient to use a (rigorous) variant of the approach proposed originally in and the final expression for is given in (3.11) or (3.27). As a by-product of the same calculation one also finds for :
The same procedure works, with due modifications, for the complex case , with the computational challenge now coming not from the half-integer power in the denominator, but from the higher integer power of the determinant in the numerator. The actual calculation is very straighforward for , becomes slightly more involved for , and for the case of actual interest produces much more cumbersome expressions, see Sec. 4.1.2 for the derivation. In the end we have to resort to symbolic computer manipulations to deal with the ensuing integrals. Here we simply quote the results for and for the sake of completeness:
and In fact the case was considered by a different variant of the supersymmetry approach in , though the result was not presented in the form 2.29.
In particular, by a direct integration one can check that , in agreement with the definition (2.26).
Given the complexity of arising expressions for , it is worth to give a different perspective on the problem. To that end we note that by introducing the matrices our main object for case, namely , can be formally rewritten as
with integration going over complex matrices with the weight function depending on an integer parameter , and on the complex parameter :
The right-hand side of (2.30) can be obviously interpreted as the mean inverse characteristic polynomial of the matrix averaged over this ’ensemble’ Formally the weight defined in (2.31) is not a probability measure for any as it is not normalized to unity, but we disregard such difference for our goals. closely related (though not identical for ) to a limiting case of versions of the chiral ensemble with a ’source’ considered in and . Namely, let us consider a more general version of (2.31):
where the ’source’ matrix is a fixed complex matrix with the singular values (i.e. eigenvalues of ) being (in general, distinct) non-negative real numbers . Obviously our previous choice corresponded to all equal to . Note that the point correlation functions of eigenvalue densities for such type of a chiral ensemble (with a Hermitean source ) were derived in , but their knowledge is not sufficient for our purposes. Some information for the mean inverse characteristic polynomial for the chiral ensemble with a ’source’ similar to (2.32) was given in the framework of the method of multiple orthogonal polynomials in . In a separate paper we are providing the full analysis of the problem for for any integer positive and by deriving the following representation (see Proposition 3.9 in ):
where we defined the following function of and :
where are Laguerre polynomials. The equivalence with (2.28) - (2.29) for can be straightforwardly verified (see the Appendix A of ). One can further perform the asymptotic analysis of (2.33) - (2.34) for and extract the bulk scaling asymptotics relevant for the present paper in a more transparent and systematic way than is provided by the supersymmetry approach in case. Nevertheless, supersymmetric treatment has its own merits: the method is robust and is expected to be generalizable to more general ensembles of non-selfadjoint random matrices lacking the full invariance of the Ginibre ensembles.
The approach suggested in the present paper can be certainly adjusted for addressing overlaps of left/right eigenvectors corresponding to complex eigenvalues of real Ginibre ensemble, although in this way one encounters a few challenging technical problem not yet fully resolved. One can also envisage extensions addressing overlaps of two different eigenvectors, as well as posing similar questions for other types of non-Hermitian matrices, including those with quaternion structure for , those relevant in the theory of chaotic scattering and those relevant in the Quantum Chromodynamics context. We hope to be able to answer some of these questions in future publications.
Proof of Theorem 2.1
Let be a real eigenvalue of a matrix with real entries, and denote the associated real left and right eigenvectors as and . Then, as is well-known, see e.g. , it is always possible to represent the matrix as
2 Partial Schur decomposition of the Real Ginibre Ensemble and overlap statistics.
In this section we show how to reduce the calculation of the Laplace transform of the JPD defined in (1.2) to evaluating the ensemble average for the ratio of certain determinants, see (3.8-3.9).
In a similar way one defines the complex Ginibre ensemble
as well as the so-called quaternion ensemble which is however not considered in the present work.
Assigning the Dyson’s index In the literature one frequently uses the notation emphasizing an orthogonal symmetry of the distribution, and correspondingly and for complex and quaternion real versions of Ginibre ensemble with and , correspondingly. one can write for all three ensembles the Joint Probability Density (JPD) with respect to the flat Lebesgue measure in the form
where stands for the Hermitian conjugation, and the bar for the complex conjugation. In this section we will concentrate in detail on the real case ; similar treatment of case will be briefly described in the last section.
with some normalization constant .
The above j.p.d. can be used to calculate the Laplace transform of the probability density for our main object of interest, the random variable which for a given value of is given by (3.3), or equivalently the characteristic function
As the integral over w is Gaussian and it can be readily performed yielding the factor
where we have used . Combining all the factors we finally see that the characteristic function in question is proportional to the ensemble average of the ratio of determinants, cf. (2.26) for , which we also may present in an equivalent, but different form convenient for further evaluation:
where as will be found below (see the Corollary 3.4) and
Here the ensemble average is performed over the j.p.d. (3.4) of real Ginibre matrices of the reduced size . The problem of averaging the ratio of determinants in the above expression can be efficiently solved in the framework of the supersymmetry approach. The main steps of the corresponding procedure are presented in the following section. Interestingly, when implementing such an approach inverting the Laplace transform comes as a part of the procedure. In this way one recovers first (2.5) which by straightforward algebraic manipulations can be shown to be equivalent to (2.2).
3 Supersymmetry approach to the ratio of determinants and proof of Theorem 2.1
In this section we evaluate that ensemble average for real Ginibre matrices of size , with the main object of interest being
with the constant .
Proof of the Theorem 2.1. The Prop. 3.3 when combined with (3.8) immediately provides the proof of (2.5), hence of the Theorem 2.1. Namely, to arrive at (2.5) one replaces in (3.11), and substitutes it into (3.8). Noting that the result assumes the form of a Laplace transform in variable makes its inversion trivial, and we recover the JPD of the random variables and the real eigenvalue as is given in (2.5). Proof of the Proposition 3.3:
Let be four column vectors with anticommuting components each. Using the standard rules of Berezin integration one represents the numerator in the ratio (3.10) as a Gaussian integral
Now we further use a form of the standard Gaussian integral well-defined for any real-symmetric matrix and any positive :
where the integration goes over the vector with real commuting components. This allows to represent the denominator in (3.10) as a Gaussian integral over two such vectors :
where here and below stands for (temporaly) ignored multiplicative constants (in general, dependent) whose product will be restored in the very end of the procedure. After substituting the above representations to (3.10) and rearranging in the exponent as
etc, where stands for the matrix with entries , one can easily perform the averaging over the real Ginibre matrices by using the identity
After the ensemble average is performed, there exists only one term in the exponential in the integrand which is quartic in anticommuting variables, and it is of the form . The corresponding exponential factor is then represented as:
where the formula above represents the simplest instance of what is generally known as the Hubbard-Stratonovich transformation. After such a representation is employed, it allows to perform the (by now, Gaussian) integration over the anticommuting vectors explicitly, and reduce the whole expression to the integral over the two vectors and over a single complex variable :
A straightforward calculation shows that the determinant in the above expression is equal to
and we see that the integration over is now easy to perform via using the polar coordinates:
As to the remaining integrations, one may notice that the integrand depends only on the entries of a positive semidefinite real symmetric matrix
A useful trick suggested in in such a situation is to pass from the pair of vectors to the matrix as a new integration variable. Such change is non-singular for and incurs a Jacobian factor proportional to (see the Appendix D of ). This finally brings to the form
The next step requires employing a convenient parametrization of the integration domain defined via the inequalities and which ensure that is a real symmetric positive semidefinite matrix. First, it is easy to see that such domain can be parametrized by expressing the diagonal entries and in terms of two real coordinates chosen in such a way that . By explicitly writing and evaluating the associated Jacobian we get in those coordinates . Although calculation in that parametrization is already quite convenient, it turns out that it becomes even shorter if one parametrizes the same domain in a related, but slightly less obvious way using instead the matrix entries and as new coordinates, complemented with , and expressing the remaining entry as . This finally gives
and further changing brings (3.20) to the form
where all integrals are well-defined and convergent for ; in particular, the latter one can be evaluated explicitly in terms of the Bessel function of second kind as ( see , p.363)
In principle, one can demonstrate existence of a chain of integral identities which allows to perform the remaining integrations in (3.22) explicitly without changing the order of integrations. This way leads however to quite cumbersome intermediate formulas, and we proceed instead by changing the order in (3.22) (which can be justified by Fubini’s theorem) to
which allows to perform the integrals over and much more efficiently. Namely, introduce the function
Then it is easy to see that after renaming the equation (3.23) can be rewritten as
Now by using the relation one can see that
for some real constant . Simple manipulations with incomplete function (2.4) show that this is equivalent to (3.11). To establish the value for the constant one can use, for example, the limit where according to the definition (3.10)
On the other hand, performing limit in (3.27) gives after a simple calculation
The definition of the left-hand side implies that the coefficient in front of must be equal to unity, giving finally
The normalization constant in Eq.(3.8) is given by .
To establish the value of the constant we consider the limit in both sides of (3.8). By the very definition of the Laplace transform its value at must be equal to the mean density of real eigenvalues for the real Ginibre ensemble given in (2.3). On the other hand, for the integration over in (3.11) can be easily performed introducing as new integration variable. One gets in this way:
To get featuring in the right-hand side of (3.8) replace in the above and use . Multiplying with and comparing with the left-hand side gives the value for the constant . ∎
Proof of Theorem 2.3
Our approach to complex Ginibre matrices follows essentially the same steps as for the real case, with very little modifications, and we only briefly indicate necessary changes. Similarly to (3.1), suppose that a complex-valued matrix has only non-degenerate eigenvalues, and assuming it has an eigenvalue (in general, complex) it can be represented as (see e.g. Sec. 6 of )
Now we exploit the analogue of Prop. (3.2)
with some normalization constant .
Using the above j.p.d. to calculate the Laplace transform of the probability density for the random variable for a fixed value of we arrive after standard manipulations at representing it as the expectation of the ratios of the determinants of the form
where we introduced the notation, cf. (2.26) for ,
with averaging performed over the j.p.d. (3.4) of complex Ginibre matrices of the size . Note, that the value of the constant normalization factor in (4.4) is found aposteriori exactly in the same way as in the real case, by comparing the known expression for the mean density of complex eigenvalues (2.18) (coinciding with ) and the corresponding limit in the right-hand side of (4.4).
In the general case evaluating for integer can be done essentially by the same supersymmetry method which was used in section (3.3), with obvious necessary modifications imposed by symmetries. In particular, presence of higher powers of the determinants in the numerator of (4.5) necessitates to use sets of anticommuting vectors for their representation, making the resulting integral representation in our version of the supersymmetry method significantly more cumbersome than in the real case. In the most relevant case and a special choice of the spectral parameter the expected value of the ratio featuring in the right-hand side of (4.5) can be relatively easily extracted as a special limiting case of a more general object evaluated in or, in a different way, in . The corresponding calculation is sketched in the first part of the next section. The supersymmetry approach for works along exactly the same general lines as in the real case, but is somewhat more involved technically. The corresponding calculation is outlined in the second part of the next section.
In the special case an integral representation of the averaged ratio of determinants featuring in (4.4) which we find most convenient for our purposes was derived in , see Eq.(29) there. Actually, our object arises as a particular case of that formula, identifying and considering a special limit (the latter limit is highly degenerate, and it is easier to perform it directly in eq.(25), and then rederive (29)). In this way we arrive at representing as
Now the integrals over and can be readily evaluated, with the result being simply
Further employing a well-known integral representation for the Bessel function of the second kind
which after substituting to the Laplace transform (4.4) is equivalent to (2.13).
1.2 Evaluation of (4.5) for L=2𝐿2L=2 and |z|≠0𝑧0|z|\neq 0 by supersymmetry approach
where the entering quantities were defined in equations (2.16)-(2.15).
The proof is very similar to the real case, and is outlined below.
One starts with using two copies of the set of four anticommuting vectors, namely and , to represent separately two determinants in the numerator via Gaussian integrals, see (3.12). At the same time, one needs two commuting vectors with complex-valued components to represent the denominator:
The ensemble averaging is performed by exploiting analogue of (3.15)
Performing the average one collects all terms in the exponential which are quartic in anticommuting variables, e.g. , etc.. The corresponding exponential factor can be then represented via a matrix version of the Hubbard-Stratonovich transformation generalizing (3.16):
with being a pair of general complex conjugate matrices. This trick allows to integrate out the vectors with anticommuting component completely. The analogue of (3.17) takes the form
At the next step one can simplify the above expression by employing the singular value decomposition with unitary and and replacing the integration over complex vectors with one over the Hermitian positive semidefinite matrix (cf. (3.19)):
After straightforward algebraic manipulations this allows to represent (4.13) for as
The Hermitian matrix can be parametrized very similarly to (3.21). Namely, writing for the complex variable and using together with as the coordinates, the domain of integration is parametrized by matrices
In this way we arrive at an analogue of (3.23):
The integrals over , , and can be performed. Namely, denoting and we introduce a function, cf. (3.24),
After further denoting we then define the functions
and renaming we notice that (4.17) can be represented, after restoring the normalization constants, as
Substituting (4.19) to the above and taking the limit, the expression can be further simplified with the help of symbolic manipulations using Wolfram Mathematica and is fianlly represented as (4.9). In particular, it is easy to see that so that (4.9) at indeed reproduces (4.8). ∎