Definition: The residue Res(f, c) of a function f(z) at c is the coefficient of (z c) 1 in the Laurent series expansion of f at c.

Size: px
Start display at page:

Download "Definition: The residue Res(f, c) of a function f(z) at c is the coefficient of (z c) 1 in the Laurent series expansion of f at c."

Transcription

1 efnton: The resdue Res(f, c) of a functon f(z) at c s the coeffcent of (z c) n the Laurent seres expanson of f at c. Computaton: To compute Res(f, c), consder (z c)f(z) : g(z) g(c) + +(z c) n g (n) (c)/n! +. Then f(z)(z c) g(c) + + (z c) n g (n) (c)/n!. Thus Res(f, c) g(c) (z c)f(z) zc. If f s analytcal n a neghborhood of c, then Res(f, c) (z c)f(z) zc. The converse s not generally true. At a smple pole c, the resdue of f s gven by: More generally, f c s a pole of order n, then f(z)h(z)/(z c) n, and so Res(f, c) s gven by: (z c)f(z) zc (z c) h(z)/(z c) n zc h(z)/(z c) n zc h (n ) (z)/(n )! zc [(z c) n f(z)] (n ) / (n )! zc, where the 3 rd equalty s obtaned by dfferentatng the numerator and denomnator (n ) tmes. In other words, f c s a pole of order n, then resdue of f at c can be determned by the formula: Ths formula can be very useful n determnng the resdues for low order poles. For hgher order poles, the calculatons can become unmanageable, and a drect seres expanson may be easer. Applcaton: Accordng to resdue theorem: Here, s a closed curve, and I(, a k ) counts the number of tmes wnds around a k (k th pont nsde the closed curve where f s not analytc) n a counter clockwse manner. Snce resdues can be computed qute easly (as dscussed above), they can be used to easly determne a contour ntegral va the above resdue theorem. As an example, the above theorem s used n dervng the Nyqust crteron for stablty (#RHP poles of closed loop #RHP poles of open loop + #encrclements of (,) by plot of open loop freq. response).

2 The resdue theorem and ts applcatons Olver Knll Caltech, 996 Ths text contans some notes to a three hour lecture n complex analyss gven at Caltech. The lectures start from scratch and contan an essentally self-contaned proof of the Jordan normal form theorem, I had learned from Eugene Trubowtz as an undergraduate at ETH Zürch n the thrd semester of the standard calculus educaton at that school. My text also ncludes two proofs of the fundamental theorem of algebra usng complex analyss and examples, whch examples showng how resdue calculus can help to calculate some defnte ntegrals. Except for the proof of the normal form theorem, the materal s contaned n standard text books on complex analyss. The notes assume famlarty wth partal dervatves and lne ntegrals. I use Trubowtz approach to use Greens theorem to prove Cauchy s theorem. [ When I had been an undergraduate, such a drect multvarable lnk was not n my complex analyss text books (Ahlfors for example does not menton Greens theorem n hs book).] For the Jordan form secton, some lnear algebra knowledge s requred. The resdue theorem efnton Let C be open (every pont n has a small dsc around t whch stll s n ). enote by C () the dfferentable functons C. Ths means that for f(z) f(x + y) u(x + y) + v(x + y) the partal dervatves u x, u y, v x, v y are contnuous, real-valued functons on. efnton. Let : (a, b) be a dfferentable curve n. efne the complex lne ntegral b f(z) dz f((t)) (t) dt If z x + y, and f u + v, we have f(z) dz b a a (uẋ vẏ) + (uẏ + vẋ) dt The ntegral for pecewse dfferentable curves s obtaned by addng the ntegrals of the peces. We always assume from now on that all curves are pecewse dfferentable. Example. { z < r} wth r >, : [, k 2π], (t) (cos(t), sn(t)), f(z) z n wth k N,n Z. If n, we get z n dz k2π If n, we have zn dz k2π dt k 2π. e nt e t dt k2π z n dz n + e(n+2)t k2π e (n+)t dt We recall from vector calculus the Green formula for a vector feld (u, v) n R 2 (uẋ + vẏ) dt (v x u y ) dx dy, where s the open set enclosed by closed curve δ and where dx dy dxdy s the volume form n the plane. Wrte dz dx + dy, dz dx dy and dz dz 2dx dy. efne for f C ()

3 f(a + ǫe t ) f(a) C ǫ Theorem. (Complex Green Formula) f C (), C, δ. f(z)dz f z dz dz. Proof. Green s theorem appled twce (to the real part wth the vector feld (u, v) and to the magnary part wth the vector feld (v, u)) shows that b f(z) dz (uẋ vẏ) + (uẏ + vẋ) dt concdes wth f z dz dz a 2 (u x v y ) + 2 (u y + v x ) 2dx dy ( u y v x )dx dy + (u x v y )dx dy We check that f z u x v y, v x u y. The rght hand sde are called the Cauchy-Remann dfferental equatons. efnton. enote by C ω () the set of functons n C () for whch f z for all z. Functons f Cω () are called analytc or holomorphc n. Corollary.2 (Theorem of Cauchy) f C ω (), C, δ. f(z) dz. Proof. f(z) dz f dz dz z Corollary.3 (Cauchy s Integral formula) f C ω (), smply connected, δ. For any a f(a) f(w) dw 2π w a. Proof. efne for small enough ǫ > the set ǫ \ { z a ǫ} and the curve ǫ : t z + ǫe t. (Because s open, the set ǫ s contaned n for small enough ǫ). Because ǫ δ ǫ we get by Cauchy s theorem.2 f(w) w a dw f(w) w a dw. We compute ǫ f(w) 2π w a dw ǫ f(z + ǫ e t ) d a + ǫ e t a dt (a + ǫet ) dt 2π The rght hand sde converges for ǫ to 2πf(a) because f C () mples f(a + ǫ e t ) dt

4 Corollary.4 (Generalzed Cauchy Integral formulas) Assume f C ω () and C smply connected, and δ. For all n N one has f (n) (z) C ω () and for any z / f (n) (z) n! f(w) dz 2π (w z) n+. Proof. Just dfferentate Cauchy s ntegral formula n tmes. It follows that f C ω () s arbtrary often dfferentable. efnton Let f C ω ( \ {a}) and a wth smply connected C wth boundary. efne the resdue of f at a as Res(f, a) : f(z) dz. 2π By Cauchy s theorem, the value does not depend on. Example. f(z) (z a) and { z a < }. Our calculaton n the example at the begnnng of the secton gves Res(f, a). A generalzaton of Cauchy s theorem s the followng resdue theorem: Corollary.5 (The resdue theorem) f C ω ( \ {z } n ), open contanng {z } wth boundary δ. f(z) dz 2π n Res(f, z ). Proof. Take ǫ so small that { z z ǫ} are all dsjont and contaned n. Applyng Cauchy s theorem to the doman \ n leads to the above formula. 2 Calculaton of defnte ntegrals The resdue theorem has applcatons n functonal analyss, lnear algebra, analytc number theory, quantum feld theory, algebrac geometry, Abelan ntegrals or dynamcal systems. In ths secton we want to see how the resdue theorem can be used to computng defnte real ntegrals. The frst example s the ntegral-sne S(x) x a functon whch has applcatons n electrcal engneerng. It s used also n the proof of the prme number theorem whch states that the functon π(n) {p n p prme} satsfes π(n) x/log(x) for x. sn(t) t dt, S( ) sn(x) x dx π 2 Proof. Let f(z) ez z whch satsfes f C ω (C \ {}). For z x R, we have Im(f(z)) sn(x) x. efne for R > ǫ > the open set enclosed by the curve 4, where

5 Fgure : t [ǫ, R] t +. 2 : t [, π] R e t. 3 : t [ R, ǫ] t +. 4 : t [π, ] ǫ e t. R R By Cauchy s theorem f(z) dz R ǫ e x π x dx + e Ret ǫ e x Re t Ret dt + R x dx + e ǫet π ǫe t ǫet dt. The magnary part of the frst and the thrd ntegral converge for ǫ, R both to S( ). The magnary part of the fourth ntegral converges to π because lm ǫ π e ǫet dt π. The second ntegral converges to zero for R because e Ret e R sn(t) e Rt for t (, π/2]. + x 2 dx π Proof. Take f(z) + z 2 whch has a smple pole a n the upper half plane. efne for R > the half-dsc wth a hole whch has as a boundary the curve 2 wth : t [ R, R] t +. 2 : t [, π] R e t. f s analytc n \ {} and by the resdue theorem R π f(z) dz + x 2 dx Re t dt + R 2 2π Res(f(z), ) 2π lm(z ) f(z) π e2t z R The second ntegral from the curve 2 goes to zero for R. Let f, g be two polynomals wth n deg(g) 2 + deg(f) such that the poles z of h : f/g are not on R + {}. h(x) dx n Res(h(z) log(z), z ) Proof. efne for R > r > the doman enclosed by the curves R r + wth + : t [r, R] t +. : t [R, r] t +. R : t [, 2π] R e t. r : t [, 2π] r e t. and apply the resdue theorem for the functon h(z) log(z): h(z) log(z) dz h(z)log(z) dz + h(z)log(z) dz + h(z)log(z) dz + h(z) log(z) dz

6 Because of the degree assumpton, R h(z)log(z) for R. Because h s analytc near and log(z) goes slower to than z we get also r h(z)log(z) dz as r. The sum of the last two ntegrals goes to (2π) h(x) dx because h(z)log(z) dz h(z)(log(z) + 2π) dz. + π dθ a + cos(θ) dθ π a2, a > Proof. Put z e θ. Then Let : θ e θ π a + cos(θ) a + z + z 2 2az + z2 + 2z dθ a + cos(θ) dθ 2π dθ 2 a + cos(θ) dθ 2dz 2 2az + z 2 +. From the two zeros a ± a 2 of the polynomal 2az + z 2 + the root λ + s n the unt dsc and λ outsde the unt dsc. From the resdue theorem, the ntegral s 2π Res( 2az + z 2 +, λ +) 3 Jordan normal form for matrces 2π λ + λ. π a2. As an other applcaton of complex analyss, we gve an elegant proof of Jordan s normal form theorem n lnear algebra wth the help of the Cauchy-resdue calculus. Let M(n,R) denote the set of real n n matrces and by M(n,C) the set n n matrces wth complex entres. For A M(n, C) the characterstc polynomal s det(λ A) k (λ λ ) µ. We smply wrte λ A nstead of λi A, where I s the dentty matrx. The complex numbers λ are called the egenvalues of A and µ denote ther multplctes. Clearly k µ n. Two matrces A, B M(n,C) are called smlar f there exsts an nvertble matrx S such that A S BS. Theorem 3. (Jordan normal form theorem) [A ]... A M(n,C) s smlar to a matrx [A 2 ] where A [A k ] λ λ λ are called normal blocks. Remark. It follows f all egenvalues of A are dfferent, then A s dagonalzable. enote for λ λ the resolvent matrx R(λ) (λ A). The functon λ R(λ) s analytc n C \ {λ } n the sense that for all, j, the functons λ [R(λ)] j are

7 (where A (j) are the matrces obtaned by deletng the th row and the j th column of A), such that [R(λ)] j α j(λ) det(λ A). Lemma 3.2 (The resolvent dentty) R(λ) R(λ ) (λ λ)r(λ)r(λ ) Proof. From A(λ A) (λ A)A follows R(λ)A AR(λ) and we get by fllng n (λ A)R(λ ) I and (λ A)R(λ) I R(λ) R(λ ) R(λ)(λ A)R(λ ) (λ A)R(λ)R(λ ) (λ λ)r(λ)r(λ ). efnton C ω (, M(n,C)) denotes the set of functons f : M(n,C), such that for all, j the map z [f(z)] j s n C ω (). Gven a curve n we defne the complex ntegral f(z) dz by [ f(z) dz] j [f(z)] j dz. efne for δ < mn j λ λ j and : t z + δe t the matrces P R(λ) dλ 2π N (λ λ )R(λ) dλ. 2π Theorem 3.3 (Jordan decomposton of a matrx) ) P P j δ j P j, 2) k P I. 3) N P j δ j N P j N 4) N N j, j, P (A λ ) N, N µ 5) A k λ P + k N Proof. ) For j we have usng the resolvent dentty (2π) 2 P P j R(λ) dλ R(λ ) dλ R(λ)R(λ ) dλdλ j j R(λ) R(λ ) j λ dλ dλ λ R(λ) j λ λ dλ dλ + R(λ ) j λ λ dλ dλ. On the other hand, wth : t λ + δ/2 e t (2π) 2 R(λ) R(λ ) P P λ dλ dλ R(λ) R(λ ) λ λ dλ dλ λ R(λ) λ λ dλ dλ R(λ ) λ dλ dλ λ 2π R(λ )dλ, where we used λ λ dλ and λ λ dλ 2π. 2) Usng Cauchy s theorem we have for any curve R { λ R} enclosng all the egenvalues k k P R(λ) dλ R(λ) dλ 2π 2π R R(λ) A R(λ) dλ + A R(λ) dλ

