We denote the derivative at x by DF (x) = L. With respect to the standard bases of R n and R m, DF (x) is simply the matrix of partial derivatives,

Size: px
Start display at page:

Download "We denote the derivative at x by DF (x) = L. With respect to the standard bases of R n and R m, DF (x) is simply the matrix of partial derivatives,"

Transcription

1 The derivative Let O be an open subset of R n, and F : O R m a continuous function We say F is differentiable at a point x O, with derivative L, if L : R n R m is a linear transformation such that, for y R n, small, () F (x + y) = F (x) + Ly + R(x, y) with (2) R(x, y) y 0 as y 0 We denote the derivative at x by DF (x) = L With respect to the standard bases of R n and R m, DF (x) is simply the matrix of partial derivatives, ( ) F / x F / x n Fj (3) DF (x) = = x, k F m / x F m / x n so that, if v = (v,, v n ) t, (regarded as a column vector) then ( F / x k )v k k (4) DF (x)v = ( F m / x k )v k k It will be shown below that F is differentiable whenever all the partial derivatives exist and are continuous on O In such a case we say F is a C function on O More generally, F is said to be C k if all its partial derivatives of order k exist and are continuous If F is C k for all k, we say F is C In (2), we can use the Euclidean norm on R n and R m This norm is defined by (5) x = ( x x 2 ) /2 n for x = (x,, x n ) R n Any other norm would do equally well An application of the Fundamental Theorem of Calculus, to functions of each variable x j separately, yields the following If we assume F : O R m is differentiable in each variable separately, and that each F/ x j is continuous on O, then (6) F (x + y) = F (x) + n [ F (x + zj ) F (x + z j ) ] = F (x) + j= A j (x, y) = 0 F x j ( x + zj + ty j e j ) dt, n A j (x, y)y j, j=

2 2 where z 0 = 0, z j = (y,, y j, 0,, 0), and {e j } is the standard basis of R n Consequently, (7) F (x + y) = F (x) + R(x, y) = j= n j= 0 F x j (x) y j + R(x, y), n { F y j (x + z j + ty j e j ) F } (x) dt x j x j Now (7) implies F is differentiable on O, as we stated below (4) Thus we have established the following Proposition If O is an open subset of R n and F : O R m is of class C, then F is differentiable at each point x O As is shown in many calculus texts, one can use the Mean Value Theorem instead of the Fundamental Theorem of Calculus, and obtain a slightly sharper result Let us give some examples of derivatives First, take n = 2, m =, and set (8) F (x) = (sin x )(sin x 2 ) Then (9) DF (x) = ((cos x )(sin x 2 ), (sin x )(cos x 2 )) Next, take n = m = 2 and ( ) x x 2 (0) F (x) = x 2 x2 2 Then ( x2 x () DF (x) = 2x 2x 2 We can replace R n and R m by more general finite-dimensional real vector spaces, isomorphic to Euclidean space For example, the space M(n, R) of real n n matrices is isomorphic to R n2 Consider the function (2) S : M(n, R) M(n, R), S(X) = X 2 We have ) (3) (X + Y ) 2 = X 2 + XY + Y X + Y 2 = X 2 + DS(X)Y + R(X, Y ), with R(X, Y ) = Y 2, and hance (4) DS(X)Y = XY + Y X

3 3 For our next example, we take (5) O = Gl(n, R) = {X M(n, R) : det X 0}, which, as shown below, is open in M(n, R) We consider (6) Φ : Gl(n, R) M(n, R), Φ(X) = X, and compute DΦ(I) We use the following If, for A M(n, R), (7) A = sup{ Av : v R n, v }, then (8) A, B M(n, R) AB A B, hence Y M(n, R) Y k Y k Also (9) S k = I Y + Y 2 + ( ) k Y k Y S k = S k Y = Y Y 2 + Y 3 + ( ) k Y k+ (I + Y )S k = S k (I + Y ) = I + ( ) k Y k+, hence (20) Y < = (I + Y ) = so ( ) k Y k = I Y + Y 2, k=0 (2) DΦ(I)Y = Y Related calculations show that Gl(n, R) is open in M(n, R) In fact, given X Gl(n, R), Y M(n, R), (22) X + Y = X(I + X Y ), which by (20) is invertible as long as (23) X Y < One can proceed from here to compute DΦ(X) See the exercises We return to general considerations, and derive the chain rule for the derivative Let F : O R m be differentiable at x O, as above, let U be a neighborhood of z = F (x) in R m, and let G : U R k be differentiable at z Consider H = G F We have (24) H(x + y) = G(F (x + y)) = G ( F (x) + DF (x)y + R(x, y) ) = G(z) + DG(z) ( DF (x)y + R(x, y) ) + R (x, y) = G(z) + DG(z)DF (x)y + R 2 (x, y)

4 4 with R 2 (x, y) y Thus G F is differentiable at x, and 0 as y 0 (25) D(G F )(x) = DG(F (x)) DF (x) Another useful remark is that, by the Fundamental Theorem of Calculus, applied to ϕ(t) = F (x + ty), (26) F (x + y) = F (x) + 0 DF (x + ty)y dt, provided F is C For a typical application, see (66) For the study of higher order derivatives of a function, the following result is fundamental Proposition 2 Assume F : O R m is of class C 2, with O open in R n Then, for each x O, j, k n, (27) x j F x k (x) = F (x) x k x j Proof It suffices to take m = We label our function f : O R For j n, we set (28) j,h f(x) = h( f(x + hej ) f(x) ), where {e,, e n } is the standard basis of R n The mean value theorem (for functions of x j alone) implies that if j f = f/ x j exists on O, then, for x O, h > 0 sufficiently small, (29) j,h f(x) = j f(x + α j he j ), for some α j (0, ), depending on x and h Iterating this, if j ( k f) exists on O, then, for x O, h > 0 sufficiently small, (30) k,h j,h f(x) = k ( j,h f)(x + α k he k ) = j,h ( k f)(x + α k he k ) = j k f(x + α k he k + α j he j ), with α j, α k (0, ) Here we have used the elementary result (3) k j,h f = j,h ( k f) We deduce the following

5 Proposition 3 If k f and j k f exist on O and j k f is continuous at x 0 O, then (32) j k f(x 0 ) = lim h 0 k,h j,h f(x 0 ) Clearly (33) k,h j,h f = j,h k,h f, so we have the following, which easily implies Proposition 2 Corollary 4 In the setting of Proposition 3, if also j f and k j f exist on O and k j f is continuous at x 0, then (34) j k f(x 0 ) = k j f(x 0 ) 5 We now describe two convenient notations to express higher order derivatives of a C k function f : Ω R, where Ω R n is open In one, let J be a k-tuple of integers between and n; J = (j,, j k ) We set (35) f (J) (x) = jk j f(x), j = x j We set J = k, the total order of differentiation As we have seen in Proposition 2, i j f = j i f provided f C 2 (Ω) It follows that, if f C k (Ω), then jk j f = lk l f whenever {l,, l k } is a permutation of {j,, j k } Thus, another convenient notation to use is the following Let α be an n-tuple of non-negative integers, α = (α,, α n ) Then we set (36) f (α) (x) = α α n n f(x), α = α + + α n Note that, if J = α = k and f C k (Ω), (37) f (J) (x) = f (α) (x), with α i = #{l : j l = i} Correspondingly, there are two expressions for monomials in x = (x,, x n ): (38) x J = x j x jk, x α = x α xα n n, and x J = x α provided J and α are related as in (37) Both these notations are called multi-index notations We now derive Taylor s formula with remainder for a smooth function F : Ω R, making use of these multi-index notations We will apply the one variable formula (052) (053), ie, (39) ϕ(t) = ϕ(0) + ϕ (0)t + 2 ϕ (0)t k! ϕ(k) (0)t k + r k (t),

