Solution to Homework 1

Size: px
Start display at page:

Download "Solution to Homework 1"

Transcription

1 Solution to Homework Sec 2 (a) Yes It is condition (VS 3) (b) No If x, y are both zero vectors Then by condition (VS 3) x = x + y = y (c) No Let e be the zero vector We have e = 2e (d) No It will be false when a = (e) Yes (f) No It has m rows and n columns (g) No (h) No For example, we have x + ( x) = (i) Yes (j) Yes (k) Yes That is the definition 8 By (VS 7) and (VS 8), we have (a + b)(x + y) = a(x + y) + b(x + y) = ax + ay + bx + by 4 Yes All the condition are preserved when the field is the real numbers 5 No Because a real-valued vector scalar multiply with a complex number will not always be a real-valued vector 2 Since each entries could be or and there are m n entries, there are 2 m n vectors in that space Sec 3 (a) No This should make sure that the field and the operations of V and W are the same Otherwise, for example, V = R and w = Q respectively Then W is a vector space over Q but not a space over R So it is not a subspace of V (b) No We should have that any subspace contains (c) Yes We can choose W = (d) No Let V = R, E = {} and E = {} Then we have E E = is not a subspace

2 (e) Yes Only entries on diagonal could be nonzero (f) No It is the summation of that (g) No But it is called isomorphism That is, they are the same in view of structure 8 Just check whether it s closed under addition and scalar multiplication and whether it contains And here s and t are in R (a) Yes It is a line t(3,, ) (b) No It contains no (,, ) (c) Yes It is a plane with normal vector (2, 7, ) (d) Yes It is a plane with normal vector (, 4, ) (e) No It contains no (,, ) (f) No We have both ( 3, 5, ) and (, 6, 3) are elements of W 6 But their sum ( 3, 5 + 6, 3) is not an element of W 6 No in general but yes when n = Since W is not closed under addition For example, when n = 2, (x 2 + x) + ( x 2 ) = x is not in W 9 It s easy to say that it is sufficient since if we have W W 2 or W 2 W Then the union of W and W 2 will be W or W 2, a space of course To say it is necessary we may assume that neither W W 2 or W 2 W holds Then we can find some x W W 2 and y W 2 W Thus by the condition of subspace we have x + y is a vector in W or in W 2, say W But this will make y = (x + y) x should be in W It will be contradictory to the original hypothesis that y W 2 W 23 (a) We have (x + x 2 ) + (y + y 2 ) = (x + y ) + (x 2 + y 2 ) W + W 2 and c(x + x 2 ) = cx + cx 2 W + W 2 if x, y W and x 2, y 2 W 2 And we have = + W +W 2 Finally W = {x+ : x W, W 2 } W + W 2 and it s similar for the case of W 2 (b) If U is a subspace contains both W and W 2 then x + y should be a vector in U for all x W and y W 2 28 By the previous exercise we have (M + M 2 ) t = M t + M t 2 = (M + M 2 ) and (cm) t = cm t = cm With addition that zero matrix is skewsymmetric we have the set of all skew-symmetric matrices is a space We have M nn (F) = A A M nn (F) = (A + A t ) + (A A t ) A M nn (F) = W + W 2 and W W 2 = {} The final equality is because A + A t is symmetric and A A t is skew-symmetric If F is of characteristic 2, we have W = W 2 3 If V = W W 2 and some vector y V can be represented as y = x +x 2 = x + x 2, where x, x W and x 2, x 2 W 2 Then we have x x W and x x = x 2 x 2 W 2 But since W W 2 = {}, we have x = x and x 2 = x 2 Conversely, if each vector in V can be uniquely written as x + x 2, then V = W +W 2 Now if x W W 2 and x, then we have that x = x+ with x W and W 2 or x = + x with W and x W 2, ie a contradiction 2

3 3 (a) If v + W is a space, we have = v + ( v) v + W and thus v W and v W Conversely, if v W we have actually v + W = W, a space (b) We can prove that v +W = v 2 +W if and only if (v v 2 )+W = W This is because ( v ) + (v + W ) = W and ( v ) + (v 2 + W ) = ( v + v 2 ) + W So if (v v 2 ) + W = W, a space, then we have v v 2 W by the previous exercise And if v v 2 W we can conclude that (v v 2 ) + W = W (c) We have (v + W ) + (v 2 + W ) = (v + v 2 ) + W = (v + v 2) + W = (v +W )+(v 2+W ) since by the previous exercise we have v v W and v 2 v 2 W and thus (v + v 2 ) (v + v 2) W On the other hand, since v v W implies av av = a(v v ) W, we have a(v + W ) = a(v + W ) (d) It is closed because V is closed The commutativity and associativity of addition is also because V is commutative and associative For the zero element we have (x + W ) + W = x + W For the inverse element we have (x + W ) + ( x + W ) = W For the identity element of multiplication we have (x + W ) = x + W The distribution law and combination law are also followed by the original propositions in V But there are one more thing should be checked, that is whether it is well-defined But this is the exercise 33 (c) Sec 4 (a) Yes Just pick any coefficient to be zero (b) No By definition it should be {} (c) Yes Every subspaces of which contains S as a subset contains span(s) and span(s) is a subspace (d) No This action will change the solution of one system of linear equations (e) Yes (f) No For example, x = 3 has no solution Any symmetric 2 2 matrices can be written as following: ( ) a b = am b c + cm 2 + bm 3 For x the statement is the definition of linear combination and the set is a line For x = the both side of the equation is the set of zero vector and the set is the origin 4 We prove span(s S 2 ) span(s )+span(s 2 ) first For v span(s S 2 ) we have v = n a ix i + m j= a jy j with x i S and y j S 2 Since the first summation is in span(s ) and the second summation is in span(s 2 ), we have v span(s ) + span(s 2 ) For the converse, let u + v span(s ) + span(s 2 ) with u span(s ) and v span(s 2 ) We can write v = n a ix i + m j= a jy j with x i S and y j S 2 This means u + v span(s S 2 ) 3

4 Sec 5 (a) No For example, take S = {(, ), (2, ), (, )} and then (, ) is not a linear combination of the other two (b) Yes It is because = (c) No It is independent by the remark after Definition of linearly independent (d) No For example, we have S = {(, ), (2, ), (, )} but {(, ), (, )} is linearly independent (e) Yes This is the contrapositive statement of Theorem 6 (f) Yes This is the definition 2 (a) Linearly dependent (b) Linearly independent (c) Linearly independent (d) Linearly dependent (e) Linearly dependent (f) Linearly independent (g) Linearly dependent (h) Linearly independent (i) Linearly independent (j) Linearly dependent 9 It is sufficient since if u = tv for some t F then we have utv = While it is also necessary since if au + bv = for some a, b F with at least one of the two coefficients not zero, then we may assume a and u = b a v Pick v = (,, ), v 2 = (,, ), v 3 = (,, ) And we have that none of the three is a multiple of another and they are dependent since v v 2 v 3 = 3 (a) Sufficiency: If {u+v, u v} is linearly independent we have a(u+v)+ b(u v) = implies a = b = Assuming that cu + dv =, we can deduce that c+d c d c+d 2 (u + v) + 2 (u v) = and hence 2 = c d 2 = This means c = d = if the characteristic is not two Necessity: If {u, v} is linearly independent we have au + bv = implies a = b = Assuming that c(u + v) + d(u v) =, we can deduce that (c + d)u + (c d)v = and hence c + d = c d = This means c = d = if the characteristic is not two (b) Similar to (a) 5 Sufficiency: If u =, then S is linearly independent Suppose u k+ is in span({u, u 2,, u k }) for some k, say u k+ = a u + a 2 u a k u k Then we have a u + a 2 u a k u k u k+ = is a nontrivial representation 4