8 The clam follows from and from the fact that for R 2π R λ dλ A R(λ) dλ R λ snce R(λ) j C λ for a constant C only dependent on A. 3) For j, we get wth the resolvent dentty (2π) 2 N P j (λ λ ) R(λ)R(λ ) dλ dλ j λ λ j λ λ (R(λ) R(λ )) dλ dλ λ λ j λ λ R(λ) λ λ dλ dλ j λ λ R(λ ) dλ dλ. Usng the curve { λ λ δ/2} we have (2π) 2 N P (λ λ ) R(λ)R(λ ) dλ dλ λ λ λ λ (R(λ) R(λ )) dλ dλ (λ λ )R(λ) dλ (2π) 2 N. λ λ dλ + (λ λ )R(λ ) dλ λ λ dλ 4) N N j s left as an exercse. (The calculaton goes completely analogue to the already done calculatons n ) or n 3) (2π)P (A λ ) R(λ)(A λ ) dλ R(λ)(A λ ) I dλ R(λ)(A λ ) R(λ)(A λ) dλ (λ λ )R(λ) dλ (2π)N. Usng 3) and ) we get from the just obtaned equalty (2π)N k (2π)P (A λ ) k R(λ)(A λ ) k dλ R(λ)(A λ ) k R(λ)(A λ ) k (A λ) dλ R(λ)(A λ ) k (λ λ ) dλ R(λ)(A λ ) (k ) (λ λ ) R(λ)(A λ ) k 2 (A λ) dλ R(λ)(A λ ) k 2 (λ λ ) 2 dλ. Repeatng lke ths k 2 more tmes, we get (2π)N k (λ λ ) k R(λ) dλ. The clam N µ follows from the fact that (λ λ ) µ R(λ) s analytc.