6 6 with (40) r k (t) = k! t 0 (t s) k ϕ (k+) (s) ds, given ϕ C k+ (I), I = ( a, a) (See the exercises, and also Appendix D for further discussion) Let us assume 0 Ω, and that the line segment from 0 to x is contained in Ω We set ϕ(t) = F (tx), and apply (39) (40) with t = Applying the chain rule, we have (4) ϕ (t) = Differentiating again, we have (42) ϕ (t) = n j F (tx)x j = F (J) (tx)x J j= J =, K = J = F (J+K) (tx)x J+K = J =2 F (J) (tx)x J, where, if J = k, K = l, we take J + K = (j,, j k, k,, k l ) Inductively, we have (43) ϕ (k) (t) = F (J) (tx)x J Hence, from (39) with t =, or, more briefly, F (x) = F (0) + J = (44) F (x) = where (45) R k (x) = k! J =k F (J) (0)x J + + k! J k J =k+ J =k J! F (J) (0)x J + R k (x), ( 0 F (J) (0)x J + R k (x), ) ( s) k F (J) (sx) ds x J This gives Taylor s formula with remainder for F C k+ (Ω), in the J-multi-index notation We also want to write the formula in the α-multi-index notation We have (46) F (J) (tx)x J = ν(α)f (α) (tx)x α, where J =k α =k (47) ν(α) = #{J : α = α(j)},

7 and we define the relation α = α(j) to hold provided the condition (37) holds, or equivalently provided x J = x α Thus ν(α) is uniquely defined by (48) α =k ν(α)x α = J =k x J = (x + + x n ) k One sees that, if α = k, then ν(α) is equal to the product of the number of combinations of k objects, taken α at a time, times the number of combinations of k α objects, taken α 2 at a time, times the number of combinations of k (α + + α n ) objects, taken α n at a time Thus ( )( ) ( ) k k α k α α n (49) ν(α) = = α In other words, for α = k, (50) ν(α) = k! α!, where α! = α! α n! Thus the Taylor formula (44) can be rewritten α 2 (5) F (x) = where (52) R k (x) = α =k+ α k k + α! α n α! F (α) (0)x α + R k (x), ( 0 ) ( s) k F (α) (sx) ds x α k! α!α 2! α n! The formula (5) (52) holds for F C k+ It is significant that (5), with a variant of (52), holds for F C k In fact, for such F, we can apply (52) with k replaced by k, to get (53) F (x) = with (54) R k (x) = α k α =k k α! α! F (α) (0)x α + R k (x), ( 0 ) ( s) k F (α) (sx) ds x α We can add and subtract F (α) (0) to F (α) (sx) in the integrand above, and obtain the following 7

8 8 Proposition 5 If F C k on a ball B r (0), the formula (5) holds for x B r (0), with (55) R k (x) = α =k k α! ( 0 ( s) k [ F (α) (sx) F (α) (0) ] ) ds x α Remark Note that (55) yields the estimate (56) R k (x) α =k x α α! sup F (α) (sx) F (α) (0) 0 s The term corresponding to J = 2 in (44), or α = 2 in (5), is of particular interest It is (57) 2 J =2 F (J) (0) x J = 2 n j,k= 2 F x k x j (0) x j x k We define the Hessian of a C 2 function F : O R as an n n matrix: ( (58) D 2 2 ) F F (y) = (y) x k x j Then the power series expansion of second order about 0 for F takes the form (59) F (x) = F (0) + DF (0)x + 2 x D2 F (0)x + R 2 (x), where, by (56), (60) R 2 (x) C n x 2 sup 0 s, α =2 F (α) (sx) F (α) (0) In all these formulas we can translate coordinates and expand about y O For example, (59) extends to (6) F (x) = F (y) + DF (y)(x y) + 2 (x y) D2 F (y)(x y) + R 2 (x, y), with (62) R 2 (x, y) C n x y 2 sup 0 s, α =2 F (α) (y + s(x y)) F (α) (y) Example If we take F (x) as in (8), so DF (x) is as in (9), then ( ) D 2 sin x sin x F (x) = 2 cos x cos x 2 cos x cos x 2 sin x sin x 2

9 9 The results (6) (62) are useful for extremal problems, ie, determining where a sufficiently smooth function F : O R has local maxima and local minima Clearly if F C (O) and F has a local maximum or minimum at x 0 O, then DF (x 0 ) = 0 In such a case, we say x 0 is a critical point of F To check what kind of critical point x 0 is, we look at the n n matrix A = D 2 F (x 0 ), assuming F C 2 (O) By Proposition 2, A is a symmetric matrix A basic result in linear algebra is that if A is a real, symmetric n n matrix, then R n has an orthonormal basis of eigenvectors, {v,, v n }, satisfying Av j = λ j v j ; the real numbers λ j are the eigenvalues of A We say A is positive definite if all λ j > 0, and we say A is negative definite if all λ j < 0 We say A is strongly indefinite if some λ j > 0 and another λ k < 0 Equivalently, given a real, symmetric matrix A, (63) for some C > 0, all v R n, and (64) A positive definite v Av C v 2, A negative definite v Av C v 2, A strongly indefinite v, w R n, nonzero, such that v Av C v 2, w Aw C w 2, for some C > 0 In light of (44) (45), we have the following result Proposition 6 Assume F C 2 (O) is real valued, O open in R n Let x 0 O be a critical point for F Then (i) D 2 F (x 0 ) positive definite F has a local minimum at x 0, (ii) D 2 F (x 0 ) negative definite F has a local maximum at x 0, (iii) D 2 F (x 0 ) strongly indefinite F has neither a local maximum nor a local minimum at x 0 In case (iii), we say x 0 is a saddle point for F The following is a test for positive definiteness Proposition 7 Let A = (a ij ) be a real, symmetric, n n matrix For l n, form the l l matrix A l = (a ij ) i,j l Then (65) A positive definite det A l > 0, l {,, n} Regarding the implication, note that if A is positive definite, then det A = det A n is the product of its eigenvalues, all > 0, hence is > 0 Also in this case, it follows from (65) that each A l must be positive definite, hence have positive determinant, so we have The implication is easy enough for 2 2 matrices If A is symmetric and det A > 0, then either both its eigenvalues are positive (so A is positive definite) or both are negative (so A is negative definite) In the latter case, A = (a ) must be negative, so we have in this case We prove for n 3, using induction The inductive hypothesis implies that if det A l > 0 for each l n, then A n is positive definite The next lemma then guarantees that A = A n has at least n positive eigenvalues The hypothesis that det A > 0 does not allow that the remaining eigenvalue be 0, so all the eigenvalues of A must be positive Thus Proposition 7 is proven, once we have the following

10 0 Lemma 8 In the setting of Proposition 7, if A n is positive definite, then A = A n has at least n positive eigenvalues Proof Since A is symmetric, R n has an orthonormal basis v,, v n of eigenvectors of A; Av j = λ j v j If the conclusion of the lemma is false, at least two of the eigenvalues, say λ, λ 2, are 0 Let W = Span(v, v 2 ), so w W = w Aw 0 Since W has dimension 2, R n R n satisfies R n W 0, so there exists a nonzero w R n W, and then w A n w = w Aw 0, contradicting the hypothesis that A n is positive definite Remark Given (65), we see by taking A A that if A is a real, symmetric n n matrix, (66) A negative definite ( ) l det A l > 0, l {,, n} We return to higher order power series formulas with remainder and complement Proposition 5 Let us go back to (39) (40) and note that the integral in (40) is /(k + ) times a weighted average of ϕ (k+) (s) over s [0, t] Hence we can write r k (t) = (k + )! ϕ(k+) (θt), for some θ [0, ], if ϕ is of class C k+ This is the Lagrange form of the remainder; see Appendix D for more on this, and for a comparison with the Cauchy form of the remainder If ϕ is of class C k, we can replace k + by k in (39) and write (67) ϕ(t) = ϕ(0) + ϕ (0)t + + (k )! ϕ(k ) (0)t k + k! ϕ(k) (θt)t k, for some θ [0, ] Pluging (67) into (43) for ϕ(t) = F (tx) gives (68) F (x) = J k J! F (J) (0)x J + k! J =k F (J) (θx)x J, for some θ [0, ] (depending on x and on k, but not on J), when F is of class C k on a neighborhood B r (0) of 0 R n Similarly, using the α-multi-index notation, we have, as an alternative to (53) (54), (69) F (x) = α k α! F (α) (0)x α + α =k α! F (α) (θx)x α,

