Asymptotics of Hermite polynomials
|
|
- Sharon Stokes
- 5 years ago
- Views:
Transcription
1 Asymptotics of Hermite polynomials Michael Lindsey We motivate the study of the asymptotics of Hermite polynomials via their appearance in the analysis of the Gaussian Unitary Ensemble (GUE). Following Tao [3], we prove various facts about the Hermite polynomials and analyze their asymptotics via analysis of the semiclassical harmonic oscillator operator, which arises from the Hermite differential equation. Still following Tao [3], we use these asymptotics to prove a semicircular law for the expected empirical spectral distribution of the GUE. Since this project is a pedagogical exercise, we provide significantly more detail than Tao [3], filling in several computations and exercises left to the reader, and even correcting a few errors. Lastly, we make use of our results on the asymptotics of Hermite polynomials to show that, in a certain sense, the normalized stationary states for the quantum harmonic oscillator converge to the classical position distribution for the harmonic oscillator. This convergence is suggested graphically in Griffiths []. Our proof is very likely nothing new, though it has been thought out independently by the author. Before beginning, we note that our discussion of random matrix theory (focusing on the GUE) is less detailed than the material that follows (i.e., the discussion of Hermite polynomials, their asymptotics, and the proofs of the semicircular law and the fact about harmonic oscillator), and we refer to other texts for proofs in certain places. (Since this project is for a class on orthogonal polynomials, we decided that it would be more appropriate to provide full detail in the latter parts and to include the discussion of random matrix theory mainly as motivation.) Contents The GUE and related ensembles The Ginibre formula 3 Enter orthogonal polynomials 3 Hermite polynomials 5. The Hermite recurrence relation Differential equations associated with Hermite polynomials Rewriting K n in terms of Hermite functions Analysis of the eigenfunction equation of L h 6 Asymptotics for the GUE expected empirical spectral measure
2 7 Connection with the quantum harmonic oscillator 6 The GUE and related ensembles The n-dimensional GUE is an ensemble of n n Hermitian matrices. A sample M is obtained by sampling the upper triangular entries from the N C (, ) distribution and sampling the diagonal entries from N R (, ), allmutuallyindependently,andfixingthelower-triangularentriesbytheconstraint that M is Hermitian. We write M (M ij ). Consider the measure dm Q n i dm Q ii j<k dm jk < dm jk on the space M of Hermitian matrices (simply the Lebesgue measure on M considered in the most obvious way as R n ). t is clear by construction that the probability measure corresponding to the GUE is given by! Y n µ n C n e Mii / dm Y e Mij dm jkdm < jk A i C n n Y i e Mii / C n e tr(m )/ Y applej<kapplen applej<kapplen e Mij A dm where C n is chosen so that µ n (M). t is clear that e tr(m )/ is invariant under the transformation M 7! UMU for unitary matrices U. By computing the determinant of M 7! UMU as a linear transformation R n! R n (as in Deift []), it can be shown that dm is also unvariant under this transformation, and therefore µ n is invariant under conjugation by unitary matrices. More generally we can consider the distribution µ F n Cn F e F (M) dm, where F : M!Ris invariant under unitary conjugation (so F depends symmetrically on all of the eigenvalues). Particularly noteworthy are the functions F tr P, where P is a polynomial of even degree with positive coefficient for the highest-order term (ensuring integrability). Many of the properties of the GUE hold for these ensembles as well. For P quadratic, it is easy to see that e trp (M) splits into a product of functions of M ii and M jk (with j<k)individually,soevidentlythediagonalandupper triangular entries of M are all mutually independent in this case (as in the GUE). As mentioned by Deift [], a suitable converse is true, and it follows that modulo shifting by a constant and rescaling, the GUE is the unique Hermitian matrix ensemble that is invariant under unitary conjugation with all non-lower-triangular entries mutually independent and therefore a very natural object to study. The Ginibre formula We consider M to be the random matrix variable associated with µ F n (though we shall omit the F from our notation) for F tr P as above. Consider the map which maps M 7! (,,, n) where apple apple apple n are the ordered eigenvalues of M (all real since M is hermitian). Then the following holds for the density n for on the space R n apple {x apple x apple applex n }:
3 Theorem. (Ginibre formula). where n ( ) const e n( ) Y P n i P ( i) n( ), applei<japplen ( j i ). We give a brief sketch of the proof, following Deift []. First note that when the eigenvalues of M are simple, the diagonalization M U U (with the entries of ordered) is unique up to right-multiplication of U by diagonal unitary matrices (which form the maximal torus T n U n ). This holds because a matrix can only commute with if it is diagonal. Also, it is not hard to see that generically M has simple eigenvalues (this can be shown for example by considering the vanishing set of the discriminant, which does not have full dimension). Then there is a map M 7! (R n < { < < < n }, U n mod (T n )) which is a bijection when restricted a subset of M of full measure. AcalculationusinglocalcoordinatesofU n mod (T n ) shows that the Jacobian determinant of is equal to the product of n( ) and a factor that depends only on unitary variables associated with the coordinates on U n mod (T n ), and with some work the Ginibre formula follows from this fact. 3 Enter orthogonal polynomials The GUE and related ensembles are linked to orthogonal polynomials via the expression n( ) that appears in the Ginibre formula. n( ) is of course the Vandermonde determinant det V where V ( i j ). For all j, let j be a monic polynomial of degree j. Then by elementary row operations, we have that n( )det(v ) where V i ( j ),so! nx n( ) det V > V det k ( i ) k ( j ). Then in the case of the GUE, n ( ) const e P n i const det i / det k nx k ( i )e k! nx k ( i ) k ( j ) k const det (K n ( i, j)) applei,japplen, i / k ( j )e applei,japplen applei,japplen! j / applei,japplen where K n is defined by K n (x, y) P n k k( i )e i / k ( j )e j /. We see that taking the j to be non-monic only changes the formula for n ( ) by a constant factor, so let us take j to be the orthonormal Hermite polynomials. Then evidently by orthonormality we have that R K n (x, x) dx n (trace identity) and K n (x, y) R K n (x, z)k n (z,y) dz (reproducing formula). These two properties yield the following: 3
4 Lemma. (Determinantal integration). det (K n ( i, j)) applei,japplek+ d k+ (n k) det (K n ( i, j)) applei,japplek. n particular it follows that det (K n ( i, j)) applei,japplen d d n n! Proof. See, for example, Tao [3]. The latter statement can be used to show that in fact n ( )det(k n ( i, j)) applei,japplen in the GUE case. Furthermore, it can be shown that k (,..., k) :det(k n ( i, j)) applei,japplek is the k-point correlation function for the spectrum, i.e., 3 X k (,..., k)f (,..., k) d d k E F ( i (M n ),..., i k (M n )) 5 R k applei,...,i k applen, distinct for any measurable F : R k! C supported on {x apple applex k }.SeeTao[3]fordetails. t follows from the Christoffel-Darboux formula that K n (x, y) n(x) n (y) n (x) n (y) e (x +y )/, a n (x y) where a i are defined by the three-term recurrence i+ (x) (a i x + b i )P i (x) c i P i (x). Then also we have that K n (x, x) (a n ) n(x) n (x) n (x) n (x) e x /. Then it is clear that pinning down the asymptotics of the n (and the a n ) will help us to grasp the asymptotic behavior of the expected spectral measure of the GUE. Many objects associated with the GUE can be expressed conveniently in terms of K n ;see,for example, Deift []. We will later focus on a particular object: the expected empirical spectral measure of M n. The empirical spectral measure µ Mn is defined by µ Mn P n i i(m n). Recalling our result on the k-point correlation function above with k,wehavethat nx K n (x, x)f (x) dx E F ( i (M n )) for measurable F : R! C. Ofcourse, nx F ( i (M n )) F R i i nx i i(m n), so it follows that Eµ Mn K n (x, x) dx. As we shall confirm later, the range of the eigenvalues of M n scales as p n,soforstudyingasymptoticbehavioritmakessensetoconsidertherescaled probability measure n / K n ( p nx, p nx) dx, which is easily seen to be equal to Eµ p Mn/ n. We write E n n / K n ( p nx, p nx), soeµ p Mn/ n E n (x) dx. We will examine below the asymptotics of E n and Eµ p Mn/ n.
5 Hermite polynomials Henceforth we denote by P i the Hermite polynomials with positive leading coefficients which are orthonormal with respect to the weight function w(x) e x /.. The Hermite recurrence relation By the three-term recurrence, there exist a i,b i,c i (with a i 6, c )suchthat P i+ (x) (a i x + b i )P i (x) c i P i (x). We aim to compute the a i,b i,c i. By taking the inner product of both sides with P i+ w and P i w, we obtain a i xp i (x)p i+ (x)w(x) dx (.) c i a i xp i (x)p i (x)w(x) dx. (.) From (.) and (.) we see that c i a i a i for all i. Meanwhile, taking the inner product of both sides of the recurrence relation with P i w yields b i a i xp i (x) w(x) dx. (.3) (Thus far we have used only the orthonormality of the P i.) Notice that xw(x) w (x). Thus we obtain by integrating by parts in (.): a i P i (x)p i+ (x)+p i (x)pi+(x) w(x) dx P i (x)pi+(x)w(x) dx, where the second equality follows from the fact that P i has degree at most i (and hence is orthogonal to P i+ with respect to w). Let i be the leading coefficient of P i. Then Pi+ of order at most i. Then a i P i (x) i+ (i + ) i P i + Q, where Q is a polynomial apple (i + ) i+ i P i (x)+q(x) w(x) dx (i + ) i+ i. t is also clear from the three-term recurrence relation that i+ a i i,soa i a i p, i+ i p. i + i + (i + )a i,i.e., 5
6 t is easy to see that P (x) ( ) /,so i Also, since c i a i a i for i, wehavethat for i. c i /p i!. p i p i + Now integrating (.3) by parts, we have b i a i P i (x)p i (x)w(x) dx, where the second equality follows from the fact that P i has degree at most i. Then the Hermite recurrence relation is P i+ (x) p i + xp i (x) p i p i + P i (x). (.). Differential equations associated with Hermite polynomials Next we obtain differential equations satisfied by the Hermite polynomials. To do so, we write Pi+ as a linear combination of Hermite polynomials of order at most i, obtainingthecoefficientsofthis linear combination by taking inner products. Note that by integration by parts we have P j (x)pi+(x)w(x) dx xp j (x)p i+ (x)w(x) dx Pj(x)P i+ (x)w(x) dx xpj (x) P j(x) P i+ (x)w(x) dx. When j<i, clearly the last integral is zero, and when j i, wehavethatthecontributionofthe Pj term is zero, so P i (x)pi+(x)w(x) dx xp i (x)p i+ (x)w(x) dx a i, where the second equality follows from (.). Thus we can write P i+ a i P i p i +P i. (.5) 6
7 Then it follows that h (wp i ) (x) w (x)p i (x)+w(x)pi (x) xp i (x)+ p ip i i w(x). By (.), the last expression is equal to p i +Pi+ (x)w(x), sowehavethat or perhaps more familiarly, Since P ( ) /,wehavethat (wp i ) p i +wp i+, d e x / P i (x) p i +e x / P i+ (x). dx P n (x) ( )n ( ) /p n! ex / dn dx n e x /. (.6) This gives an explicit formula for the Hermite polynomials. However, we are interested in their asymptotic behavior for large n, which is not obvious from this formula. We need another approach to uncover this asymptotic behavior. Note that by (.) and (.5), we have for n that np n (x) x p p p np n (x) n n Pn (x) xpn(x) Pn (x). Then we have the Hermite differential equation: P n (x) xp n(x)+np n (x). We can in fact derive a differential equation satsified by the n-th Hermite function n P n w /. We simply differentiate twice: n Pn w / +Pn w / + Pn w /. Noting that w / (x) x w(x)/,sotherefore we obtain w / (x) x w(x) /, x n(x) Pn (x)w(x) / xpn(x)w(x) / + 7 P n (x)w(x) /
8 apple Pn (x) apple apple x xpn(x)+ x np n (x)+ n + + x n(x), P n (x) w(x) / P n (x) w(x) / i.e., n(x) apple n + x n(x). (.7) Note that, equivalently, we have that L n n + n, where we denote by L the harmonic oscillator operator L (x) (x)+ x..3 Rewriting K n in terms of Hermite functions Recall from above that (following from the Christoffel-Darboux formula) K n (x, x) a n P n(x)p n (x) P n (x)p n (x) w(x). Since P n a n P n (see (.5)), it follows that K n (x, x) P n(x) P n (x)p n (x) w(x). (.8) Now so Then n(x) + n n(x) P n(x)w(x) / x P n(x)w(x) /, n(x) P n(x) w(x) x xp n (x)p n(x)w(x)+ x P n(x) w(x) n(x) P n(x) w(x) xp n (x)p n(x)w(x)+np n (x) w(x) P n(x) w(x)+[ xp n(x)+np n (x)] P n (x)w(x) P n(x) w(x)+ x p np n (x)+np n (x) P n (x)w(x), 8
9 where the last equality follows from (.5). By the Hermite recurrence relation (.), x p np n (x)+np n (x) p n(n )P n (x), and again by (.5), the RHS of this equation is equal to Pn (x), so n(x) + n Then by (.8), we have that x n(x) P n(x) P n (x)p n (x) w(x). K n (x, x) n(x) + n x n(x). Recall from above that we were interested in the asymptotic behavior of E n n / K n ( p nx, p nx), since the rescaled expected empirical spectral measure of the GUE is given by E n dx. Now E n n / n( p nx) + p x n n( p nx) n n(x) + x n(x), where n is the rescaled Hermite function defined by n (x) :n / Notice that n satisfies the differential equation n n(x)+ x n(x) n 3/ n( p / x nx)+n n / n apple n + apple n + n + n x n, n / n ( p nx) + n x n( p nx). n( p / x nx)+n n ( p nx) n( p nx)+ x n/ n( p nx) i.e., L /n n + n n, where L h denotes the semiclassical harmonic oscillator operator L h h + x. Then it is natural to analyze the eigenfunction equation or equivalently, L h, x h k(x), (.9) where k(x) : p x / (so we consider only the region where x / < ). We will eventually take h> to be /n (small when n is large) and to be + n (nearly when n is large). 9
10 5 Analysis of the eigenfunction equation of L h t is helpful, both intuitively and formally, to draw a comparison between (.9) and the familiar ODE h k with constant coefficient, having as its solution (x) Ae ikx/h + Be ikx/h. We then forward the ansatz (x) A(x)e i (x)/h + B(x)e i (x)/h, where (x) R x k(y) dy, i.e., is an antiderivative of k. Weobtainbydifferentiating: (x) ik(x) h A(x)e i (x)/h B(x)e i (x)/h + A (x)e i (x)/h + B (x)e i (x)/h. Since we are solving for two functions A and B, heuristicallyweexpecttobeabletoputan additional constraint on A and B, namely A (x)e i (x)/h + B (x)e i (x)/h. (5.) We will see later that the expressions for A and B that we obtain do indeed satisfy this equation. Again we differentiate, yielding (x) Referring back to (.9), we see that then k(x) h (x)+ ik (x) A(x)e i (x)/h B(x)e i (x)/h h + ik(x) A (x)e i (x)/h B (x)e i (x)/h. h A (x)e i (x)/h B (x)e i (x)/h k (x) A(x)e i (x)/h B(x)e i (x)/h. k(x) Adding and subtracting this equation with (5.), we obtain or equivalently A (x)e i (x)/h k (x) A(x)e i (x)/h B(x)e i (x)/h k(x) B (x)e i (x)/h k (x) A(x)e i (x)/h B(x)e i (x)/h, k(x) A (x) B (x) k (x) k(x) A(x)+ k (x) i (x)/h B(x)e k(x) k (x) k(x) B(x)+ k (x) k(x) A(x)ei (x)/h. Define a(x) k(x) / A(x) and b(x) k(x) / B(x), so A(x) k(x) / a(x), B(x) k(x) / b(x),
11 and also i.e., and similarly a (x) k(x) / A (x)+ k (x) A(x) k(x) / k (x) i (x)/h B(x)e k(x) / k (x) k(x) b(x)e i (x)/h, a (x) k (x) k(x) b(x)e i (x)/h, (5.) b (x) k (x) k(x) a(x)ei (x)/h. Then on any compact interval contained within (, ), wehavethata,b O( a, b ). Furthermore, by Gronwall s inequality we have that a(x) applec b() and b(x) applec a() on for constants C,C depending only on. Therefore on. Now by (5.), we have a(x) a() x x a,b,a,b O( a() + b() ) (x) a (u) du k (u) k(u) b(u)e i (u)/h du k (v) k ( (v)) (v)b (v) e iv/h dv, where we have made the substitution v (u) (note that is strictly increasing, hence invertible, since k is positive). Then integrating by parts we obtain " # v (x) a(x) a() h (v) (x) i k ( (v)b (v) e iv/h F (v)e iv/h dva, (v)) where " F (v) d k (v) dv k ( (v)) (v)b n particular is a smooth function on that does not depend on h, and furthermore from the product rule it is clear that F O( b + b ). t follows from our earlier finding that F O( b() + b () ). Evidently then a(x) a() + O (h [ a() + b() ]), v (v) #.
12 and by analogous reasoning we obtain We have thus shown the following: b(x) b() + O (h [ a() + b() ]). Theorem. Suppose that L h. Then on any compact interval contained in (, ), where Furthermore (x) k(x) / a(x)e i (x)/h + b(x)e i (x)/h, a(x) a() + O (h [ a() + b() ]), b(x) b() + O (h [ a() + b() ]). (x) ik(x)/ h a(x)e i (x)/h b(x)e i (x)/h. 6 Asymptotics for the GUE expected empirical spectral measure Now plugging in + n and h n,weseethatonanycompactinterval contained in (, ), where and furthermore n k(x) / a(x)e in (x) + b(x)e in (x), a(x) a() + O n [ a() + b() ], b(x) b() + O n [ a() + b() ], n(x) nik(x) / a(x)e in (x) b(x)e in (x). n the following the reader should note that a and b depend on n, thoughweomitthisdependence from the notation. Recall from above that the density of the expected empirical spectral measure is given by so E n (x) x n (x) + n n(x), E n (x) a(x)e in (x) + b(x)e in (x) k(x) x + a(x)e in (x) b(x)e in (x) k(x) h a(x) + b(x) +< a(x)b(x)e in (x) i k(x) h + a(x) + b(x) < a(x)b(x)e in (x) i k(x) a(x) + b(x) apple k(x) x + k(x) x
13 +< a(x)b(x)e in (x) apple k(x) q Notice that k(x) + x n,sok(x) notion more precise. ndeed, we have that applek(x) x x x + n + n + n x x + O x q x n + n x k(x). (6.) for large n. We will make this x x x n. n x + n n + n Notice that for >, wehavethat apple +,and( ) apple. Thus in fact for all, > we have that ( ) apple,so and "k(x) k(x) Similarly, it is easy to show that k(x) x E n (x) a(x) + b(x) h p r x r # x O, n x + o(). q x + o(). Then we have from (6.) that x i x + o() + O( a(x) b(x) ) o(). Of course since a, b O( a(), b() ), weinfacthavethat E n (x) a(x) + b(x) h p i x + o() + O( a() b() ) o(). (6.) To proceed we approximate the initial conditions a() and b(). Recall(.6) froma above, i.e., that P n (x) ( )n ( ) /p n! ex / dn dx n e x /. Using the Taylor expansion X e x / ( ) k x k k, k! k 3
14 we see that for even n, and for odd n, P n () ( ) n/p n! ( ) / n/ (n/)!, P n(), P n (), P n() ( )(n+)/ (n + ) p n! ( ) / (n+)/ ((n + )/)!. Now n () n / P n () and n() n 3/ n() n 3/ Pn(), andfurthermore n () a() + b() and n() ni(a() b()), so 8 < a() + b() ( )n/ n /p n!, a() b(), n is even ( ) / n/ (n/)! : a() + b(), a() b() ( )(n+)/ n / (n+) p n! i( ) / (n+)/ ((n+)/)!, Now recalling that n! p n (n/e) n (Stirling s approximation), we have that n is odd. ( ) n/ n /p n! ( ) / n/ (n/)! ( ) n/ n/ ( ) / n / n n/ e n/ ( ) / n/ (n/)! ( ) n/ n/ n n/ e n/ n/ (n/)! ( ) n/ n / n n/ e n/ n/ / n / n n/ n/ e n/ ( ) n/ /, so as n!.wealsocompute ( ) (n+)/ n / (n + ) p n! ( ) / (n+)/ ((n + )/)! n /p n! ( ) / n/ (n/)!! / ( ) (n+)/ n / (n + )( ) / n / n n/ e n/ ( ) / (n+)/ ((n + )/)! ( ) (n+)/ (n + )nn/ e n/ (n+)/ ((n + )/)! ( ) (n+)/ (n + )n n/ e n/ (n+)/ / (n + ) / (n + ) (n+)/ (e) (n+)/ n/ n ( ) (n+)/ / e / n + ( ) (n+)/ / e / + n / n ( ) (n+)/ /, so n / (n + ) p n! ( ) / (n+)/ ((n + )/)!! /.
15 Now when n is even, a() b(), soa() b() (a() + b()). Whenn is odd, a() b(), so a() b() (a() b()). t follows that we have that a(), b()! / as n!,so a() + b()! as n!. Recall (6.) from above, i.e., that E n (x) a(x) + b(x) h p i x + o() + O( a() b() ) o(). Also recall that a(x) a() + O n [ a() + b() ], b(x) b() + O n [ a() + b() ]. But since a(), b()! /,so a() + b() and a() b() are both bounded uniformly in n, and in fact a(x) a() + O(n ), b(x) b() + O(n ), and O( a() b() ) O(). Thus a + b a() + b()! uniformly on as n!, so a + b! uniformly on as n!,i.e., a + b + o(). Then we have shown that apple hp i E n (x) + o() x + o() + o() p x + o(), or, in other words, E n (x) p x converges to zero uniformly on. Now let : R! R be measurable, bounded, and supported on a compact interval (, ). Now E n (x) p x! uniformly on, so (x) E n (x) p x dx! by bounded convergence, and consequently R E R n! (x)p x dx. n particular, letting m [ +m, m ] and taking m we see that R m E n! R p m x dx. Ofcourse, R R E n, so it follows that R R p R\ m E n! m x dx. Now let : R! R be bounded and continuous, so appleb everywhere for some B>. Then q (x) E n (x) ( x p ) + dx apple (x) E n (x) x dx m + (x) E n (x) dx R\ m + (x) q ( x R\ m ) + dx. 5
16 The first term in the last expression converges to zero by our previous argument, and the second term is bounded by B R R p R\ m E n (x) dx, which converges to B m x dx. Thus lim sup n! (x) E n (x) q ( x ) + dx apple B p m x dx. The RHS p of this inequality can be made arbitrarily small by taking m sufficiently large since x dx,soinfact R t follows that lim n! (x) E n (x) q ( x ) + dx. E n! q (x) ( x ) + dx. We collect our results into the following theorem: q Theorem. Eµ p Mn/ n E n dx! sc dx weakly, where sc (x) ( x ) +. Furthermore, E n! sc uniformly on any compact interval contained in (, ), and E n! sc in L on R\[, ]. 7 Connection with the quantum harmonic oscillator Recall from the preceding section that we denote by P n the Hermite polynomials orthonormal with respect to w(x) e x /.Furtherwehavedefined n P n w / and n (x) n / n( p nx), so n p n n( p nx) dx n dx P n (x) w(x) dx, i.e., k n k L. n fact the n are (modulo horizontal rescaling) the normalized stationary states for the quantum-mechanical harmonic oscillator. See, for example, Griffiths [] for a discussion of the harmonic oscillator. n Griffiths [], it is indicated graphically that the n converge in some sense to the density of the classical distribution of the harmonic oscillator. We will formulate and prove this convergence precisely. Consider the harmonic oscillator defined by x(t) A cos (!t). t is clear that the amount of time per period for which x(t) y (for y [ A, A]) isgivenby! cos (y/a), andtheperiodofoscillationis /!, so the fraction of time for which x(t) y is given by cos (y/a). 6
17 t follows the stationary distribution function F forthe position of the harmonic oscillator satisfies F (y) cos (y/a) for y [ A, A], andthecorrespondingprobabilitydensityfunctionis f(y) F (y) A x A /. Without loss of much generality, we fix A,so f(x) x /. + n fact we must rescale the have the following: n to obtain convergence to the classical density f. Moreprecisely,we Theorem. For any bounded continuous function : R! R, R n! R f. Proof. Let : R! R be continuous with appleb for some B>. From the preceding section, we have that on any compact interval contained in (, ), n(x) k(x) a(x)e in (x) + b(x)e in (x), where a(x) a() + O n, b(x) b() + O n. (Recall that a and b depend on n). Furthermore, we showed that a()! / and b() ( ) n a(). Then we have that on. n(x) k(x) a() e in (x) +( ) n e in (x) + O n Let for x ( g n (x) k(x) a() e in (x) +( ) n e in (x), ). Weclaimthat R R n g n!. ndeed, and a() is bounded uniformly in n, so by bounded convergence, and the claim follows. n(x) g n (x) k(x) a() O(n ), n g n! Then define h n (x) k(x) e in (x) +( ) n e in (x) 7
18 for x (, ). Weclaimthat R g R n h n!. ndeed we have that g n h n k(x) e in (x) +( ) n e in (x) a(), so again our claim follows from bounded convergence. Now h n k(x) e in (x) +( k () e inx +( (x) ) n e in (x) (x) dx e inx +( ) n e inx ) n e inx (x) dx, (x) (x) dx where (x) k (x) (x) (x) ()(x), so L (R) \ L (R). Then by the Plancherel identity, since h F e inx +( ) n e inx i (u) ( ) u n n + (u)+( ) n u + n, we have that h n apple ( ) n ˆ By the Riemann-Lebesgue lemma, ( ) n hˆ n Thus as n!. ˆ() k () (x) k(x) (x) dx. h n n + ˆ + ˆ n (x) k(x) (x) dx! n +ˆ(). i! as n!.furthermore, (x) dx / x We showed in the preceding section that k(x)! uniformly on as n!,and / since k is bounded away from on it follows that k(x)! f(x) uniformly on. Therefore k(x) (x) dx x f dx! 8
19 as n!. Putting together our results, we have shown that R n! R f dx as n!. Now we could have taken in the preceding, so in particular we have that R n! R f as n!.ofcourse, n is a probability density, so R R R\ n! f. Now R n R f apple n apple n! B f f + R\ f + B. R\ n + n + B R\ R\ f f Now by taking [ +m, m ] for m sufficiently large, we can make the last expression above arbitrarily small (since R f ). Therefore R R n! R f as n!,andtheproofis R complete. References [] P. Deift, Orthogonal Polynomials and Random Matrices: A Riemann-Hilbert Approach, American Mathematical Society, 999. [] D. J. Griffiths, ntroduction to Quantum Mechanics, Pearson, 5. [3] T. Tao, Topics in Random Matrix Theory, AmericanMathematicalSociety,. 9
Finite-dimensional spaces. C n is the space of n-tuples x = (x 1,..., x n ) of complex numbers. It is a Hilbert space with the inner product
Chapter 4 Hilbert Spaces 4.1 Inner Product Spaces Inner Product Space. A complex vector space E is called an inner product space (or a pre-hilbert space, or a unitary space) if there is a mapping (, )
More informationAPPENDIX A. Background Mathematics. A.1 Linear Algebra. Vector algebra. Let x denote the n-dimensional column vector with components x 1 x 2.
APPENDIX A Background Mathematics A. Linear Algebra A.. Vector algebra Let x denote the n-dimensional column vector with components 0 x x 2 B C @. A x n Definition 6 (scalar product). The scalar product
More informationMathematical Methods wk 2: Linear Operators
John Magorrian, magog@thphysoxacuk These are work-in-progress notes for the second-year course on mathematical methods The most up-to-date version is available from http://www-thphysphysicsoxacuk/people/johnmagorrian/mm
More informationSolutions: Problem Set 3 Math 201B, Winter 2007
Solutions: Problem Set 3 Math 201B, Winter 2007 Problem 1. Prove that an infinite-dimensional Hilbert space is a separable metric space if and only if it has a countable orthonormal basis. Solution. If
More informationChapter 8 Integral Operators
Chapter 8 Integral Operators In our development of metrics, norms, inner products, and operator theory in Chapters 1 7 we only tangentially considered topics that involved the use of Lebesgue measure,
More informationRANDOM MATRIX THEORY AND TOEPLITZ DETERMINANTS
RANDOM MATRIX THEORY AND TOEPLITZ DETERMINANTS David García-García May 13, 2016 Faculdade de Ciências da Universidade de Lisboa OVERVIEW Random Matrix Theory Introduction Matrix ensembles A sample computation:
More informationORTHOGONAL POLYNOMIALS
ORTHOGONAL POLYNOMIALS 1. PRELUDE: THE VAN DER MONDE DETERMINANT The link between random matrix theory and the classical theory of orthogonal polynomials is van der Monde s determinant: 1 1 1 (1) n :=
More informationSPRING 2006 PRELIMINARY EXAMINATION SOLUTIONS
SPRING 006 PRELIMINARY EXAMINATION SOLUTIONS 1A. Let G be the subgroup of the free abelian group Z 4 consisting of all integer vectors (x, y, z, w) such that x + 3y + 5z + 7w = 0. (a) Determine a linearly
More informationMATH 205C: STATIONARY PHASE LEMMA
MATH 205C: STATIONARY PHASE LEMMA For ω, consider an integral of the form I(ω) = e iωf(x) u(x) dx, where u Cc (R n ) complex valued, with support in a compact set K, and f C (R n ) real valued. Thus, I(ω)
More informationMath 118, Handout 4: Hermite functions and the Fourier transform. n! where D = d/dx, are a basis of eigenfunctions for the Fourier transform
The Hermite functions defined by h n (x) = ( )n e x2 /2 D n e x2 where D = d/dx, are a basis of eigenfunctions for the Fourier transform f(k) = f(x)e ikx dx on L 2 (R). Since h 0 (x) = e x2 /2 h (x) =
More informationExtreme eigenvalue fluctutations for GUE
Extreme eigenvalue fluctutations for GUE C. Donati-Martin 204 Program Women and Mathematics, IAS Introduction andom matrices were introduced in multivariate statistics, in the thirties by Wishart [Wis]
More informationVector Spaces. Vector space, ν, over the field of complex numbers, C, is a set of elements a, b,..., satisfying the following axioms.
Vector Spaces Vector space, ν, over the field of complex numbers, C, is a set of elements a, b,..., satisfying the following axioms. For each two vectors a, b ν there exists a summation procedure: a +
More informationClass notes: Approximation
Class notes: Approximation Introduction Vector spaces, linear independence, subspace The goal of Numerical Analysis is to compute approximations We want to approximate eg numbers in R or C vectors in R
More information1. General Vector Spaces
1.1. Vector space axioms. 1. General Vector Spaces Definition 1.1. Let V be a nonempty set of objects on which the operations of addition and scalar multiplication are defined. By addition we mean a rule
More informationThis ODE arises in many physical systems that we shall investigate. + ( + 1)u = 0. (λ + s)x λ + s + ( + 1) a λ. (s + 1)(s + 2) a 0
Legendre equation This ODE arises in many physical systems that we shall investigate We choose We then have Substitution gives ( x 2 ) d 2 u du 2x 2 dx dx + ( + )u u x s a λ x λ a du dx λ a λ (λ + s)x
More informationUniversality of distribution functions in random matrix theory Arno Kuijlaars Katholieke Universiteit Leuven, Belgium
Universality of distribution functions in random matrix theory Arno Kuijlaars Katholieke Universiteit Leuven, Belgium SEA 06@MIT, Workshop on Stochastic Eigen-Analysis and its Applications, MIT, Cambridge,
More informationReview of Linear Algebra Definitions, Change of Basis, Trace, Spectral Theorem
Review of Linear Algebra Definitions, Change of Basis, Trace, Spectral Theorem Steven J. Miller June 19, 2004 Abstract Matrices can be thought of as rectangular (often square) arrays of numbers, or as
More informationLecture 8 : Eigenvalues and Eigenvectors
CPS290: Algorithmic Foundations of Data Science February 24, 2017 Lecture 8 : Eigenvalues and Eigenvectors Lecturer: Kamesh Munagala Scribe: Kamesh Munagala Hermitian Matrices It is simpler to begin with
More informationSpectral Theorem for Self-adjoint Linear Operators
Notes for the undergraduate lecture by David Adams. (These are the notes I would write if I was teaching a course on this topic. I have included more material than I will cover in the 45 minute lecture;
More informationDeterminantal point processes and random matrix theory in a nutshell
Determinantal point processes and random matrix theory in a nutshell part I Manuela Girotti based on M. Girotti s PhD thesis and A. Kuijlaars notes from Les Houches Winter School 202 Contents Point Processes
More informationKernel Method: Data Analysis with Positive Definite Kernels
Kernel Method: Data Analysis with Positive Definite Kernels 2. Positive Definite Kernel and Reproducing Kernel Hilbert Space Kenji Fukumizu The Institute of Statistical Mathematics. Graduate University
More informationDeterminantal point processes and random matrix theory in a nutshell
Determinantal point processes and random matrix theory in a nutshell part II Manuela Girotti based on M. Girotti s PhD thesis, A. Kuijlaars notes from Les Houches Winter School 202 and B. Eynard s notes
More informationCentral Limit Theorems for linear statistics for Biorthogonal Ensembles
Central Limit Theorems for linear statistics for Biorthogonal Ensembles Maurice Duits, Stockholm University Based on joint work with Jonathan Breuer (HUJI) Princeton, April 2, 2014 M. Duits (SU) CLT s
More informationTopics in Harmonic Analysis Lecture 1: The Fourier transform
Topics in Harmonic Analysis Lecture 1: The Fourier transform Po-Lam Yung The Chinese University of Hong Kong Outline Fourier series on T: L 2 theory Convolutions The Dirichlet and Fejer kernels Pointwise
More informationLINEAR ALGEBRA BOOT CAMP WEEK 4: THE SPECTRAL THEOREM
LINEAR ALGEBRA BOOT CAMP WEEK 4: THE SPECTRAL THEOREM Unless otherwise stated, all vector spaces in this worksheet are finite dimensional and the scalar field F is R or C. Definition 1. A linear operator
More informationThe following definition is fundamental.
1. Some Basics from Linear Algebra With these notes, I will try and clarify certain topics that I only quickly mention in class. First and foremost, I will assume that you are familiar with many basic
More informationHilbert Spaces. Hilbert space is a vector space with some extra structure. We start with formal (axiomatic) definition of a vector space.
Hilbert Spaces Hilbert space is a vector space with some extra structure. We start with formal (axiomatic) definition of a vector space. Vector Space. Vector space, ν, over the field of complex numbers,
More informationSome Notes on Linear Algebra
Some Notes on Linear Algebra prepared for a first course in differential equations Thomas L Scofield Department of Mathematics and Statistics Calvin College 1998 1 The purpose of these notes is to present
More informationLinear Algebra. Matrices Operations. Consider, for example, a system of equations such as x + 2y z + 4w = 0, 3x 4y + 2z 6w = 0, x 3y 2z + w = 0.
Matrices Operations Linear Algebra Consider, for example, a system of equations such as x + 2y z + 4w = 0, 3x 4y + 2z 6w = 0, x 3y 2z + w = 0 The rectangular array 1 2 1 4 3 4 2 6 1 3 2 1 in which the
More informationQuantum Computing Lecture 2. Review of Linear Algebra
Quantum Computing Lecture 2 Review of Linear Algebra Maris Ozols Linear algebra States of a quantum system form a vector space and their transformations are described by linear operators Vector spaces
More informationMATRIX INTEGRALS AND MAP ENUMERATION 2
MATRIX ITEGRALS AD MAP EUMERATIO 2 IVA CORWI Abstract. We prove the generating function formula for one face maps and for plane diagrams using techniques from Random Matrix Theory and orthogonal polynomials.
More informationOPSF, Random Matrices and Riemann-Hilbert problems
OPSF, Random Matrices and Riemann-Hilbert problems School on Orthogonal Polynomials in Approximation Theory and Mathematical Physics, ICMAT 23 27 October, 2017 Plan of the course lecture 1: Orthogonal
More information1 Linear Algebra Problems
Linear Algebra Problems. Let A be the conjugate transpose of the complex matrix A; i.e., A = A t : A is said to be Hermitian if A = A; real symmetric if A is real and A t = A; skew-hermitian if A = A and
More informationRandom matrices and the Riemann zeros
Random matrices and the Riemann zeros Bruce Bartlett Talk given in Postgraduate Seminar on 5th March 2009 Abstract Random matrices and the Riemann zeta function came together during a chance meeting between
More informationTrace Class Operators and Lidskii s Theorem
Trace Class Operators and Lidskii s Theorem Tom Phelan Semester 2 2009 1 Introduction The purpose of this paper is to provide the reader with a self-contained derivation of the celebrated Lidskii Trace
More informationEIGENVALUES AND EIGENVECTORS 3
EIGENVALUES AND EIGENVECTORS 3 1. Motivation 1.1. Diagonal matrices. Perhaps the simplest type of linear transformations are those whose matrix is diagonal (in some basis). Consider for example the matrices
More informationElementary linear algebra
Chapter 1 Elementary linear algebra 1.1 Vector spaces Vector spaces owe their importance to the fact that so many models arising in the solutions of specific problems turn out to be vector spaces. The
More informationNOTES ON FRAMES. Damir Bakić University of Zagreb. June 6, 2017
NOTES ON FRAMES Damir Bakić University of Zagreb June 6, 017 Contents 1 Unconditional convergence, Riesz bases, and Bessel sequences 1 1.1 Unconditional convergence of series in Banach spaces...............
More informationMathematical Methods wk 1: Vectors
Mathematical Methods wk : Vectors John Magorrian, magog@thphysoxacuk These are work-in-progress notes for the second-year course on mathematical methods The most up-to-date version is available from http://www-thphysphysicsoxacuk/people/johnmagorrian/mm
More informationMathematical Methods wk 1: Vectors
Mathematical Methods wk : Vectors John Magorrian, magog@thphysoxacuk These are work-in-progress notes for the second-year course on mathematical methods The most up-to-date version is available from http://www-thphysphysicsoxacuk/people/johnmagorrian/mm
More informationMeasures, orthogonal polynomials, and continued fractions. Michael Anshelevich
Measures, orthogonal polynomials, and continued fractions Michael Anshelevich November 7, 2008 MEASURES AND ORTHOGONAL POLYNOMIALS. µ a positive measure on R. A linear functional µ[p ] = P (x) dµ(x), µ
More informationMAT 257, Handout 13: December 5-7, 2011.
MAT 257, Handout 13: December 5-7, 2011. The Change of Variables Theorem. In these notes, I try to make more explicit some parts of Spivak s proof of the Change of Variable Theorem, and to supply most
More informationTHEODORE VORONOV DIFFERENTIABLE MANIFOLDS. Fall Last updated: November 26, (Under construction.)
4 Vector fields Last updated: November 26, 2009. (Under construction.) 4.1 Tangent vectors as derivations After we have introduced topological notions, we can come back to analysis on manifolds. Let M
More informationLecture I: Asymptotics for large GUE random matrices
Lecture I: Asymptotics for large GUE random matrices Steen Thorbjørnsen, University of Aarhus andom Matrices Definition. Let (Ω, F, P) be a probability space and let n be a positive integer. Then a random
More informationMidterm for Introduction to Numerical Analysis I, AMSC/CMSC 466, on 10/29/2015
Midterm for Introduction to Numerical Analysis I, AMSC/CMSC 466, on 10/29/2015 The test lasts 1 hour and 15 minutes. No documents are allowed. The use of a calculator, cell phone or other equivalent electronic
More information18.S34 linear algebra problems (2007)
18.S34 linear algebra problems (2007) Useful ideas for evaluating determinants 1. Row reduction, expanding by minors, or combinations thereof; sometimes these are useful in combination with an induction
More informationMeasures, orthogonal polynomials, and continued fractions. Michael Anshelevich
Measures, orthogonal polynomials, and continued fractions Michael Anshelevich November 7, 2008 MEASURES AND ORTHOGONAL POLYNOMIALS. MEASURES AND ORTHOGONAL POLYNOMIALS. µ a positive measure on R. 2 MEASURES
More informationGeneralized eigenvector - Wikipedia, the free encyclopedia
1 of 30 18/03/2013 20:00 Generalized eigenvector From Wikipedia, the free encyclopedia In linear algebra, for a matrix A, there may not always exist a full set of linearly independent eigenvectors that
More informationj=1 x j p, if 1 p <, x i ξ : x i < ξ} 0 as p.
LINEAR ALGEBRA Fall 203 The final exam Almost all of the problems solved Exercise Let (V, ) be a normed vector space. Prove x y x y for all x, y V. Everybody knows how to do this! Exercise 2 If V is a
More informationA Brief Outline of Math 355
A Brief Outline of Math 355 Lecture 1 The geometry of linear equations; elimination with matrices A system of m linear equations with n unknowns can be thought of geometrically as m hyperplanes intersecting
More informationIf Y and Y 0 satisfy (1-2), then Y = Y 0 a.s.
20 6. CONDITIONAL EXPECTATION Having discussed at length the limit theory for sums of independent random variables we will now move on to deal with dependent random variables. An important tool in this
More informationEigenvalues and eigenfunctions of the Laplacian. Andrew Hassell
Eigenvalues and eigenfunctions of the Laplacian Andrew Hassell 1 2 The setting In this talk I will consider the Laplace operator,, on various geometric spaces M. Here, M will be either a bounded Euclidean
More informationRecitation 1 (Sep. 15, 2017)
Lecture 1 8.321 Quantum Theory I, Fall 2017 1 Recitation 1 (Sep. 15, 2017) 1.1 Simultaneous Diagonalization In the last lecture, we discussed the situations in which two operators can be simultaneously
More informationLinear Algebra March 16, 2019
Linear Algebra March 16, 2019 2 Contents 0.1 Notation................................ 4 1 Systems of linear equations, and matrices 5 1.1 Systems of linear equations..................... 5 1.2 Augmented
More informationLecture 3 Dynamics 29
Lecture 3 Dynamics 29 30 LECTURE 3. DYNAMICS 3.1 Introduction Having described the states and the observables of a quantum system, we shall now introduce the rules that determine their time evolution.
More informationA Remark on Hypercontractivity and Tail Inequalities for the Largest Eigenvalues of Random Matrices
A Remark on Hypercontractivity and Tail Inequalities for the Largest Eigenvalues of Random Matrices Michel Ledoux Institut de Mathématiques, Université Paul Sabatier, 31062 Toulouse, France E-mail: ledoux@math.ups-tlse.fr
More informationMTH50 Spring 07 HW Assignment 7 {From [FIS0]}: Sec 44 #4a h 6; Sec 5 #ad ac 4ae 4 7 The due date for this assignment is 04/05/7 Sec 44 #4a h Evaluate the erminant of the following matrices by any legitimate
More informationApproximation theory
Approximation theory Xiaojing Ye, Math & Stat, Georgia State University Spring 2019 Numerical Analysis II Xiaojing Ye, Math & Stat, Georgia State University 1 1 1.3 6 8.8 2 3.5 7 10.1 Least 3squares 4.2
More information1 Continuity Classes C m (Ω)
0.1 Norms 0.1 Norms A norm on a linear space X is a function : X R with the properties: Positive Definite: x 0 x X (nonnegative) x = 0 x = 0 (strictly positive) λx = λ x x X, λ C(homogeneous) x + y x +
More informationbe the set of complex valued 2π-periodic functions f on R such that
. Fourier series. Definition.. Given a real number P, we say a complex valued function f on R is P -periodic if f(x + P ) f(x) for all x R. We let be the set of complex valued -periodic functions f on
More informationMath 102, Winter Final Exam Review. Chapter 1. Matrices and Gaussian Elimination
Math 0, Winter 07 Final Exam Review Chapter. Matrices and Gaussian Elimination { x + x =,. Different forms of a system of linear equations. Example: The x + 4x = 4. [ ] [ ] [ ] vector form (or the column
More informationMath 350 Fall 2011 Notes about inner product spaces. In this notes we state and prove some important properties of inner product spaces.
Math 350 Fall 2011 Notes about inner product spaces In this notes we state and prove some important properties of inner product spaces. First, recall the dot product on R n : if x, y R n, say x = (x 1,...,
More informationCorrelation Functions, Cluster Functions, and Spacing Distributions for Random Matrices
Journal of Statistical Physics, Vol. 92, Nos. 5/6, 1998 Correlation Functions, Cluster Functions, and Spacing Distributions for Random Matrices Craig A. Tracy1 and Harold Widom2 Received April 7, 1998
More informationc 1 v 1 + c 2 v 2 = 0 c 1 λ 1 v 1 + c 2 λ 1 v 2 = 0
LECTURE LECTURE 2 0. Distinct eigenvalues I haven t gotten around to stating the following important theorem: Theorem: A matrix with n distinct eigenvalues is diagonalizable. Proof (Sketch) Suppose n =
More informationA glimpse of Fourier analysis
Chapter 7 A glimpse of Fourier analysis 7.1 Fourier series In the middle of the 18th century, mathematicians and physicists started to study the motion of a vibrating string (think of the strings of a
More informationLinear Algebra: Matrix Eigenvalue Problems
CHAPTER8 Linear Algebra: Matrix Eigenvalue Problems Chapter 8 p1 A matrix eigenvalue problem considers the vector equation (1) Ax = λx. 8.0 Linear Algebra: Matrix Eigenvalue Problems Here A is a given
More informationExtreme Values and Positive/ Negative Definite Matrix Conditions
Extreme Values and Positive/ Negative Definite Matrix Conditions James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University November 8, 016 Outline 1
More informationLECTURE NOTES ELEMENTARY NUMERICAL METHODS. Eusebius Doedel
LECTURE NOTES on ELEMENTARY NUMERICAL METHODS Eusebius Doedel TABLE OF CONTENTS Vector and Matrix Norms 1 Banach Lemma 20 The Numerical Solution of Linear Systems 25 Gauss Elimination 25 Operation Count
More informationTriangular matrices and biorthogonal ensembles
/26 Triangular matrices and biorthogonal ensembles Dimitris Cheliotis Department of Mathematics University of Athens UK Easter Probability Meeting April 8, 206 2/26 Special densities on R n Example. n
More informationNumerical Linear Algebra
University of Alabama at Birmingham Department of Mathematics Numerical Linear Algebra Lecture Notes for MA 660 (1997 2014) Dr Nikolai Chernov April 2014 Chapter 0 Review of Linear Algebra 0.1 Matrices
More informationMATRICES ARE SIMILAR TO TRIANGULAR MATRICES
MATRICES ARE SIMILAR TO TRIANGULAR MATRICES 1 Complex matrices Recall that the complex numbers are given by a + ib where a and b are real and i is the imaginary unity, ie, i 2 = 1 In what we describe below,
More informationOrthogonal Polynomials and Gaussian Quadrature
Orthogonal Polynomials and Gaussian Quadrature 1. Orthogonal polynomials Given a bounded, nonnegative, nondecreasing function w(x) on an interval, I of the real line, we consider the Hilbert space L 2
More information96 CHAPTER 4. HILBERT SPACES. Spaces of square integrable functions. Take a Cauchy sequence f n in L 2 so that. f n f m 1 (b a) f n f m 2.
96 CHAPTER 4. HILBERT SPACES 4.2 Hilbert Spaces Hilbert Space. An inner product space is called a Hilbert space if it is complete as a normed space. Examples. Spaces of sequences The space l 2 of square
More informationChapter 7: Bounded Operators in Hilbert Spaces
Chapter 7: Bounded Operators in Hilbert Spaces I-Liang Chern Department of Applied Mathematics National Chiao Tung University and Department of Mathematics National Taiwan University Fall, 2013 1 / 84
More informationCALCULUS JIA-MING (FRANK) LIOU
CALCULUS JIA-MING (FRANK) LIOU Abstract. Contents. Power Series.. Polynomials and Formal Power Series.2. Radius of Convergence 2.3. Derivative and Antiderivative of Power Series 4.4. Power Series Expansion
More informationChapter 2. Linear Algebra. rather simple and learning them will eventually allow us to explain the strange results of
Chapter 2 Linear Algebra In this chapter, we study the formal structure that provides the background for quantum mechanics. The basic ideas of the mathematical machinery, linear algebra, are rather simple
More information22.3. Repeated Eigenvalues and Symmetric Matrices. Introduction. Prerequisites. Learning Outcomes
Repeated Eigenvalues and Symmetric Matrices. Introduction In this Section we further develop the theory of eigenvalues and eigenvectors in two distinct directions. Firstly we look at matrices where one
More informationExponential tail inequalities for eigenvalues of random matrices
Exponential tail inequalities for eigenvalues of random matrices M. Ledoux Institut de Mathématiques de Toulouse, France exponential tail inequalities classical theme in probability and statistics quantify
More information1.4 Complex random variables and processes
.4. COMPLEX RANDOM VARIABLES AND PROCESSES 33.4 Complex random variables and processes Analysis of a stochastic difference equation as simple as x t D ax t C bx t 2 C u t can be conveniently carried over
More informationThe Dirichlet s P rinciple. In this lecture we discuss an alternative formulation of the Dirichlet problem for the Laplace equation:
Oct. 1 The Dirichlet s P rinciple In this lecture we discuss an alternative formulation of the Dirichlet problem for the Laplace equation: 1. Dirichlet s Principle. u = in, u = g on. ( 1 ) If we multiply
More informationRepeated Eigenvalues and Symmetric Matrices
Repeated Eigenvalues and Symmetric Matrices. Introduction In this Section we further develop the theory of eigenvalues and eigenvectors in two distinct directions. Firstly we look at matrices where one
More informationLecture 12: Detailed balance and Eigenfunction methods
Miranda Holmes-Cerfon Applied Stochastic Analysis, Spring 2015 Lecture 12: Detailed balance and Eigenfunction methods Readings Recommended: Pavliotis [2014] 4.5-4.7 (eigenfunction methods and reversibility),
More informationElements of Positive Definite Kernel and Reproducing Kernel Hilbert Space
Elements of Positive Definite Kernel and Reproducing Kernel Hilbert Space Statistical Inference with Reproducing Kernel Hilbert Space Kenji Fukumizu Institute of Statistical Mathematics, ROIS Department
More informationMatrices and Vectors. Definition of Matrix. An MxN matrix A is a two-dimensional array of numbers A =
30 MATHEMATICS REVIEW G A.1.1 Matrices and Vectors Definition of Matrix. An MxN matrix A is a two-dimensional array of numbers A = a 11 a 12... a 1N a 21 a 22... a 2N...... a M1 a M2... a MN A matrix can
More informationProblem 1A. Find the volume of the solid given by x 2 + z 2 1, y 2 + z 2 1. (Hint: 1. Solution: The volume is 1. Problem 2A.
Problem 1A Find the volume of the solid given by x 2 + z 2 1, y 2 + z 2 1 (Hint: 1 1 (something)dz) Solution: The volume is 1 1 4xydz where x = y = 1 z 2 This integral has value 16/3 Problem 2A Let f(x)
More informationA linear algebra proof of the fundamental theorem of algebra
A linear algebra proof of the fundamental theorem of algebra Andrés E. Caicedo May 18, 2010 Abstract We present a recent proof due to Harm Derksen, that any linear operator in a complex finite dimensional
More information2-Dimensional Density Matrices
A Transformational Property of -Dimensional Density Matrices Nicholas Wheeler January 03 Introduction. This note derives from recent work related to decoherence models described by Zurek and Albrecht.
More informationf (x) = k=0 f (0) = k=0 k=0 a k k(0) k 1 = a 1 a 1 = f (0). a k k(k 1)x k 2, k=2 a k k(k 1)(0) k 2 = 2a 2 a 2 = f (0) 2 a k k(k 1)(k 2)x k 3, k=3
1 M 13-Lecture Contents: 1) Taylor Polynomials 2) Taylor Series Centered at x a 3) Applications of Taylor Polynomials Taylor Series The previous section served as motivation and gave some useful expansion.
More informationThe Simple Harmonic Oscillator
The Simple Harmonic Oscillator Asaf Pe er 1 November 4, 215 This part of the course is based on Refs [1] [3] 1 Introduction We return now to the study of a 1-d stationary problem: that of the simple harmonic
More informationMarkov operators, classical orthogonal polynomial ensembles, and random matrices
Markov operators, classical orthogonal polynomial ensembles, and random matrices M. Ledoux, Institut de Mathématiques de Toulouse, France 5ecm Amsterdam, July 2008 recent study of random matrix and random
More informationSPECTRAL THEOREM FOR COMPACT SELF-ADJOINT OPERATORS
SPECTRAL THEOREM FOR COMPACT SELF-ADJOINT OPERATORS G. RAMESH Contents Introduction 1 1. Bounded Operators 1 1.3. Examples 3 2. Compact Operators 5 2.1. Properties 6 3. The Spectral Theorem 9 3.3. Self-adjoint
More information4. Ergodicity and mixing
4. Ergodicity and mixing 4. Introduction In the previous lecture we defined what is meant by an invariant measure. In this lecture, we define what is meant by an ergodic measure. The primary motivation
More information1 Math 241A-B Homework Problem List for F2015 and W2016
1 Math 241A-B Homework Problem List for F2015 W2016 1.1 Homework 1. Due Wednesday, October 7, 2015 Notation 1.1 Let U be any set, g be a positive function on U, Y be a normed space. For any f : U Y let
More informationWigner s semicircle law
CHAPTER 2 Wigner s semicircle law 1. Wigner matrices Definition 12. A Wigner matrix is a random matrix X =(X i, j ) i, j n where (1) X i, j, i < j are i.i.d (real or complex valued). (2) X i,i, i n are
More informationChapter Two Elements of Linear Algebra
Chapter Two Elements of Linear Algebra Previously, in chapter one, we have considered single first order differential equations involving a single unknown function. In the next chapter we will begin to
More informationFrom random matrices to free groups, through non-crossing partitions. Michael Anshelevich
From random matrices to free groups, through non-crossing partitions Michael Anshelevich March 4, 22 RANDOM MATRICES For each N, A (N), B (N) = independent N N symmetric Gaussian random matrices, i.e.
More information0.1 Rational Canonical Forms
We have already seen that it is useful and simpler to study linear systems using matrices. But matrices are themselves cumbersome, as they are stuffed with many entries, and it turns out that it s best
More informationMath 554 Qualifying Exam. You may use any theorems from the textbook. Any other claims must be proved in details.
Math 554 Qualifying Exam January, 2019 You may use any theorems from the textbook. Any other claims must be proved in details. 1. Let F be a field and m and n be positive integers. Prove the following.
More informationLecture 9: Eigenvalues and Eigenvectors in Classical Mechanics (See Section 3.12 in Boas)
Lecture 9: Eigenvalues and Eigenvectors in Classical Mechanics (See Section 3 in Boas) As suggested in Lecture 8 the formalism of eigenvalues/eigenvectors has many applications in physics, especially in
More informationCHAPTER 8. Smoothing operators
CHAPTER 8 Smoothing operators Lecture 8: 13 October, 2005 Now I am heading towards the Atiyah-Singer index theorem. Most of the results proved in the process untimately reduce to properties of smoothing
More information