9 Remark. It follows that the matrx A leaves nvarant the subspaces H P H of H C n and acts on H as v λ v + N v. There s a bass of H, the matrces N have n the sde dagonal and are everywhere else: by 4), we know that µ s the smallest k such that N k. It mples that all egenvalues of N are. There exsts a vector v H such that {N kv v k} n k form a bass n H. (Ths s an exercse: any nontrval relaton j a jn j v would mply that N had an egenvalue dfferent from ). In that bass, the transformaton N s the matrx N The matrx A s now a drect sum of Jordan blocks A k A, where λ A λ λ Exercses: ) Perform the calculaton whch had been left out n the above proof: show that N N j, j.. 2) Show that f a lnear transformaton N on a µ dmensonal space has the property N µ and N k for k < µ, then there s a bass n whch N s a Jordan block wth zeros n the dagonal. 4 The argument prncple Cauchy s ntegral formula and the resdue formula can be expressed more naturally usng the noton of the wndng number.. Lemma 4. Let be closed curve n C avodng a pont a C. There exsts k Z such that dz z a 2πk. Proof. efne Snce h (t) z (t)/(z(t) a), we get h(t) : t z (s) ds z(s) a. d dt e h(t) (z(t) a) h (t)e h(t) (z(t) a) + e h(t) z (t). and e h(t) (z(t) a) e h() (z() a) s a constant. Therefore e h(t) z(t) a z() a and especally eh(2π) z(2π) a z() a whch means h(2π) 2πk. efnton The ndex or wndng number of a closed curve wth respect to a pont a / s n(, a) dz 2π z a 2πZ. The defnton s legtmated by the above lemma. Cauchy s ntegral formula and the resdue theorem holds more generally for any closed curve n a smply con-