11 for some θ [0, ] (depending on x and on α, but not on α), if F C k (B r (0)) Note also that (70) 2 J =2 F (J) (θx)x J = 2 n j,k= 2 F x k x j (θx)x j x k = 2 x D2 F (θx)x, with D 2 F (y) as in (58), so if F C 2 (B r (0)), we have, as an alternative to (59), (7) F (x) = F (0) + DF (0)x + 2 x D2 F (θx)x, for some θ [0, ] We next complemant the multi-index notations for higher derivatives of a function F by a multi-linear notation, defined as follows If k N, F C k (U), and y U R n, set (72) D k F (y)(u,, u k ) = t tk F (y + t u + + t k u k ), t = =t k =0 for u,, u k R n For k =, this formula is equivalent to the definition of DF given at the beginning of this section For k = 2, we have (73) D 2 F (y)(u, v) = u D 2 F (y)v, with D 2 F (y) as in (58) Generally, (72) defines D k F (y) as a symmetric, k-linear form in u,, u k R n We can relate (72) to the J-multi-index notation as follows We start with (74) t F (y + t u + + t k u k ) = and inductively obtain (75) t tk F (y + Σt j u j ) = hence (76) D k F (y)(u,, u k ) = In particular, if u = = u k = u, J = = J k = J = = J k = J = F (J) (y + Σt j u j )u J, F (J + +J k ) (y + Σt j u j )u J uj k k, F (J + +J k ) (y)u J uj k k (77) D k F (y)(u,, u) = F (J) (y)u J J =k

12 2 Hence (68) yields (78) F (x) = F (0)+DF (0)x+ + (k )! Dk F (0)(x,, x)+ k! Dk F (θx)(x,, x), for some θ [0, ], if F C k (B r (0)) In fact, rather than appealing to (68), we can note that ϕ(t) = F (tx) = ϕ (k) (t) = t tk ϕ(t + t + + t k ) = D k F (tx)(x,, x), and obtain (78) directly from (67) We can also use the notation D j F (y)x j = D j F (y)(x,, x), t = =t k =0 with j copies of x within the last set of parentheses, and rewrite (78) as (79) F (x) = F (0) + DF (0)x + + Note how (78) and (79) generalize (7) (k )! Dk F (0)x (k ) + k! Dk F (θx)x k Exercises Consider the following function f : R 2 R: f(x, y) = (cos x)(cos y) Find all its critical points, and determine which of these are local maxima, local minima, and saddle points 2 Let M(n, R) denote the space of real n n matrices Assume F, G : M(n, R) M(n, R) are of class C Show that H(X) = F (X)G(X) defines a C map H : M(n, R) M(n, R), and DH(X)Y = DF (X)Y G(X) + F (X)DG(X)Y 3 Let Gl(n, R) M(n, R) denote the set of invertible matrices Show that Φ : Gl(n, R) M(n, R), Φ(X) = X is of class C and that DΦ(X)Y = X Y X 4 Identify R 2 and C via z = x+iy Then multiplication by i on C corresponds to applying ( ) 0 J = 0

13 Let O R 2 be open, f : O R 2 be C Say f = (u, v) Regard Df(x, y) as a 2 2 real matrix One says f is holomorphic, or complex-analytic, provided the Cauchy-Riemann equations hold: u x = v y, Show that this is equivalent to the condition Generalize to O open in C m, f : O C n u y = v x Df(x, y) J = J Df(x, y) 5 Let f be C on a region in R 2 containing [a, b] {y} Show that, as h 0, 3 [ ] f f(x, y + h) f(x, y) (x, y), h y uniformly on [a, b] {y} Hint Show that the left side is equal to h f (x, y + s) ds, h 0 y and use the uniform continuity of f/ y on [a, b] [y δ, y + δ]; cf Proposition A5 6 In the setting of Exercise 5, show that d b b f f(x, y) dx = (x, y) dx dy a a y 7 Considering the power series show that f(x) = f(y) + f (y)(x y) + + f (j) (y) (x y) j + R j (x, y), j! R j y = j! f (j+) (y)(x y) j, R j (x, x) = 0 Use this to re-derive (053), and hence (22) (23) We define big oh and little oh notation: f(x) = O(x) (as x 0) f(x) C x as x 0, f(x) = o(x) (as x 0) f(x) 0 x as x 0

14 4 8 Let O R n be open and y O Show that f C k+ (O) f(x) = α k f C k (O) f(x) = α k α! f (α) (y)(x y) α + O( x y k+ ), α! f (α) (y)(x y) α + o( x y k ) Exercises 9 deal with properties of the determinant, as a differentiable function on spaces of matrices Foundational work on determinants is developed in an accompanying set of auxiliary exercises on determinants 9 Let M n n be the space of complex n n matrices, det : M n n C the determinant Show that, if I is the identity matrix, D det(i)b = Tr B, ie, d dt det(i + tb) t=0 = Tr B 0 If A(t) = ( a jk (t) ) is a curve in M n n, use the expansion of (d/dt) det A(t) as a sum of n determinants, in which the rows of A(t) are successively differentiated, to show that, for A M n n, D det(a)b = Tr ( Cof(A) t B), where Cof(A) is the cofactor matrix of A Suppose A M n n is invertible Using show that det(a + tb) = (det A) det(i + ta B), D det(a)b = (det A) Tr(A B) Comparing the result of Exercise 0, deduce Cramer s formula: (det A)A = Cof(A) t 2 Assume G : U O, F : O Ω Show that F, G C = F G C (Hint Use (7)) Show that, for any k N, F, G C k = F G C k

15 5 3 Show that the map Φ : Gl(n, R) Gl(n, R) given by Φ(X) = X is C k for each k, ie, Φ C Hint Start with the material of Exercise 3 Auxiliary exercises on determinants If M n n denotes the space of n n complex matrices, we want to show that there is a map (79) det : M n n C which is uniquely specified as a function ϑ : M n n C satisfying: (a) ϑ is linear in each column a j of A, (b) ϑ(ã) = ϑ(a) if à is obtained from A by interchanging two columns (c) ϑ(i) = Let A = (a,, a n ), where a j are column vectors; a j = (a j,, a nj ) t Show that, if (a) holds, we have the expansion (80) det A = a j det (e j, a 2,, a n ) = j = j,,j n a j a jn n det (e j, e j2,, e jn ), where {e,, e n } is the standard basis of C n 2 Show that, if (b) and (c) also hold, then (8) det A = (sgn σ) a σ() a σ(2)2 a σ(n)n, σ S n where S n is the set of permutations of {,, n}, and (82) sgn σ = det (e σ(),, e σ(n) ) = ± To define sgn σ, the sign of a permutation σ, we note that every permutation σ can be written as a product of transpositions: σ = τ τ ν, where a transposition of {,, n} interchanges two elements and leaves the rest fixed We say sgn σ = if ν is even and sgn σ = if ν is odd It is necessary to show that sgn σ is independent of the choice of such a product representation (Referring to (82) begs the question until we know that det is well defined)