5 Necessary: If S is linearly dependent, there is some integer k such that there is some nontrivial representation a u + a 2 u a k u k + a k+ u k+ = Furthermore we may assume that a k+ otherwise we may choose less k until that a k+ Hence we have u k+ = a k+ (a u + a 2 u a k u k ) and so u k+ span({u, u 2,, u k }) Sec 6 (a) No The empty set is its basis (b) Yes This is the result of Replacement Theorem (c) No For example, the set of all polynomials has no finite basis (d) No R 2 has {(, ), (, )} and {(, ), (, )} as bases (e) Yes This is the Corollary after Replacement Theorem (f) No It is n + (g) No It is m n (h) Yes This is the Replacement Theorem (i) No For S = {, 2}, a subset of R, then 5 = +2 2 = (j) Yes This is Theorem (k) Yes It is and V respectively (l) Yes This is the Corollary 2 after Replacement Theorem 5 It is impossible since the dimension of R 3 is three 7 We have first {u, u 2 } is linearly independent And since u 3 = 4u and u 4 = 3u + 7u 2, we can check that {u, u 2, u 5 } is linearly independent and hence it is a basis Since {u, v} is a basis for V, dim V = 2 So if {u + v, au} is a set of 2 linearly independent vectors, then it is a basis Now if then we get c (u + v) + c 2 (au) =, (c + ac 2 )u + c v = By the linear independency of {u, v}, we have { c + ac 2 = c = As a and b are nonzero, we have c = c 2 = linearly independent and is a basis for V Hence {u + v, au} are Similarly c (au) + c 2 (bv) = implies c = c 2 = So {au, bv} are linearly independent, hence a basis for V 5

6 2 Suppose {u, v, w} is a basis for V Then we know dim V = 3 So {u + v + w, v + w, w} is a basis if they are linearly independent For we can rearrange to get c (u + v + w) + c 2 (v + w) + c 3 (w) =, c u + (c + c 2 )v + (c + c 2 + c 3 )w = By the linear independence of {u, v, w}, we have c = c +c 2 = c +c 2 +c 3 = Then obviously we have c = c 2 = c 3 = So {u + v + w, v + w, w} are linearly independent and hence a basis 22 One can see that the dimension of W after intersecting with W 2 does not change So it is natural to think that W is a set not larger than W 2 and contained in W 2 More rigorously, we claim that W W 2 is the condition It is obvious to see that W W 2 implies dim(w W 2 ) = dim(w ) Since W W 2, W W 2 is just W So their dimensions are equal To show the necessary condition, we show that dim(w W 2 ) = dim(w ) implies W W 2 Suppose that W is not contained in W 2, that means there is some vector v W \ W 2 Let β be the basis of W W 2, in particular β is in W Note that v is in W but not W 2, so v span(β) But then β {v} are linearly independent in W So the size of this linearly independent set of vectors is greater than dim(w ), which leads to a contradiction Hence W must be contained in W 2 23 (a) Note that W = span({v, v 2,, v k }) has the same dimension as W 2 = span({v, v 2,, v k, v}) So v cannot help in generating more combinations In other word v is already in span({v, v 2,, v k }) Hence we claim that v {v, v 2,, v k } = W is the condition To show the necessary condition, we suppose v W Let β be a basis of W Note that β W W 2 and v W 2 Then β {v} is a linearly independent set in W 2 But then dim(w 2 ) = dim(w ) = β < β + = β {v} dim(w 2 ) leads to a contradiction Hence v W To check that the condition is sufficient, if v {v, v 2,, v k }, then span({v, v 2,, v k, v}) = span({v, v 2,, v k }) Hence W and W 2 are the same, so are their dimensions (b) With the above condition, it shows that dim(w ) dim(w 2 ) implies v W Then following the same arguments in (a), we arrive at dim(w ) = β < β + = β {v} dim(w 2 ) Hence dim(w ) < dim(w 2 ) 6

7 26 For any f P n (R) with f(a) =, we have f(x) = (x a)g(x) for some g P n (R) So the subspace is equivalent to {f P n (R) : f(a) = } {f P n (R) : f(x) = (x a)g(x), g P n (R)} But P n (R) is of dimension n, so is the subspace More explicitly, {, x,, x n } is a basis for P n (R) One can easily check that {(x a), (x a)x,, (x a)x n } is a basis for the subspace Or simply one can observe {x a, x 2 a 2,, x n a n } is another basis for the subspace 29 (a) Suppose {u, u 2,, u k } is a basis for W W 2 Then one can extend it to a basis {u, u 2,, u k, v, v 2,, v m } for W and a basis {u, u 2,, u k, w, w 2,, w p } for W 2 We want to show that {u, u 2,, u k, v, v 2,, v m, w, w 2,, w p } is a basis for W + W 2 Suppose we have k m a i u i + b i v i + One can rearrange to get m b i v i = p c i w i = k a i u i + v i + p c i w i We then see the left hand side is in W, while the right hand side is in W 2 So both are in W W 2 In particular, m b i can be expressed as a combination of {u, u 2,, u k } m b i v i = s u + s 2 u s k u k We can rearrange to get s u + s 2 u s k u k + b v + b 2 v b m v m = Note that {u, u 2,, u k, v, v 2,, v m } is a basis The linear independence implies coefficients are all zero In particular b = b 2 = = b m = Now the right hand side vanishes = k a i u i + v i + p c i w i Again, linear independence of {u, u 2,, u k, w, w 2,, w p } implies that a = a 2 = = a k = c = c 2 = = c p = Hence {u, u 2,, u k, v, v 2,, v m, w, w 2,, w p } 7

8 Sec 2 are linearly independent Now for any vector z W + W 2, we have z = x + y, where x W and y W 2 Then we can write x and y as follows x = a u + a 2 u a k u k + b v + b 2 v b m v m y = c u + c 2 u c k u k + d w + d 2 w d m w m So we can rearrange the sum to get z = k m (a i + c i )u i + b i v i + p d i w i span({u, u 2,, u k, v, v 2,, v m, w, w 2,, w p }) Hence we have checked {u, u 2,, u k, v, v 2,, v m, w, w 2,, w p } is a basis for W + W 2 Then one can easily check their dimensions dim(w + W 2 ) = k + m + p = dim(w ) + dim(w 2 ) dim(w + W 2 ) (b) V is the direct sum of W and W 2 if and only if W W 2 = {} But W W 2 = {} if and only if dim(w W 2 ) = From the above formula, we have dim(v ) = dim(w ) + dim(w 2 ) 5 To show that T is linear, for any f, g P (R), we write f(x) = n i= a ix i and g(x) = sum m i= b ix i Without loss of generality, we may assume n >= m and set b i = for i > m So we can write g(x) = sum n i= b ix i Then T (f(x) + g(x)) = x (f(x) + g(x))dt = and, similarly, T (αf(x)) = αt (f(x)) = x i= x (a i + b i )t i dt i= x a i t i dt + = T (f(x)) + T (g(x)) b i t i dt To prove that T is one-to-one, we suppose T (f(x)) = T (g(x)) Then one can do the integration and get a i = b i for all i n i= x f(t)dt = a i i + xi+ = Hence f g and T is one-to-one x i= g(t)dt b i i + xi+ However T is not onto For example, for any constant c P (R) but there is no such f P (R) such that T (f(x)) = x f(t)dt = i= 8

9 7 Let s recall the rank-nullity formula dim V = dim R(T ) + dim N(T ) (a) Suppose dim V < dim W but T is onto Then we have R(T ) = W But dim N(T ) So dim V < dim W = dim R(T ) <= dim R(T ) + dim N(T ) = dim V, which is a contradiction Hence T cannot be onto (b) Suppose dim V > dim W but T is one-to-one Then we have N(T ) = {} and dim N(T ) = But dim R(T ) dim W So dim V > dim W dim R(T ) = dim R(T ) + dim N(T ) = dim V, which is again a contradiction Hence T cannot be one-to-one 8 Note that N(T ) is in the domain while R(T ) is in the codomain Consider the linear transformation T (x, y) = (y, ) One can easily check that N(T ) = {(x, ) : x R} = R(T ) 9 Consider T (x, y) = ( y, x) and U(x, y) = (2x, 2y) Then and R(T ) = {(x, y) R 2 } = R(U) N(T ) = {(, ) R 2 } = N(U) Actually T is a rotation and U is a scaling One can also try U to be a translation The conclusion is the same Sec 22 3 Suppose T : V W, U : V W and R(T ) R(U) = {} If αt + βu is the zero linear transformation from V to W (that is the in L(V, W )), then we want to show that α = β = That means (αt + βu)(v) = for all v V So αt (v) = βu(v) for all v V Note that the left hand side is in R(T ), while the right hand side is in R(U) Then R(T ) R(U) = {} implies that αt (v) = and βu(v) = for all v in V Note that T and U are nonzero linear transformations Hence it must be that α = β = and the linear independency follows 6 Let n = dim V Suppose {v, v 2,, v k } is a basis for N(T ) Then one can extend it to be a basis β for V β = {v, v 2, v k, v k+,, v n } Note that {T v k+,, T v n } is a basis for R(T ) Since dim W = dim V = n, we can extend the above to be a basis γ for W γ = {w, w 2,, w k, T v k+,, T v n } 9

10 Now we can check that [T ] γ β is diagonal [T ] γ β = [T v ] γ [T v 2 ] γ [T v n ] γ One can see that T v, T v 2,, T v k are zero vectors and T v k+,, T v n are basis in W So {[T v k+ ] γ,, [T v n ] γ } are {e k+,, e n }, where e j is a vector with a at jth entry and elsewhere ( ) [T ] γ O O β = O I n k Sec 23 2 Note that UT is a transformation from V to Z (a) Suppose T (x) = T (y) for x, y V Then by transforming them with U, we have UT (x) = UT (y) As UT is one-to-one, so x = y Hence T is one-to-one However U may not be one-to-one One example is that T (x, y) = (x, y, ) and U(x, y, z) = (x, y) Then T and UT are one-to-one, while U is not (b) Suppose z Z As UT is onto, there exists some v V such that UT (v) = z Then take w = T (v), we have U(w) = U(T (v)) = z Hence U is onto However T may not be onto A counter example would be the one in (a) (c) For UT (x) = UT (y), as U is one-to-one, we have T (x) = T (y) Again as T is one-to-one, we have x = y So UT is one-to-one For z Z, as U is onto, there exists some w W such that U(w) = z Then for this w, as T is onto, there exist some v V such that T (v) = w Hence we have found v V such that UT (v) = U(w) = z So UT is onto 3 Denote (M) ij as the entry at ith row and jth column Then one can simply write from definition to check that they are equal tr(ab) = tr(ba) = (AB) ii = (BA) jj = j= j= j= (A) ij (B) ji (A) ji (B) ij = j= (A) ij (B) ji As the sum is finite, we can interchange the order of summations and get the result

11 7 Suppose T : V V is a linear transformation such that T = T 2 Denote W = {y V : T (y) = y} and W 2 = {y V : T (y) = }(= N(T )) Note that for every vector x V, we can write x = T (x) + (x T (x)) In other words, we write x = u + v, where u = T (x) and v = x T (x) We claim that u W and v W 2 Firstly, T (u) = T (T (x)) = T (x) = u, so u W Next, T (v) = T (x T (x)) = T (x) T (T (x)) = T (x) T (x) =, so v W 2 Moreover we can see that V = W W 2, that means W W 2 = {} For any y W W 2, we have both T (y) = y and T (y) =, so y = To interpret this, V is decomposed into two subspaces, say V = W W 2 A vector v V can be expressed as a sum of two parts, one from each subspace A transformation T will preserve the first part and remove the other part, that is just a projection Hence T is a projection of vectors onto some subspace W V which V = W W 2 Sec 24 4 As A and B are invertible, there exists A and B such that So it is easy to check A A = AA = I and B B = BB = I B A AB = I and ABB A = I Hence AB is invertible and B A is the inverse of AB In other words (AB) = B A 6 Φ is an isomorphism if it is a one-to-one onto linear transformation It is easy to check that Φ is linear Φ(C + D) = B (C + D)B = B CB + B DB = Φ(C) + Φ(D) Φ(αC) = B (αc)b = αb CB = αφ(c) Note that B is invertible Then for any C and D such that Φ(C) = Φ(D), we have B CB = B DB Hence C = D and Φ is one-to-one Moreover, given A, we can also find C = BAB such that Φ(C) = B BAB B = A Hence Φ is onto So it is an isomorphism

12 Sec 32 2 (g) By elementary row operations, we get the RREF (reduced row echelon form) So the rank is just 5 (h) By computing the RREF of (A I), we see the rank is just 3 So the inverse does not exist Sec 33 3 (g) Consider { x + 2x 2 + x 3 + x 4 = x 2 x 3 + x 4 = One particular solution is x = x 2 = x 3 = and x 4 = Now we consider the homogenous system { { x + 2x 2 + x 3 + x 4 = x = 3x 3 + x 4 x 2 x 3 + x 4 = x 2 = x 3 x 4 We choose ( 3,,, ) and (,,, ) to be a basis for the solution set of the homogenous system Then all the solutions can be written as (,,, )+s( 3,,, )+t(,,, ) Hence the solutions to the system are x x 2 x 3 x 4 = 3s + t s t s t + for all s, t R 4 (b) First, rewrite the system of linear equations as Ax = b x + 2x 2 x 3 = 5 x + x 2 + x 3 = 2x 2x 2 + x 3 = x x 2 x 3 5 = 4 i By computing the RREF of (A I), , 2

13 Sec 34 we get A = ii As we now have A, x is just A b x x 2 = = 9 x (a) Check that (,,,,, ) and (,,,,, ) are solutions to the system, so S V Suppose a(,,,,, ) + b(,,,,, ) = (,,,,, ) One can easily solve that a = b = Hence they are linearly independent (b) Consider the system { x x 2 +2x 4 3x 5 +x 6 = 2x x 2 x 3 +3x 4 4x 5 +4x 6 = One can solve for any two of the variables, say x and x 2 { x = x 3 x 4 +x 5 3x 6 x 2 = x 3 +x 4 2x 5 2x 6 We then get a set of basis for the solution set by setting each of {x 3, x 4, x 5, x 6 } to be 3 2 2,,, To extend S to a basis for V, we compute the RREF to select two more linearly independent vectors to form a basis

14 Sec 4 Hence we choose (,,,,, ) and ( 3, 2,,,, ) Therefore, the extended basis is 3 2,,, For Exercise 5, 7 and 8, we introduce the following notations ( ) a b A = c d 5 Suppose B is obtained by interchanging the rows of A ( ) c d B = a b Then the determinants can be easily computed 7 Note that det(b) = cb ad = (ad bc) = det(a) Then the determinants are equal ( ) A t a c = b d det(a t ) = ad bc = det(a) 8 As A is upper triangular, we have c = Then det(a) = ad bc = ad, which is the product of the diagonal entries of A Sec By negating a row of the matrix A, we change det(a) by a factor of To obtain A, we can negate every row of A, that is negating n times So det( A) = ( ) n det(a) For det( A) = det(a), either det(a) =, which means A is not invertible; or ( ) n =, which means n is even or F is of characteristic 2 27 It is obvious that A is not of full-rank, so det(a) = 4

15 Sec 43 2 Note that det(q t ) = det(q) So if QQ t = I, we have det(qq t ) = det(i) Then det(q) 2 = det(q) det(q t ) = det(qq t ) = det(i) = Hence det(q) = ± 5 Note that det(q ) = det(q) for invertible matrix Q M n n (F) If A and B are similar, there exists some invertible matrix Q such that A = Q BQ So det(a) = det(q BQ) = det(q ) det(b) det(q) = det(b) 22 (a) Note that β = {, x,, x n } and γ = {e, e 2,, e n+ } [T ] γ β = [T ()] γ [T (x)] γ [T (x 2 )] γ [T (x n )] γ For T (x j ) = (c j, cj,, cj n) for j =,, 2,, n As γ is just the standard basis, T (x j ) as its usual representation under γ Hence we have c c 2 c n M = [T ] γ β = c c 2 c n c n c 2 n c n n (b) Using Exercise 22 from Sec 24, we know that T is an isomorphism In other words, T is an invertible transformation, so is M Hence det(m) (c) We recall that a n b n = (a b)(a n + a n 2 b + + ab n 2 + b n ) 5

16 Sec 44 Then we are ready to expand the determinant c c 2 c n c c 2 c n det(m) = det c n c 2 n c n n c c 2 c n c c c 2 c 2 c n c n = det c n c c 2 n c 2 c n n c n c c c 2 c 2 c n c n = det c n c c 2 n c 2 c n n c n n c n + c = (c i c ) det c n + c i= cn i c i n i= cn i n c i Observe that the second column can be reduced by a multiple of the first column c n c 2 + c c + c 2 n det(m) = (c i c ) det c n c 2 n + c n c + c 2 i= cn i c i n i= cn i n c i In the same way, we can reduce the jth column by multiples of previous columns By these column operations, we can get c n c 2 c n det(m) = (c i c ) det c n c 2 n c n n In the same fashion, we expand this determinant c n n 2 c n 2 2 det(m) = (c i c ) (c i c ) det i=2 c n c n 2 n n n n = (c i c ) (c i c ) (c i c n ) = i,j n i=2 (c j c i ) Basically these are the major rules for us to handle determinants Please make sure you don t get them wrong i=n 6

17 (a) True (b) False (It depends) (c) True (d) False (e) False (f) True (g) True (h) False (i) True (j) True (k) True And, of course, please make sure you understand the reasons behind each fact 7

EXERCISE SET 5.1. = (kx + kx + k, ky + ky + k ) = (kx + kx + 1, ky + ky + 1) = ((k + )x + 1, (k + )y + 1)

EXERCISE SET 5.1. = (kx + kx + k, ky + ky + k ) = (kx + kx + 1, ky + ky + 1) = ((k + )x + 1, (k + )y + 1) EXERCISE SET 5. 6. The pair (, 2) is in the set but the pair ( )(, 2) = (, 2) is not because the first component is negative; hence Axiom 6 fails. Axiom 5 also fails. 8. Axioms, 2, 3, 6, 9, and are easily

More information

2. Every linear system with the same number of equations as unknowns has a unique solution.

2. Every linear system with the same number of equations as unknowns has a unique solution. 1. For matrices A, B, C, A + B = A + C if and only if A = B. 2. Every linear system with the same number of equations as unknowns has a unique solution. 3. Every linear system with the same number of equations

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

MATH 240 Spring, Chapter 1: Linear Equations and Matrices

MATH 240 Spring, Chapter 1: Linear Equations and Matrices MATH 240 Spring, 2006 Chapter Summaries for Kolman / Hill, Elementary Linear Algebra, 8th Ed. Sections 1.1 1.6, 2.1 2.2, 3.2 3.8, 4.3 4.5, 5.1 5.3, 5.5, 6.1 6.5, 7.1 7.2, 7.4 DEFINITIONS Chapter 1: Linear

More information

MATH 221: SOLUTIONS TO SELECTED HOMEWORK PROBLEMS

MATH 221: SOLUTIONS TO SELECTED HOMEWORK PROBLEMS MATH 221: SOLUTIONS TO SELECTED HOMEWORK PROBLEMS 1. HW 1: Due September 4 1.1.21. Suppose v, w R n and c is a scalar. Prove that Span(v + cw, w) = Span(v, w). We must prove two things: that every element

More information

IMPORTANT DEFINITIONS AND THEOREMS REFERENCE SHEET

IMPORTANT DEFINITIONS AND THEOREMS REFERENCE SHEET IMPORTANT DEFINITIONS AND THEOREMS REFERENCE SHEET This is a (not quite comprehensive) list of definitions and theorems given in Math 1553. Pay particular attention to the ones in red. Study Tip For each

More information

Math 4A Notes. Written by Victoria Kala Last updated June 11, 2017

Math 4A Notes. Written by Victoria Kala Last updated June 11, 2017 Math 4A Notes Written by Victoria Kala vtkala@math.ucsb.edu Last updated June 11, 2017 Systems of Linear Equations A linear equation is an equation that can be written in the form a 1 x 1 + a 2 x 2 +...

More information

Math Linear Algebra Final Exam Review Sheet

Math Linear Algebra Final Exam Review Sheet Math 15-1 Linear Algebra Final Exam Review Sheet Vector Operations Vector addition is a component-wise operation. Two vectors v and w may be added together as long as they contain the same number n of

More information

Math 54 HW 4 solutions

Math 54 HW 4 solutions Math 54 HW 4 solutions 2.2. Section 2.2 (a) False: Recall that performing a series of elementary row operations A is equivalent to multiplying A by a series of elementary matrices. Suppose that E,...,

More information

Math 3108: Linear Algebra

Math 3108: Linear Algebra Math 3108: Linear Algebra Instructor: Jason Murphy Department of Mathematics and Statistics Missouri University of Science and Technology 1 / 323 Contents. Chapter 1. Slides 3 70 Chapter 2. Slides 71 118

More information

MATH 110: LINEAR ALGEBRA HOMEWORK #2

MATH 110: LINEAR ALGEBRA HOMEWORK #2 MATH 11: LINEAR ALGEBRA HOMEWORK #2 1.5: Linear Dependence and Linear Independence Problem 1. (a) False. The set {(1, ), (, 1), (, 1)} is linearly dependent but (1, ) is not a linear combination of the

More information

IMPORTANT DEFINITIONS AND THEOREMS REFERENCE SHEET

IMPORTANT DEFINITIONS AND THEOREMS REFERENCE SHEET IMPORTANT DEFINITIONS AND THEOREMS REFERENCE SHEET This is a (not quite comprehensive) list of definitions and theorems given in Math 1553. Pay particular attention to the ones in red. Study Tip For each

More information

Online Exercises for Linear Algebra XM511

Online Exercises for Linear Algebra XM511 This document lists the online exercises for XM511. The section ( ) numbers refer to the textbook. TYPE I are True/False. Lecture 02 ( 1.1) Online Exercises for Linear Algebra XM511 1) The matrix [3 2

More information

1 Last time: inverses

1 Last time: inverses MATH Linear algebra (Fall 8) Lecture 8 Last time: inverses The following all mean the same thing for a function f : X Y : f is invertible f is one-to-one and onto 3 For each b Y there is exactly one a

More information

Linear Algebra Highlights

Linear Algebra Highlights Linear Algebra Highlights Chapter 1 A linear equation in n variables is of the form a 1 x 1 + a 2 x 2 + + a n x n. We can have m equations in n variables, a system of linear equations, which we want to

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

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

Math 110, Spring 2015: Midterm Solutions

Math 110, Spring 2015: Midterm Solutions Math 11, Spring 215: Midterm Solutions These are not intended as model answers ; in many cases far more explanation is provided than would be necessary to receive full credit. The goal here is to make

More information

CSL361 Problem set 4: Basic linear algebra

CSL361 Problem set 4: Basic linear algebra CSL361 Problem set 4: Basic linear algebra February 21, 2017 [Note:] If the numerical matrix computations turn out to be tedious, you may use the function rref in Matlab. 1 Row-reduced echelon matrices

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

MATH SOLUTIONS TO PRACTICE PROBLEMS - MIDTERM I. 1. We carry out row reduction. We begin with the row operations

MATH SOLUTIONS TO PRACTICE PROBLEMS - MIDTERM I. 1. We carry out row reduction. We begin with the row operations MATH 2 - SOLUTIONS TO PRACTICE PROBLEMS - MIDTERM I. We carry out row reduction. We begin with the row operations yielding the matrix This is already upper triangular hence The lower triangular matrix

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

Math 24 Winter 2010 Sample Solutions to the Midterm

Math 24 Winter 2010 Sample Solutions to the Midterm Math 4 Winter Sample Solutions to the Midterm (.) (a.) Find a basis {v, v } for the plane P in R with equation x + y z =. We can take any two non-collinear vectors in the plane, for instance v = (,, )

More information

LINEAR ALGEBRA BOOT CAMP WEEK 1: THE BASICS

LINEAR ALGEBRA BOOT CAMP WEEK 1: THE BASICS LINEAR ALGEBRA BOOT CAMP WEEK 1: THE BASICS Unless otherwise stated, all vector spaces in this worksheet are finite dimensional and the scalar field F has characteristic zero. The following are facts (in

More information

Lecture Summaries for Linear Algebra M51A

Lecture Summaries for Linear Algebra M51A These lecture summaries may also be viewed online by clicking the L icon at the top right of any lecture screen. Lecture Summaries for Linear Algebra M51A refers to the section in the textbook. Lecture

More information

1.5 Linear Dependence and Linear Independence

1.5 Linear Dependence and Linear Independence 14. For v span(s 1 S ) we may write v = n i=1 a i x i with x i S 1 and x i S. So v is an element of both span(s 1 ) and span(s ) and hence an element of span(s 1 ) span(s ). For example we have if S 1

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

Math 110: Worksheet 3

Math 110: Worksheet 3 Math 110: Worksheet 3 September 13 Thursday Sept. 7: 2.1 1. Fix A M n n (F ) and define T : M n n (F ) M n n (F ) by T (B) = AB BA. (a) Show that T is a linear transformation. Let B, C M n n (F ) and a

More information

Chapter 1 Vector Spaces

Chapter 1 Vector Spaces Chapter 1 Vector Spaces Per-Olof Persson persson@berkeley.edu Department of Mathematics University of California, Berkeley Math 110 Linear Algebra Vector Spaces Definition A vector space V over a field

More information

MATH 2331 Linear Algebra. Section 1.1 Systems of Linear Equations. Finding the solution to a set of two equations in two variables: Example 1: Solve:

MATH 2331 Linear Algebra. Section 1.1 Systems of Linear Equations. Finding the solution to a set of two equations in two variables: Example 1: Solve: MATH 2331 Linear Algebra Section 1.1 Systems of Linear Equations Finding the solution to a set of two equations in two variables: Example 1: Solve: x x = 3 1 2 2x + 4x = 12 1 2 Geometric meaning: Do these

More information

Chapter 7. Linear Algebra: Matrices, Vectors,

Chapter 7. Linear Algebra: Matrices, Vectors, Chapter 7. Linear Algebra: Matrices, Vectors, Determinants. Linear Systems Linear algebra includes the theory and application of linear systems of equations, linear transformations, and eigenvalue problems.

More information

Review for Exam Find all a for which the following linear system has no solutions, one solution, and infinitely many solutions.

Review for Exam Find all a for which the following linear system has no solutions, one solution, and infinitely many solutions. Review for Exam. Find all a for which the following linear system has no solutions, one solution, and infinitely many solutions. x + y z = 2 x + 2y + z = 3 x + y + (a 2 5)z = a 2 The augmented matrix for

More information

NAME MATH 304 Examination 2 Page 1

NAME MATH 304 Examination 2 Page 1 NAME MATH 4 Examination 2 Page. [8 points (a) Find the following determinant. However, use only properties of determinants, without calculating directly (that is without expanding along a column or row

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

MAT 2037 LINEAR ALGEBRA I web:

MAT 2037 LINEAR ALGEBRA I web: MAT 237 LINEAR ALGEBRA I 2625 Dokuz Eylül University, Faculty of Science, Department of Mathematics web: Instructor: Engin Mermut http://kisideuedutr/enginmermut/ HOMEWORK 2 MATRIX ALGEBRA Textbook: Linear

More information

Linear Algebra Summary. Based on Linear Algebra and its applications by David C. Lay

Linear Algebra Summary. Based on Linear Algebra and its applications by David C. Lay Linear Algebra Summary Based on Linear Algebra and its applications by David C. Lay Preface The goal of this summary is to offer a complete overview of all theorems and definitions introduced in the chapters

More information

MATH 320: PRACTICE PROBLEMS FOR THE FINAL AND SOLUTIONS

MATH 320: PRACTICE PROBLEMS FOR THE FINAL AND SOLUTIONS MATH 320: PRACTICE PROBLEMS FOR THE FINAL AND SOLUTIONS There will be eight problems on the final. The following are sample problems. Problem 1. Let F be the vector space of all real valued functions on

More information

MAT 242 CHAPTER 4: SUBSPACES OF R n

MAT 242 CHAPTER 4: SUBSPACES OF R n MAT 242 CHAPTER 4: SUBSPACES OF R n JOHN QUIGG 1. Subspaces Recall that R n is the set of n 1 matrices, also called vectors, and satisfies the following properties: x + y = y + x x + (y + z) = (x + y)

More information

Math 314H EXAM I. 1. (28 points) The row reduced echelon form of the augmented matrix for the system. is the matrix

Math 314H EXAM I. 1. (28 points) The row reduced echelon form of the augmented matrix for the system. is the matrix Math 34H EXAM I Do all of the problems below. Point values for each of the problems are adjacent to the problem number. Calculators may be used to check your answer but not to arrive at your answer. That

More information

ELEMENTARY LINEAR ALGEBRA WITH APPLICATIONS. 1. Linear Equations and Matrices

ELEMENTARY LINEAR ALGEBRA WITH APPLICATIONS. 1. Linear Equations and Matrices ELEMENTARY LINEAR ALGEBRA WITH APPLICATIONS KOLMAN & HILL NOTES BY OTTO MUTZBAUER 11 Systems of Linear Equations 1 Linear Equations and Matrices Numbers in our context are either real numbers or complex

More information

Chapter 2: Matrix Algebra

Chapter 2: Matrix Algebra Chapter 2: Matrix Algebra (Last Updated: October 12, 2016) These notes are derived primarily from Linear Algebra and its applications by David Lay (4ed). Write A = 1. Matrix operations [a 1 a n. Then entry

More information

Chapter 1: Linear Equations

Chapter 1: Linear Equations Chapter : Linear Equations (Last Updated: September, 7) The material for these notes is derived primarily from Linear Algebra and its applications by David Lay (4ed).. Systems of Linear Equations Before

More information

BASIC NOTIONS. x + y = 1 3, 3x 5y + z = A + 3B,C + 2D, DC are not defined. A + C =

BASIC NOTIONS. x + y = 1 3, 3x 5y + z = A + 3B,C + 2D, DC are not defined. A + C = CHAPTER I BASIC NOTIONS (a) 8666 and 8833 (b) a =6,a =4 will work in the first case, but there are no possible such weightings to produce the second case, since Student and Student 3 have to end up with

More information

Review Solutions for Exam 1

Review Solutions for Exam 1 Definitions Basic Theorems. Finish the definition: Review Solutions for Exam (a) A linear combination of vectors {v,..., v n } is: any vector of the form c v + c v + + c n v n (b) A set of vectors {v,...,

More information

Math 24 Spring 2012 Questions (mostly) from the Textbook

Math 24 Spring 2012 Questions (mostly) from the Textbook Math 24 Spring 2012 Questions (mostly) from the Textbook 1. TRUE OR FALSE? (a) The zero vector space has no basis. (F) (b) Every vector space that is generated by a finite set has a basis. (c) Every vector

More information

Study Guide for Linear Algebra Exam 2

Study Guide for Linear Algebra Exam 2 Study Guide for Linear Algebra Exam 2 Term Vector Space Definition A Vector Space is a nonempty set V of objects, on which are defined two operations, called addition and multiplication by scalars (real

More information

Chapter 1: Linear Equations

Chapter 1: Linear Equations Chapter : Linear Equations (Last Updated: September, 6) The material for these notes is derived primarily from Linear Algebra and its applications by David Lay (4ed).. Systems of Linear Equations Before

More information

Linear Algebra M1 - FIB. Contents: 5. Matrices, systems of linear equations and determinants 6. Vector space 7. Linear maps 8.

Linear Algebra M1 - FIB. Contents: 5. Matrices, systems of linear equations and determinants 6. Vector space 7. Linear maps 8. Linear Algebra M1 - FIB Contents: 5 Matrices, systems of linear equations and determinants 6 Vector space 7 Linear maps 8 Diagonalization Anna de Mier Montserrat Maureso Dept Matemàtica Aplicada II Translation:

More information

LINEAR ALGEBRA QUESTION BANK

LINEAR ALGEBRA QUESTION BANK LINEAR ALGEBRA QUESTION BANK () ( points total) Circle True or False: TRUE / FALSE: If A is any n n matrix, and I n is the n n identity matrix, then I n A = AI n = A. TRUE / FALSE: If A, B are n n matrices,

More information

Homework 5 M 373K Mark Lindberg and Travis Schedler

Homework 5 M 373K Mark Lindberg and Travis Schedler Homework 5 M 373K Mark Lindberg and Travis Schedler 1. Artin, Chapter 3, Exercise.1. Prove that the numbers of the form a + b, where a and b are rational numbers, form a subfield of C. Let F be the numbers

More information

Math Camp II. Basic Linear Algebra. Yiqing Xu. Aug 26, 2014 MIT

Math Camp II. Basic Linear Algebra. Yiqing Xu. Aug 26, 2014 MIT Math Camp II Basic Linear Algebra Yiqing Xu MIT Aug 26, 2014 1 Solving Systems of Linear Equations 2 Vectors and Vector Spaces 3 Matrices 4 Least Squares Systems of Linear Equations Definition A linear

More information

Math Linear Algebra II. 1. Inner Products and Norms

Math Linear Algebra II. 1. Inner Products and Norms Math 342 - Linear Algebra II Notes 1. Inner Products and Norms One knows from a basic introduction to vectors in R n Math 254 at OSU) that the length of a vector x = x 1 x 2... x n ) T R n, denoted x,

More information

MTH5102 Spring 2017 HW Assignment 3: Sec. 1.5, #2(e), 9, 15, 20; Sec. 1.6, #7, 13, 29 The due date for this assignment is 2/01/17.

MTH5102 Spring 2017 HW Assignment 3: Sec. 1.5, #2(e), 9, 15, 20; Sec. 1.6, #7, 13, 29 The due date for this assignment is 2/01/17. MTH5102 Spring 2017 HW Assignment 3: Sec. 1.5, #2(e), 9, 15, 20; Sec. 1.6, #7, 13, 29 The due date for this assignment is 2/01/17. Sec. 1.5, #2(e). Determine whether the following sets are linearly dependent

More information

Linear Algebra Notes. Lecture Notes, University of Toronto, Fall 2016

Linear Algebra Notes. Lecture Notes, University of Toronto, Fall 2016 Linear Algebra Notes Lecture Notes, University of Toronto, Fall 2016 (Ctd ) 11 Isomorphisms 1 Linear maps Definition 11 An invertible linear map T : V W is called a linear isomorphism from V to W Etymology:

More information

1. What is the determinant of the following matrix? a 1 a 2 4a 3 2a 2 b 1 b 2 4b 3 2b c 1. = 4, then det

1. What is the determinant of the following matrix? a 1 a 2 4a 3 2a 2 b 1 b 2 4b 3 2b c 1. = 4, then det What is the determinant of the following matrix? 3 4 3 4 3 4 4 3 A 0 B 8 C 55 D 0 E 60 If det a a a 3 b b b 3 c c c 3 = 4, then det a a 4a 3 a b b 4b 3 b c c c 3 c = A 8 B 6 C 4 D E 3 Let A be an n n matrix

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

APPENDIX: MATHEMATICAL INDUCTION AND OTHER FORMS OF PROOF

APPENDIX: MATHEMATICAL INDUCTION AND OTHER FORMS OF PROOF ELEMENTARY LINEAR ALGEBRA WORKBOOK/FOR USE WITH RON LARSON S TEXTBOOK ELEMENTARY LINEAR ALGEBRA CREATED BY SHANNON MARTIN MYERS APPENDIX: MATHEMATICAL INDUCTION AND OTHER FORMS OF PROOF When you are done

More information

(a) If A is a 3 by 4 matrix, what does this tell us about its nullspace? Solution: dim N(A) 1, since rank(a) 3. Ax =

(a) If A is a 3 by 4 matrix, what does this tell us about its nullspace? Solution: dim N(A) 1, since rank(a) 3. Ax = . (5 points) (a) If A is a 3 by 4 matrix, what does this tell us about its nullspace? dim N(A), since rank(a) 3. (b) If we also know that Ax = has no solution, what do we know about the rank of A? C(A)

More information

We could express the left side as a sum of vectors and obtain the Vector Form of a Linear System: a 12 a x n. a m2

We could express the left side as a sum of vectors and obtain the Vector Form of a Linear System: a 12 a x n. a m2 Week 22 Equations, Matrices and Transformations Coefficient Matrix and Vector Forms of a Linear System Suppose we have a system of m linear equations in n unknowns a 11 x 1 + a 12 x 2 + + a 1n x n b 1

More information

Span & Linear Independence (Pop Quiz)

Span & Linear Independence (Pop Quiz) Span & Linear Independence (Pop Quiz). Consider the following vectors: v = 2, v 2 = 4 5, v 3 = 3 2, v 4 = Is the set of vectors S = {v, v 2, v 3, v 4 } linearly independent? Solution: Notice that the number

More information

Chapter SSM: Linear Algebra. 5. Find all x such that A x = , so that x 1 = x 2 = 0.

Chapter SSM: Linear Algebra. 5. Find all x such that A x = , so that x 1 = x 2 = 0. Chapter Find all x such that A x : Chapter, so that x x ker(a) { } Find all x such that A x ; note that all x in R satisfy the equation, so that ker(a) R span( e, e ) 5 Find all x such that A x 5 ; x x

More information

2018 Fall 2210Q Section 013 Midterm Exam II Solution

2018 Fall 2210Q Section 013 Midterm Exam II Solution 08 Fall 0Q Section 0 Midterm Exam II Solution True or False questions points 0 0 points) ) Let A be an n n matrix. If the equation Ax b has at least one solution for each b R n, then the solution is unique

More information

Linear Algebra (part 1) : Vector Spaces (by Evan Dummit, 2017, v. 1.07) 1.1 The Formal Denition of a Vector Space

Linear Algebra (part 1) : Vector Spaces (by Evan Dummit, 2017, v. 1.07) 1.1 The Formal Denition of a Vector Space Linear Algebra (part 1) : Vector Spaces (by Evan Dummit, 2017, v. 1.07) Contents 1 Vector Spaces 1 1.1 The Formal Denition of a Vector Space.................................. 1 1.2 Subspaces...................................................

More information

MATH PRACTICE EXAM 1 SOLUTIONS

MATH PRACTICE EXAM 1 SOLUTIONS MATH 2359 PRACTICE EXAM SOLUTIONS SPRING 205 Throughout this exam, V and W will denote vector spaces over R Part I: True/False () For each of the following statements, determine whether the statement is

More information

LINEAR ALGEBRA REVIEW

LINEAR ALGEBRA REVIEW LINEAR ALGEBRA REVIEW SPENCER BECKER-KAHN Basic Definitions Domain and Codomain. Let f : X Y be any function. This notation means that X is the domain of f and Y is the codomain of f. This means that for

More information

2 b 3 b 4. c c 2 c 3 c 4

2 b 3 b 4. c c 2 c 3 c 4 OHSx XM511 Linear Algebra: Multiple Choice Questions for Chapter 4 a a 2 a 3 a 4 b b 1. What is the determinant of 2 b 3 b 4 c c 2 c 3 c 4? d d 2 d 3 d 4 (a) abcd (b) abcd(a b)(b c)(c d)(d a) (c) abcd(a

More information

Review 1 Math 321: Linear Algebra Spring 2010

Review 1 Math 321: Linear Algebra Spring 2010 Department of Mathematics and Statistics University of New Mexico Review 1 Math 321: Linear Algebra Spring 2010 This is a review for Midterm 1 that will be on Thursday March 11th, 2010. The main topics

More information

Ir O D = D = ( ) Section 2.6 Example 1. (Bottom of page 119) dim(v ) = dim(l(v, W )) = dim(v ) dim(f ) = dim(v )

Ir O D = D = ( ) Section 2.6 Example 1. (Bottom of page 119) dim(v ) = dim(l(v, W )) = dim(v ) dim(f ) = dim(v ) Section 3.2 Theorem 3.6. Let A be an m n matrix of rank r. Then r m, r n, and, by means of a finite number of elementary row and column operations, A can be transformed into the matrix ( ) Ir O D = 1 O

More information

LINEAR ALGEBRA SUMMARY SHEET.

LINEAR ALGEBRA SUMMARY SHEET. LINEAR ALGEBRA SUMMARY SHEET RADON ROSBOROUGH https://intuitiveexplanationscom/linear-algebra-summary-sheet/ This document is a concise collection of many of the important theorems of linear algebra, organized

More information

Linear Algebra (Math-324) Lecture Notes

Linear Algebra (Math-324) Lecture Notes Linear Algebra (Math-324) Lecture Notes Dr. Ali Koam and Dr. Azeem Haider September 24, 2017 c 2017,, Jazan All Rights Reserved 1 Contents 1 Real Vector Spaces 6 2 Subspaces 11 3 Linear Combination and

More information

Calculating determinants for larger matrices

Calculating determinants for larger matrices Day 26 Calculating determinants for larger matrices We now proceed to define det A for n n matrices A As before, we are looking for a function of A that satisfies the product formula det(ab) = det A det

More information

Components and change of basis

Components and change of basis Math 20F Linear Algebra Lecture 16 1 Components and change of basis Slide 1 Review: Isomorphism Review: Components in a basis Unique representation in a basis Change of basis Review: Isomorphism Definition

More information

MH1200 Final 2014/2015

MH1200 Final 2014/2015 MH200 Final 204/205 November 22, 204 QUESTION. (20 marks) Let where a R. A = 2 3 4, B = 2 3 4, 3 6 a 3 6 0. For what values of a is A singular? 2. What is the minimum value of the rank of A over all a

More information

Comps Study Guide for Linear Algebra

Comps Study Guide for Linear Algebra Comps Study Guide for Linear Algebra Department of Mathematics and Statistics Amherst College September, 207 This study guide was written to help you prepare for the linear algebra portion of the Comprehensive

More information

Math 344 Lecture # Linear Systems

Math 344 Lecture # Linear Systems Math 344 Lecture #12 2.7 Linear Systems Through a choice of bases S and T for finite dimensional vector spaces V (with dimension n) and W (with dimension m), a linear equation L(v) = w becomes the linear

More information

2: LINEAR TRANSFORMATIONS AND MATRICES

2: LINEAR TRANSFORMATIONS AND MATRICES 2: LINEAR TRANSFORMATIONS AND MATRICES STEVEN HEILMAN Contents 1. Review 1 2. Linear Transformations 1 3. Null spaces, range, coordinate bases 2 4. Linear Transformations and Bases 4 5. Matrix Representation,

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

MODEL ANSWERS TO THE THIRD HOMEWORK

MODEL ANSWERS TO THE THIRD HOMEWORK MODEL ANSWERS TO THE THIRD HOMEWORK 1 (i) We apply Gaussian elimination to A First note that the second row is a multiple of the first row So we need to swap the second and third rows 1 3 2 1 2 6 5 7 3

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

Linear equations in linear algebra

Linear equations in linear algebra Linear equations in linear algebra Samy Tindel Purdue University Differential equations and linear algebra - MA 262 Taken from Differential equations and linear algebra Pearson Collections Samy T. Linear

More information

Homework Set #8 Solutions

Homework Set #8 Solutions Exercises.2 (p. 19) Homework Set #8 Solutions Assignment: Do #6, 8, 12, 14, 2, 24, 26, 29, 0, 2, 4, 5, 6, 9, 40, 42 6. Reducing the matrix to echelon form: 1 5 2 1 R2 R2 R1 1 5 0 18 12 2 1 R R 2R1 1 5

More information

Evaluating Determinants by Row Reduction

Evaluating Determinants by Row Reduction Evaluating Determinants by Row Reduction MATH 322, Linear Algebra I J. Robert Buchanan Department of Mathematics Spring 2015 Objectives Reduce a matrix to row echelon form and evaluate its determinant.

More information

Final Review Sheet. B = (1, 1 + 3x, 1 + x 2 ) then 2 + 3x + 6x 2

Final Review Sheet. B = (1, 1 + 3x, 1 + x 2 ) then 2 + 3x + 6x 2 Final Review Sheet The final will cover Sections Chapters 1,2,3 and 4, as well as sections 5.1-5.4, 6.1-6.2 and 7.1-7.3 from chapters 5,6 and 7. This is essentially all material covered this term. Watch

More information

Linear Algebra Lecture Notes-II

Linear Algebra Lecture Notes-II Linear Algebra Lecture Notes-II Vikas Bist Department of Mathematics Panjab University, Chandigarh-64 email: bistvikas@gmail.com Last revised on March 5, 8 This text is based on the lectures delivered

More information

Matrix Algebra Determinant, Inverse matrix. Matrices. A. Fabretti. Mathematics 2 A.Y. 2015/2016. A. Fabretti Matrices

Matrix Algebra Determinant, Inverse matrix. Matrices. A. Fabretti. Mathematics 2 A.Y. 2015/2016. A. Fabretti Matrices Matrices A. Fabretti Mathematics 2 A.Y. 2015/2016 Table of contents Matrix Algebra Determinant Inverse Matrix Introduction A matrix is a rectangular array of numbers. The size of a matrix is indicated

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

Introduction to Linear Algebra, Second Edition, Serge Lange

Introduction to Linear Algebra, Second Edition, Serge Lange Introduction to Linear Algebra, Second Edition, Serge Lange Chapter I: Vectors R n defined. Addition and scalar multiplication in R n. Two geometric interpretations for a vector: point and displacement.

More information

Chapter SSM: Linear Algebra Section Fails to be invertible; since det = 6 6 = Invertible; since det = = 2.

Chapter SSM: Linear Algebra Section Fails to be invertible; since det = 6 6 = Invertible; since det = = 2. SSM: Linear Algebra Section 61 61 Chapter 6 1 2 1 Fails to be invertible; since det = 6 6 = 0 3 6 3 5 3 Invertible; since det = 33 35 = 2 7 11 5 Invertible; since det 2 5 7 0 11 7 = 2 11 5 + 0 + 0 0 0

More information

1 Matrices and Systems of Linear Equations

1 Matrices and Systems of Linear Equations March 3, 203 6-6. Systems of Linear Equations Matrices and Systems of Linear Equations An m n matrix is an array A = a ij of the form a a n a 2 a 2n... a m a mn where each a ij is a real or complex number.

More information

Answers in blue. If you have questions or spot an error, let me know. 1. Find all matrices that commute with A =. 4 3

Answers in blue. If you have questions or spot an error, let me know. 1. Find all matrices that commute with A =. 4 3 Answers in blue. If you have questions or spot an error, let me know. 3 4. Find all matrices that commute with A =. 4 3 a b If we set B = and set AB = BA, we see that 3a + 4b = 3a 4c, 4a + 3b = 3b 4d,

More information

This MUST hold matrix multiplication satisfies the distributive property.

This MUST hold matrix multiplication satisfies the distributive property. The columns of AB are combinations of the columns of A. The reason is that each column of AB equals A times the corresponding column of B. But that is a linear combination of the columns of A with coefficients

More information

Chapter 3. Vector spaces

Chapter 3. Vector spaces Chapter 3. Vector spaces Lecture notes for MA1111 P. Karageorgis pete@maths.tcd.ie 1/22 Linear combinations Suppose that v 1,v 2,...,v n and v are vectors in R m. Definition 3.1 Linear combination We say

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

(f + g)(s) = f(s) + g(s) for f, g V, s S (cf)(s) = cf(s) for c F, f V, s S

(f + g)(s) = f(s) + g(s) for f, g V, s S (cf)(s) = cf(s) for c F, f V, s S 1 Vector spaces 1.1 Definition (Vector space) Let V be a set with a binary operation +, F a field, and (c, v) cv be a mapping from F V into V. Then V is called a vector space over F (or a linear space

More information

Vector Space Basics. 1 Abstract Vector Spaces. 1. (commutativity of vector addition) u + v = v + u. 2. (associativity of vector addition)

Vector Space Basics. 1 Abstract Vector Spaces. 1. (commutativity of vector addition) u + v = v + u. 2. (associativity of vector addition) Vector Space Basics (Remark: these notes are highly formal and may be a useful reference to some students however I am also posting Ray Heitmann's notes to Canvas for students interested in a direct computational

More information

Math 113 Winter 2013 Prof. Church Midterm Solutions

Math 113 Winter 2013 Prof. Church Midterm Solutions Math 113 Winter 2013 Prof. Church Midterm Solutions Name: Student ID: Signature: Question 1 (20 points). Let V be a finite-dimensional vector space, and let T L(V, W ). Assume that v 1,..., v n is a basis

More information

Review for Exam 2 Solutions

Review for Exam 2 Solutions Review for Exam 2 Solutions Note: All vector spaces are real vector spaces. Definition 4.4 will be provided on the exam as it appears in the textbook.. Determine if the following sets V together with operations

More information

1 Last time: least-squares problems

1 Last time: least-squares problems MATH Linear algebra (Fall 07) Lecture Last time: least-squares problems Definition. If A is an m n matrix and b R m, then a least-squares solution to the linear system Ax = b is a vector x R n such that

More information

Therefore, A and B have the same characteristic polynomial and hence, the same eigenvalues.

Therefore, A and B have the same characteristic polynomial and hence, the same eigenvalues. Similar Matrices and Diagonalization Page 1 Theorem If A and B are n n matrices, which are similar, then they have the same characteristic equation and hence the same eigenvalues. Proof Let A and B be

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