10 If f C ω () n(, z) f(z) f(w) dw. 2π w z If f C ω ( \ {z } n ) f(z) dz 2π n n(, z ) Res(f, z ). Theorem 4.2 (Argument prncple for analytc functons) Gven f C ω () wth smply connected. Let a be the zeros of f n and a curve n avodng a. Then n(, a ) 2π f (z) f(z) dz Proof. Wrte where g(z) has no zeros n. We compute Cauchy s theorem gves f(z) (z a )(z a 2 )...(z a n )g(z) f (z) f(z) g (z) z a z a 2 z a n g(z). g (z) g(z) dz and the formula follows from the defnton of the wndng number. efnton If f C ω ( \ {z}) for a neghborhood of a, then a s called an solated sngularty of f. If there exsts n N such that lm n (z a)n+ f(z) then a s called a pole of f. The smallest n such that the above lmt s zero s called the order of the pole. If an solated sngularty s not a pole, t s called an essental sngularty. If f C ω ( \ {z }) and each z s a pole then f s called meromorphc n. Theorem 4.3 (Argument prncple for meromorphc functons) Let f be meromorphc n the smply connected set, a the zeros of f, b the poles of f n and a closed curve avodng a, b. n n(, a ) k j n(, b j ) f (z) 2π f(z) dz Proof. The functon g(z) : f(z) (z b )...(z b 2 )...(z b k ) s analytc n and has the zeros a. Wrte ( f (z) 2π f(z) ) dz z b z b 2 z b k 2π g (z) g(z) dz The rght hand sde s by argument prncple for analytc maps equal to n(, a ). The left hand sde s f (z) 2π f(z) dz + n(, b j ).

11 Theorem 4.4 (Generalzed argument prncple) Let f be meromorphc n the smply connected set, a the zeros of f, b the poles of f n and a closed curve avodng a, b and g C ω (). n g(a )n(, a ) k j g(b )n(, b j ) g(z) f (z) 2π f(z) dz Proof. Wrte agan n f(z) h(z) (z a ) k j (z b j) wth analytc h whch s nowhere zero and so g(z) f n (z) f(z) g(a ) z a k j g(b j ) z b j + g(z) h (z) h(z). As an applcaton, take h C ω ( ) wth { z a < r} and h( ). For z put ξ h(z). The functon f(w) h(w) ξ has only one zero n. Apply the last theorem wth g(w) w. We get h (ξ) z wh (w) 2π δ() h(w) ξ dw whch s a formula for the nverse of h. Assume f C ω ( \ {z }) s meromorphc. enote by Z f Z f () the number of zeros of a functon n and wth P f P f () the number of poles of f n. Theorem 4.5 (Rouché s theorem) Gven meromorphc f, g C ω ( \ {z }). Assume for R {z z a < R}, δ R f(z) g(z) < g(z), z. Then Z f P f Z g P g. Proof. The assumpton mples that f(z) <, z g(z) and h : f/g maps therefore nto the rght half plane. We can defne log(f/g) by requrng that Im(log(h(z))) arg(h(z)) ( π/2, π/2). The functon log(h(z)) s a prmtve of h /h (f/g) f/g. We have so Apply the argument prncple. (f/g) 2π f/g dz 2π f f g g dz. Rouché s theorem leads to an other proof of the fundamental theorem of algebra: Theorem 4.6 (Fundamental theorem of algebra) Every polynomal f(z) p(z) z n + a z n a n has exactly n roots. Proof. p(z) z n + a /z +... a n /z n goes to for z. Consder the functon g(z) z n and { z < R}.

2.3 Nilpotent endomorphisms

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 information

APPENDIX A Some Linear Algebra

APPENDIX 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 information

Lectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix

Lectures - 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 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.