16 6 3 Let σ S n act on a function of n variables by (83) (σf)(x,, x n ) = f(x σ(),, x σ(n) ) Let P be the polynomial (84) P (x,, x n ) = Show that j<k n (85) (σp )(x) = (sgn σ) P (x), and that this implies that sgn σ is well defined (x j x k ) 4 Deduce that there is a unique determinant satisfying (a) (c), and that it is given by (8) 5 Show that (8) implies (86) det A = det A t Conclude that one can replace columns by rows in the characterization (a) (c) of determinants Hint a σ(j)j = a lτ(l) with l = σ(j), τ = σ Also, sgn σ = sgn τ 6 Show that, if (a) (c) hold (for rows), it follows that (d) ϑ(ã) = ϑ(a) if à is obtained from A by adding cρ l to ρ k, for some c C, where ρ,, ρ n are the rows of A Re-prove the uniqueness of ϑ satisfying (a) (d) (for rows) by applying row operations to A until either some row vanishes or A is converted to I 7 Show that (87) det (AB) = (det A)(det B) Hint For fixed B M n n, compare ϑ (A) = det(ab) and ϑ 2 (A) = (det A)(det B) For uniqueness, use an argument from Exercise 6 8 Show that (88) det a 2 a n a 22 a 2n = det 0 a 22 a 2n = det A 0 a n2 a nn 0 a n2 a nn

17 where A = (a jk ) 2 j,k n Hint Do the first identity by the analogue of (d), for columns Then exploit uniqueness for det on M (n ) (n ) 9 Deduce that det(e j, a 2,, a n ) = ( ) j det A j where A kj is formed by deleting the k th column and the j th row from A 0 Deduce from the first sum in (80) that (89) det A = More generally, for any k {,, n}, (90) det A = n ( ) j a j det A j j= n ( ) j k a jk det A kj j= This is called an expansion of det A by minors, down the k th column By definition, the cofactor matrix of A is given by Cof(A) jk = ( ) j k det A kj 7 Show that (9) det Hint Use (88) and induction a a 2 a n a 22 a 2n a nn = a a 22 a nn Auxiliary exercises on the cross product If u, v R 3, show that the formula (92) w (u v) = det w u v w 2 u 2 v 2 w 3 u 3 v 3 for u v = Π(u, v) defines uniquely a bilinear map Π : R 3 R 3 R 3 Show that it satisfies i j = k, j k = i, k i = j,

18 8 where {i, j, k} is the standard basis of R 3 2 We say T SO(3) provided that T is a real 3 3 matrix satisfying T t T = I and det T > 0, (hence det T = ) Show that (93) T SO(3) = T u T v = T (u v) Hint Multiply the 3 3 matrix in Exercise on the left by T 3 Show that, if θ is the angle between u and v in R 3, then (94) u v = u v sin θ Hint Check this for u = i, v = ai + bj, and use Exercise 2 to show this suffices 4 Show that κ : R 3 Skew(3), the set of antisymmetric real 3 3 matrices, given by (95) κ(y, y 2, y 3 ) = satisfies 0 y 3 y 2 y 3 0 y y 2 y 0 (96) Kx = y x, K = κ(y) Show that, with [A, B] = AB BA, (97) κ(x y) = [ κ(x), κ(y) ], Tr ( κ(x)κ(y) t) = 2x y

Introduction to Analysis in Several Variables (Advanced Calculus) Michael E. Taylor

Introduction to Analysis in Several Variables (Advanced Calculus) Michael E. Taylor Introduction to Analysis in Several Variables (Advanced Calculus) Michael E. Taylor 1 2 Contents 0. One-variable calculus 1. The derivative 2. Inverse function and implicit function theorem 3. Systems

More information

Chapter 3. Differentiable Mappings. 1. Differentiable Mappings

Chapter 3. Differentiable Mappings. 1. Differentiable Mappings Chapter 3 Differentiable Mappings 1 Differentiable Mappings Let V and W be two linear spaces over IR A mapping L from V to W is called a linear mapping if L(u + v) = Lu + Lv for all u, v V and L(λv) =

More information

REVIEW OF DIFFERENTIAL CALCULUS

REVIEW OF DIFFERENTIAL CALCULUS REVIEW OF DIFFERENTIAL CALCULUS DONU ARAPURA 1. Limits and continuity To simplify the statements, we will often stick to two variables, but everything holds with any number of variables. Let f(x, y) be

More information

Determinants. Beifang Chen

