CHAPTER 3. GOE and GUE
|
|
- Suzanna Pope
- 5 years ago
- Views:
Transcription
1 CHAPTER 3 GOE ad GUE We quicly recall that a GUE matrix ca be defied i the followig three equivalet ways. We leave it to the reader to mae the three aalogous statemets for GOE. I the previous chapters, GOE ad GUE matrices appeared merely as special cases of Wiger matrices for which computatios were easier. However they have a great may eat properties ot shared by other Wiger matrices. The mai fact is that the exact desity of eigevalues of GOE ad GUE ca be foud explicitly! Ad eve more surprisigly, these exact desities have a ice structure that mae them ameable to computatios. May results that are true for geeral Wiger matrices are much harder to prove i geeral but fairly easy for these two cases. Crucial to the itegrability properties of GOE ad GUE are their ivariace uder orthogoal ad uitary cojugatios respectively. Exercise 46. (a) Let X ad Y be GUE ad GOE matrices respectively. The, for ay fixed U U() ad P O(), we have U XU d = X ad P t YP d = Y. (b) If X is a radom matrix such that X i, j, i j are idepedet real valued etries ad suppose that PXP t d = X for all P O(), the show that X has the same distributio as c X where c is a costat ad X is a GOE matrix. The aalogous statemet for uitary ivariace is also true. Remar 47. This is aalogous to the followig well ow fact. Let X be a radom vector i R. The the followig are equivalet. (1) X N (0,σ 2 I) for some σ 2. (2) X are idepedet ad PX d = X for ay P O(). To see that the secod implies the first, tae for P a orthogoal matrix whose first colum is (1/ 2,1/ 2,0,...,0) to get X 1 d =(X1 +X 2 )/ 2. Further, X 1,X 2 are i.i.d - idepedece is give, ad choosig P to be a permutatio matrix we get idetical distributios. It is well ow that the oly solutios to this distributioal equatio are the N(0,σ 2 ) distributios. If ot coviced, use characteristic fuctios or otherwise show this fact. What is the use of uitary or orthogoal ivariace? Write the spectral decompositio of a GUE matrix X = V DV. For ay fixed U U(), the UXU =(UV)D(UV). By the uitary ivariace, we see that V DV has the same distributio as (UV)D(UV). This suggests that V ad D are idepedet. The oly hitch i this reasoig is that the spectral decompositio is ot exactly uique, but it ca be tae care of 1 1 The eigespace for a give eigevalue is well-defied. This is the source of o-uiqueess. The set S of Hermitia matrices havig distict eigevalues is a dese ope set i the space of all Hermitia matrices. Therefore, almost surely, a GUE matrix has o eigevalues of multiplicity more tha oe (explai why). However, eve whe the eigespace is oe dimesioal, we ca multiply the eigevector by e iθ for some θ R ad that leads to o-uiqueess. To fix this, let D() be the group of diagoal uitary matrices ad cosider the quotiet space Q = U()/D() cosistig of right cosets. The, the mappig X ([V ],D) is oe to oe ad oto o S. Now observe that for ay U, ([UV],D) d = ([V ],D) ad hece [V ] ad D are idepedet. 29
2 30 3. GOE AND GUE 1. Tridiagoalizatio Let A be a GOE. Write it as [ ] a u t A = u B so that a N(0,2), u N 1 (0,I), B GOE 1, ad all three are idepedet. Coditio o u. The pic ay orthogoal matrix P O( 1) such that Pu = u e 1. To be specific, we ca tae the trasformatio defied by Pv = v 2 v,w w,w w, with w = u e 1. For ay w 0, the trasformatio defied o the left is the reflectio across the hyperplae perpedicular to w. These are also referred to as Householder reflectios. Chec that P is ideed uitary ad that Pu = e 1. Sice P depeds o u ad B is idepedet of U, the orthogoal ivariace of GOE shows that A 1 := P t BP = d B, that is A 1 is a GOE matrix. Also A 1 is idepedet of u ad a. Thus, [ ][ ][ ] [ 1 0 t a u t 1 0 t a r C := 0 P t = 1 e t ] 1 u B 0 P r 1 e 1 A 1 where A 1 GOE 1, a N(0,1) ad r 1 = u are all idepedet. Sice C is a orthogoal cojugatio of A, the eigevalues of A ad C are exactly the same. Observe that C j,1 = C 1, j = 0 for 2 j. Note that r1 2 = u 2 has χ 2 1 distributio. Now A 1 is a GOE matrix of oe less order. We ca play the same game with A 1 ad get a matrix D which is cojugate to A 1 but has D 1, j = D j,1 = 0 for 2 j 1. Combiig with the previous oe, we get C 2 := a r 1 0 t r 1 a r 2 e t 1 0 r 2 e 1 D with the followig properties. C 2 is cojugate to A ad hece has the same eigevalues. D GOE 2, a,a N(0,2), r1 2 χ2 1, r2 2 χ2 2, ad all these are idepedet. It is clear that this procedure ca be cotiued ad we ed up with a tridiagoal matrix that is orthogoally cojugate to A ad such that a 1 b b 1 a 2 b b 2 a 3 b (20) T = b 2 a 1 b b 1 a where a N(0,2), b 2 χ2, ad all these are idepedet. Exercise 48. If A is a GUE matrix, show that A is cojugate to a tridiagoal matrix T as i (20) where a,b are all idepedet, a N(0,1) ad b 2 Gamma(,1). Recall that χ 2 p is the same as Gamma( p 2, 1 2 ) or equivaletly, the distributio of 2Y where Y Gamma( p 2 ). Thus, we arrive at the followig theorem2. 2 The idea of tridiagoalizig the GOE ad GUE matrices was origially due to Hale Trotter?. Part of his origial motivatio was to give a simple proof of the semicircle law for GOE ad GUE matrices.
3 2. TRIDIAGONAL MATRICES AND PROBABILITY MEASURES ON THE LINE 31 Theorem 49. Let T be a tridiagoal matrix as i (20) where a,b are all idepedet. (1) If a N(0,2) ad b 2 χ2, the the vector of eigevalues of T has the same distributio as the vector of eigevalues of a GOE matrix. (2) If a N(0,2) ad b 2 χ2 2( ), the the vector of eigevalues of T has the same distributio as the eigevalues of a GUE matrix scaled by a factor of Tridiagoal matrices ad probability measures o the lie Our objective is to fid eigevalue desity for certai radom matrices, ad hece we must fid 1 auxiliary parameters i additio to the eigevalues (sice there are 2 1 parameters i the tridiagoal matrix) to carry out the Jacobia computatio. The short aswer is that if UDU is the spectral decompositio of the tridiagoal matrix, the p j = U 1, j 2,1 j 1 are the right parameters to choose. However, there are may coceptual reasos behid this choice ad we shall sped the rest of this sectio o these cocepts. Fix 1 ad write T = T (a,b) for the real symmetric tridiagoal matrix with diagoal etries T, = a for 1 ad T,+1 = T +1, = b for 1 1. Let T be the space of all real symmetric tridiagoal matrices ad let T 0 be those T (a,b) i T with distict eigevalues. Let P be the space of all probability measures o R whose support cosists of at most distict poits ad let P 0 be those elemets of P whose support has exactly distict poits. Tridiagoal matrix to probability measure: Recall that the spectral measure of a Hermitia operator T at a vector v is the uique measure ν o R such that T p v,v = R x p ν(dx) for all p 0. For example, if T is a real symmetric matrix, write its spectral decompositio as T = λ u u. The {u } is a ONB of R ad λ are real. I this case, the spectral decompositio of T at ay v R is just ν = v,u 2 δ λ. Thus ν P (observe that the support may have less tha poits as eigevalues may coicide). I particular, the spectral measure of T at e 1 is p j δ λ j where p j = U 1, j 2 (here U 1, j is the first co-ordiate of u j ). Give a real symmetric tridiagoal matrix T, let ν T be the spectral measure of T at the stadard uit vector e 1. This gives a mappig from T ito P which maps T 0 ito P 0. Probability measure to Tridiagoal matrix: Now suppose a measure µ P 0 is give. Write µ = p 1 δ λ p δ λ where λ j are distict real umbers ad p j > 0. Its momets are give by α = p j λ j. Let h (x) =x, so that {h 0,h 1,...,h 1 } is a basis for L 2 (µ) (how do you express h as a liear combiatio of h 0,...,h 1?). Apply Gram-Schmidt to the sequece h 0,h 1,... by settig ϕ 0 = ψ 0 = h 0, ad for 1 iductively by 1 ψ = h j=0 ψ h,ϕ j ϕ j, ϕ =. ψ L 2 (µ) This process is stopped whe ψ = 0. Here are some elemetary observatios. (a) Sice {h 0,...,h 1 } is a liear basis for L 2 (µ), it follows that {ϕ 0,...,ϕ 1 } are welldefied ad form a ONB for L 2 (µ). (b) For 0 1, ϕ is a polyomial of degree ad is orthogoal to all polyomials of degree less tha. (c) As h is a liear combiatio of h 0,...,h 1 (i L 2 (µ)), we see that ψ is well-defied but ψ = 0 ad hece ϕ is ot defied. Note that ψ = 0 meas that ψ (λ )=0
4 32 3. GOE AND GUE for all, ot that ψ is the zero polyomial. I fact, ψ is moic, has degree ad vaishes at λ,, which implies that ψ (λ)= j=1 (λ λ j). Fix 0 1 ad expad xϕ (x) as xϕ (x) L2 (µ) = c, j ϕ j (x), c, j = xϕ (x)ϕ j (x)dµ(x). j=0 Now, xϕ j (x) has degree less tha if j < ad xϕ (x) has degree less tha j if < j. Hece, c, j = 0 if j 2 or if j + 2. Further, c,+1 = c +1, as both are equal to R xϕ (x)ϕ +1 (x)dµ(x). Thus, we get the three term recurreces (21) L 2 (µ) xϕ (x) = b 1 ϕ 1 (x)+a ϕ (x)+b ϕ +1 (x), 0 where a = xϕ (x) 2 dµ(x), b = xϕ (x)ϕ +1 (x)dµ(x). We adopt the covetio that ϕ 1, ϕ, b 1 ad b 1 are all zero, so that these recurreces also hold for = 0 ad =. Sice ϕ all have positive leadig co-efficiets, it is ot hard to see that b is oegative. From µ P 0 we have thus costructed a tridiagoal matrix T µ := T (a,b) T (cautio: here we have idexed a,b startig from = 0). If µ P 0 m for some m <, the T µ costructed as before will have size m m. Exted this by paddig m colums ad rows of zeros to get a real symmetric tridiagoal matrix (we abuse otatio ad deote it as T µ agai) i T. Thus we get a mappig µ T µ from P ito T. The followig lemma shows that T ν T is a bijectio, ad relates objects defied o oe side (matrix etries, characteristic polyomials, eigevalues) to objects defied o the other side (the support {λ j }, the weights p j, associated orthogoal polomials). Lemma 50. Fix 1. (a) The mappig T ν T is a bijectio from T 0 ito P 0 whose iverse is µ T µ. (b) Let T = T (a,b) ad let µ = ν T. For 0 1 P be the characteristic polyomial of the top pricipal submatrix of T ad let ψ,ϕ be as costructed earlier. The ψ = P for ad hece there exist costats d such that ϕ = d P (for 1). (c) The zeros of ϕ are precisely the eigevalues of T. (d) If T = T (a,b) ad ν T = p jδ λ j, the (22) I particular, T 0 b 2( +1) = p λ i λ j 2. i< j gets mapped ito P 0 (but ot oto). PROOF. (a) Let µ = j=1 p jδ λ j P ad let T = T µ. For 0 1, let u =( p 1 ϕ 0 (λ ),..., p ϕ 1 (λ )) t. The three-term recurreces ca be writte i terms of T as T u = λ u. Thus, u is a eigevector of T with eigevalue λ. If U is the matrix with colums u, the the rows of U are orthoormal because ϕ are orthogoal polyomials of µ. Thus UU = I ad hece also U U = I, that is {u } is a ONB of R. Cosequetly, T = λ u u is the spectral decompositio of T. I particular, T p e 1 =,1 u 2 λ p = p λ p
5 3. TRIDIAGONAL MATRIX GENERALITIES 33 because u,1 = p ϕ 0 (λ )= p (as h 0 = 1 is already of uit orm i L 2 (µ) ad hece after Gram-Schmidt ϕ 0 = h 0 ). Thus, T p e 1,e 1 = R x p µ(dx) which shows that ν T = µ. This proves the first part of the lemma. (b) We saw earlier that ϕ is zero i L 2 (µ). Hece ϕ (λ j )=0 for 1 j. Thus, ϕ ad P are o-zero polyomials of degree both of which vaish at the same poits. Hece, ϕ = d P for some costat P. If S is the top pricipal submatrix of T, the it is easy to see that the first orthogoal polyomials of ν S are the same as ϕ 0,...,ϕ (which were obtaied as orthogoal polyomials of ν T ). This is easy to see from the three-term recurreces. Thus the above fact shows ϕ = d P for some costat d. (c) By the first part, ν T = p j δ λ j where λ j are the eigevalues of T ad p j > 0. The footote o the previous page also shows that ϕ vaishes at λ j, j. Sice it has degree, ϕ has oly these zeros. (d) This proof is tae from Forrester s boo. Let T deote the bottom ( ) ( ) pricipal submatrix of T. Let Q be its characteristic polyomial ad let λ () j,1 j be its eigevalues. I particular, T 0 = T. If T = λ u u is the spectral decompositio of T ad λ is ot a eigevalue of T, the (λi T ) 1 = (λ λ ) 1 u u. Hece, (λi T )1,1 = (λi T ) 1 e 1,e 1 = j p j (λ λ j ) 1 for λ {λ j }. But we also ow that (λi T ) 1,1 is equal to det(λi T 1 )/det(λi T )=Q 1 (λ)/q 0 (λ). Let λ approach λ to see that (23) p = lim λ λ (λ λ )(λi T ) 1,1 = lim λ λ (λ λ ) Q 1(λ) Q 0 (λ) = Q 1 (λ ). (λ λ j ) j=1 j Tae product over to get (the left side is positive, hece absolute values o the right) p i< j (λ i λ j ) 2 = Q 1 (λ (0) ). Let A be ay matrix with characteristic polyomial χ A ad eigevalues λ i. Let B be a m m matrix with characteristic polyomial χ B ad eigevalues µ j. The we have the obvious idetity i=1 Apply to T 0 ad T 1 to get χ B (λ i ) = m i=1 j=1 Q 1 (λ (0) µ j λ i = ) = 1 by the first row, we also have the idetity m j=1 Q 0 (λ) = (λ a 1 )Q 1 (λ) b 2 1Q 2 (λ). Therefore Q 0 (λ (1) )=b 2 1 Q 2(λ (1) ) for 1. Thus χ A (µ j ). Q 0 (λ (1) ). But by expadig det(λi T ) Q 1 (λ (0) ) = b Q 2 (λ (1) ). The right side is of a similar form to the left side, with matrix size reduced by oe. Thus, iductively we get Q 1(λ (0) ) = 1 b2 2. Pluggig ito (23) we get the statemet of the lemma. 3. Tridiagoal matrix geeralities Fix 1 ad write T = T (a,b) for the real symmetric tridiagoal matrix with diagoal etries T, = a for 1 ad T,+1 = T +1, = b for 1 1. Let T
6 34 3. GOE AND GUE be the space of all real symmetric tridiagoal matrices ad let T 0 be those T (a,b) i T with b strictly positive. Let P be the space of all probability measures o R whose support cosists of at most distict poits ad let P 0 be those elemets of P whose support has exactly distict poits. Give a real symmetric tridiagoal matrix T, let ν T be the spectral measure of T at the stadard uit vector e 3 1. This gives a mappig from T ito P. For future purpose, we also give the followig idea to fid eigevalues of T. Fix some λ R ad suppose we wat to fid a vector v such that T v = λv. This meas b 1 v 1 + a v + b v +1 = λv = v +1 = λv b 1 v 1 a v b. where we adopt the covetio that b 0 = 0. We have also assumed that b 0 for all (if b = 0, the matrix splits ito a direct sum of two matrices). Thus, we set v 1 = x to be arbitrary (o-zero)ad solve for v 1,v 2,... successively. Deote these as v 1 (x),v 2 (x),... Therefore, Now suppose a measure µ P 0 is give. We ca costruct a tridiagoal matrix T as follows. Write µ = p 1 δ λ p δ λ where λ j are distict real umbers ad p j > 0. The momets are give by α = p j λ j. Let h (x)=x, so that {h 0,h 1,...,h 1 } is a basis for L 2 (µ). [Q: How do you express h as a liear combiatio of h 0,...,h 1?]. Apply Gram-Schmidt to the sequece h 0,h 1,... to get a orthoormal basis {ϕ :0 1} of L 2 (µ). It is easy to see that ϕ is a polyomial of degree exactly, ad is orthogoal to all polyomials of degree less tha. Fix ay ad write xϕ (x) L2 (µ) = j=0 c, j ϕ j (x), c, j = xϕ (x)ϕ j (x)dµ(x). Now, xϕ j (x) has degree less tha if j < ad xϕ (x) has degree less tha j if < j. Hece, c, j = 0 if j 2 or if j + 2. Further, c,+1 = c +1, as both are equal to R xϕ (x)ϕ +1 (x)dµ(x). Thus, we get the three term recurreces (24) L 2 (µ) xϕ (x) = b 1 ϕ 1 (x)+a ϕ (x)+b ϕ +1 (x), 0 where a = xϕ (x) 2 dµ(x), b = xϕ (x)ϕ +1 (x)dµ(x). We adopt the covetio that ϕ 1, ϕ, b 1 ad b 1 are all zero, so that these recurreces also hold for = 0 ad =. From µ P 0 we have thus costructed a tridiagoal matrix T µ := T (a,b) T (cautio: here we have idexed a,b startig from = 0). If µ P 0 m for some m <, the T µ costructed as before will have size m m. Exted this by paddig m colums ad rows of zeros to get a real symmetric tridiagoal matrix (we abuse otatio ad deote it as T µ agai) i T. Thus we get a mappig µ T µ from P ito T. Lemma 51. Fix 1. (a) The mappig T ν T is a bijectio from T ito P whose iverse is µ T µ. 3 The spectral measure of a Hermitia operator T at a vector v is the uique measure ν o R such that T p v,v = R x p ν(dx) for all p 0. For example, if T is a real symmetric matrix, write its spectral decompositio as T = λ u u. The {u } is a ONB of R ad λ are real. I this case, the spectral decompositio of T at ay v R is just ν = v,u 2 δ λ. Thus ν P (observe that the support may have less tha poits as eigevalues may coicide). I particular, if T = UDU the spectral measure of T at e 1 is ν T = p i δ λi, where p i = U 1,i 2.
7 4. MORE ON TRIDIAGONAL OPERATORS* 35 (b) Let µ = ν T. Write P for the characteristic polyomial of the top submatrix of T for ad let ϕ be the orthogoal polyomials for µ as defied earlier. The ϕ = d P for for costats d. I particular, zeros of ϕ are precisely the eigevalues of T. (c) If T = T (a,b) ad µ = p jδ λ j correspod to each other i this bijectio, the (25) I particular, T 0 b 2( +1) = p λ i λ j 2. i< j gets mapped ito P 0 (but ot oto). PROOF. (a) Let µ = j=1 p jδ λ j P ad let T = T µ. For 0 1, let u =( p 1 ϕ 0 (λ ),..., p ϕ 1 (λ )) t. The three-term recurreces ca be writte i terms of T as T u = λ u. Thus, u is a eigevector of T with eigevalue λ. If U is the matrix with colums u, the the rows of U are orthoormal because ϕ are orthogoal polyomials of µ. Thus UU = I ad hece also U U = I, that is {u } is a ONB of R. Cosequetly, T = λ u u is the spectral decompositio of T. I particular, T p e 1 =,1 u 2 λ p = p λ p because u,1 = p ϕ 0 (λ )= p (h 0 = 1 is already of uit orm i L 2 (µ) ad hece after Gram-Schmidt ϕ 0 = h 0 ). Thus, T p e 1,e 1 = R x p µ(dx) which shows that ν T = µ. This proves the first part of the lemma. (b) By part (a), the coefficiets i the three term recurrece (24) are precisely the etries of T. Note that the equality i (24) is i L 2 (µ), which meas the same as sayig that equality holds for x = λ,1. Here is a way to fid T (c) Let A be ay matrix with characteristic polyomial χ A ad eigevalues λ i. Let B be a m m matrix with characteristic polyomial χ B ad eigevalues µ j. The we have the obvious idetity i=1 χ B (λ i )= m i=1 j=1 (µ j λ i ) = ( 1) m m χ A (µ j ) If b are all positive, the right had side of (??) is o-zero ad hece λ must be distict. This shows that T 0 gets mapped ito P 0. It is obviously ot oto (why?). Lemma 52. For T = T (a,b) havig the spectral measure +1 j=1 p iδ λ j at e 0, we have the idetity 1 =0 b 2(+1 ) +1 = i=1 p i j=1 (λ i λ j ) 2. i< j More o tridiagoal operators* This sectio may be omitted as we shall ot use the cotets i this course. However, as we are this close to a very rich part of classical aalysis, we state a few iterestig facts. The followig four objects are show to be itimately coected. (1) Positive measures µ P (R) havig all momets.
8 36 3. GOE AND GUE (2) Positive defiite sequeces α =(α ) 0 such that (α i+ j ) i, j 0 is o-egative defiite (that is every pricipal submatrix has o-egative determiat). (3) Orthogoal polyomials. Give a ier product o the vector space of all polyomials, oe ca obtai a orthoormal basis {ϕ } by applyig Gram-Schmidt process to the basis {h } 0 where h (x)=x. The sequece {ϕ } (which may be fiite) is called a orthogoal polyomial sequece. (4) Real symmetric tridiagoal matrices. We ow cosider semi-ifiite matrices, that is T, = a, T,+1 = T +1, = b, for 0. Fiite matrices are a subset of these, by paddig them with zeros at the ed. Measure to Positive defiite sequeces: If µ is a measure that has all momets, defie the momet sequece α = R x dµ(x). The for ay for ay m 1 ad ay u R m+1, we have u t (α i+ j ) 0 i, j m u = α i+ j u i u j = u i x i 2 µ(dx) 0. i, j m i=0 Hece α is a positive defiite sequece. It is easy to see that µ is fiitely supported if ad oly L 2 (µ) is fiite dimesioal if ad oly if (α i+ j ) i, j 0 has fiite ra. Positive defiite sequece to orthogoal polyomials: Let α be a positive defiite sequece For simplicity we assume that (α i+ j ) i, j 0 is strictly positive defiite. The the formulas h i,h j = α i+ j defie a valid ier product o the vector space P of all polyomials. Complete P uder this ier product to get a Hilbert space H. I H, h are liearly idepedet ad their spa (which is P ) is dese. Hece, applyig Gram-Schmidt procedure to the sequece h 0,h 1,... give a sequece of polyomials ϕ 0,ϕ 2,... which form a orthoormal basis for H. Clearly ϕ has degree. Orthogoal polyomials to tridiagoal matrices: Let ϕ be a ifiite sequece of polyomials such that ϕ has degree exactly. The it is clear that ϕ are liearly idepedet, that h is a liear combiatio of ϕ 0,...,ϕ. Cosider a ier product o P such that ϕ,ϕ l = δ,l. The same reasoig as before gives the three term recurreces (24) for ϕ. Thus we get a R ad b > 0, 0. Form the ifiite real symmetric tridiagoal matrix T = T (a,b). Symmetric tridiagoal operators to measures: Let T be a semi-ifiite real symmetric tridiagoal matrix. Let e be the co-ordiate vectors i l 2 (N). Let D = {x e : x 0 fiitely ofte}. This is a dese subspace of l 2 (N). T is clearly well-defied ad liear o D. It is symmetric i the sese that Tu,v = u,tv for all u,v D ad the ier product is i l 2 (N). Suppose T is a self-adjoig extesio of T. That is, there is a subspace D cotaiig D ad a liear operator T : D R such that T D = T ad such that T is self-adjoit (we are talig about ubouded operators o Hilbert spaces, hece self-adjoitess ad symmetry are two distict thigs, ad this is ot the place to go ito the defiitios. Cosult for example, chapter 13 of Rudi s Fuctioal Aalysis). The it is a fact that T has a spectral decompositio. The spectral measure of T at e 0 is a measure. I geeral there ca be more tha oe extesio. If the extesio is uique, the µ is uiquely defied. This cycle of coectios is quite deep. For example, if we start with ay positive defiite sequece α ad go through this cycle, we get a OP sequece ad a tridiagoal symmetric operator. The spectral measure of ay self-adjoit extesio of this operator has the momet sequece α. Further, there is a uique measure with momets α if ad oly if T has a uique self-adjoit extesio!
9 4. MORE ON TRIDIAGONAL OPERATORS* 37 Remar 53. I the above discussio we assumed that α is a strictly positive defiite sequece, which is the same as sayig that the measure does ot have fiite support or that the orthogoal polyomial sequece is fiite or that the tridigoal matrix is essetially fiite. If we start with a fiitely supported measure, we ca still go through this cycle, except that the Gram-Schmidt process stops at some fiite etc.
Apply change-of-basis formula to rewrite x as a linear combination of eigenvectors v j.
Eigevalue-Eigevector Istructor: Nam Su Wag eigemcd Ay vector i real Euclidea space of dimesio ca be uiquely epressed as a liear combiatio of liearly idepedet vectors (ie, basis) g j, j,,, α g α g α g α
More information1 Last time: similar and diagonalizable matrices
Last time: similar ad diagoalizable matrices Let be a positive iteger Suppose A is a matrix, v R, ad λ R Recall that v a eigevector for A with eigevalue λ if v ad Av λv, or equivaletly if v is a ozero
More information5.1. The Rayleigh s quotient. Definition 49. Let A = A be a self-adjoint matrix. quotient is the function. R(x) = x,ax, for x = 0.
40 RODICA D. COSTIN 5. The Rayleigh s priciple ad the i priciple for the eigevalues of a self-adjoit matrix Eigevalues of self-adjoit matrices are easy to calculate. This sectio shows how this is doe usig
More informationSingular value decomposition. Mathématiques appliquées (MATH0504-1) B. Dewals, Ch. Geuzaine
Lecture 11 Sigular value decompositio Mathématiques appliquées (MATH0504-1) B. Dewals, Ch. Geuzaie V1.2 07/12/2018 1 Sigular value decompositio (SVD) at a glace Motivatio: the image of the uit sphere S
More informationInverse Matrix. A meaning that matrix B is an inverse of matrix A.
Iverse Matrix Two square matrices A ad B of dimesios are called iverses to oe aother if the followig holds, AB BA I (11) The otio is dual but we ofte write 1 B A meaig that matrix B is a iverse of matrix
More informationMatrix Algebra from a Statistician s Perspective BIOS 524/ Scalar multiple: ka
Matrix Algebra from a Statisticia s Perspective BIOS 524/546. Matrices... Basic Termiology a a A = ( aij ) deotes a m matrix of values. Whe =, this is a am a m colum vector. Whe m= this is a row vector..2.
More informationMath Solutions to homework 6
Math 175 - Solutios to homework 6 Cédric De Groote November 16, 2017 Problem 1 (8.11 i the book): Let K be a compact Hermitia operator o a Hilbert space H ad let the kerel of K be {0}. Show that there
More information5 Birkhoff s Ergodic Theorem
5 Birkhoff s Ergodic Theorem Amog the most useful of the various geeralizatios of KolmogorovâĂŹs strog law of large umbers are the ergodic theorems of Birkhoff ad Kigma, which exted the validity of the
More informationLECTURE 8: ORTHOGONALITY (CHAPTER 5 IN THE BOOK)
LECTURE 8: ORTHOGONALITY (CHAPTER 5 IN THE BOOK) Everythig marked by is ot required by the course syllabus I this lecture, all vector spaces is over the real umber R. All vectors i R is viewed as a colum
More informationAbstract Vector Spaces. Abstract Vector Spaces
Astract Vector Spaces The process of astractio is critical i egieerig! Physical Device Data Storage Vector Space MRI machie Optical receiver 0 0 1 0 1 0 0 1 Icreasig astractio 6.1 Astract Vector Spaces
More information4 The Sperner property.
4 The Sperer property. I this sectio we cosider a surprisig applicatio of certai adjacecy matrices to some problems i extremal set theory. A importat role will also be played by fiite groups. I geeral,
More informationPAPER : IIT-JAM 2010
MATHEMATICS-MA (CODE A) Q.-Q.5: Oly oe optio is correct for each questio. Each questio carries (+6) marks for correct aswer ad ( ) marks for icorrect aswer.. Which of the followig coditios does NOT esure
More informationStochastic Matrices in a Finite Field
Stochastic Matrices i a Fiite Field Abstract: I this project we will explore the properties of stochastic matrices i both the real ad the fiite fields. We first explore what properties 2 2 stochastic matrices
More informationDefinition 4.2. (a) A sequence {x n } in a Banach space X is a basis for X if. unique scalars a n (x) such that x = n. a n (x) x n. (4.
4. BASES I BAACH SPACES 39 4. BASES I BAACH SPACES Sice a Baach space X is a vector space, it must possess a Hamel, or vector space, basis, i.e., a subset {x γ } γ Γ whose fiite liear spa is all of X ad
More informationSymmetric Matrices and Quadratic Forms
7 Symmetric Matrices ad Quadratic Forms 7.1 DIAGONALIZAION OF SYMMERIC MARICES SYMMERIC MARIX A symmetric matrix is a matrix A such that. A = A Such a matrix is ecessarily square. Its mai diagoal etries
More informationMath 155 (Lecture 3)
Math 55 (Lecture 3) September 8, I this lecture, we ll cosider the aswer to oe of the most basic coutig problems i combiatorics Questio How may ways are there to choose a -elemet subset of the set {,,,
More information(3) If you replace row i of A by its sum with a multiple of another row, then the determinant is unchanged! Expand across the i th row:
Math 5-4 Tue Feb 4 Cotiue with sectio 36 Determiats The effective way to compute determiats for larger-sized matrices without lots of zeroes is to ot use the defiitio, but rather to use the followig facts,
More informationMath 4707 Spring 2018 (Darij Grinberg): homework set 4 page 1
Math 4707 Sprig 2018 Darij Griberg): homewor set 4 page 1 Math 4707 Sprig 2018 Darij Griberg): homewor set 4 due date: Wedesday 11 April 2018 at the begiig of class, or before that by email or moodle Please
More informationTENSOR PRODUCTS AND PARTIAL TRACES
Lecture 2 TENSOR PRODUCTS AND PARTIAL TRACES Stéphae ATTAL Abstract This lecture cocers special aspects of Operator Theory which are of much use i Quatum Mechaics, i particular i the theory of Quatum Ope
More informationSolutions to home assignments (sketches)
Matematiska Istitutioe Peter Kumli 26th May 2004 TMA401 Fuctioal Aalysis MAN670 Applied Fuctioal Aalysis 4th quarter 2003/2004 All documet cocerig the course ca be foud o the course home page: http://www.math.chalmers.se/math/grudutb/cth/tma401/
More informationIntroduction to Optimization Techniques
Itroductio to Optimizatio Techiques Basic Cocepts of Aalysis - Real Aalysis, Fuctioal Aalysis 1 Basic Cocepts of Aalysis Liear Vector Spaces Defiitio: A vector space X is a set of elemets called vectors
More informationCHAPTER 5. Theory and Solution Using Matrix Techniques
A SERIES OF CLASS NOTES FOR 2005-2006 TO INTRODUCE LINEAR AND NONLINEAR PROBLEMS TO ENGINEERS, SCIENTISTS, AND APPLIED MATHEMATICIANS DE CLASS NOTES 3 A COLLECTION OF HANDOUTS ON SYSTEMS OF ORDINARY DIFFERENTIAL
More informationZeros of Polynomials
Math 160 www.timetodare.com 4.5 4.6 Zeros of Polyomials I these sectios we will study polyomials algebraically. Most of our work will be cocered with fidig the solutios of polyomial equatios of ay degree
More information6 Integers Modulo n. integer k can be written as k = qn + r, with q,r, 0 r b. So any integer.
6 Itegers Modulo I Example 2.3(e), we have defied the cogruece of two itegers a,b with respect to a modulus. Let us recall that a b (mod ) meas a b. We have proved that cogruece is a equivalece relatio
More informationNotes for Lecture 11
U.C. Berkeley CS78: Computatioal Complexity Hadout N Professor Luca Trevisa 3/4/008 Notes for Lecture Eigevalues, Expasio, ad Radom Walks As usual by ow, let G = (V, E) be a udirected d-regular graph with
More informationTopics in Eigen-analysis
Topics i Eige-aalysis Li Zajiag 28 July 2014 Cotets 1 Termiology... 2 2 Some Basic Properties ad Results... 2 3 Eige-properties of Hermitia Matrices... 5 3.1 Basic Theorems... 5 3.2 Quadratic Forms & Noegative
More informationMachine Learning for Data Science (CS 4786)
Machie Learig for Data Sciece CS 4786) Lecture & 3: Pricipal Compoet Aalysis The text i black outlies high level ideas. The text i blue provides simple mathematical details to derive or get to the algorithm
More informationMATH10212 Linear Algebra B Proof Problems
MATH22 Liear Algebra Proof Problems 5 Jue 26 Each problem requests a proof of a simple statemet Problems placed lower i the list may use the results of previous oes Matrices ermiats If a b R the matrix
More informationMath 61CM - Solutions to homework 3
Math 6CM - Solutios to homework 3 Cédric De Groote October 2 th, 208 Problem : Let F be a field, m 0 a fixed oegative iteger ad let V = {a 0 + a x + + a m x m a 0,, a m F} be the vector space cosistig
More information(VII.A) Review of Orthogonality
VII.A Review of Orthogoality At the begiig of our study of liear trasformatios i we briefly discussed projectios, rotatios ad projectios. I III.A, projectios were treated i the abstract ad without regard
More informationDeterminants of order 2 and 3 were defined in Chapter 2 by the formulae (5.1)
5. Determiats 5.. Itroductio 5.2. Motivatio for the Choice of Axioms for a Determiat Fuctios 5.3. A Set of Axioms for a Determiat Fuctio 5.4. The Determiat of a Diagoal Matrix 5.5. The Determiat of a Upper
More informationFor a 3 3 diagonal matrix we find. Thus e 1 is a eigenvector corresponding to eigenvalue λ = a 11. Thus matrix A has eigenvalues 2 and 3.
Closed Leotief Model Chapter 6 Eigevalues I a closed Leotief iput-output-model cosumptio ad productio coicide, i.e. V x = x = x Is this possible for the give techology matrix V? This is a special case
More informationLecture 7: Properties of Random Samples
Lecture 7: Properties of Radom Samples 1 Cotiued From Last Class Theorem 1.1. Let X 1, X,...X be a radom sample from a populatio with mea µ ad variace σ
More informationa for a 1 1 matrix. a b a b 2 2 matrix: We define det ad bc 3 3 matrix: We define a a a a a a a a a a a a a a a a a a
Math S-b Lecture # Notes This wee is all about determiats We ll discuss how to defie them, how to calculate them, lear the allimportat property ow as multiliearity, ad show that a square matrix A is ivertible
More information17. Joint distributions of extreme order statistics Lehmann 5.1; Ferguson 15
17. Joit distributios of extreme order statistics Lehma 5.1; Ferguso 15 I Example 10., we derived the asymptotic distributio of the maximum from a radom sample from a uiform distributio. We did this usig
More informationEigenvalues and Eigenvectors
5 Eigevalues ad Eigevectors 5.3 DIAGONALIZATION DIAGONALIZATION Example 1: Let. Fid a formula for A k, give that P 1 1 = 1 2 ad, where Solutio: The stadard formula for the iverse of a 2 2 matrix yields
More information2 Geometric interpretation of complex numbers
2 Geometric iterpretatio of complex umbers 2.1 Defiitio I will start fially with a precise defiitio, assumig that such mathematical object as vector space R 2 is well familiar to the studets. Recall that
More informationA brief introduction to linear algebra
CHAPTER 6 A brief itroductio to liear algebra 1. Vector spaces ad liear maps I what follows, fix K 2{Q, R, C}. More geerally, K ca be ay field. 1.1. Vector spaces. Motivated by our ituitio of addig ad
More informationLinear Regression Demystified
Liear Regressio Demystified Liear regressio is a importat subject i statistics. I elemetary statistics courses, formulae related to liear regressio are ofte stated without derivatio. This ote iteds to
More informationSequences, Series, and All That
Chapter Te Sequeces, Series, ad All That. Itroductio Suppose we wat to compute a approximatio of the umber e by usig the Taylor polyomial p for f ( x) = e x at a =. This polyomial is easily see to be 3
More informationInfinite Sequences and Series
Chapter 6 Ifiite Sequeces ad Series 6.1 Ifiite Sequeces 6.1.1 Elemetary Cocepts Simply speakig, a sequece is a ordered list of umbers writte: {a 1, a 2, a 3,...a, a +1,...} where the elemets a i represet
More information, then cv V. Differential Equations Elements of Lineaer Algebra Name: Consider the differential equation. and y2 cos( kx)
Cosider the differetial equatio y '' k y 0 has particular solutios y1 si( kx) ad y cos( kx) I geeral, ay liear combiatio of y1 ad y, cy 1 1 cy where c1, c is also a solutio to the equatio above The reaso
More information(3) If you replace row i of A by its sum with a multiple of another row, then the determinant is unchanged! Expand across the i th row:
Math 50-004 Tue Feb 4 Cotiue with sectio 36 Determiats The effective way to compute determiats for larger-sized matrices without lots of zeroes is to ot use the defiitio, but rather to use the followig
More informationAssignment 5: Solutions
McGill Uiversity Departmet of Mathematics ad Statistics MATH 54 Aalysis, Fall 05 Assigmet 5: Solutios. Let y be a ubouded sequece of positive umbers satisfyig y + > y for all N. Let x be aother sequece
More informationConvergence of random variables. (telegram style notes) P.J.C. Spreij
Covergece of radom variables (telegram style otes).j.c. Spreij this versio: September 6, 2005 Itroductio As we kow, radom variables are by defiitio measurable fuctios o some uderlyig measurable space
More informationCourse : Algebraic Combinatorics
Course 18.312: Algebraic Combiatorics Lecture Notes # 18-19 Addedum by Gregg Musier March 18th - 20th, 2009 The followig material ca be foud i a umber of sources, icludig Sectios 7.3 7.5, 7.7, 7.10 7.11,
More informationChapter 3 Inner Product Spaces. Hilbert Spaces
Chapter 3 Ier Product Spaces. Hilbert Spaces 3. Ier Product Spaces. Hilbert Spaces 3.- Defiitio. A ier product space is a vector space X with a ier product defied o X. A Hilbert space is a complete ier
More informationLinearly Independent Sets, Bases. Review. Remarks. A set of vectors,,, in a vector space is said to be linearly independent if the vector equation
Liearly Idepedet Sets Bases p p c c p Review { v v vp} A set of vectors i a vector space is said to be liearly idepedet if the vector equatio cv + c v + + c has oly the trivial solutio = = { v v vp} The
More informationRandom Matrices with Blocks of Intermediate Scale Strongly Correlated Band Matrices
Radom Matrices with Blocks of Itermediate Scale Strogly Correlated Bad Matrices Jiayi Tog Advisor: Dr. Todd Kemp May 30, 07 Departmet of Mathematics Uiversity of Califoria, Sa Diego Cotets Itroductio Notatio
More informationAdvanced Stochastic Processes.
Advaced Stochastic Processes. David Gamarik LECTURE 2 Radom variables ad measurable fuctios. Strog Law of Large Numbers (SLLN). Scary stuff cotiued... Outlie of Lecture Radom variables ad measurable fuctios.
More informationIf a subset E of R contains no open interval, is it of zero measure? For instance, is the set of irrationals in [0, 1] is of measure zero?
2 Lebesgue Measure I Chapter 1 we defied the cocept of a set of measure zero, ad we have observed that every coutable set is of measure zero. Here are some atural questios: If a subset E of R cotais a
More informationThe Discrete Fourier Transform
The Discrete Fourier Trasform Complex Fourier Series Represetatio Recall that a Fourier series has the form a 0 + a k cos(kt) + k=1 b k si(kt) This represetatio seems a bit awkward, sice it ivolves two
More information3.2 Properties of Division 3.3 Zeros of Polynomials 3.4 Complex and Rational Zeros of Polynomials
Math 60 www.timetodare.com 3. Properties of Divisio 3.3 Zeros of Polyomials 3.4 Complex ad Ratioal Zeros of Polyomials I these sectios we will study polyomials algebraically. Most of our work will be cocered
More informationLinear Elliptic PDE s Elliptic partial differential equations frequently arise out of conservation statements of the form
Liear Elliptic PDE s Elliptic partial differetial equatios frequetly arise out of coservatio statemets of the form B F d B Sdx B cotaied i bouded ope set U R. Here F, S deote respectively, the flux desity
More information6. Kalman filter implementation for linear algebraic equations. Karhunen-Loeve decomposition
6. Kalma filter implemetatio for liear algebraic equatios. Karhue-Loeve decompositio 6.1. Solvable liear algebraic systems. Probabilistic iterpretatio. Let A be a quadratic matrix (ot obligatory osigular.
More informationIntroduction to Optimization Techniques. How to Solve Equations
Itroductio to Optimizatio Techiques How to Solve Equatios Iterative Methods of Optimizatio Iterative methods of optimizatio Solutio of the oliear equatios resultig form a optimizatio problem is usually
More information(A sequence also can be thought of as the list of function values attained for a function f :ℵ X, where f (n) = x n for n 1.) x 1 x N +k x N +4 x 3
MATH 337 Sequeces Dr. Neal, WKU Let X be a metric space with distace fuctio d. We shall defie the geeral cocept of sequece ad limit i a metric space, the apply the results i particular to some special
More informationAssignment 2 Solutions SOLUTION. ϕ 1 Â = 3 ϕ 1 4i ϕ 2. The other case can be dealt with in a similar way. { ϕ 2 Â} χ = { 4i ϕ 1 3 ϕ 2 } χ.
PHYSICS 34 QUANTUM PHYSICS II (25) Assigmet 2 Solutios 1. With respect to a pair of orthoormal vectors ϕ 1 ad ϕ 2 that spa the Hilbert space H of a certai system, the operator  is defied by its actio
More informationTheorem: Let A n n. In this case that A does reduce to I, we search for A 1 as the solution matrix X to the matrix equation A X = I i.e.
Theorem: Let A be a square matrix The A has a iverse matrix if ad oly if its reduced row echelo form is the idetity I this case the algorithm illustrated o the previous page will always yield the iverse
More informationMachine Learning Theory Tübingen University, WS 2016/2017 Lecture 11
Machie Learig Theory Tübige Uiversity, WS 06/07 Lecture Tolstikhi Ilya Abstract We will itroduce the otio of reproducig kerels ad associated Reproducig Kerel Hilbert Spaces (RKHS). We will cosider couple
More informationThe multiplicative structure of finite field and a construction of LRC
IERG6120 Codig for Distributed Storage Systems Lecture 8-06/10/2016 The multiplicative structure of fiite field ad a costructio of LRC Lecturer: Keeth Shum Scribe: Zhouyi Hu Notatios: We use the otatio
More informationCALCULATION OF FIBONACCI VECTORS
CALCULATION OF FIBONACCI VECTORS Stuart D. Aderso Departmet of Physics, Ithaca College 953 Daby Road, Ithaca NY 14850, USA email: saderso@ithaca.edu ad Dai Novak Departmet of Mathematics, Ithaca College
More information6.3 Testing Series With Positive Terms
6.3. TESTING SERIES WITH POSITIVE TERMS 307 6.3 Testig Series With Positive Terms 6.3. Review of what is kow up to ow I theory, testig a series a i for covergece amouts to fidig the i= sequece of partial
More informationMatrix Algebra 2.2 THE INVERSE OF A MATRIX Pearson Education, Inc.
2 Matrix Algebra 2.2 THE INVERSE OF A MATRIX MATRIX OPERATIONS A matrix A is said to be ivertible if there is a matrix C such that CA = I ad AC = I where, the idetity matrix. I = I I this case, C is a
More informationIn number theory we will generally be working with integers, though occasionally fractions and irrationals will come into play.
Number Theory Math 5840 otes. Sectio 1: Axioms. I umber theory we will geerally be workig with itegers, though occasioally fractios ad irratioals will come ito play. Notatio: Z deotes the set of all itegers
More informationLinear regression. Daniel Hsu (COMS 4771) (y i x T i β)2 2πσ. 2 2σ 2. 1 n. (x T i β y i ) 2. 1 ˆβ arg min. β R n d
Liear regressio Daiel Hsu (COMS 477) Maximum likelihood estimatio Oe of the simplest liear regressio models is the followig: (X, Y ),..., (X, Y ), (X, Y ) are iid radom pairs takig values i R d R, ad Y
More information5. Matrix exponentials and Von Neumann s theorem The matrix exponential. For an n n matrix X we define
5. Matrix expoetials ad Vo Neuma s theorem 5.1. The matrix expoetial. For a matrix X we defie e X = exp X = I + X + X2 2! +... = 0 X!. We assume that the etries are complex so that exp is well defied o
More informationMath 220B Final Exam Solutions March 18, 2002
Math 0B Fial Exam Solutios March 18, 00 1. (1 poits) (a) (6 poits) Fid the Gree s fuctio for the tilted half-plae {(x 1, x ) R : x 1 + x > 0}. For x (x 1, x ), y (y 1, y ), express your Gree s fuctio G(x,
More informationReal Numbers R ) - LUB(B) may or may not belong to B. (Ex; B= { y: y = 1 x, - Note that A B LUB( A) LUB( B)
Real Numbers The least upper boud - Let B be ay subset of R B is bouded above if there is a k R such that x k for all x B - A real umber, k R is a uique least upper boud of B, ie k = LUB(B), if () k is
More informationOnce we have a sequence of numbers, the next thing to do is to sum them up. Given a sequence (a n ) n=1
. Ifiite Series Oce we have a sequece of umbers, the ext thig to do is to sum them up. Give a sequece a be a sequece: ca we give a sesible meaig to the followig expressio? a = a a a a While summig ifiitely
More informationIntroduction to Functional Analysis
MIT OpeCourseWare http://ocw.mit.edu 18.10 Itroductio to Fuctioal Aalysis Sprig 009 For iformatio about citig these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. LECTURE OTES FOR 18.10,
More informationLecture 8: October 20, Applications of SVD: least squares approximation
Mathematical Toolkit Autum 2016 Lecturer: Madhur Tulsiai Lecture 8: October 20, 2016 1 Applicatios of SVD: least squares approximatio We discuss aother applicatio of sigular value decompositio (SVD) of
More information8. Applications To Linear Differential Equations
8. Applicatios To Liear Differetial Equatios 8.. Itroductio 8.. Review Of Results Cocerig Liear Differetial Equatios Of First Ad Secod Orders 8.3. Eercises 8.4. Liear Differetial Equatios Of Order N 8.5.
More informationAN INTRODUCTION TO SPECTRAL GRAPH THEORY
AN INTRODUCTION TO SPECTRAL GRAPH THEORY JIAQI JIANG Abstract. Spectral graph theory is the study of properties of the Laplacia matrix or adjacecy matrix associated with a graph. I this paper, we focus
More information7.1 Convergence of sequences of random variables
Chapter 7 Limit Theorems Throughout this sectio we will assume a probability space (, F, P), i which is defied a ifiite sequece of radom variables (X ) ad a radom variable X. The fact that for every ifiite
More informationComplex Analysis Spring 2001 Homework I Solution
Complex Aalysis Sprig 2001 Homework I Solutio 1. Coway, Chapter 1, sectio 3, problem 3. Describe the set of poits satisfyig the equatio z a z + a = 2c, where c > 0 ad a R. To begi, we see from the triagle
More informationHILBERT-SCHMIDT AND TRACE CLASS OPERATORS. 1. Introduction
HILBERT-SCHMIDT AND TRACE CLASS OPERATORS MICHAEL WALTER Let H 0 be a Hilbert space. We deote by BpHq ad KpHq the algebra of bouded respective compact operators o H ad by B fi phq the subspace of operator
More informationRiesz-Fischer Sequences and Lower Frame Bounds
Zeitschrift für Aalysis ud ihre Aweduge Joural for Aalysis ad its Applicatios Volume 1 (00), No., 305 314 Riesz-Fischer Sequeces ad Lower Frame Bouds P. Casazza, O. Christese, S. Li ad A. Lider Abstract.
More informationa for a 1 1 matrix. a b a b 2 2 matrix: We define det ad bc 3 3 matrix: We define a a a a a a a a a a a a a a a a a a
Math E-2b Lecture #8 Notes This week is all about determiats. We ll discuss how to defie them, how to calculate them, lear the allimportat property kow as multiliearity, ad show that a square matrix A
More informationdenote the set of all polynomials of the form p=ax 2 +bx+c. For example, . Given any two polynomials p= ax 2 +bx+c and q= a'x 2 +b'x+c',
Chapter Geeral Vector Spaces Real Vector Spaces Example () Let u ad v be vectors i R ad k a scalar ( a real umber), the we ca defie additio: u+v, scalar multiplicatio: ku, kv () Let P deote the set of
More informationGeometry of LS. LECTURE 3 GEOMETRY OF LS, PROPERTIES OF σ 2, PARTITIONED REGRESSION, GOODNESS OF FIT
OCTOBER 7, 2016 LECTURE 3 GEOMETRY OF LS, PROPERTIES OF σ 2, PARTITIONED REGRESSION, GOODNESS OF FIT Geometry of LS We ca thik of y ad the colums of X as members of the -dimesioal Euclidea space R Oe ca
More informationPhysics 324, Fall Dirac Notation. These notes were produced by David Kaplan for Phys. 324 in Autumn 2001.
Physics 324, Fall 2002 Dirac Notatio These otes were produced by David Kapla for Phys. 324 i Autum 2001. 1 Vectors 1.1 Ier product Recall from liear algebra: we ca represet a vector V as a colum vector;
More information5.1 Review of Singular Value Decomposition (SVD)
MGMT 69000: Topics i High-dimesioal Data Aalysis Falll 06 Lecture 5: Spectral Clusterig: Overview (cotd) ad Aalysis Lecturer: Jiamig Xu Scribe: Adarsh Barik, Taotao He, September 3, 06 Outlie Review of
More informationTridiagonal reduction redux
Week 15: Moday, Nov 27 Wedesday, Nov 29 Tridiagoal reductio redux Cosider the problem of computig eigevalues of a symmetric matrix A that is large ad sparse Usig the grail code i LAPACK, we ca compute
More informationREGULARIZATION OF CERTAIN DIVERGENT SERIES OF POLYNOMIALS
REGULARIZATION OF CERTAIN DIVERGENT SERIES OF POLYNOMIALS LIVIU I. NICOLAESCU ABSTRACT. We ivestigate the geeralized covergece ad sums of series of the form P at P (x, where P R[x], a R,, ad T : R[x] R[x]
More information11. FINITE FIELDS. Example 1: The following tables define addition and multiplication for a field of order 4.
11. FINITE FIELDS 11.1. A Field With 4 Elemets Probably the oly fiite fields which you ll kow about at this stage are the fields of itegers modulo a prime p, deoted by Z p. But there are others. Now although
More informationlim za n n = z lim a n n.
Lecture 6 Sequeces ad Series Defiitio 1 By a sequece i a set A, we mea a mappig f : N A. It is customary to deote a sequece f by {s } where, s := f(). A sequece {z } of (complex) umbers is said to be coverget
More informationMachine Learning Theory Tübingen University, WS 2016/2017 Lecture 12
Machie Learig Theory Tübige Uiversity, WS 06/07 Lecture Tolstikhi Ilya Abstract I this lecture we derive risk bouds for kerel methods. We will start by showig that Soft Margi kerel SVM correspods to miimizig
More informationIntroduction to Extreme Value Theory Laurens de Haan, ISM Japan, Erasmus University Rotterdam, NL University of Lisbon, PT
Itroductio to Extreme Value Theory Laures de Haa, ISM Japa, 202 Itroductio to Extreme Value Theory Laures de Haa Erasmus Uiversity Rotterdam, NL Uiversity of Lisbo, PT Itroductio to Extreme Value Theory
More informationTMA4205 Numerical Linear Algebra. The Poisson problem in R 2 : diagonalization methods
TMA4205 Numerical Liear Algebra The Poisso problem i R 2 : diagoalizatio methods September 3, 2007 c Eiar M Røquist Departmet of Mathematical Scieces NTNU, N-749 Trodheim, Norway All rights reserved A
More informationAlgebra of Least Squares
October 19, 2018 Algebra of Least Squares Geometry of Least Squares Recall that out data is like a table [Y X] where Y collects observatios o the depedet variable Y ad X collects observatios o the k-dimesioal
More informationCALCULATING FIBONACCI VECTORS
THE GENERALIZED BINET FORMULA FOR CALCULATING FIBONACCI VECTORS Stuart D Aderso Departmet of Physics, Ithaca College 953 Daby Road, Ithaca NY 14850, USA email: saderso@ithacaedu ad Dai Novak Departmet
More informationSequences, Mathematical Induction, and Recursion. CSE 2353 Discrete Computational Structures Spring 2018
CSE 353 Discrete Computatioal Structures Sprig 08 Sequeces, Mathematical Iductio, ad Recursio (Chapter 5, Epp) Note: some course slides adopted from publisher-provided material Overview May mathematical
More information3. Z Transform. Recall that the Fourier transform (FT) of a DT signal xn [ ] is ( ) [ ] = In order for the FT to exist in the finite magnitude sense,
3. Z Trasform Referece: Etire Chapter 3 of text. Recall that the Fourier trasform (FT) of a DT sigal x [ ] is ω ( ) [ ] X e = j jω k = xe I order for the FT to exist i the fiite magitude sese, S = x [
More informationM A T H F A L L CORRECTION. Algebra I 1 4 / 1 0 / U N I V E R S I T Y O F T O R O N T O
M A T H 2 4 0 F A L L 2 0 1 4 HOMEWORK ASSIGNMENT #4 CORRECTION Algebra I 1 4 / 1 0 / 2 0 1 4 U N I V E R S I T Y O F T O R O N T O P r o f e s s o r : D r o r B a r - N a t a Correctio Homework Assigmet
More informationb i u x i U a i j u x i u x j
M ath 5 2 7 Fall 2 0 0 9 L ecture 1 9 N ov. 1 6, 2 0 0 9 ) S ecod- Order Elliptic Equatios: Weak S olutios 1. Defiitios. I this ad the followig two lectures we will study the boudary value problem Here
More informationFibonacci numbers and orthogonal polynomials
Fiboacci umbers ad orthogoal polyomials Christia Berg April 10, 2006 Abstract We prove that the sequece (1/F +2 0 of reciprocals of the Fiboacci umbers is a momet sequece of a certai discrete probability,
More informationBasic Iterative Methods. Basic Iterative Methods
Abel s heorem: he roots of a polyomial with degree greater tha or equal to 5 ad arbitrary coefficiets caot be foud with a fiite umber of operatios usig additio, subtractio, multiplicatio, divisio, ad extractio
More informationLecture Overview. 2 Permutations and Combinations. n(n 1) (n (k 1)) = n(n 1) (n k + 1) =
COMPSCI 230: Discrete Mathematics for Computer Sciece April 8, 2019 Lecturer: Debmalya Paigrahi Lecture 22 Scribe: Kevi Su 1 Overview I this lecture, we begi studyig the fudametals of coutig discrete objects.
More informationChapter 8. Euler s Gamma function
Chapter 8 Euler s Gamma fuctio The Gamma fuctio plays a importat role i the fuctioal equatio for ζ(s) that we will derive i the ext chapter. I the preset chapter we have collected some properties of the
More information