= = = (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 information

Salmon: Lectures on partial differential equations. Consider the general linear, second-order PDE in the form. ,x 2

Salmon: 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 information

n α 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

n α 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 information

U.C. Berkeley CS294: Spectral Methods and Expanders Handout 8 Luca Trevisan February 17, 2016

U.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 information

8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS

8.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 information

MATH 241B FUNCTIONAL ANALYSIS - NOTES EXAMPLES OF C ALGEBRAS

MATH 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 information

Transfer Functions. Convenient representation of a linear, dynamic model. A transfer function (TF) relates one input and one output: ( ) system

Transfer Functions. Convenient representation of a linear, dynamic model. A transfer function (TF) relates one input and one output: ( ) system Transfer Functons Convenent representaton of a lnear, dynamc model. A transfer functon (TF) relates one nput and one output: x t X s y t system Y s The followng termnology s used: x y nput output forcng

More information

NUMERICAL DIFFERENTIATION

NUMERICAL DIFFERENTIATION NUMERICAL DIFFERENTIATION 1 Introducton Dfferentaton s a method to compute the rate at whch a dependent output y changes wth respect to the change n the ndependent nput x. Ths rate of change s called the

More information

Bernoulli Numbers and Polynomials

Bernoulli 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 information

A New Refinement of Jacobi Method for Solution of Linear System Equations AX=b

A New Refinement of Jacobi Method for Solution of Linear System Equations AX=b Int J Contemp Math Scences, Vol 3, 28, no 17, 819-827 A New Refnement of Jacob Method for Soluton of Lnear System Equatons AX=b F Naem Dafchah Department of Mathematcs, Faculty of Scences Unversty of Gulan,

More information

More metrics on cartesian products

More metrics on cartesian products More metrcs on cartesan products If (X, d ) are metrc spaces for 1 n, then n Secton II4 of the lecture notes we defned three metrcs on X whose underlyng topologes are the product topology The purpose of

More information

Section 8.3 Polar Form of Complex Numbers

Section 8.3 Polar Form of Complex Numbers 80 Chapter 8 Secton 8 Polar Form of Complex Numbers From prevous classes, you may have encountered magnary numbers the square roots of negatve numbers and, more generally, complex numbers whch are the

More information

8.6 The Complex Number System

8.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 information

MA 323 Geometric Modelling Course Notes: Day 13 Bezier Curves & Bernstein Polynomials

MA 323 Geometric Modelling Course Notes: Day 13 Bezier Curves & Bernstein Polynomials MA 323 Geometrc Modellng Course Notes: Day 13 Bezer Curves & Bernsten Polynomals Davd L. Fnn Over the past few days, we have looked at de Casteljau s algorthm for generatng a polynomal curve, and we have

More information

2 More examples with details

2 More examples with details Physcs 129b Lecture 3 Caltech, 01/15/19 2 More examples wth detals 2.3 The permutaton group n = 4 S 4 contans 4! = 24 elements. One s the dentty e. Sx of them are exchange of two objects (, j) ( to j and

More information

Lecture 3. Ax x i a i. i i

Lecture 3. Ax x i a i. i i 18.409 The Behavor of Algorthms n Practce 2/14/2 Lecturer: Dan Spelman Lecture 3 Scrbe: Arvnd Sankar 1 Largest sngular value In order to bound the condton number, we need an upper bound on the largest

More information

Integrals and Invariants of Euler-Lagrange Equations

Integrals and Invariants of Euler-Lagrange Equations Lecture 16 Integrals and Invarants of Euler-Lagrange Equatons ME 256 at the Indan Insttute of Scence, Bengaluru Varatonal Methods and Structural Optmzaton G. K. Ananthasuresh Professor, Mechancal Engneerng,

More information

20. Mon, Oct. 13 What we have done so far corresponds roughly to Chapters 2 & 3 of Lee. Now we turn to Chapter 4. The first idea is connectedness.

20. Mon, Oct. 13 What we have done so far corresponds roughly to Chapters 2 & 3 of Lee. Now we turn to Chapter 4. The first idea is connectedness. 20. Mon, Oct. 13 What we have done so far corresponds roughly to Chapters 2 & 3 of Lee. Now we turn to Chapter 4. The frst dea s connectedness. Essentally, we want to say that a space cannot be decomposed

More information

9 Characteristic classes

9 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 information

Inner Product. Euclidean Space. Orthonormal Basis. Orthogonal

Inner 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 information

ON A DETERMINATION OF THE INITIAL FUNCTIONS FROM THE OBSERVED VALUES OF THE BOUNDARY FUNCTIONS FOR THE SECOND-ORDER HYPERBOLIC EQUATION

ON A DETERMINATION OF THE INITIAL FUNCTIONS FROM THE OBSERVED VALUES OF THE BOUNDARY FUNCTIONS FOR THE SECOND-ORDER HYPERBOLIC EQUATION Advanced Mathematcal Models & Applcatons Vol.3, No.3, 2018, pp.215-222 ON A DETERMINATION OF THE INITIAL FUNCTIONS FROM THE OBSERVED VALUES OF THE BOUNDARY FUNCTIONS FOR THE SECOND-ORDER HYPERBOLIC EUATION

More information

This model contains two bonds per unit cell (one along the x-direction and the other along y). So we can rewrite the Hamiltonian as:

This model contains two bonds per unit cell (one along the x-direction and the other along y). So we can rewrite the Hamiltonian as: 1 Problem set #1 1.1. A one-band model on a square lattce Fg. 1 Consder a square lattce wth only nearest-neghbor hoppngs (as shown n the fgure above): H t, j a a j (1.1) where,j stands for nearest neghbors

More information

Distribution det x s on p-adic matrices

Distribution det x s on p-adic matrices January 30, 207 Dstruton det x s on p-adc matrces aul arrett garrett@math.umn.edu http://www.math.umn.edu/ garrett/ Let e a p-adc feld wth ntegers o, local parameter, and resdue feld cardnalty q. Let A

More information

3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X

3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X Statstcs 1: Probablty Theory II 37 3 EPECTATION OF SEVERAL RANDOM VARIABLES As n Probablty Theory I, the nterest n most stuatons les not on the actual dstrbuton of a random vector, but rather on a number

More information

Solutions to Problem Set 6

Solutions to Problem Set 6 Solutons to Problem Set 6 Problem 6. (Resdue theory) a) Problem 4.7.7 Boas. n ths problem we wll solve ths ntegral: x sn x x + 4x + 5 dx: To solve ths usng the resdue theorem, we study ths complex ntegral:

More information

Dirichlet s Theorem In Arithmetic Progressions

Dirichlet s Theorem In Arithmetic Progressions Drchlet s Theorem In Arthmetc Progressons Parsa Kavkan Hang Wang The Unversty of Adelade February 26, 205 Abstract The am of ths paper s to ntroduce and prove Drchlet s theorem n arthmetc progressons,

More information

Math1110 (Spring 2009) Prelim 3 - Solutions

Math1110 (Spring 2009) Prelim 3 - Solutions Math 1110 (Sprng 2009) Solutons to Prelm 3 (04/21/2009) 1 Queston 1. (16 ponts) Short answer. Math1110 (Sprng 2009) Prelm 3 - Solutons x a 1 (a) (4 ponts) Please evaluate lm, where a and b are postve numbers.

More information

Linear, affine, and convex sets and hulls In the sequel, unless otherwise specified, X will denote a real vector space.

Linear, 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 information

One-sided finite-difference approximations suitable for use with Richardson extrapolation

One-sided finite-difference approximations suitable for use with Richardson extrapolation Journal of Computatonal Physcs 219 (2006) 13 20 Short note One-sded fnte-dfference approxmatons sutable for use wth Rchardson extrapolaton Kumar Rahul, S.N. Bhattacharyya * Department of Mechancal Engneerng,

More information

Tensor Analysis. For orthogonal curvilinear coordinates, ˆ ˆ (98) Expanding the derivative, we have, ˆ. h q. . h q h q

Tensor Analysis. For orthogonal curvilinear coordinates, ˆ ˆ (98) Expanding the derivative, we have, ˆ. h q. . h q h q For orthogonal curvlnear coordnates, eˆ grad a a= ( aˆ ˆ e). h q (98) Expandng the dervatve, we have, eˆ aˆ ˆ e a= ˆ ˆ a h e + q q 1 aˆ ˆ ˆ a e = ee ˆˆ ˆ + e. h q h q Now expandng eˆ / q (some of the detals

More information

CALCULUS CLASSROOM CAPSULES

CALCULUS CLASSROOM CAPSULES CALCULUS CLASSROOM CAPSULES SESSION S86 Dr. Sham Alfred Rartan Valley Communty College salfred@rartanval.edu 38th AMATYC Annual Conference Jacksonvlle, Florda November 8-, 202 2 Calculus Classroom Capsules

More information

Bézier curves. Michael S. Floater. September 10, These notes provide an introduction to Bézier curves. i=0

Bé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 information

5 The Rational Canonical Form

5 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 information

763622S ADVANCED QUANTUM MECHANICS Solution Set 1 Spring c n a n. c n 2 = 1.

763622S 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 information

In this section is given an overview of the common elasticity models.

In this section is given an overview of the common elasticity models. Secton 4.1 4.1 Elastc Solds In ths secton s gven an overvew of the common elastcty models. 4.1.1 The Lnear Elastc Sold The classcal Lnear Elastc model, or Hooean model, has the followng lnear relatonshp

More information

C/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/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 information

1 (1 + ( )) = 1 8 ( ) = (c) Carrying out the Taylor expansion, in this case, the series truncates at second order:

1 (1 + ( )) = 1 8 ( ) = (c) Carrying out the Taylor expansion, in this case, the series truncates at second order: 68A Solutons to Exercses March 05 (a) Usng a Taylor expanson, and notng that n 0 for all n >, ( + ) ( + ( ) + ) We can t nvert / because there s no Taylor expanson around 0 Lets try to calculate the nverse

More information

REAL ANALYSIS I HOMEWORK 1

REAL ANALYSIS I HOMEWORK 1 REAL ANALYSIS I HOMEWORK CİHAN BAHRAN The questons are from Tao s text. Exercse 0.0.. If (x α ) α A s a collecton of numbers x α [0, + ] such that x α

More information

Solutions to exam in SF1811 Optimization, Jan 14, 2015

Solutions to exam in SF1811 Optimization, Jan 14, 2015 Solutons to exam n SF8 Optmzaton, Jan 4, 25 3 3 O------O -4 \ / \ / The network: \/ where all lnks go from left to rght. /\ / \ / \ 6 O------O -5 2 4.(a) Let x = ( x 3, x 4, x 23, x 24 ) T, where the varable

More information

Bezier curves. Michael S. Floater. August 25, These notes provide an introduction to Bezier curves. i=0

Bezier 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 information

THE CHINESE REMAINDER THEOREM. We should thank the Chinese for their wonderful remainder theorem. Glenn Stevens

THE 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 information

Quantum Mechanics I - Session 4

Quantum 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

The Order Relation and Trace Inequalities for. Hermitian Operators

The 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 information

Representation theory and quantum mechanics tutorial Representation theory and quantum conservation laws

Representation 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 information

Stanford University CS359G: Graph Partitioning and Expanders Handout 4 Luca Trevisan January 13, 2011

Stanford 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 information

A Quantum Gauss-Bonnet Theorem

A Quantum Gauss-Bonnet Theorem A Quantum Gauss-Bonnet Theorem Tyler Fresen November 13, 2014 Curvature n the plane Let Γ be a smooth curve wth orentaton n R 2, parametrzed by arc length. The curvature k of Γ s ± Γ, where the sgn s postve

More information

Errors for Linear Systems

Errors for Linear Systems Errors for Lnear Systems When we solve a lnear system Ax b we often do not know A and b exactly, but have only approxmatons  and ˆb avalable. Then the best thng we can do s to solve ˆx ˆb exactly whch

More information

Zeros and Zero Dynamics for Linear, Time-delay System

Zeros and Zero Dynamics for Linear, Time-delay System UNIVERSITA POLITECNICA DELLE MARCHE - FACOLTA DI INGEGNERIA Dpartmento d Ingegnerua Informatca, Gestonale e dell Automazone LabMACS Laboratory of Modelng, Analyss and Control of Dynamcal System Zeros and

More information

1 Matrix representations of canonical matrices

1 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 information

Complex Variables. Chapter 18 Integration in the Complex Plane. March 12, 2013 Lecturer: Shih-Yuan Chen

Complex Variables. Chapter 18 Integration in the Complex Plane. March 12, 2013 Lecturer: Shih-Yuan Chen omplex Varables hapter 8 Integraton n the omplex Plane March, Lecturer: Shh-Yuan hen Except where otherwse noted, content s lcensed under a BY-N-SA. TW Lcense. ontents ontour ntegrals auchy-goursat theorem

More information

Module 3: Element Properties Lecture 1: Natural Coordinates

Module 3: Element Properties Lecture 1: Natural Coordinates Module 3: Element Propertes Lecture : Natural Coordnates Natural coordnate system s bascally a local coordnate system whch allows the specfcaton of a pont wthn the element by a set of dmensonless numbers

More information

Canonical transformations

Canonical transformations Canoncal transformatons November 23, 2014 Recall that we have defned a symplectc transformaton to be any lnear transformaton M A B leavng the symplectc form nvarant, Ω AB M A CM B DΩ CD Coordnate transformatons,

More information

U.C. Berkeley CS294: Beyond Worst-Case Analysis Luca Trevisan September 5, 2017

U.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 information

Polynomials. 1 More properties of polynomials

Polynomials. 1 More properties of polynomials Polynomals 1 More propertes of polynomals Recall that, for R a commutatve rng wth unty (as wth all rngs n ths course unless otherwse noted), we defne R[x] to be the set of expressons n =0 a x, where a

More information

REDUCTION 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. 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 information

Errata to Invariant Theory with Applications January 28, 2017

Errata 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 information

D.K.M COLLEGE FOR WOMEN (AUTONOMOUS), VELLORE DEPARTMENT OF MATHEMATICS

D.K.M COLLEGE FOR WOMEN (AUTONOMOUS), VELLORE DEPARTMENT OF MATHEMATICS D.K.M COLLEGE FOR WOMEN (AUTONOMOUS), VELLORE DEPARTMENT OF MATHEMATICS SUB: ALGEBRA SUB CODE: 5CPMAA SECTION- A UNIT-. Defne conjugate of a n G and prove that conjugacy s an equvalence relaton on G. Defne

More information

Modelli Clamfim Equazione del Calore Lezione ottobre 2014

Modelli Clamfim Equazione del Calore Lezione ottobre 2014 CLAMFIM Bologna Modell 1 @ Clamfm Equazone del Calore Lezone 17 15 ottobre 2014 professor Danele Rtell danele.rtell@unbo.t 1/24? Convoluton The convoluton of two functons g(t) and f(t) s the functon (g

More information

Formulas for the Determinant

Formulas 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 information

Singular Value Decomposition: Theory and Applications

Singular 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 information

Appendix B. Criterion of Riemann-Stieltjes Integrability

Appendix B. Criterion of Riemann-Stieltjes Integrability Appendx B. Crteron of Remann-Steltes Integrablty Ths note s complementary to [R, Ch. 6] and [T, Sec. 3.5]. The man result of ths note s Theorem B.3, whch provdes the necessary and suffcent condtons for

More information

NOTES ON SIMPLIFICATION OF MATRICES

NOTES ON SIMPLIFICATION OF MATRICES 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

More information

Affine transformations and convexity

Affine 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 information

ψ = i c i u i c i a i b i u i = i b 0 0 b 0 0

ψ = i c i u i c i a i b i u i = i b 0 0 b 0 0 Quantum Mechancs, Advanced Course FMFN/FYSN7 Solutons Sheet Soluton. Lets denote the two operators by  and ˆB, the set of egenstates by { u }, and the egenvalues as  u = a u and ˆB u = b u. Snce the

More information

Linear Approximation with Regularization and Moving Least Squares

Linear 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 information

Linear Algebra and its Applications

Linear 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 information

Difference Equations

Difference 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 information

Spectral Graph Theory and its Applications September 16, Lecture 5

Spectral Graph Theory and its Applications September 16, Lecture 5 Spectral Graph Theory and ts Applcatons September 16, 2004 Lecturer: Danel A. Spelman Lecture 5 5.1 Introducton In ths lecture, we wll prove the followng theorem: Theorem 5.1.1. Let G be a planar graph

More information

Finite Element Modelling of truss/cable structures

Finite Element Modelling of truss/cable structures Pet Schreurs Endhoven Unversty of echnology Department of Mechancal Engneerng Materals echnology November 3, 214 Fnte Element Modellng of truss/cable structures 1 Fnte Element Analyss of prestressed structures

More information

FACTORIZATION IN KRULL MONOIDS WITH INFINITE CLASS GROUP

FACTORIZATION 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 information

Calculus of Variations Basics

Calculus of Variations Basics Chapter 1 Calculus of Varatons Bascs 1.1 Varaton of a General Functonal In ths chapter, we derve the general formula for the varaton of a functonal of the form J [y 1,y 2,,y n ] F x,y 1,y 2,,y n,y 1,y

More information

Random Walks on Digraphs

Random 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 information

Physics 181. Particle Systems

Physics 181. Particle Systems Physcs 181 Partcle Systems Overvew In these notes we dscuss the varables approprate to the descrpton of systems of partcles, ther defntons, ther relatons, and ther conservatons laws. We consder a system

More information

Hidden Markov Models & The Multivariate Gaussian (10/26/04)

Hidden Markov Models & The Multivariate Gaussian (10/26/04) CS281A/Stat241A: Statstcal Learnng Theory Hdden Markov Models & The Multvarate Gaussan (10/26/04) Lecturer: Mchael I. Jordan Scrbes: Jonathan W. Hu 1 Hdden Markov Models As a bref revew, hdden Markov models

More information

Case A. P k = Ni ( 2L i k 1 ) + (# big cells) 10d 2 P k.

Case A. P k = Ni ( 2L i k 1 ) + (# big cells) 10d 2 P k. THE CELLULAR METHOD In ths lecture, we ntroduce the cellular method as an approach to ncdence geometry theorems lke the Szemeréd-Trotter theorem. The method was ntroduced n the paper Combnatoral complexty

More information

Differential Polynomials

Differential Polynomials JASS 07 - Polynomals: Ther Power and How to Use Them Dfferental Polynomals Stephan Rtscher March 18, 2007 Abstract Ths artcle gves an bref ntroducton nto dfferental polynomals, deals and manfolds and ther

More information

The equation of motion of a dynamical system is given by a set of differential equations. That is (1)

The equation of motion of a dynamical system is given by a set of differential equations. That is (1) Dynamcal Systems Many engneerng and natural systems are dynamcal systems. For example a pendulum s a dynamcal system. State l The state of the dynamcal system specfes t condtons. For a pendulum n the absence

More information

Randić Energy and Randić Estrada Index of a Graph

Randić Energy and Randić Estrada Index of a Graph EUROPEAN JOURNAL OF PURE AND APPLIED MATHEMATICS Vol. 5, No., 202, 88-96 ISSN 307-5543 www.ejpam.com SPECIAL ISSUE FOR THE INTERNATIONAL CONFERENCE ON APPLIED ANALYSIS AND ALGEBRA 29 JUNE -02JULY 20, ISTANBUL

More information

Numerical Heat and Mass Transfer

Numerical Heat and Mass Transfer Master degree n Mechancal Engneerng Numercal Heat and Mass Transfer 06-Fnte-Dfference Method (One-dmensonal, steady state heat conducton) Fausto Arpno f.arpno@uncas.t Introducton Why we use models and

More information

Solutions Homework 4 March 5, 2018

Solutions 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 information

ON THE JACOBIAN CONJECTURE

ON THE JACOBIAN CONJECTURE v v v Far East Journal of Mathematcal Scences (FJMS) 17 Pushpa Publshng House, Allahabad, Inda http://www.pphm.com http://dx.do.org/1.17654/ms1111565 Volume 11, Number 11, 17, Pages 565-574 ISSN: 97-871

More information

CSCE 790S Background Results

CSCE 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 information

DISCRIMINANTS 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. 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 information

Erratum: A Generalized Path Integral Control Approach to Reinforcement Learning

Erratum: A Generalized Path Integral Control Approach to Reinforcement Learning Journal of Machne Learnng Research 00-9 Submtted /0; Publshed 7/ Erratum: A Generalzed Path Integral Control Approach to Renforcement Learnng Evangelos ATheodorou Jonas Buchl Stefan Schaal Department of

More information

Example: (13320, 22140) =? Solution #1: The divisors of are 1, 2, 3, 4, 5, 6, 9, 10, 12, 15, 18, 20, 27, 30, 36, 41,

Example: (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 information

The Feynman path integral

The Feynman path integral The Feynman path ntegral Aprl 3, 205 Hesenberg and Schrödnger pctures The Schrödnger wave functon places the tme dependence of a physcal system n the state, ψ, t, where the state s a vector n Hlbert space

More information

Fundamental loop-current method using virtual voltage sources technique for special cases

Fundamental loop-current method using virtual voltage sources technique for special cases Fundamental loop-current method usng vrtual voltage sources technque for specal cases George E. Chatzaraks, 1 Marna D. Tortorel 1 and Anastasos D. Tzolas 1 Electrcal and Electroncs Engneerng Departments,

More information

12 MATH 101A: ALGEBRA I, PART C: MULTILINEAR ALGEBRA. 4. Tensor product

12 MATH 101A: ALGEBRA I, PART C: MULTILINEAR ALGEBRA. 4. Tensor product 12 MATH 101A: ALGEBRA I, PART C: MULTILINEAR ALGEBRA Here s an outlne of what I dd: (1) categorcal defnton (2) constructon (3) lst of basc propertes (4) dstrbutve property (5) rght exactness (6) localzaton

More information

where a is any ideal of R. Lemma Let R be a ring. Then X = Spec R is a topological space. Moreover the open sets

where a is any ideal of R. Lemma Let R be a ring. Then X = Spec R is a topological space. Moreover the open sets 11. Schemes To defne schemes, just as wth algebrac varetes, the dea s to frst defne what an affne scheme s, and then realse an arbtrary scheme, as somethng whch s locally an affne scheme. The defnton of

More information

Exercise Solutions to Real Analysis

Exercise Solutions to Real Analysis xercse Solutons to Real Analyss Note: References refer to H. L. Royden, Real Analyss xersze 1. Gven any set A any ɛ > 0, there s an open set O such that A O m O m A + ɛ. Soluton 1. If m A =, then there

More information

Curvature and isoperimetric inequality

Curvature and isoperimetric inequality urvature and sopermetrc nequalty Julà ufí, Agustí Reventós, arlos J Rodríguez Abstract We prove an nequalty nvolvng the length of a plane curve and the ntegral of ts radus of curvature, that has as a consequence

More information

Lecture 5.8 Flux Vector Splitting

Lecture 5.8 Flux Vector Splitting Lecture 5.8 Flux Vector Splttng 1 Flux Vector Splttng The vector E n (5.7.) can be rewrtten as E = AU (5.8.1) (wth A as gven n (5.7.4) or (5.7.6) ) whenever, the equaton of state s of the separable form

More information

Matrix Approximation via Sampling, Subspace Embedding. 1 Solving Linear Systems Using SVD

Matrix 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 information

Problem Set 9 Solutions

Problem 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 information

Lecture 5 Decoding Binary BCH Codes

Lecture 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 information

SL n (F ) Equals its Own Derived Group

SL 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 information

3 Basic boundary value problems for analytic function in the upper half plane

3 Basic boundary value problems for analytic function in the upper half plane 3 Basc boundary value problems for analytc functon n the upper half plane 3. Posson representaton formulas for the half plane Let f be an analytc functon of z throughout the half plane Imz > 0, contnuous

More information