Determinants. Beifang Chen Determinants Beifang Chen 1 Motivation Determinant is a function that each square real matrix A is assigned a real number, denoted det A, satisfying certain properties If A is a 3 3 matrix, writing A [u,

More information

Equality: Two matrices A and B are equal, i.e., A = B if A and B have the same order and the entries of A and B are the same.

Equality: Two matrices A and B are equal, i.e., A = B if A and B have the same order and the entries of A and B are the same. Introduction Matrix Operations Matrix: An m n matrix A is an m-by-n array of scalars from a field (for example real numbers) of the form a a a n a a a n A a m a m a mn The order (or size) of A is m n (read

More information

1 Directional Derivatives and Differentiability

1 Directional Derivatives and Differentiability Wednesday, January 18, 2012 1 Directional Derivatives and Differentiability Let E R N, let f : E R and let x 0 E. Given a direction v R N, let L be the line through x 0 in the direction v, that is, L :=

More information

MATH 205C: STATIONARY PHASE LEMMA

MATH 205C: STATIONARY PHASE LEMMA MATH 205C: STATIONARY PHASE LEMMA For ω, consider an integral of the form I(ω) = e iωf(x) u(x) dx, where u Cc (R n ) complex valued, with support in a compact set K, and f C (R n ) real valued. Thus, I(ω)

More information

1. General Vector Spaces

1. General Vector Spaces 1.1. Vector space axioms. 1. General Vector Spaces Definition 1.1. Let V be a nonempty set of objects on which the operations of addition and scalar multiplication are defined. By addition we mean a rule

More information

8 Extremal Values & Higher Derivatives

8 Extremal Values & Higher Derivatives 8 Extremal Values & Higher Derivatives Not covered in 2016\17 81 Higher Partial Derivatives For functions of one variable there is a well-known test for the nature of a critical point given by the sign

More information

Linear Systems and Matrices

Linear Systems and Matrices Department of Mathematics The Chinese University of Hong Kong 1 System of m linear equations in n unknowns (linear system) a 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2.......

More information

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 1 x 2. x n 8 (4) 3 4 2

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 1 x 2. x n 8 (4) 3 4 2 MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS SYSTEMS OF EQUATIONS AND MATRICES Representation of a linear system The general system of m equations in n unknowns can be written a x + a 2 x 2 + + a n x n b a

More information

MATH 174A: PROBLEM SET 3. Suggested Solution. det(a + tb) = (det A) det(i + ta 1 B)

MATH 174A: PROBLEM SET 3. Suggested Solution. det(a + tb) = (det A) det(i + ta 1 B) MATH 174A: PROBLEM SET 3 Suggested Solution Problem 1. (Cf. Taylor I.1.3.) Let M n n (C) denote the set of n n complex matrices. Suppose A M n n (C) is invertible. Using show that det(a + tb) = (det A)

More information

OR MSc Maths Revision Course

OR MSc Maths Revision Course OR MSc Maths Revision Course Tom Byrne School of Mathematics University of Edinburgh t.m.byrne@sms.ed.ac.uk 15 September 2017 General Information Today JCMB Lecture Theatre A, 09:30-12:30 Mathematics revision

More information

Math113: Linear Algebra. Beifang Chen

Math113: Linear Algebra. Beifang Chen Math3: Linear Algebra Beifang Chen Spring 26 Contents Systems of Linear Equations 3 Systems of Linear Equations 3 Linear Systems 3 2 Geometric Interpretation 3 3 Matrices of Linear Systems 4 4 Elementary

More information

Determinants Chapter 3 of Lay

Determinants Chapter 3 of Lay Determinants Chapter of Lay Dr. Doreen De Leon Math 152, Fall 201 1 Introduction to Determinants Section.1 of Lay Given a square matrix A = [a ij, the determinant of A is denoted by det A or a 11 a 1j

More information

MATH 2030: EIGENVALUES AND EIGENVECTORS

MATH 2030: EIGENVALUES AND EIGENVECTORS MATH 2030: EIGENVALUES AND EIGENVECTORS Determinants Although we are introducing determinants in the context of matrices, the theory of determinants predates matrices by at least two hundred years Their

More information

Solution Set 7, Fall '12

Solution Set 7, Fall '12 Solution Set 7, 18.06 Fall '12 1. Do Problem 26 from 5.1. (It might take a while but when you see it, it's easy) Solution. Let n 3, and let A be an n n matrix whose i, j entry is i + j. To show that det

More information

Analysis II: The Implicit and Inverse Function Theorems

Analysis II: The Implicit and Inverse Function Theorems Analysis II: The Implicit and Inverse Function Theorems Jesse Ratzkin November 17, 2009 Let f : R n R m be C 1. When is the zero set Z = {x R n : f(x) = 0} the graph of another function? When is Z nicely

More information

Basics of Calculus and Algebra

Basics of Calculus and Algebra Monika Department of Economics ISCTE-IUL September 2012 Basics of linear algebra Real valued Functions Differential Calculus Integral Calculus Optimization Introduction I A matrix is a rectangular array

More information

Linear Algebra. Matrices Operations. Consider, for example, a system of equations such as x + 2y z + 4w = 0, 3x 4y + 2z 6w = 0, x 3y 2z + w = 0.

Linear Algebra. Matrices Operations. Consider, for example, a system of equations such as x + 2y z + 4w = 0, 3x 4y + 2z 6w = 0, x 3y 2z + w = 0. Matrices Operations Linear Algebra Consider, for example, a system of equations such as x + 2y z + 4w = 0, 3x 4y + 2z 6w = 0, x 3y 2z + w = 0 The rectangular array 1 2 1 4 3 4 2 6 1 3 2 1 in which the

More information

Nonlinear equations. Norms for R n. Convergence orders for iterative methods

Nonlinear equations. Norms for R n. Convergence orders for iterative methods Nonlinear equations Norms for R n Assume that X is a vector space. A norm is a mapping X R with x such that for all x, y X, α R x = = x = αx = α x x + y x + y We define the following norms on the vector

More information

Several variables. x 1 x 2. x n

Several variables. x 1 x 2. x n Several variables Often we have not only one, but several variables in a problem The issues that come up are somewhat more complex than for one variable Let us first start with vector spaces and linear

More information

Determinants - Uniqueness and Properties

Determinants - Uniqueness and Properties Determinants - Uniqueness and Properties 2-2-2008 In order to show that there s only one determinant function on M(n, R), I m going to derive another formula for the determinant It involves permutations

More information

Chapter 7. Extremal Problems. 7.1 Extrema and Local Extrema

Chapter 7. Extremal Problems. 7.1 Extrema and Local Extrema Chapter 7 Extremal Problems No matter in theoretical context or in applications many problems can be formulated as problems of finding the maximum or minimum of a function. Whenever this is the case, advanced

More information

Chapter 4. Inverse Function Theorem. 4.1 The Inverse Function Theorem

Chapter 4. Inverse Function Theorem. 4.1 The Inverse Function Theorem Chapter 4 Inverse Function Theorem d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d dd d d d d This chapter

More information

NORMS ON SPACE OF MATRICES

NORMS ON SPACE OF MATRICES NORMS ON SPACE OF MATRICES. Operator Norms on Space of linear maps Let A be an n n real matrix and x 0 be a vector in R n. We would like to use the Picard iteration method to solve for the following system

More information

THE INVERSE FUNCTION THEOREM

THE INVERSE FUNCTION THEOREM THE INVERSE FUNCTION THEOREM W. PATRICK HOOPER The implicit function theorem is the following result: Theorem 1. Let f be a C 1 function from a neighborhood of a point a R n into R n. Suppose A = Df(a)

More information

Chapter 2: Linear Independence and Bases

Chapter 2: Linear Independence and Bases MATH20300: Linear Algebra 2 (2016 Chapter 2: Linear Independence and Bases 1 Linear Combinations and Spans Example 11 Consider the vector v (1, 1 R 2 What is the smallest subspace of (the real vector space

More information

0.1 Rational Canonical Forms

0.1 Rational Canonical Forms We have already seen that it is useful and simpler to study linear systems using matrices. But matrices are themselves cumbersome, as they are stuffed with many entries, and it turns out that it s best

More information

Fundamentals of Engineering Analysis (650163)

Fundamentals of Engineering Analysis (650163) Philadelphia University Faculty of Engineering Communications and Electronics Engineering Fundamentals of Engineering Analysis (6563) Part Dr. Omar R Daoud Matrices: Introduction DEFINITION A matrix is

More information

Review of Multi-Calculus (Study Guide for Spivak s CHAPTER ONE TO THREE)

Review of Multi-Calculus (Study Guide for Spivak s CHAPTER ONE TO THREE) Review of Multi-Calculus (Study Guide for Spivak s CHPTER ONE TO THREE) This material is for June 9 to 16 (Monday to Monday) Chapter I: Functions on R n Dot product and norm for vectors in R n : Let X

More information

FIXED POINT ITERATIONS

FIXED POINT ITERATIONS FIXED POINT ITERATIONS MARKUS GRASMAIR 1. Fixed Point Iteration for Non-linear Equations Our goal is the solution of an equation (1) F (x) = 0, where F : R n R n is a continuous vector valued mapping in

More information

1. Bounded linear maps. A linear map T : E F of real Banach

1. Bounded linear maps. A linear map T : E F of real Banach DIFFERENTIABLE MAPS 1. Bounded linear maps. A linear map T : E F of real Banach spaces E, F is bounded if M > 0 so that for all v E: T v M v. If v r T v C for some positive constants r, C, then T is bounded:

More information

OHSx XM511 Linear Algebra: Solutions to Online True/False Exercises

OHSx XM511 Linear Algebra: Solutions to Online True/False Exercises This document gives the solutions to all of the online exercises for OHSx XM511. The section ( ) numbers refer to the textbook. TYPE I are True/False. Answers are in square brackets [. Lecture 02 ( 1.1)

More information

Algebra II. Paulius Drungilas and Jonas Jankauskas

Algebra II. Paulius Drungilas and Jonas Jankauskas Algebra II Paulius Drungilas and Jonas Jankauskas Contents 1. Quadratic forms 3 What is quadratic form? 3 Change of variables. 3 Equivalence of quadratic forms. 4 Canonical form. 4 Normal form. 7 Positive

More information

Mathematics Course 111: Algebra I Part I: Algebraic Structures, Sets and Permutations

Mathematics Course 111: Algebra I Part I: Algebraic Structures, Sets and Permutations Mathematics Course 111: Algebra I Part I: Algebraic Structures, Sets and Permutations D. R. Wilkins Academic Year 1996-7 1 Number Systems and Matrix Algebra Integers The whole numbers 0, ±1, ±2, ±3, ±4,...

More information

Review of linear algebra

Review of linear algebra Review of linear algebra 1 Vectors and matrices We will just touch very briefly on certain aspects of linear algebra, most of which should be familiar. Recall that we deal with vectors, i.e. elements of

More information

4. Determinants.

4. Determinants. 4. Determinants 4.1. Determinants; Cofactor Expansion Determinants of 2 2 and 3 3 Matrices 2 2 determinant 4.1. Determinants; Cofactor Expansion Determinants of 2 2 and 3 3 Matrices 3 3 determinant 4.1.

More information

0 Sets and Induction. Sets

0 Sets and Induction. Sets 0 Sets and Induction Sets A set is an unordered collection of objects, called elements or members of the set. A set is said to contain its elements. We write a A to denote that a is an element of the set

More information

18.S34 linear algebra problems (2007)

18.S34 linear algebra problems (2007) 18.S34 linear algebra problems (2007) Useful ideas for evaluating determinants 1. Row reduction, expanding by minors, or combinations thereof; sometimes these are useful in combination with an induction

More information

j=1 x j p, if 1 p <, x i ξ : x i < ξ} 0 as p.

j=1 x j p, if 1 p <, x i ξ : x i < ξ} 0 as p. LINEAR ALGEBRA Fall 203 The final exam Almost all of the problems solved Exercise Let (V, ) be a normed vector space. Prove x y x y for all x, y V. Everybody knows how to do this! Exercise 2 If V is a

More information

Implicit Functions, Curves and Surfaces

Implicit Functions, Curves and Surfaces Chapter 11 Implicit Functions, Curves and Surfaces 11.1 Implicit Function Theorem Motivation. In many problems, objects or quantities of interest can only be described indirectly or implicitly. It is then

More information

ELEMENTARY DIFFERENTIAL GEOMETRY. by Michael E. Taylor

ELEMENTARY DIFFERENTIAL GEOMETRY. by Michael E. Taylor ELEMENTARY DIFFERENTIAL GEOMETRY by Michael E. Taylor Contents 1. Exercises on determinants and cross products 2. Exercises on trigonometric functions 3. Exercises on the Frenet-Serret formulas 4. Curves

More information

2 Two-Point Boundary Value Problems

2 Two-Point Boundary Value Problems 2 Two-Point Boundary Value Problems Another fundamental equation, in addition to the heat eq. and the wave eq., is Poisson s equation: n j=1 2 u x 2 j The unknown is the function u = u(x 1, x 2,..., x

More information

1 Matrices and Systems of Linear Equations. a 1n a 2n

1 Matrices and Systems of Linear Equations. a 1n a 2n March 31, 2013 16-1 16. Systems of Linear Equations 1 Matrices and Systems of Linear Equations An m n matrix is an array A = (a ij ) of the form a 11 a 21 a m1 a 1n a 2n... a mn where each a ij is a real

More information

INVERSE FUNCTION THEOREM and SURFACES IN R n

INVERSE FUNCTION THEOREM and SURFACES IN R n INVERSE FUNCTION THEOREM and SURFACES IN R n Let f C k (U; R n ), with U R n open. Assume df(a) GL(R n ), where a U. The Inverse Function Theorem says there is an open neighborhood V U of a in R n so that

More information

3 Matrix Algebra. 3.1 Operations on matrices

3 Matrix Algebra. 3.1 Operations on matrices 3 Matrix Algebra A matrix is a rectangular array of numbers; it is of size m n if it has m rows and n columns. A 1 n matrix is a row vector; an m 1 matrix is a column vector. For example: 1 5 3 5 3 5 8

More information

Mathematical Analysis Outline. William G. Faris

Mathematical Analysis Outline. William G. Faris Mathematical Analysis Outline William G. Faris January 8, 2007 2 Chapter 1 Metric spaces and continuous maps 1.1 Metric spaces A metric space is a set X together with a real distance function (x, x ) d(x,

More information

Sobolev Spaces. Chapter 10

Sobolev Spaces. Chapter 10 Chapter 1 Sobolev Spaces We now define spaces H 1,p (R n ), known as Sobolev spaces. For u to belong to H 1,p (R n ), we require that u L p (R n ) and that u have weak derivatives of first order in L p

More information

Differentiable Functions

Differentiable Functions Differentiable Functions Let S R n be open and let f : R n R. We recall that, for x o = (x o 1, x o,, x o n S the partial derivative of f at the point x o with respect to the component x j is defined as

More information

Multivariable Calculus

Multivariable Calculus 2 Multivariable Calculus 2.1 Limits and Continuity Problem 2.1.1 (Fa94) Let the function f : R n R n satisfy the following two conditions: (i) f (K ) is compact whenever K is a compact subset of R n. (ii)

More information

Economics 204 Summer/Fall 2011 Lecture 11 Monday August 8, f(x + h) (f(x) + ah) = a = 0 = 0. f(x + h) (f(x) + T x (h))

Economics 204 Summer/Fall 2011 Lecture 11 Monday August 8, f(x + h) (f(x) + ah) = a = 0 = 0. f(x + h) (f(x) + T x (h)) Economics 204 Summer/Fall 2011 Lecture 11 Monday August 8, 2011 Sections 41-43 (Unified) Definition 1 Let f : I R, where I R is an open interval f is differentiable at x I if for some a R f(x + h) f lim

More information

Lecture Notes on Metric Spaces

Lecture Notes on Metric Spaces Lecture Notes on Metric Spaces Math 117: Summer 2007 John Douglas Moore Our goal of these notes is to explain a few facts regarding metric spaces not included in the first few chapters of the text [1],

More information

Course 311: Michaelmas Term 2005 Part III: Topics in Commutative Algebra

Course 311: Michaelmas Term 2005 Part III: Topics in Commutative Algebra Course 311: Michaelmas Term 2005 Part III: Topics in Commutative Algebra D. R. Wilkins Contents 3 Topics in Commutative Algebra 2 3.1 Rings and Fields......................... 2 3.2 Ideals...............................

More information

LINEAR ALGEBRA BOOT CAMP WEEK 4: THE SPECTRAL THEOREM

LINEAR ALGEBRA BOOT CAMP WEEK 4: THE SPECTRAL THEOREM LINEAR ALGEBRA BOOT CAMP WEEK 4: THE SPECTRAL THEOREM Unless otherwise stated, all vector spaces in this worksheet are finite dimensional and the scalar field F is R or C. Definition 1. A linear operator

More information

SYLLABUS. 1 Linear maps and matrices

SYLLABUS. 1 Linear maps and matrices Dr. K. Bellová Mathematics 2 (10-PHY-BIPMA2) SYLLABUS 1 Linear maps and matrices Operations with linear maps. Prop 1.1.1: 1) sum, scalar multiple, composition of linear maps are linear maps; 2) L(U, V

More information

Determinants: Introduction and existence

Determinants: Introduction and existence Math 5327 Spring 2018 Determinants: Introduction and existence In this set of notes I try to give the general theory of determinants in a fairly abstract setting. I will start with the statement of the

More information

Problem Set (T) If A is an m n matrix, B is an n p matrix and D is a p s matrix, then show

Problem Set (T) If A is an m n matrix, B is an n p matrix and D is a p s matrix, then show MTH 0: Linear Algebra Department of Mathematics and Statistics Indian Institute of Technology - Kanpur Problem Set Problems marked (T) are for discussions in Tutorial sessions (T) If A is an m n matrix,

More information

UNIVERSAL IDENTITIES. b = det

UNIVERSAL IDENTITIES. b = det UNIVERSAL IDENTITIES KEITH CONRAD 1 Introduction We want to describe an idea which reduces the verification of algebraic identities valid over all commutative rings to the verification over the complex

More information

Department of Mathematics, University of California, Berkeley. GRADUATE PRELIMINARY EXAMINATION, Part A Fall Semester 2016

Department of Mathematics, University of California, Berkeley. GRADUATE PRELIMINARY EXAMINATION, Part A Fall Semester 2016 Department of Mathematics, University of California, Berkeley YOUR 1 OR 2 DIGIT EXAM NUMBER GRADUATE PRELIMINARY EXAMINATION, Part A Fall Semester 2016 1. Please write your 1- or 2-digit exam number on

More information

be any ring homomorphism and let s S be any element of S. Then there is a unique ring homomorphism

be any ring homomorphism and let s S be any element of S. Then there is a unique ring homomorphism 21. Polynomial rings Let us now turn out attention to determining the prime elements of a polynomial ring, where the coefficient ring is a field. We already know that such a polynomial ring is a UFD. Therefore

More information

11 a 12 a 21 a 11 a 22 a 12 a 21. (C.11) A = The determinant of a product of two matrices is given by AB = A B 1 1 = (C.13) and similarly.

11 a 12 a 21 a 11 a 22 a 12 a 21. (C.11) A = The determinant of a product of two matrices is given by AB = A B 1 1 = (C.13) and similarly. C PROPERTIES OF MATRICES 697 to whether the permutation i 1 i 2 i N is even or odd, respectively Note that I =1 Thus, for a 2 2 matrix, the determinant takes the form A = a 11 a 12 = a a 21 a 11 a 22 a

More information

Problem Set 4. f(a + h) = P k (h) + o( h k ). (3)

Problem Set 4. f(a + h) = P k (h) + o( h k ). (3) Analysis 2 Antti Knowles Problem Set 4 1. Let f C k+1 in a neighborhood of a R n. In class we saw that f can be expressed using its Taylor series as f(a + h) = P k (h) + R k (h) (1) where P k (h).= k r=0

More information

Real Analysis Math 131AH Rudin, Chapter #1. Dominique Abdi

Real Analysis Math 131AH Rudin, Chapter #1. Dominique Abdi Real Analysis Math 3AH Rudin, Chapter # Dominique Abdi.. If r is rational (r 0) and x is irrational, prove that r + x and rx are irrational. Solution. Assume the contrary, that r+x and rx are rational.

More information

MATH 4030 Differential Geometry Lecture Notes Part 4 last revised on December 4, Elementary tensor calculus

MATH 4030 Differential Geometry Lecture Notes Part 4 last revised on December 4, Elementary tensor calculus MATH 4030 Differential Geometry Lecture Notes Part 4 last revised on December 4, 205 Elementary tensor calculus We will study in this section some basic multilinear algebra and operations on tensors. Let

More information

Differentiation. f(x + h) f(x) Lh = L.

Differentiation. f(x + h) f(x) Lh = L. Analysis in R n Math 204, Section 30 Winter Quarter 2008 Paul Sally, e-mail: sally@math.uchicago.edu John Boller, e-mail: boller@math.uchicago.edu website: http://www.math.uchicago.edu/ boller/m203 Differentiation

More information

Chapter 8: Taylor s theorem and L Hospital s rule

Chapter 8: Taylor s theorem and L Hospital s rule Chapter 8: Taylor s theorem and L Hospital s rule Theorem: [Inverse Mapping Theorem] Suppose that a < b and f : [a, b] R. Given that f (x) > 0 for all x (a, b) then f 1 is differentiable on (f(a), f(b))

More information

Boolean Inner-Product Spaces and Boolean Matrices

Boolean Inner-Product Spaces and Boolean Matrices Boolean Inner-Product Spaces and Boolean Matrices Stan Gudder Department of Mathematics, University of Denver, Denver CO 80208 Frédéric Latrémolière Department of Mathematics, University of Denver, Denver

More information

GQE ALGEBRA PROBLEMS

GQE ALGEBRA PROBLEMS GQE ALGEBRA PROBLEMS JAKOB STREIPEL Contents. Eigenthings 2. Norms, Inner Products, Orthogonality, and Such 6 3. Determinants, Inverses, and Linear (In)dependence 4. (Invariant) Subspaces 3 Throughout

More information

MA102: Multivariable Calculus

MA102: Multivariable Calculus MA102: Multivariable Calculus Rupam Barman and Shreemayee Bora Department of Mathematics IIT Guwahati Differentiability of f : U R n R m Definition: Let U R n be open. Then f : U R n R m is differentiable

More information

Some notes on Coxeter groups

Some notes on Coxeter groups Some notes on Coxeter groups Brooks Roberts November 28, 2017 CONTENTS 1 Contents 1 Sources 2 2 Reflections 3 3 The orthogonal group 7 4 Finite subgroups in two dimensions 9 5 Finite subgroups in three

More information

HOMEWORK 9 solutions

HOMEWORK 9 solutions Math 4377/6308 Advanced Linear Algebra I Dr. Vaughn Climenhaga, PGH 651A Fall 2013 HOMEWORK 9 solutions Due 4pm Wednesday, November 13. You will be graded not only on the correctness of your answers but

More information

(K + L)(c x) = K(c x) + L(c x) (def of K + L) = K( x) + K( y) + L( x) + L( y) (K, L are linear) = (K L)( x) + (K L)( y).

(K + L)(c x) = K(c x) + L(c x) (def of K + L) = K( x) + K( y) + L( x) + L( y) (K, L are linear) = (K L)( x) + (K L)( y). Exercise 71 We have L( x) = x 1 L( v 1 ) + x 2 L( v 2 ) + + x n L( v n ) n = x i (a 1i w 1 + a 2i w 2 + + a mi w m ) i=1 ( n ) ( n ) ( n ) = x i a 1i w 1 + x i a 2i w 2 + + x i a mi w m i=1 Therefore y

More information

DETERMINANTS. , x 2 = a 11b 2 a 21 b 1

DETERMINANTS. , x 2 = a 11b 2 a 21 b 1 DETERMINANTS 1 Solving linear equations The simplest type of equations are linear The equation (1) ax = b is a linear equation, in the sense that the function f(x) = ax is linear 1 and it is equated to

More information

Preliminary Exam 2016 Solutions to Morning Exam

Preliminary Exam 2016 Solutions to Morning Exam Preliminary Exam 16 Solutions to Morning Exam Part I. Solve four of the following five problems. Problem 1. Find the volume of the ice cream cone defined by the inequalities x + y + z 1 and x + y z /3

More information

Linear Ordinary Differential Equations

Linear Ordinary Differential Equations MTH.B402; Sect. 1 20180703) 2 Linear Ordinary Differential Equations Preliminaries: Matrix Norms. Denote by M n R) the set of n n matrix with real components, which can be identified the vector space R

More information

Calculus 2502A - Advanced Calculus I Fall : Local minima and maxima

Calculus 2502A - Advanced Calculus I Fall : Local minima and maxima Calculus 50A - Advanced Calculus I Fall 014 14.7: Local minima and maxima Martin Frankland November 17, 014 In these notes, we discuss the problem of finding the local minima and maxima of a function.

More information

a 11 a 12 a 11 a 12 a 13 a 21 a 22 a 23 . a 31 a 32 a 33 a 12 a 21 a 23 a 31 a = = = = 12

a 11 a 12 a 11 a 12 a 13 a 21 a 22 a 23 . a 31 a 32 a 33 a 12 a 21 a 23 a 31 a = = = = 12 24 8 Matrices Determinant of 2 2 matrix Given a 2 2 matrix [ ] a a A = 2 a 2 a 22 the real number a a 22 a 2 a 2 is determinant and denoted by det(a) = a a 2 a 2 a 22 Example 8 Find determinant of 2 2

More information

Math Camp Lecture 4: Linear Algebra. Xiao Yu Wang. Aug 2010 MIT. Xiao Yu Wang (MIT) Math Camp /10 1 / 88

Math Camp Lecture 4: Linear Algebra. Xiao Yu Wang. Aug 2010 MIT. Xiao Yu Wang (MIT) Math Camp /10 1 / 88 Math Camp 2010 Lecture 4: Linear Algebra Xiao Yu Wang MIT Aug 2010 Xiao Yu Wang (MIT) Math Camp 2010 08/10 1 / 88 Linear Algebra Game Plan Vector Spaces Linear Transformations and Matrices Determinant

More information

MATH 51H Section 4. October 16, Recall what it means for a function between metric spaces to be continuous:

MATH 51H Section 4. October 16, Recall what it means for a function between metric spaces to be continuous: MATH 51H Section 4 October 16, 2015 1 Continuity Recall what it means for a function between metric spaces to be continuous: Definition. Let (X, d X ), (Y, d Y ) be metric spaces. A function f : X Y is

More information

ENGR-1100 Introduction to Engineering Analysis. Lecture 21

ENGR-1100 Introduction to Engineering Analysis. Lecture 21 ENGR-1100 Introduction to Engineering Analysis Lecture 21 Lecture outline Procedure (algorithm) for finding the inverse of invertible matrix. Investigate the system of linear equation and invertibility

More information

LINEAR ALGEBRA WITH APPLICATIONS

LINEAR ALGEBRA WITH APPLICATIONS SEVENTH EDITION LINEAR ALGEBRA WITH APPLICATIONS Instructor s Solutions Manual Steven J. Leon PREFACE This solutions manual is designed to accompany the seventh edition of Linear Algebra with Applications

More information

Mathematics. EC / EE / IN / ME / CE. for

Mathematics.   EC / EE / IN / ME / CE. for Mathematics for EC / EE / IN / ME / CE By www.thegateacademy.com Syllabus Syllabus for Mathematics Linear Algebra: Matrix Algebra, Systems of Linear Equations, Eigenvalues and Eigenvectors. Probability

More information

1. Tangent Vectors to R n ; Vector Fields and One Forms All the vector spaces in this note are all real vector spaces.

1. Tangent Vectors to R n ; Vector Fields and One Forms All the vector spaces in this note are all real vector spaces. 1. Tangent Vectors to R n ; Vector Fields and One Forms All the vector spaces in this note are all real vector spaces. The set of n-tuples of real numbers is denoted by R n. Suppose that a is a real number

More information

Linear Algebra: Lecture notes from Kolman and Hill 9th edition.

Linear Algebra: Lecture notes from Kolman and Hill 9th edition. Linear Algebra: Lecture notes from Kolman and Hill 9th edition Taylan Şengül March 20, 2019 Please let me know of any mistakes in these notes Contents Week 1 1 11 Systems of Linear Equations 1 12 Matrices

More information

MAT 570 REAL ANALYSIS LECTURE NOTES. Contents. 1. Sets Functions Countability Axiom of choice Equivalence relations 9

MAT 570 REAL ANALYSIS LECTURE NOTES. Contents. 1. Sets Functions Countability Axiom of choice Equivalence relations 9 MAT 570 REAL ANALYSIS LECTURE NOTES PROFESSOR: JOHN QUIGG SEMESTER: FALL 204 Contents. Sets 2 2. Functions 5 3. Countability 7 4. Axiom of choice 8 5. Equivalence relations 9 6. Real numbers 9 7. Extended

More information

MATH 323 Linear Algebra Lecture 6: Matrix algebra (continued). Determinants.

MATH 323 Linear Algebra Lecture 6: Matrix algebra (continued). Determinants. MATH 323 Linear Algebra Lecture 6: Matrix algebra (continued). Determinants. Elementary matrices Theorem 1 Any elementary row operation σ on matrices with n rows can be simulated as left multiplication

More information

MATH 235. Final ANSWERS May 5, 2015

MATH 235. Final ANSWERS May 5, 2015 MATH 235 Final ANSWERS May 5, 25. ( points) Fix positive integers m, n and consider the vector space V of all m n matrices with entries in the real numbers R. (a) Find the dimension of V and prove your

More information

Mathematical Foundations

Mathematical Foundations Chapter 1 Mathematical Foundations 1.1 Big-O Notations In the description of algorithmic complexity, we often have to use the order notations, often in terms of big O and small o. Loosely speaking, for

More information

Determinants An Introduction

Determinants An Introduction Determinants An Introduction Professor Je rey Stuart Department of Mathematics Paci c Lutheran University Tacoma, WA 9844 USA je rey.stuart@plu.edu The determinant is a useful function that takes a square

More information

MAT Linear Algebra Collection of sample exams

MAT Linear Algebra Collection of sample exams MAT 342 - Linear Algebra Collection of sample exams A-x. (0 pts Give the precise definition of the row echelon form. 2. ( 0 pts After performing row reductions on the augmented matrix for a certain system

More information

SPRING OF 2008 D. DETERMINANTS

SPRING OF 2008 D. DETERMINANTS 18024 SPRING OF 2008 D DETERMINANTS In many applications of linear algebra to calculus and geometry, the concept of a determinant plays an important role This chapter studies the basic properties of determinants

More information

CALCULUS JIA-MING (FRANK) LIOU

CALCULUS JIA-MING (FRANK) LIOU CALCULUS JIA-MING (FRANK) LIOU Abstract. Contents. Power Series.. Polynomials and Formal Power Series.2. Radius of Convergence 2.3. Derivative and Antiderivative of Power Series 4.4. Power Series Expansion

More information

Chapter 2: Unconstrained Extrema

Chapter 2: Unconstrained Extrema Chapter 2: Unconstrained Extrema Math 368 c Copyright 2012, 2013 R Clark Robinson May 22, 2013 Chapter 2: Unconstrained Extrema 1 Types of Sets Definition For p R n and r > 0, the open ball about p of

More information

Math Homework 2

Math Homework 2 Math 73 Homework Due: September 8, 6 Suppose that f is holomorphic in a region Ω, ie an open connected set Prove that in any of the following cases (a) R(f) is constant; (b) I(f) is constant; (c) f is

More information

2. Function spaces and approximation

2. Function spaces and approximation 2.1 2. Function spaces and approximation 2.1. The space of test functions. Notation and prerequisites are collected in Appendix A. Let Ω be an open subset of R n. The space C0 (Ω), consisting of the C

More information

88 CHAPTER 3. SYMMETRIES

88 CHAPTER 3. SYMMETRIES 88 CHAPTER 3 SYMMETRIES 31 Linear Algebra Start with a field F (this will be the field of scalars) Definition: A vector space over F is a set V with a vector addition and scalar multiplication ( scalars

More information

MATH 23a, FALL 2002 THEORETICAL LINEAR ALGEBRA AND MULTIVARIABLE CALCULUS Solutions to Final Exam (in-class portion) January 22, 2003

MATH 23a, FALL 2002 THEORETICAL LINEAR ALGEBRA AND MULTIVARIABLE CALCULUS Solutions to Final Exam (in-class portion) January 22, 2003 MATH 23a, FALL 2002 THEORETICAL LINEAR ALGEBRA AND MULTIVARIABLE CALCULUS Solutions to Final Exam (in-class portion) January 22, 2003 1. True or False (28 points, 2 each) T or F If V is a vector space

More information

Refined Inertia of Matrix Patterns

Refined Inertia of Matrix Patterns Electronic Journal of Linear Algebra Volume 32 Volume 32 (2017) Article 24 2017 Refined Inertia of Matrix Patterns Kevin N. Vander Meulen Redeemer University College, kvanderm@redeemer.ca Jonathan Earl

More information

Lecture Notes in Linear Algebra

Lecture Notes in Linear Algebra Lecture Notes in Linear Algebra Dr. Abdullah Al-Azemi Mathematics Department Kuwait University February 4, 2017 Contents 1 Linear Equations and Matrices 1 1.2 Matrices............................................

More information