NOTES ON SIMPLIFICATION OF MATRICES
|
|
- Giles Nelson
- 5 years ago
- Views:
Transcription
1 NOTES ON SIMPLIFICATION OF MATRICES JONATHAN LUK These notes dscuss how to smplfy an (n n) matrx In partcular, we expand on some of the materal from the textbook (wth some repetton) Part of the exposton s nspred by some notes of Elashberg, whch you may easly fnd on the nternet From the pont of vew of the larger context of the course, the goal s to have a way to compute e A for a gven matrx A, whch s useful n solvng lnear ODEs I wll lkely be modfyng these notes as I lecture Meanwhle, f you have any comments or correctons, even very mnor ones, please let me know Before we proceed, let s start wth a few observatons: () To compute e A, t s useful to fnd some B whch s smlar to A, e, B = S AS for some S, such that e B s easer to compute Ths s because (Exercse) e A = Se B S (2) Now, n terms of computng exponentals, the easest matrces are dagonal ones If Λ = dag(λ, λ n ), then (Exercse) e Λ = dag(e λ,, e λn ) Combnng ths wth the frst observaton, we have an easy way to compute the exponentals of dagonalzable matrces (cf Defnton 4) (3) Another class of matrces whose exponentals are easy to compute are nlpotent matrces Here, we say that N s nlpotent f N k = for some k N For a nlpotent matrx, the power seres that defnes e N becomes a fnte sum and s therefore easer to compute Not all matrces are dagonalzable (Why? Exercse) The man result that we wll get to s that all matrces can be decomposed as the sum of a dagonalzable matrx B and a nlpotent matrx N such that B and N commute Ths gves a way of computng the exponental of any matrx Even f one s only nterested n real matrces, as we wll see, complex numbers enter naturally (cf Remark 2) From now on, we work wth complex matrces and vectors Some results on dagonalzablty We begn by recallng the followng defntons from 6CM: Defnton (Egenvalues and egenvectors) Let A be an (n n) matrx We say that λ s an egenvalue of A f there exsts v such that Av = λv If λ s an egenvalue, any v satsfyng Av = λv (ncludng ) s called an egenvector Remark 2 Some remarks are n order: () λ s an egenvalue ff ker(λi A) {} ff det(λi A) = (2) (Complex) egenvalues always exst Ths s because det(λi A) = s a polynomal n λ, whch always has a root n C by the fundamental theorem of algebra In fact, for an (n n) matrx A, we always have n roots f we count multplcty Ths s the man reason we work over C nstead of R Defnton 3 (Smlarty) Two (n n) matrces A and B are smlar f there exsts an nvertble (n n) matrx S such that S AS = B Defnton 4 (Dagonalzablty) A matrx s dagonalzable f t s smlar to a dagonal matrx One mportant (suffcent but not necessary) crteron for dagonalzablty s gven by the spectral theorem from 6CM:
2 2 JONATHAN LUK Theorem 5 (Spectral theorem) A real symmetrc matrx s dagonalzable Moreover, gven a real symmetrc matrx A, one can fnd a real (n n) matrx Q such that Q AQ s dagonal and Q T Q = I We wll not repeat the proof here In general, we have the followng characterzaton: Lemma 6 An (n n) matrx A s dagonalzable f and only f C n admts a bass whch conssts of egenvectors of A Proof Only f Suppose A s dagonalzable Then S AS = D for some dagonal matrx λ λ 2 D = λn and some nvertble matrx S Let v C n, =,, n, be the columns of S, e, S = v v 2 v n Snce S s nvertble, {v } n = forms a bass Moreover, Av Av 2 Av n = AS = SD = λ v λ 2 v 2 λ n v n Hence, comparng each column, we have Av = λ v In other words, the bass v,, v n conssts of egenvectors If Ths s smlar Gven a bass {v,, v n } of C n consstng of egenvectors of A, defne S = v v 2 v n Then a smlar computaton as the only f part shows that S AS s dagonal A corollary s the followng (suffcent but not necessary) crteron for dagonalzablty: Corollary 7 Suppose all the egenvalues of an (n n) matrx A are dstnct, then A s dagonalzable Proof Let {λ } n = be the dstnct egenvalues and let {v } n = Cn \ {} be correspondng egenvectors We prove that {v } n = s lnearly ndependent by nducton Base case Snce v, {v } s lnearly ndependent Inducton step Suppose {v, v k } are lnearly ndependent Let Applyng A, we get k c v = = k c λ v = =
3 NOTES ON SIMPLIFICATION OF MATRICES 3 Multply the frst equaton by λ k and subtract the second equaton from t We obtan k c (λ k λ )v = = By lnear ndependence of {v,, v k }, c (λ k λ ) = for all {,, k } Snce λ k λ, we have c = for all {,, k } Ths then mples also that c k = Hence, {v, v k } are lnearly ndependent By nducton, {v, v n } s lnearly ndependent It therefore forms a bass of C n By Lemma 6, A s dagonalzable In general, not all matrces are dagonalzable (see homework 3 for an example) Nevertheless, we have Propostons 8 and Proposton 9 below Proposton 8 Every matrx s smlar to an upper trangular matrx Proof Let us prove ths by nducton on the sze of the matrx Clearly all matrces are upper trangular Suppose that for some k 2, every (k ) (k ) matrx s smlar to an upper trangular matrx Let A be an k k matrx By Remark 2, A has an egenvector, say, x wth egenvalue λ Complete x to a bass {x, y 2,, y k } Consder now the matrx S = x y 2 y k Then S AS = λ B where B s a (k ) (k ) matrx (whch we do not know much about) and are entres that we have no nformaton about By the nducton hypothess, there exsts a (k ) (k ) matrx S 2 such that S 2 B S 2 s upper trangular Now let S 2 be a k k matrx defned by Let S = S S 2 We compute S AS =S 2 S AS S 2 = = S 2 = S2 S 2 λ S 2 B S 2 whch s an upper trangular matrx,, λ B S2 Proposton 9 The set of dagonalzable matrces s dense n the set of all matrces
4 4 JONATHAN LUK Proof Gven an (n n) matrx A and an ɛ >, we want to fnd a matrx B wth A B op < ɛ such that B s dagonalzable To do ths, frst, we fnd S such that S AS s upper trangular Then the egenvalues of A are the dagonal entres of S AS (Why? Exercse) Now one can fnd an upper trangular matrx B by perturbng the dagonal entres of S AS such that B S AS op < ɛ S op S op and all the egenvalues of B are dstnct Defne B = S BS We check that A B op = SS (A B)SS op S op S AS B op S op < ɛ B s dagonalzable: B s dagonalzable by Corollary 7 Snce B s smlar to B, B s dagonalzable 2 Cayley Hamlton theorem Defnton 2 Let p(λ) = a n λ n + + a wth a C for =,, n be a polynomal Then for an (n n) matrx A, p(a) s the (n n) matrx The followng s a fundamental result: p(a) = a n A n + + a I Theorem 22 (Cayley Hamlton) Let χ A (λ) = det(λi A) be the characterstc polynomal of A Then χ A (A) = Proof Step Frst, ths s true for dagonal matrces To see that, let A be a dagonal matrx, λ λ 2 A = λn λ n It s easy to compute that χ A (λ) = Π n = (λ λ ) We now check χ A (A) = Π n =(A λ I) λ 2 λ = λ λ 2 λ λ n λ 2 λ n = λ n λ (λ λ 2 ) (λ λ n ) λn λ2 (λ 2 λ ) (λ 2 λ n ) (λn λ) (λn λ2) = Step 2 We clam that a consequence of Step s that χ A (A) = for all dagonalzable A To see ths, suppose S AS = D for some dagonal matrx D Then det(λi A) = det(s ) det(λi A) det(s) = det(s (λi A)S) = det(λi D) Hence χ A (λ) = χ D (λ) Now suppose Then χ A (λ) = χ D (λ) = λ n + a n λ n + + a χ A (A) =A n + a n A n + + a I = SS (A n + a n A n + + a I)SS =S ( (S AS) n + a n (S AS) n + + a I ) S =Sχ D (D)S By Step, χ D (D) = Hence, χ A (A) = Step 3 χ A (A) depends on A contnuously Therefore, the concluson of the theorem follows from the densty of dagonalzable matrces (Proposton 9)
5 NOTES ON SIMPLIFICATION OF MATRICES 5 3 Generalzed egenspaces The Cayley Hamlton theorem gves us a way to decompose C n nto generalzed egenspaces Defnton 3 Let A be an (n n) matrx We say that v s a generalzed egenvector f there exsts an egenvalue λ and a k N such that v ker(λi A) k Defnton 32 Let A be an (n n) matrx and λ be an egenvalue The generalzed egenspace assocate to λ s gven by {v C n : (λi A) k v = for some k N} Defnton 33 Gven two polynomals f and g, we say that h s a greatest common dvsor of f and g f h s a non-zero polynomal of maxmal degree whch dvdes both f and g Proposton 34 (Bézout s dentty) Let f, g be polynomals Then there exsts a greatest common dvsor whch s unque up to multplcaton by constants Moreover, for any greatest common dvsor h, there exsts polynomals p and q such that pf + qg = h Proof Consder the set S = {pf + qg : p, q polynomals} Let h = p h f + q h g be a non-zero polynomal n S wth mnmal degree We clam that h dvdes any polynomal n S Suppose not Then there are some p d and q d such that p d f + q d g = sh + r for some polynomals s and r, wth r and deg(r) < deg(h) But then r = (p d p h s)f + (q d q h s)g s a non-zero element n S wth a smaller degree than h, whch s a contradcton We now clam that h s a greatest common dvsor of f and g Suppose c s a common dvsor of f and g, say f = cp c and g = cq c for some polynomals p c and q c Then h = p h f + q h g = p h p c c + q h q c c = (p h p c + q h q c )c Hence, c dvdes h In other words, any other common dvsor of f and g must dvde h Ths shows that h s a greatest common dvsor The same argument also shows the unqueness of the greatest common dvsor up to multplcatve constant Fnally, Bézout s dentty follows from takng p = p h and q = q h Defnton 35 We denote by (f, g) the unque monc (e, wth leadng coeffcent ) polynomal whch s a greatest common dvsor of f and g Theorem 36 Let V be a fnte dmensonal vector space, A : V polynomals such that (f, g) = and f(a)g(a) = Then V = ker(f(a)) ker(g(a)), V be a lnear map and f, g be e, for every v V, there exst unque x ker(f(a)) and y ker(g(a)) such that v = x + y Proof By Proposton 34, there exst polynomals p and q such that pf + qg = Now gven v V, defne x = q(a)g(a)v, y = p(a)f(a)v By defnton, v = Iv = (p(a)f(a) + q(a)g(a))v = y + x and f(a)x = q(a)f(a)g(a)v =, g(a)y = p(a)f(a)g(a)v = Notce that we have used that any two polynomals of A commute We have thus shown that for every v V, there exst x ker(f(a)) and y ker(g(a)) such that v = x + y Fnally, suppose v = x+y = x +y, where x, x ker(f(a)) and y, y ker(g(a)) Then x x = y y ker(f(a)) ker(g(a)) Then Hence, x = x and consequently y = y x x = (f(a)p(a) + g(a)q(a))(x x ) =
6 6 JONATHAN LUK Iteratng ths, we have Corollary 37 Let V be a fnte dmensonal vector space, A : V V be a lnear map and f = f f k, where f are polynomals wth (f, f j ) = whenever j, f(a) = Then V = ker(f (A)) ker(f k (A)) In partcular, usng Cayley Hamlton theorem, we can decompose C n nto generalzed egenspaces: Corollary 38 Let A be an (n n) matrx and suppose the characterstc polynomal can be wrtten as where the λ s are dstnct and k = ν = n Then Ths also mples the followng: det(λi A) = Π k =(λ λ ) ν, C n = ker(a λ I) ν ker(a λ 2 I) ν2 ker(a λ k I) ν k (3) Corollary 39 C n admts a bass of generalzed egenvectors 4 Decomposton nto dagonalzable and nlpotent matrces Theorem 4 Let A be an (n n) matrx Then there exsts (n n) matrces L and N such that () A = L + N, (2) L s dagonalzable, (3) N s nlpotent, n fact, N n =, (4) LN = NL Proof Recall that C n admts a decomposton (3) Defne L so that for any v ker(a λ I) ν, Lv = λ v It s easy to check that L s lnear and therefore s gven by a matrx We now check the followng clams: Clam : L s dagonalzable By defnton C n admts a bass of egenvectors of L Hence, L s dagonalzable by Lemma 6 Clam 2: A L s nlpotent We wll show that for ν = max{ν,, ν k }, (A L) ν v = for all v C n Ths then mples (A L) ν = Snce ν n, we have N n = By (3), t suffces to consder v ker(a λ I) ν for some By defnton of L, (A L)v = (A λ I)v Now clearly (A λ I)v ker(a λ I) ν, so we have (A L) 2 v = (A λ I)v Iteratng ths, we have (A L) ν = (A λ I) ν v = snce ν ν and v ker(a λ I) ν Clam 3: N = A L and L commute As before, by (3), t suffces to check that NLv = LNv for v ker(a λ I) ν for some Now NLv = (A λ I)λ v = λ (A λ I)v = LNv Theorem 42 The decomposton n Theorem 4 s unque Proof Recall that C n admts a decomposton (3) We want to prove that f A = L + N, where L s dagonalzable, N k = for some k N and NL = LN, then Lv = λ v for any v ker(a λ I) ν We compute, for v ker(a λ I) ν, that (L λ I) n+k v =(A λ I N) 2n v = 2n j= (n + k)! j!(n + k j)! ( N)j (A λ I) n+k j v n (n + k)! = j!(n + k j)! ( N)j (A λ I) n+k j v j= =
7 NOTES ON SIMPLIFICATION OF MATRICES 7 Here, we have used () N and A commute snce NA = N(L + N) = NL + N 2 = LN + N 2 = (L + N)N = AN, (2) N k =, (3) Snce (A λ I) ν v = and ν n, we have (A λ I) l v = for all l n Now, (L λ I) n+k v = Snce L s dagonalzable, (L λ I)v = Ths s what we want to show Consder A = Egenvalues We frst fnd ts egenvalues det(λi A) = det λ λ λ λ 5 Example = λλ(λ2 + ) ( )(λ 2 + ) = (λ 2 + ) 2 Therefore, the egenvalues are ±, each wth multplcty 2 Generalzed egenvectors We now fnd the generalzed egenvectors I A = By nspecton, Smlarly, We compute By nspecton, (I A) 2 = ( I A) 2 = It s easy to check that ndeed ker((i A) 2 ) = span I A =, = ker(( I A) 2 ) = span, = C n = ker((i A) 2 ) ker(( I A) 2 ) (5) (52)
8 8 JONATHAN LUK We now decompose A nto ts dagonalzable and nlpotent parts Defne L accordng to the proof of Theorem 4 We check that L = ( 2 )L 2 L = ( 2 ) ( 2 )( ) =, Therefore, L L L We check that = ( 2 )L = ( 2 )L = 2 L + 2 L ( 2 )L + 2 L L = = ( 2 ) = ( 2 ) N = A L = = ( 2 ) + ( 2 )( ) ( 2 )( ) + ( 2 )( ) = = = whch s obvously nlpotent Takng exponental usng the prevous decomposton L s dagonalzable More precsely, gven the above computatons, we know that for S =,,,, we have We check that S LS = S =
9 NOTES ON SIMPLIFICATION OF MATRICES 9 We check that 2 2 S LS = = 2 2 Hence, e Lt =S = = = e t e t e t e t S cos t sn t sn t cos t cos t sn t sn t cos t e t e t e t e t 2 et 2 et 2 et 2 et 2 e t 2 e t 2 e t 2 e t Also, snce we have, N 2 = e tn = I + tn = t t =, Puttng all these together e ta = e tl e tn = cos t sn t sn t cos t cos t sn t sn t cos t t t = cos t sn t t cos t t sn t sn t cos t t sn t t cos t cos t sn t sn t cos t 6 Jordan canoncal form It s useful to further analyse nlpotent matrces Ths wll also lead us to the noton of Jordan canoncal forms, whch gves us another way to compute exponentals of matrces
10 JONATHAN LUK We begn wth the analyss of nlpotent matrces One example of nlpotent matrces s the followng m m matrx: J m := An easy computaton shows that Lemma 6 J m m = Proposton 62 Let N be an (n n) nlpotent matrx Then N s smlar to a matrx J, whch s a block dagonal matrx wth blocks J n+,, J nk +, where (n + ) + + (n k + ) = n Proof It suffces to fnd a bass v, Nv,, N n v, v 2, Nv 2,, N n2 v 2,, v k,, N n k v k, where Then for N n+ v = N n2+ v 2 = = N n k+ v k = (6) S = N n v Nv v N n2 v 2 v 2 N n k v k v k, S AS s n the desred form Step : Choosng v Let v be a non-zero vector Snce N s nlpotent, there exsts n N {} such that N n v and N n+ v = We clam that v, Nv,, N n v are lnearly ndependent We prove ths by nducton Frst N n v s lnearly ndependent snce t s non-zero Now, suppose N n v, N n v,, N n j v are lnearly ndependent Suppose Multplyng by N on the left, we have c n j N n j v + c n jn n j v + + c n N n v = (62) c n j N n j v + c n jn n j+ v + + c n N n v =, snce N n+ v = By lnear ndependence of N n v, N n v,, N n j v, we have c n j = c n jn n j+ = = c n = Usng (62), we also have c n = Hence, N n v, N n v,, N n j v, N n j v are lnearly ndependent The clam follows from nducton If v, Nv,, N n v form a bass, we are done Otherwse, proceed to Step 2 Step 2 Choosng v 2 Take v 2 so that v, Nv,, N n v, v 2 are lnearly ndependent Take n 2 such that N n2 v 2 but N n2+ v 2 = Wthout loss of generalty, assume n 2 n (otherwse, relabel) There are now two cases: ether () N n v and N n2 v 2 are lnearly ndependent; or (2) N n v = an n2 v 2 for some a C \ {} In case (), we clam that v,, N n v, v 2,, N n2 v 2 are lnearly ndependent We wll prove nductvely n j that v,, N n v, N n2 j v 2,, N n2 j v 2,, N n2 v 2 are lnearly ndependent We already know from above that v,, N n v are lnearly ndependent Suppose that v,, N n v, N n2 j v 2,, N n2 j v 2,, N n2 v 2 are lnearly ndependent for some j (wth j = meanng that none of the v 2 terms are present) Let c v + + c n N n v + d n2 j N n2 j + d n2 jn n2 j + + d n2 N n2 v 2 =, Applyng N and usng the nducton hypothess, we have c = = c n =, d n2 j = = d n2 = Ths mples c n N n v + d n2 N n2 v 2 =
11 NOTES ON SIMPLIFICATION OF MATRICES Snce N n v and N n2 v 2 are lnearly ndependent, c n = d n2 = Hence, v,, N n v, N n2 j v 2,, N n2 j v 2,, N n2 v 2 are lnearly ndependent Ths completes the nducton In case (2), we let v 2 = v 2 a N n n2 v Notce that ths s stll lnearly ndependent wth v, v n and there exsts n 2 < n 2 such that N n2 v 2 and N n 2 v 2 = Now we consder the followng cases, ether ether ( ) N n v and N n 2 v 2 are lnearly ndependent; or (2 ) N n v = a N n 2 v 2 for some a C \ {} In case ( ), we then argue as above to show that v,, N n v, v 2,, N n 2 v 2 are lnearly ndependent In case (2 ), we then defne v 2 = v 2 a N n n 2 v 2 and then repeat ths process Snce n 2 > n 2 >, ths process must come to an end At the end, we wll obtan v 2 such that v,, N n v, v 2,, N n2 v 2 are lnearly ndependent We now abuse notaton to rename v 2 and n 2 as v 2 and n 2 Now f v,, N n v, v 2,, N n2 v 2 form a bass, we are done Otherwse, we contnue ths process by fndng v 3, v 4, etc, and obtan a bass Remark 63 Let us note that the proof above also suggests an algorthm for fndng a bass satsfyng (6) v, Nv,, N n v, v 2, Nv 2,, N n2 v 2,, v k,, N n k v k Defnton 64 The followng (m m) matrx s known as a Jordan block λ λ λi + J m := λ λ Defnton 65 A matrx s sad to be n Jordan canoncal form f t s a block dagonal matrx wth Jordan blocks Corollary 66 Any (n n) matrx A s smlar to a matrx n Jordan canoncal form Proof We pck a bass of generalzed egenvectors as follows Frst recall (3) Snce A λ I s nlpotent for any ker((a λ I) ν ), by Proposton 62, we can fnd a bass of ker((a λ I) ν ) whch takes the form v,, (A λ I)v,,, (A λ I) n, v,,, v,k, (A λ I)v,k,, (A λ I) n,k v,k By (3), puttng all these bases together for all generalzed egenspaces ker((a λ I) ν ), we obtan a bass of C n Fnally, defnng S by S = (A λ I) n, v, v, (A λ m I) n m,km vm,km v m,km, one checks that S AS s n the Jordan canoncal form 6 Exponentals of matrces n Jordan canoncal form Frst, we note that t t 2 t 2! m (m )! t e Jmt = t 2 2! t
12 2 JONATHAN LUK Take a Jordan block λi + J m Notce that λij m = J m λi Hence, e (λi+jm)t := e λt λt t2 te 2! eλt t m (m )! eλt e λt te λt t 2 e λt te λt e λt 2! eλt 62 Example wth Jordan canoncal form Let us go back to the example n Secton 5 and fnd the Jordan canoncal formof A Let us frst fnd a bass of C n followng the algorthm suggested n the proof of Proposton 62 Take, an element n the generalzed egenspace n (5) We compute Now consder the vector (A I) = = n the generalzed egenspace n (52) We compute (A + I) = = Therefore, for S defned as we have S = S AS =, Let us note that ths gves another way to compute e At Frst, we compute S : S =
13 NOTES ON SIMPLIFICATION OF MATRICES 3 Then, we have e At =S = = = e t t e t e t t e t S cos t sn t t cos t t sn t sn t cos t t sn t t cos t cos t sn t sn t cos t e t te t e t e t te t e t 2 et 2 et t 2 et t 2 et 2 et 2 et 2 e t 2 e t t 2 e t t 2 e t 2 e t 2 e t
2.3 Nilpotent endomorphisms
s a block dagonal matrx, wth A Mat dm U (C) In fact, we can assume that B = B 1 B k, wth B an ordered bass of U, and that A = [f U ] B, where f U : U U s the restrcton of f to U 40 23 Nlpotent endomorphsms
More information5 The Rational Canonical Form
5 The Ratonal Canoncal Form Here p s a monc rreducble factor of the mnmum polynomal m T and s not necessarly of degree one Let F p denote the feld constructed earler n the course, consstng of all matrces
More informationLectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix
Lectures - Week 4 Matrx norms, Condtonng, Vector Spaces, Lnear Independence, Spannng sets and Bass, Null space and Range of a Matrx Matrx Norms Now we turn to assocatng a number to each matrx. We could
More informationAPPENDIX A Some Linear Algebra
APPENDIX A Some Lnear Algebra The collecton of m, n matrces A.1 Matrces a 1,1,..., a 1,n A = a m,1,..., a m,n wth real elements a,j s denoted by R m,n. If n = 1 then A s called a column vector. Smlarly,
More information8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS
SECTION 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS 493 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS All the vector spaces you have studed thus far n the text are real vector spaces because the scalars
More informationRepresentation theory and quantum mechanics tutorial Representation theory and quantum conservation laws
Representaton theory and quantum mechancs tutoral Representaton theory and quantum conservaton laws Justn Campbell August 1, 2017 1 Generaltes on representaton theory 1.1 Let G GL m (R) be a real algebrac
More informationSalmon: Lectures on partial differential equations. Consider the general linear, second-order PDE in the form. ,x 2
Salmon: Lectures on partal dfferental equatons 5. Classfcaton of second-order equatons There are general methods for classfyng hgher-order partal dfferental equatons. One s very general (applyng even to
More informationMATH 241B FUNCTIONAL ANALYSIS - NOTES EXAMPLES OF C ALGEBRAS
MATH 241B FUNCTIONAL ANALYSIS - NOTES EXAMPLES OF C ALGEBRAS These are nformal notes whch cover some of the materal whch s not n the course book. The man purpose s to gve a number of nontrval examples
More informationAffine transformations and convexity
Affne transformatons and convexty The purpose of ths document s to prove some basc propertes of affne transformatons nvolvng convex sets. Here are a few onlne references for background nformaton: http://math.ucr.edu/
More informationU.C. Berkeley CS294: Spectral Methods and Expanders Handout 8 Luca Trevisan February 17, 2016
U.C. Berkeley CS94: Spectral Methods and Expanders Handout 8 Luca Trevsan February 7, 06 Lecture 8: Spectral Algorthms Wrap-up In whch we talk about even more generalzatons of Cheeger s nequaltes, and
More informationMTH 819 Algebra I S13. Homework 1/ Solutions. 1 if p n b and p n+1 b 0 otherwise ) = 0 if p q or n m. W i = rw i
MTH 819 Algebra I S13 Homework 1/ Solutons Defnton A. Let R be PID and V a untary R-module. Let p be a prme n R and n Z +. Then d p,n (V) = dm R/Rp p n 1 Ann V (p n )/p n Ann V (p n+1 ) Note here that
More informationTHE CHINESE REMAINDER THEOREM. We should thank the Chinese for their wonderful remainder theorem. Glenn Stevens
THE CHINESE REMAINDER THEOREM KEITH CONRAD We should thank the Chnese for ther wonderful remander theorem. Glenn Stevens 1. Introducton The Chnese remander theorem says we can unquely solve any par of
More informationBOUNDEDNESS OF THE RIESZ TRANSFORM WITH MATRIX A 2 WEIGHTS
BOUNDEDNESS OF THE IESZ TANSFOM WITH MATIX A WEIGHTS Introducton Let L = L ( n, be the functon space wth norm (ˆ f L = f(x C dx d < For a d d matrx valued functon W : wth W (x postve sem-defnte for all
More informationSTAT 309: MATHEMATICAL COMPUTATIONS I FALL 2018 LECTURE 16
STAT 39: MATHEMATICAL COMPUTATIONS I FALL 218 LECTURE 16 1 why teratve methods f we have a lnear system Ax = b where A s very, very large but s ether sparse or structured (eg, banded, Toepltz, banded plus
More informationOn Finite Rank Perturbation of Diagonalizable Operators
Functonal Analyss, Approxmaton and Computaton 6 (1) (2014), 49 53 Publshed by Faculty of Scences and Mathematcs, Unversty of Nš, Serba Avalable at: http://wwwpmfnacrs/faac On Fnte Rank Perturbaton of Dagonalzable
More informationFormulas for the Determinant
page 224 224 CHAPTER 3 Determnants e t te t e 2t 38 A = e t 2te t e 2t e t te t 2e 2t 39 If 123 A = 345, 456 compute the matrx product A adj(a) What can you conclude about det(a)? For Problems 40 43, use
More informationSL n (F ) Equals its Own Derived Group
Internatonal Journal of Algebra, Vol. 2, 2008, no. 12, 585-594 SL n (F ) Equals ts Own Derved Group Jorge Macel BMCC-The Cty Unversty of New York, CUNY 199 Chambers street, New York, NY 10007, USA macel@cms.nyu.edu
More informationCSCE 790S Background Results
CSCE 790S Background Results Stephen A. Fenner September 8, 011 Abstract These results are background to the course CSCE 790S/CSCE 790B, Quantum Computaton and Informaton (Sprng 007 and Fall 011). Each
More informationDIFFERENTIAL FORMS BRIAN OSSERMAN
DIFFERENTIAL FORMS BRIAN OSSERMAN Dfferentals are an mportant topc n algebrac geometry, allowng the use of some classcal geometrc arguments n the context of varetes over any feld. We wll use them to defne
More information332600_08_1.qxp 4/17/08 11:29 AM Page 481
336_8_.qxp 4/7/8 :9 AM Page 48 8 Complex Vector Spaces 8. Complex Numbers 8. Conjugates and Dvson of Complex Numbers 8.3 Polar Form and DeMovre s Theorem 8.4 Complex Vector Spaces and Inner Products 8.5
More informationFINITELY-GENERATED MODULES OVER A PRINCIPAL IDEAL DOMAIN
FINITELY-GENERTED MODULES OVER PRINCIPL IDEL DOMIN EMMNUEL KOWLSKI Throughout ths note, s a prncpal deal doman. We recall the classfcaton theorem: Theorem 1. Let M be a fntely-generated -module. (1) There
More informationRandom Walks on Digraphs
Random Walks on Dgraphs J. J. P. Veerman October 23, 27 Introducton Let V = {, n} be a vertex set and S a non-negatve row-stochastc matrx (.e. rows sum to ). V and S defne a dgraph G = G(V, S) and a drected
More informationRestricted Lie Algebras. Jared Warner
Restrcted Le Algebras Jared Warner 1. Defntons and Examples Defnton 1.1. Let k be a feld of characterstc p. A restrcted Le algebra (g, ( ) [p] ) s a Le algebra g over k and a map ( ) [p] : g g called
More informationQuantum Mechanics I - Session 4
Quantum Mechancs I - Sesson 4 Aprl 3, 05 Contents Operators Change of Bass 4 3 Egenvectors and Egenvalues 5 3. Denton....................................... 5 3. Rotaton n D....................................
More information= = = (a) Use the MATLAB command rref to solve the system. (b) Let A be the coefficient matrix and B be the right-hand side of the system.
Chapter Matlab Exercses Chapter Matlab Exercses. Consder the lnear system of Example n Secton.. x x x y z y y z (a) Use the MATLAB command rref to solve the system. (b) Let A be the coeffcent matrx and
More information1 Matrix representations of canonical matrices
1 Matrx representatons of canoncal matrces 2-d rotaton around the orgn: ( ) cos θ sn θ R 0 = sn θ cos θ 3-d rotaton around the x-axs: R x = 1 0 0 0 cos θ sn θ 0 sn θ cos θ 3-d rotaton around the y-axs:
More informationInner Product. Euclidean Space. Orthonormal Basis. Orthogonal
Inner Product Defnton 1 () A Eucldean space s a fnte-dmensonal vector space over the reals R, wth an nner product,. Defnton 2 (Inner Product) An nner product, on a real vector space X s a symmetrc, blnear,
More informationErrata to Invariant Theory with Applications January 28, 2017
Invarant Theory wth Applcatons Jan Drasma and Don Gjswjt http: //www.wn.tue.nl/~jdrasma/teachng/nvtheory0910/lecturenotes12.pdf verson of 7 December 2009 Errata and addenda by Darj Grnberg The followng
More informationMEM633 Lectures 7&8. Chapter 4. Descriptions of MIMO Systems 4-1 Direct Realizations. (i) x u. y x
MEM633 Lectures 7&8 Chapter 4 Descrptons of MIMO Systems 4- Drect ealzatons y() s s su() s y () s u () s ( s)( s) s y() s u (), s y() s u() s s s y() s u(), s y() s u() s ( s)( s) s () ( s ) y ( s) u (
More informationSolutions Homework 4 March 5, 2018
1 Solutons Homework 4 March 5, 018 Soluton to Exercse 5.1.8: Let a IR be a translaton and c > 0 be a re-scalng. ˆb1 (cx + a) cx n + a (cx 1 + a) c x n x 1 cˆb 1 (x), whch shows ˆb 1 s locaton nvarant and
More informationC/CS/Phy191 Problem Set 3 Solutions Out: Oct 1, 2008., where ( 00. ), so the overall state of the system is ) ( ( ( ( 00 ± 11 ), Φ ± = 1
C/CS/Phy9 Problem Set 3 Solutons Out: Oct, 8 Suppose you have two qubts n some arbtrary entangled state ψ You apply the teleportaton protocol to each of the qubts separately What s the resultng state obtaned
More informationn α j x j = 0 j=1 has a nontrivial solution. Here A is the n k matrix whose jth column is the vector for all t j=0
MODULE 2 Topcs: Lnear ndependence, bass and dmenson We have seen that f n a set of vectors one vector s a lnear combnaton of the remanng vectors n the set then the span of the set s unchanged f that vector
More informationDISCRIMINANTS AND RAMIFIED PRIMES. 1. Introduction A prime number p is said to be ramified in a number field K if the prime ideal factorization
DISCRIMINANTS AND RAMIFIED PRIMES KEITH CONRAD 1. Introducton A prme number p s sad to be ramfed n a number feld K f the prme deal factorzaton (1.1) (p) = po K = p e 1 1 peg g has some e greater than 1.
More informationComposite Hypotheses testing
Composte ypotheses testng In many hypothess testng problems there are many possble dstrbutons that can occur under each of the hypotheses. The output of the source s a set of parameters (ponts n a parameter
More informationBézier curves. Michael S. Floater. September 10, These notes provide an introduction to Bézier curves. i=0
Bézer curves Mchael S. Floater September 1, 215 These notes provde an ntroducton to Bézer curves. 1 Bernsten polynomals Recall that a real polynomal of a real varable x R, wth degree n, s a functon of
More informationProblem Set 9 Solutions
Desgn and Analyss of Algorthms May 4, 2015 Massachusetts Insttute of Technology 6.046J/18.410J Profs. Erk Demane, Srn Devadas, and Nancy Lynch Problem Set 9 Solutons Problem Set 9 Solutons Ths problem
More informationa b a In case b 0, a being divisible by b is the same as to say that
Secton 6.2 Dvsblty among the ntegers An nteger a ε s dvsble by b ε f there s an nteger c ε such that a = bc. Note that s dvsble by any nteger b, snce = b. On the other hand, a s dvsble by only f a = :
More informationLinear, affine, and convex sets and hulls In the sequel, unless otherwise specified, X will denote a real vector space.
Lnear, affne, and convex sets and hulls In the sequel, unless otherwse specfed, X wll denote a real vector space. Lnes and segments. Gven two ponts x, y X, we defne xy = {x + t(y x) : t R} = {(1 t)x +
More informationHomework 1 Lie Algebras
Homework 1 Le Algebras Joshua Ruter February 9, 018 Proposton 0.1 Problem 1.7a). Let A be a K-algebra, wth char K. Then A s alternatve f and only f the folowng two lnear) denttes hold for all a, b, y A.
More information8.6 The Complex Number System
8.6 The Complex Number System Earler n the chapter, we mentoned that we cannot have a negatve under a square root, snce the square of any postve or negatve number s always postve. In ths secton we want
More informationA CHARACTERIZATION OF ADDITIVE DERIVATIONS ON VON NEUMANN ALGEBRAS
Journal of Mathematcal Scences: Advances and Applcatons Volume 25, 2014, Pages 1-12 A CHARACTERIZATION OF ADDITIVE DERIVATIONS ON VON NEUMANN ALGEBRAS JIA JI, WEN ZHANG and XIAOFEI QI Department of Mathematcs
More informationMATH Sensitivity of Eigenvalue Problems
MATH 537- Senstvty of Egenvalue Problems Prelmnares Let A be an n n matrx, and let λ be an egenvalue of A, correspondngly there are vectors x and y such that Ax = λx and y H A = λy H Then x s called A
More informationComputing π with Bouncing Balls
by Let the mass of two balls be M and m, where M = (6 n )m for n N. The larger ball s rolled towards the lghter ball, whch ear a wall and ntally at rest. Fnd the number of collsons between the two balls
More informationA p-adic PERRON-FROBENIUS THEOREM
A p-adic PERRON-FROBENIUS THEOREM ROBERT COSTA AND PATRICK DYNES Advsor: Clayton Petsche Oregon State Unversty Abstract We prove a result for square matrces over the p-adc numbers akn to the Perron-Frobenus
More informationStanford University CS359G: Graph Partitioning and Expanders Handout 4 Luca Trevisan January 13, 2011
Stanford Unversty CS359G: Graph Parttonng and Expanders Handout 4 Luca Trevsan January 3, 0 Lecture 4 In whch we prove the dffcult drecton of Cheeger s nequalty. As n the past lectures, consder an undrected
More informationALGEBRA HW 7 CLAY SHONKWILER
ALGEBRA HW 7 CLAY SHONKWILER 1 Whch of the followng rngs R are dscrete valuaton rngs? For those that are, fnd the fracton feld K = frac R, the resdue feld k = R/m (where m) s the maxmal deal), and a unformzer
More informationPerron Vectors of an Irreducible Nonnegative Interval Matrix
Perron Vectors of an Irreducble Nonnegatve Interval Matrx Jr Rohn August 4 2005 Abstract As s well known an rreducble nonnegatve matrx possesses a unquely determned Perron vector. As the man result of
More information9 Characteristic classes
THEODORE VORONOV DIFFERENTIAL GEOMETRY. Sprng 2009 [under constructon] 9 Characterstc classes 9.1 The frst Chern class of a lne bundle Consder a complex vector bundle E B of rank p. We shall construct
More informationA combinatorial problem associated with nonograms
A combnatoral problem assocated wth nonograms Jessca Benton Ron Snow Nolan Wallach March 21, 2005 1 Introducton. Ths work was motvated by a queston posed by the second named author to the frst named author
More informationU.C. Berkeley CS294: Beyond Worst-Case Analysis Luca Trevisan September 5, 2017
U.C. Berkeley CS94: Beyond Worst-Case Analyss Handout 4s Luca Trevsan September 5, 07 Summary of Lecture 4 In whch we ntroduce semdefnte programmng and apply t to Max Cut. Semdefnte Programmng Recall that
More information763622S ADVANCED QUANTUM MECHANICS Solution Set 1 Spring c n a n. c n 2 = 1.
7636S ADVANCED QUANTUM MECHANICS Soluton Set 1 Sprng 013 1 Warm-up Show that the egenvalues of a Hermtan operator  are real and that the egenkets correspondng to dfferent egenvalues are orthogonal (b)
More informationSupplement: Proofs and Technical Details for The Solution Path of the Generalized Lasso
Supplement: Proofs and Techncal Detals for The Soluton Path of the Generalzed Lasso Ryan J. Tbshran Jonathan Taylor In ths document we gve supplementary detals to the paper The Soluton Path of the Generalzed
More informationFirst day August 1, Problems and Solutions
FOURTH INTERNATIONAL COMPETITION FOR UNIVERSITY STUDENTS IN MATHEMATICS July 30 August 4, 997, Plovdv, BULGARIA Frst day August, 997 Problems and Solutons Problem. Let {ε n } n= be a sequence of postve
More informationMath 217 Fall 2013 Homework 2 Solutions
Math 17 Fall 013 Homework Solutons Due Thursday Sept. 6, 013 5pm Ths homework conssts of 6 problems of 5 ponts each. The total s 30. You need to fully justfy your answer prove that your functon ndeed has
More informationLinear Algebra and its Applications
Lnear Algebra and ts Applcatons 4 (00) 5 56 Contents lsts avalable at ScenceDrect Lnear Algebra and ts Applcatons journal homepage: wwwelsevercom/locate/laa Notes on Hlbert and Cauchy matrces Mroslav Fedler
More informationREDUCTION MODULO p. We will prove the reduction modulo p theorem in the general form as given by exercise 4.12, p. 143, of [1].
REDUCTION MODULO p. IAN KIMING We wll prove the reducton modulo p theorem n the general form as gven by exercse 4.12, p. 143, of [1]. We consder an ellptc curve E defned over Q and gven by a Weerstraß
More informationLearning Theory: Lecture Notes
Learnng Theory: Lecture Notes Lecturer: Kamalka Chaudhur Scrbe: Qush Wang October 27, 2012 1 The Agnostc PAC Model Recall that one of the constrants of the PAC model s that the data dstrbuton has to be
More informationDeriving the X-Z Identity from Auxiliary Space Method
Dervng the X-Z Identty from Auxlary Space Method Long Chen Department of Mathematcs, Unversty of Calforna at Irvne, Irvne, CA 92697 chenlong@math.uc.edu 1 Iteratve Methods In ths paper we dscuss teratve
More informationAnti-van der Waerden numbers of 3-term arithmetic progressions.
Ant-van der Waerden numbers of 3-term arthmetc progressons. Zhanar Berkkyzy, Alex Schulte, and Mchael Young Aprl 24, 2016 Abstract The ant-van der Waerden number, denoted by aw([n], k), s the smallest
More informationEigenvalues of Random Graphs
Spectral Graph Theory Lecture 2 Egenvalues of Random Graphs Danel A. Spelman November 4, 202 2. Introducton In ths lecture, we consder a random graph on n vertces n whch each edge s chosen to be n the
More informationU.C. Berkeley CS278: Computational Complexity Professor Luca Trevisan 2/21/2008. Notes for Lecture 8
U.C. Berkeley CS278: Computatonal Complexty Handout N8 Professor Luca Trevsan 2/21/2008 Notes for Lecture 8 1 Undrected Connectvty In the undrected s t connectvty problem (abbrevated ST-UCONN) we are gven
More informationThe Order Relation and Trace Inequalities for. Hermitian Operators
Internatonal Mathematcal Forum, Vol 3, 08, no, 507-57 HIKARI Ltd, wwwm-hkarcom https://doorg/0988/mf088055 The Order Relaton and Trace Inequaltes for Hermtan Operators Y Huang School of Informaton Scence
More informationLecture 5 Decoding Binary BCH Codes
Lecture 5 Decodng Bnary BCH Codes In ths class, we wll ntroduce dfferent methods for decodng BCH codes 51 Decodng the [15, 7, 5] 2 -BCH Code Consder the [15, 7, 5] 2 -code C we ntroduced n the last lecture
More informationShort running title: A generating function approach A GENERATING FUNCTION APPROACH TO COUNTING THEOREMS FOR SQUARE-FREE POLYNOMIALS AND MAXIMAL TORI
Short runnng ttle: A generatng functon approach A GENERATING FUNCTION APPROACH TO COUNTING THEOREMS FOR SQUARE-FREE POLYNOMIALS AND MAXIMAL TORI JASON FULMAN Abstract. A recent paper of Church, Ellenberg,
More informationU.C. Berkeley CS294: Beyond Worst-Case Analysis Handout 6 Luca Trevisan September 12, 2017
U.C. Berkeley CS94: Beyond Worst-Case Analyss Handout 6 Luca Trevsan September, 07 Scrbed by Theo McKenze Lecture 6 In whch we study the spectrum of random graphs. Overvew When attemptng to fnd n polynomal
More informationTHERE ARE NO POINTS OF ORDER 11 ON ELLIPTIC CURVES OVER Q.
THERE ARE NO POINTS OF ORDER 11 ON ELLIPTIC CURVES OVER Q. IAN KIMING We shall prove the followng result from [2]: Theorem 1. (Bllng-Mahler, 1940, cf. [2]) An ellptc curve defned over Q does not have a
More informationMath 261 Exercise sheet 2
Math 261 Exercse sheet 2 http://staff.aub.edu.lb/~nm116/teachng/2017/math261/ndex.html Verson: September 25, 2017 Answers are due for Monday 25 September, 11AM. The use of calculators s allowed. Exercse
More informationPRIMES 2015 reading project: Problem set #3
PRIMES 2015 readng project: Problem set #3 page 1 PRIMES 2015 readng project: Problem set #3 posted 31 May 2015, to be submtted around 15 June 2015 Darj Grnberg The purpose of ths problem set s to replace
More informationMEM 255 Introduction to Control Systems Review: Basics of Linear Algebra
MEM 255 Introducton to Control Systems Revew: Bascs of Lnear Algebra Harry G. Kwatny Department of Mechancal Engneerng & Mechancs Drexel Unversty Outlne Vectors Matrces MATLAB Advanced Topcs Vectors A
More informationLecture 2: Gram-Schmidt Vectors and the LLL Algorithm
NYU, Fall 2016 Lattces Mn Course Lecture 2: Gram-Schmdt Vectors and the LLL Algorthm Lecturer: Noah Stephens-Davdowtz 2.1 The Shortest Vector Problem In our last lecture, we consdered short solutons to
More informationBezier curves. Michael S. Floater. August 25, These notes provide an introduction to Bezier curves. i=0
Bezer curves Mchael S. Floater August 25, 211 These notes provde an ntroducton to Bezer curves. 1 Bernsten polynomals Recall that a real polynomal of a real varable x R, wth degree n, s a functon of the
More informationNotes on Frequency Estimation in Data Streams
Notes on Frequency Estmaton n Data Streams In (one of) the data streamng model(s), the data s a sequence of arrvals a 1, a 2,..., a m of the form a j = (, v) where s the dentty of the tem and belongs to
More informationBACKGROUND: WEAK CONVERGENCE, LINEAR ALGEBRA 1. WEAK CONVERGENCE
BACKGROUND: WEAK CONVERGENCE, LINEAR ALGEBRA 1. WEAK CONVERGENCE Defnton 1. Let (X,d) be a complete, separable metrc space (also known as a Polsh space). The Borel σ algebra on X s the mnmal σ algebra
More informationWeek 2. This week, we covered operations on sets and cardinality.
Week 2 Ths week, we covered operatons on sets and cardnalty. Defnton 0.1 (Correspondence). A correspondence between two sets A and B s a set S contaned n A B = {(a, b) a A, b B}. A correspondence from
More informationExample: (13320, 22140) =? Solution #1: The divisors of are 1, 2, 3, 4, 5, 6, 9, 10, 12, 15, 18, 20, 27, 30, 36, 41,
The greatest common dvsor of two ntegers a and b (not both zero) s the largest nteger whch s a common factor of both a and b. We denote ths number by gcd(a, b), or smply (a, b) when there s no confuson
More informatione - c o m p a n i o n
OPERATIONS RESEARCH http://dxdoorg/0287/opre007ec e - c o m p a n o n ONLY AVAILABLE IN ELECTRONIC FORM 202 INFORMS Electronc Companon Generalzed Quantty Competton for Multple Products and Loss of Effcency
More informationBernoulli Numbers and Polynomials
Bernoull Numbers and Polynomals T. Muthukumar tmk@tk.ac.n 17 Jun 2014 The sum of frst n natural numbers 1, 2, 3,..., n s n n(n + 1 S 1 (n := m = = n2 2 2 + n 2. Ths formula can be derved by notng that
More informationLecture 7: Gluing prevarieties; products
Lecture 7: Glung prevaretes; products 1 The category of algebrac prevaretes Proposton 1. Let (f,ϕ) : (X,O X ) (Y,O Y ) be a morphsm of algebrac prevaretes. If U X and V Y are affne open subvaretes wth
More informationSingular Value Decomposition: Theory and Applications
Sngular Value Decomposton: Theory and Applcatons Danel Khashab Sprng 2015 Last Update: March 2, 2015 1 Introducton A = UDV where columns of U and V are orthonormal and matrx D s dagonal wth postve real
More informationRapid growth in finite simple groups
Rapd growth n fnte smple groups Martn W. Lebeck, Gl Schul, Aner Shalev March 1, 016 Abstract We show that small normal subsets A of fnte smple groups grow very rapdly namely, A A ɛ, where ɛ > 0 s arbtrarly
More informationBallot Paths Avoiding Depth Zero Patterns
Ballot Paths Avodng Depth Zero Patterns Henrch Nederhausen and Shaun Sullvan Florda Atlantc Unversty, Boca Raton, Florda nederha@fauedu, ssull21@fauedu 1 Introducton In a paper by Sapounaks, Tasoulas,
More informationLinear Approximation with Regularization and Moving Least Squares
Lnear Approxmaton wth Regularzaton and Movng Least Squares Igor Grešovn May 007 Revson 4.6 (Revson : March 004). 5 4 3 0.5 3 3.5 4 Contents: Lnear Fttng...4. Weghted Least Squares n Functon Approxmaton...
More informationPolynomials. 1 What is a polynomial? John Stalker
Polynomals John Stalker What s a polynomal? If you thnk you already know what a polynomal s then skp ths secton. Just be aware that I consstently wrte thngs lke p = c z j =0 nstead of p(z) = c z. =0 You
More informationAn Introduction to Morita Theory
An Introducton to Morta Theory Matt Booth October 2015 Nov. 2017: made a few revsons. Thanks to Nng Shan for catchng a typo. My man reference for these notes was Chapter II of Bass s book Algebrac K-Theory
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 12 10/21/2013. Martingale Concentration Inequalities and Applications
MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.65/15.070J Fall 013 Lecture 1 10/1/013 Martngale Concentraton Inequaltes and Applcatons Content. 1. Exponental concentraton for martngales wth bounded ncrements.
More informationHowever, since P is a symmetric idempotent matrix, of P are either 0 or 1 [Eigen-values
Fall 007 Soluton to Mdterm Examnaton STAT 7 Dr. Goel. [0 ponts] For the general lnear model = X + ε, wth uncorrelated errors havng mean zero and varance σ, suppose that the desgn matrx X s not necessarly
More informationA FORMULA FOR COMPUTING INTEGER POWERS FOR ONE TYPE OF TRIDIAGONAL MATRIX
Hacettepe Journal of Mathematcs and Statstcs Volume 393 0 35 33 FORMUL FOR COMPUTING INTEGER POWERS FOR ONE TYPE OF TRIDIGONL MTRIX H Kıyak I Gürses F Yılmaz and D Bozkurt Receved :08 :009 : ccepted 5
More informationLECTURE 9 CANONICAL CORRELATION ANALYSIS
LECURE 9 CANONICAL CORRELAION ANALYSIS Introducton he concept of canoncal correlaton arses when we want to quantfy the assocatons between two sets of varables. For example, suppose that the frst set of
More informationMatrix Approximation via Sampling, Subspace Embedding. 1 Solving Linear Systems Using SVD
Matrx Approxmaton va Samplng, Subspace Embeddng Lecturer: Anup Rao Scrbe: Rashth Sharma, Peng Zhang 0/01/016 1 Solvng Lnear Systems Usng SVD Two applcatons of SVD have been covered so far. Today we loo
More informationGoogle PageRank with Stochastic Matrix
Google PageRank wth Stochastc Matrx Md. Sharq, Puranjt Sanyal, Samk Mtra (M.Sc. Applcatons of Mathematcs) Dscrete Tme Markov Chan Let S be a countable set (usually S s a subset of Z or Z d or R or R d
More informationDifference Equations
Dfference Equatons c Jan Vrbk 1 Bascs Suppose a sequence of numbers, say a 0,a 1,a,a 3,... s defned by a certan general relatonshp between, say, three consecutve values of the sequence, e.g. a + +3a +1
More informationFACTORIZATION IN KRULL MONOIDS WITH INFINITE CLASS GROUP
C O L L O Q U I U M M A T H E M A T I C U M VOL. 80 1999 NO. 1 FACTORIZATION IN KRULL MONOIDS WITH INFINITE CLASS GROUP BY FLORIAN K A I N R A T H (GRAZ) Abstract. Let H be a Krull monod wth nfnte class
More information1 GSW Iterative Techniques for y = Ax
1 for y = A I m gong to cheat here. here are a lot of teratve technques that can be used to solve the general case of a set of smultaneous equatons (wrtten n the matr form as y = A), but ths chapter sn
More informationNon-negative Matrices and Distributed Control
Non-negatve Matrces an Dstrbute Control Yln Mo July 2, 2015 We moel a network compose of m agents as a graph G = {V, E}. V = {1, 2,..., m} s the set of vertces representng the agents. E V V s the set of
More informationMath 594. Solutions 1
Math 594. Solutons 1 1. Let V and W be fnte-dmensonal vector spaces over a feld F. Let G = GL(V ) and H = GL(W ) be the assocated general lnear groups. Let X denote the vector space Hom F (V, W ) of lnear
More informationOn the Operation A in Analysis Situs. by Kazimierz Kuratowski
v1.3 10/17 On the Operaton A n Analyss Stus by Kazmerz Kuratowsk Author s note. Ths paper s the frst part slghtly modfed of my thess presented May 12, 1920 at the Unversty of Warsaw for the degree of Doctor
More informationLecture 12: Discrete Laplacian
Lecture 12: Dscrete Laplacan Scrbe: Tanye Lu Our goal s to come up wth a dscrete verson of Laplacan operator for trangulated surfaces, so that we can use t n practce to solve related problems We are mostly
More informationHomework Notes Week 7
Homework Notes Week 7 Math 4 Sprng 4 #4 (a Complete the proof n example 5 that s an nner product (the Frobenus nner product on M n n (F In the example propertes (a and (d have already been verfed so we
More information18.781: Solution to Practice Questions for Final Exam
18.781: Soluton to Practce Questons for Fnal Exam 1. Fnd three solutons n postve ntegers of x 6y = 1 by frst calculatng the contnued fracton expanson of 6. Soluton: We have 1 6=[, ] 6 6+ =[, ] 1 =[,, ]=[,,
More informationComplete subgraphs in multipartite graphs
Complete subgraphs n multpartte graphs FLORIAN PFENDER Unverstät Rostock, Insttut für Mathematk D-18057 Rostock, Germany Floran.Pfender@un-rostock.de Abstract Turán s Theorem states that every graph G
More information