# and B = 0 1. Since the size of A is 2 3 and that of B is , A B. Do note, however, that the entries of A and B are the same.

Save this PDF as:

Size: px
Start display at page:

Download "and B = 0 1. Since the size of A is 2 3 and that of B is , A B. Do note, however, that the entries of A and B are the same."

## Transcription

1 Matrix Arithmetic Harold W. Ellingsen Jr. SUNY Potsdam This supplements Linear Algebra by Hefferon, which is lacking a chapter of matrix arithmetic for its own sake. Instructors who wish to introduce these manipulations earlier and without the rigor of linear transformations may find this useful. Please be sure to cover the text s Chapter One first. This material is Free, including the LaTeX source, under the Creative Commons Attribution- ShareAlike.5 License. The latest version should be the one on this site. Any feedback on the note is appreciated. Matrix Arithmetic In this note we explore matrix arithmetic for its own sake. The author introduces it in Chapter Four using linear transformations. While his approach is quite rigorous, matrix arithmetic can be studied after Chapter One. This note assumes that Chapter One has been completed. a 11 a 1 a 1n a 1 a a n For a shortcut notation instead of writing a matrix A as...., we will write.. a m1 a m a mn A = (a ij ) m n or just A = (a ij ) if the size of A is understood. When given a set of objects in mathematics, there are two basic questions one should ask: When are two objects equal? and How can we combine two objects to produce a third object? For the first question we have the following definition. Definition 1 We say that two matrices A = (a ij ) and B = (b ij ) are equal, written A = B, provided they have the same size and their corresponding entries are equal, that is, their sizes are both m n and for each 1 i m and 1 j n, a ij = b ij. Example Let A = and B = 0 1. Since the size of A is 3 and that of B is , A B. Do note, however, that the entries of A and B are the same. ( x y x 1 x y. Find all values of x and y so that y = x each matrix is. So we set the corresponding entries equal: x = 1 y x = x y = x + 1 y = 1 ). We see that the size of We see that x = ±1 and y = ±1. From = x+1, we get that x must be 1. From y x = x y, we get that y = x and so x = y. Thus y is also 1. 1

2 As for the second question, we have been doing this for quite a while now: Adding, subtracting, multiplying, and dividing(when possible) real numbers. So how can we add and subtract two matrices? Eventually we will multiply matrices, but for now we consider another multiplication. Here are the definitions. Definition Let A = (a ij ) and B = (b ij ) be m n matrices. We define their sum, denoted by A+B, and their difference, denoted by A B, to be the respective matrices (a ij +b ij ) and (a ij b ij ). We define scalar multiplication by for any r R, ra is the matrix (ra ij ). These definitions should appear quite natural: When two matrices have the same size, we just add or subtract their corresponding entries, and for the scalar multiplication, we just multiply each entry by the scalar. Here are some examples. Example Let A =, B =, and C = Compute each of the following, if possible. 1. A + B. ( Since A) and( B are both ) ( matrices, we can ) add them. Here we go: A + B = ( 1) = = ( ) 5 0. B A. Since ( A and ) B( are both ) ( matrices, we) can( subtract ) them. Here we go: B A = = = ( 1) B + C. No can do. B and C have different sizes: B is and C is C. We just multiply each entry of C by 4: 4C = =. 4 ( 1) 4 ( ) 4 ( 3) A 3B. These matrices have the same size, so ( we ll ) do the ( scalar ) multiplication first and then the subtraction. Here we go: A 3B = = Matrix arithmetic has some of the same properties as real number arithmetic. Properties of Matrix Arithmetic Let A, B, and C be m n matrices and r, s R. 1. A + B = B + A (Matrix addition is commutative.). A + (B + C) = (A + B) + C (Matrix addition is associative.) 3. r(a + B) = ra + rb (Scalar multiplication distributes over matrix addition.)

3 4. (r + s)a = ra + sa (Real number addition distributes over scalar multiplication.) 5. (rs)a = r(sa) (An associativity for scalar multiplication.) 6. There is a unique m n matrix Θ such that for any m n matrix M, M + Θ = M. (This Θ is called the m n zero matrix.) 7. For every m n matrix M there is a unique m n matrix N such that M + N = Θ. (This N is called the negative of M and is denoted M.) Let s prove something. How about that real number addition distributes over matrix addition, there is a zero matrix, and each matrix has a negative? You should prove the rest at some point in your life. Proof Let A = (a ij ) be an m n matrix and r, s R. By definition, (r + s)a and ra +sa have the same size. Now we must show that their corresponding entries are equal. Let 1 i m and 1 j n. Then the ij-entry of (r + s)a is (r + s)a ij. Using the usual properties of real number arithmetic, we have (r + s)(a ij ) = ra ij + sa ij = ra ij + sa ij, which is the sum of the ij-entries of ra and sa, that is, the ij-entry of ra + sa. Hence (r + s)a = ra + sa. Let M = (m ij ) be an m n matrix and let Θ be the m n matrix all of whose entries are 0. By assumption M, Θ, and M +Θ have the same size. Notice that the ij-entry of M +Θ is m ij +0. This is exactly the ij-entry of M. Hence they re equal. For uniqueness, suppose that Ψ is an m n matrix with the property that for any m n matrix C, C + Ψ = C. Then Θ = Θ + Ψ by the property of Ψ. But by the property of Θ, Ψ = Ψ + Θ. Since matrix addition is commutative, we see that Θ = Ψ. Hence Θ is unique. Let N = ( m ij ). Now this makes sense as each m ij is a real number and so its negative is also a real number. Notice that M, N, M + N, and Θ all have the same size. Now the ij-entry of M + N is m ij + ( m ij ) = 0, the ij-entry of Θ. Hence a desired N exists. For uniqueness suppose that P is an m n matrix with the property that M + P = Θ. Then N = N + Θ as Θ is the zero matrix = N + (M + P) as M + P = Θ = (N + M) + P by associativity of matrix addition = Θ + P as N + M = Θ = P as Θ is the zero matrix. Hence this N is unique. Now we will multiply matrices, but not in the way you re thinking. We will NEVER just simply multiply the corresponding entries! What we do is an extension of the dot product of vectors. (If you re not familiar with this, don t worry about it.) First we will multiply a row by a column and the result will be a real number(or scalar). 3

4 Definition 3 We take a row vector b a 1 a a p with p entries and a column vector with p entries. and define their product, denoted by b a 1 a a p., to be the real number a 1b 1 + a b + + a p b p. Notice that we re just taking the sum of the products of the corresponding entries and that we may view a real number as a 1 1 matrix. Let s do a couple of examples. Example 3 Multiply! 1. ( 3 4 ) 3 4 = (3) + 3(4) + 4(5) = ( 1 3 ) 1 = 1() + ( ) + ( )( 1) + 3() =. Now we ll multiply a general matrix by a column. Afterall, we can think of a matrix as several row vectors of the same size put together. To do such a multiplication, the number of entries in each row must be the number of entries in the column and then we multiply each row of the matrix by the column. Definition 4 Let A be an m p matrix and b a p 1 column vector. We define their product, denoted by Ab, to be the m 1 column vector whose i-th entry, 1 i m, is the product of the i-th row of A and b. Here is a couple of examples. Example 4 Multiply the matrix by the column = = 1 1(1) + () + 3( 3) = (1) + 1() + ( 3) b 1 b p (5) + ( )( 1) 1 0(5) + 3( 1) 1(5) + 4( 1) = Now we can extend this multiplication to appropriately sized arbitrary matrices. We can think of a matrix as several column vectors of the same size put together. To multiply a row by a column, we must be sure that they have the same number of entries. This means that the number of columns of our first matrix must be the number of rows of the second. b 1 b p 4

5 Definition 5 Let A be an m p matrix and B a p n matrix. We define their product, denoted by AB, to be the m n matrix whose ij-entry, 1 i m and 1 j n, is the product of the i-th row of A and the j-th column of B. Here are a few examples. Example 5 Multiply, if possible Let A = and B =. Since both matrices are, we can find AB and BA. Note ( that ) ( the size of ) both products is. Here we go: AB = = st row of A times 1 st column of B 1 st row of A times nd column of B nd row of A times 1 st column of B nd row of A times nd = column of B 1(4) + ( ) 1( 3) + (1) 0 1 = and 3(4) + 4( ) 3( 3) + 4(1) BA = = st row of B times 1 st column of A 1 st row of B times nd column of A nd row of B times 1 st column of A nd row of B times nd = column of A 4(1) + ( 3)(3) 4() + ( 3)(4) 5 4 =. (1) + 1(3) () + 1(4) 1 0 Did you notice what just happened? We have that AB BA! Yes, it s true: Matrix multiplication is not commutative Can we multiply? No. The first matrix is 3 and then second is also 3. The number of columns of the first is not the same as the number of rows of the second Can we multiply 5? Yes, the first is 3 and the second is 3, so their product is. Here we go: (1) + (5) + 9( 1) () + () + 9(3) 3 35 = = (1) + 0(5) + 8( 1) 1() + 0() + 8(3) Now we state some nice, and natural, Properties of Matrix Multiplication: Let A, B, and C be matrices of the appropriate sizes and r R. Then 1. A(BC) = (AB)C (Matrix multiplication is associative.). (ra)b = r(ab) = A(rB) (Scalar multiplication commutes with matrix multiplication.) 5

6 3. A(B + C) = AB + AC 4. (A + B)C = AC + BC (Matrix multiplication distributes over matrix addition.) 5. There exists a unique n n matrix I such that for all n n matrices M, IM = MI = M. (I is called the n n identity matrix.) A proof that matrix multiplication is associative would be quite messy at this point. We will just take it to be true. There is an elegant proof, but we need to learn some more linear algebra first. Let s prove the first distributive property and existence of the identity matrix. You should prove the rest at some point in your life. Proof Let A be an m p matrix and B and C p n matrices. This is what we mean by appropriate sizes: B and C must be the same size in order to add them, and the number of columns in A must be the number of rows in B and C in order to multiply them. We have that the two matrices on each side of the equals sign have the same size, namely, m n. Now we show their corresponding entries are equal. So let s write A = (a ik ), B = (b kj ), and C = (c kj ). Notice that we re using the k to denote the row numbers of B and C. Let 1 i m and 1 j n. For simplicity, write the i-th row of A as b a 1 a a p and the j-th columns of B and C as. and c, respectively. Then the. b 1 + c 1 b + c j-th column of B + C is. So the ij-entry of A(B + C) is the product of the i-th row of. b p + c A and the j-th column of B + C. Multiplying and then using the usual properties of real number b 1 + c 1 arithmetic, we have b + c a 1 a a p. = b p + c a 1 (b 1 + c 1 ) + a (b + c ) + + a p (b p + c p ) = a 1 b 1 + a 1 c 1 + a b + b c + + a p b p + a p c p = (a 1 b 1 + a b + + a p b p ) + (a 1 c 1 + a c + + a p c p ). Notice that the expressions in parentheses are the products of the i-th row of A with each of the j-th columns of B and C and that the sum of these two is the ij-entry of AB +AC. So we re done. Now we will prove that last statement, about this mysterious identity matrix. We need a definition first: The main diagonal of a matrix A consists of the entries of the from a ii. Let M = (m ij ) be an n n matrix. Let I be the n n matrix whose main diagonal entries are all 1 s and all of its b 1 b p c 1 c p 6

7 other entries s, i.e., I = Since M and I are both n n, thier products IM and MI are both n n. Notice that the i-th row of I is the row vector whose i-th entry is 1 and all others 0 s. So when we multiply this i-th row of I by the j-th column of M, the only entry in the column that gets multiplied by the 1 is m ij. Thus IM = M. Now notice that the j-th column of I is the column vector whose j-th entry is a 1 and all others 0 s. So when we multiply the i-th row of M by the j-th column of I, the only entry in the row that gets multiplied the 1 is m ij. Thus MI = M. The proof that I is unique is quite similar to that of the zero matrix. And we re done. Now we return to systems of linear equations. Here s a generic one: a 11 x 1 + a 1 x + + a 1n x n = b 1 a 1 x 1 + a x + + a n x n = b. a m1 x 1 + a m x + + a mn x n = b m. We can express this system as a matrix equation Ax = b. How?, you ask. Just look at each equation: We re multiplying a s by x s and adding them up. This is exactly how we multiply a row by a column. The matrix A we need is the matrix of the coefficients in the system and the x is the column vector of the variables. So the b is the column vector of the constants. More explicitly, we a 11 a 1 a 1n x 1 b 1 a 1 a a n have A =......, x = x., and b = b. So our matrix equation Ax = b. a m1 a m a mn x n b m represents the system of linear equations, which is a much more concise way of writing a system. It also provides a more convenient way of determining whether or not system: Just check whether or not Au = b. Let s do an example. Example 6 Consider the linear system x y = 0 x + z = 4. x + y z = 1 u 1 u is a solution to the. 1. Write it as a matrix equation. So following the above, we let A be the matrix of coefficients, u n 7

8 x the columnvector of the variables, and b the column vector of the constants. We have A = 1 0 x x , x = y, b = 4, and the equation is y = 4. 1 z 1 1 z 1 1. Determine whether or not is a solution to the system Let u =. Then multiplying, we have Au = = b. So is a solution to the system Determine whether or not 4 is a solution. 1 (1) 1() + 0(3) = 1(1) + 0() + 1(3) = 3 1(1) + () (3) 1 0 () 1(4) + 0() Let v = 4. Then multiplying, we have Av = = 1() + 0(4) + 1() = 1 1() + (4) () 0 4 b. So 4 is not a solution to the system. 6 Invertible Matrices We know that every nonzero real number x has a multiplicative inverse, namely x 1 = 1/x, as xx 1 = 1. Is there an analogous inverse for matrices? That is, for any nonzero square matrix A, is there a matrix B such that AB = ( BA = ) I, where I is the appropriate identity matrix? Consider 1 0 a b the specific nonzero matrix A =. Let s try to find its B. So let B =. Then 0 0 c d a b AB =. Oh. The matrix AB has a row of 0 s, so it can never be the identity, which is So the answer to our question is no. Here, then, is a definition: 0 1 Definition 6 We will say that an n n matrix A is invertible provided there is an n n matrix B for which AB = BA = I. This B is called an inverse of A. Notice that II = I, so there is at least one invertible matrix for each possible size. Are there more? Why, yes, there are. Thanks for asking. Here s one now. Example ( 7 ) (1) + 1( 1) ( 1) + 1() Let A = and B =. Multiplying, we get that AB = = (1) + 1( 1) 1( 1) + 1() 1 0 1() 1(1) 1(1) 1(1) 1 0 and BA = =. So A is invertible. Perhaps you ve 0 1 1() + (1) 1(1) + (1) 0 1 noticed that B is also invertible. 8

9 As you may have guessed, there are lots of invertible matrices. But there are also lots of matrices that are not invertible. Before determining a method to determine whether or not a matrix is invertible, let s state and prove a few results about invertible matrices. Proposition 1 Let A be an n n invertible matrix. If B and C are two inverses for A, then B = C. In other words, the inverse of a square matrix, if it exists, is unique. Proof Let A, B, and C be n n matrices. Assume that A is invertible and B and C are its inverses. So we have that AB = BA = AC = CA = I. Now B = BI = B(AC) = (BA)C = IC = C. Notice that we used the associativity of matrix multiplication here. Now we can refer to the inverse of a square matrix A and so we will write its inverse as A 1 and read it as A inverse. In this case we have AA 1 = A 1 A = I. Next we prove a theorem about the inverses of matrices. Proposition Let A and B be n n invertible matrices. Then 1. A 1 is invertible and (A 1 ) 1 = A and. AB is invertible and (AB) 1 = B 1 A 1. Note that we reverse the order of the inverses in the product. This is due to the fact that matrix multiplication is not commutative. Proof Let A and B be n n invertible matrices. Then AA 1 = A 1 A = I. So A satisfies the definition for A 1 being invertible. Thus (A 1 ) 1 = A. To show that AB is invertible, we will just multiply, taking full advantage that matrix multiplication is associative: (AB)(B 1 A 1 ) = A(BB 1 )A 1 = AIA 1 = AA 1 = I (B 1 A 1 )(AB) = B 1 (A 1 A)B = B 1 IB = B 1 B = I. and Hence AB is invertible and its inverse is B 1 A 1. The proof of the following corollary is a nice exercise using induction. Corollary to Proposition If A 1, A,..., A m are invertible n n matrices, then A 1 A A m is invertible and (A 1 A A m ) 1 = A 1 m A 1 A 1 1. How do we know if a matrix is invertible or not? The following theorem tells us. All vectors in R n will be written as columns. 9

10 The Invertible Matrix Theorem(IMT) Part I Let A be an n n matrix, I the n n identity matrix, and θ the zero vector in R n. Then the following are equivalent. 1. A is invertible.. The reduced row echelon form of A is I. 3. For any b R n the matrix equation Ax = b has exactly one solution. 4. The matrix equation Ax = θ has only x = θ as its solution. What we mean that the following are equivalent is that for any two of the statements, one is true if and only if the other is true. In the proof we take advantage that the logical connective implies is transitive, that is, if P Q and Q R, then P R. We will prove that () (1), (1) (3), (3) (4), and (4) (). Proof Let A be an n n matrix, I the n n identity matrix, and θ the zero vector in R n. Assume that the reduced echelon form of A is I. We wish to find an n n matrix B so that AB = BA = I. Recall that we can view the multiplication of two matrices as the multiplication of a matrix by a sequence of columns. In this way finding a matrix B for which AB = I is the same as solving the n systems of linear equations whose matrix equations are given by Ax j = e j where e j is the j-th column of I for 1 j n. To solve each system, we must reduce the augmented matrix (A e j ). Since the reduced echelon form of A is I, each of these systems has a unique solution. Notice, however, that it is the A part of the augmented matrix that dictates the row operations we must use; each e j is just along for the ride. This suggests that in practice we can reduce the giant augmented matrix (A I) until the A part is in its reduced echelon form, which we assumed is I. Hence we can reduce (A I) to (I B) for some n n matrix B. For each 1 j n the solution to Ax j = e j is the j-th column of B. Thus AB = I. Now since matrix multiplication is not commutative, we must still show that BA = I. Since we have reduced that giant augmented matrix (A I) to (I B), we have in fact reduced I to B. By Lemma 1.6 in Chapter One Section III, reduces to is an equivalence relation. Since we can reduce I to B, we can reduce B to I. In other words, the reduced echelon form of B is I. The previous argument then shows that there is an n n matrix C for which BC = I. Then A = AI = A(BC) = (AB)C = IC = C. Hence BA = I. Thus A is invertible. Now we assume that A is invertible. Let b R n and consider A 1 b. Since A 1 is n n and b R n, A 1 b R n. Now A(A 1 b) = (AA 1 )b = Ib = b. Technically we showed that I is the identity for square matrices, but since we can make a square matrix whose columns are all b, we see that Ib is indeed b. We have just shown that the equation Ax = b has a solution. For uniqueness, suppose that u R n is another one. Then we have Au = b A 1 (Au) = A 1 b (A 1 A)u = A 1 b Iu = A 1 b u = A 1 b. 10

11 Hence the only solution is x = A 1 b. Since θ is a particular vector in R n, we automatically have that if for any b R n the matrix equation Ax = b has exactly one solution, then the matrix equation Ax = θ has only x = θ as its solution. Now to complete the proof, we must show that if the matrix equation Ax = θ has only x = θ as its solution, then the reduced echelon form of A is I. We do so by contraposition. Assume that the reduced echelon form of A is not I. Since A is square, its reduced echelon form must contain a row of zeroes. In solving the homogeneous system of linear equations corresponding to Ax = θ, the augmented matrix (A θ) will have an entire row of zeroes when A has been reduced to its reduced echelon form. As the number of equations and unknowns are the same, the system must have a free variable. This means that the system has more than one solution(in fact it has infinitely many, but who s counting?). Hence the matrix equation Ax = θ has more than one solution. Thus by contraposition we have proved that if the matrix equation Ax = θ has only x = θ as its solution, then the reduced echelon form of A is I. Therefore we have proved the theorem. Example 8 1. The first part of the proof provides a method for determining whether or not a matrix is invertible and if so, finding its inverse: Given an n n matrix A, we form the giant augmented matrix (A I) and row reduce it until the A part is in reduced echelon form. If this form is I, then we know that A is invertible and the matrix in the I part is its inverse; if this form is not I, then A is not invertible. Determine whether or not the matrix is invertible and if so, to find its inverse. 1 (a) Let A =. We form the giant augmented matrix (A I) and row reduce: /3 / /3 1/3 So we see that the reduced echelon form of A is the identity. Thus 0 1 1/3 /3 1/3 1/3 A is invertible and A 1 =. We can rewrite this inverse a bit more nicely 1/3 /3 by factoring out the 1/3: A 1 = (b) Let A = 1 1. We form giant augmented matrix (A I) and row reduce: /3 4/3 / /3 /3 1/ /3 /3 1/3 5/3 4/3 /3 So we see that A is invertible and A 1 = Notice all of those 4/3 /3 1/3 11

12 thirds in the inverse? Factoring out a 1/3, we get A 1 = (c) Let B =. We form the giant augmented matrix (B I) and row reduce: Since the reduced echelon form of B is not I, B is not invertible.. As seen in the proof of the theorem, we can use the inverse of a matrix to solve a system of linear equations with the same number of equations and unknowns. Specifically, we express the system as a matrix equation Ax = b, where A is the matrix of the coefficients. If A is invertible, then the solution is x = A 1 b. Solve the following system of linear equations using the inverse of the matrix of coefficients. x +z = 3 x +y z = 3 x+y +z = 6. Notice that the coefficient matrix is, conveniently, the matrix A from part (b) above, whose x inverse we ve already found. The matrix equation for this system is Ax = b where x = y z 3 and b = 3. Then x = A 1 b = = The following theorem tells us that if the product of two square matrices is the identity, then they are in fact inverses of each other. Theorem Let A and B be n n matrices and I the n n identity matrix. If AB = I, then A and B are invertible and A 1 = B. Proof Let A and B be n n matrices, I the n n identity matrix, and θ the zero vector in R n. Assume AB = I. We will use the IMT Part I to prove that B is invertible first. Consider the matrix equation Bx = θ and let u R n be a solution. So we have Bu = θ A(Bu) = Aθ (AB)u = θ Iu = θ u = θ. The only solution to Bx = θ is x = θ. Hence by the IMT Part I, B is invertible. So B 1 exists. Then multiplying both sides of AB = I on the right by B 1 gives us that A = B 1. Since B 1 is invertible, A is too and A 1 = (B 1 ) 1 = B. 1

13 Transposes We finish this section off with what s called the transpose of a matrix. Here s the definition. Definition 7 Let A = (a ij ) be an m n matrix. The transpose of A, denoted by A T, is the matrix whose i-th column is the i-th row of A, or equivalently, whose j-th row is the j-th column of A. Notice that A T is an n m matrix. We will write A T = (a T ji ) where at ji = a ij. Here is a couple of examples. Example Let A =. The first row of A is ( 1 3 ) and the second row is ( ). So these become the columns of A T, that is, A T = 5. Alternatively, we see that the columns of 3 6 A are ( ( ( 1 3,, and. So these become the rows of A 4) 5) 6) T, as we can see above Let B = We make the rows of B the columns of B T. Doing so, we get B T = Note that the main diagonals of a matrix and its transpose are the same. Proposition 3 Let A and B be appropriately sized matrices and r R. Then 1. (A T ) T = A. (A + B) T = A T + B T 3. (ra) T = ra T 4. (AB) T = B T A T Proof The first three properties seem perfectly natural. Some time when you get bored, you should try to prove them. But what about that multiplication one? Does that seem natural? Maybe. Given how the inverse of the product of matrices works, maybe this is fine. Let s prove it. Let A be an m p matrix and B a p n matrix. Then AB is an m n matrix. This means that (AB) T is an n m matrix. Then B T is an n p matrix and A T is a p m matrix. So multiplying B T A T makes sense and its size is also n m. But what about their corresponding entries? The ji-entry of (AB) T is the ij-entry of AB, which is the i-th row of A times the j-th column of B. For simplicity, let ( a 1 a a p ) be the i-th row of A and b 1 b the j-th column of B. Then the ij-entry of. b p 13

14 AB is a 1 b 1 +a b + +a p b p, but this is also equal to b 1 a 1 +b a + b p a p, which is the product of a 1 a b1 b b p and.. This is exactly the product of the j-th row of BT and the i-th column a p of A T, which is the ji-entry of B T A T. Thus ji-entry of (AB) T is the ji-entry of B T A T. Therefore (AB) T = B T A T. Here are some exercises. Enjoy. [ ] 3 4 [ ] Let A =, B = , C =, D = E = 3, F = 0 1 whenever possible. If a computation is not possible, state why. [ ] 1 0 1, 0 1 [ ], and G = [ 1 ]. Compute each of the following and simplify, 3 (a) 3C 4D (b) A (D + C) (c) A E (d) AE (e) 3BC 4BD (f) CB + D (g) GC (h) F G. Illustrate the associativity of matrix multiplication by multiplying (AB)C and A(BC) where A, B, and C are matrices above. 3. Let A be an n n matrix. Let m N. As you would expect, we define A m to be the product of A with itself m times. Notice that this makes sense as matrix multiplication is associative. [ ] 1 (a) Compute A 4 for A =. 1 1 (b) Provide a counter-example to the statement: For any matrices A and B, (AB) = A B. 4. Prove that for all m n matrices A, B, and C, if A + C = B + C, then A = B. 5. Let Θ be the m n zero matrix. Prove that for any m n matrix A, A = ( 1)A and 0A = Θ. 6. Let Θ be the m n zero matrix. Prove that for any r R and m n matrix A, if ra = Θ, then r = 0 or A = Θ. 7. We have seen an example of two matrices A and B for which AB BA, showing us that matrix multiplication is not commutative. However, it s more that just not commutative, it s soooooo not commutative. Doing the following problems will illustrate what we mean by this. (a) Find two matrices A and B for which AB and BA are defined, but have different sizes. (b) Find two matrices A and B for which AB is defined, but BA is not. 14

15 8. Let Θ be the zero matrix and I the identity matrix. Provide a counter-example to each of the following statements: (a) For any matrices A and B, if AB = Θ, then A = Θ or B = Θ. (b) For any matrices, A, B, and C, if AB = AC, then B = C. (c) For any matrix A, if A = A, then A = Θ or A = I. 9. Suppose that we have a homogeneous system of linear equations whose matrix equation is given by Ax = θ where A is the m n matrix of coefficients, x is the column matrix of the n variables, and θ is the column matrix of the m zeroes. Use the properties of matrix arithmetic to show that for any solutions u and v to the system and r R, u + v and ru are also solutions. 10. Consider the system of linear equations: x 1 + x + x 3 + x 4 = 3 x 1 x + x 3 + x 4 = 5 x x 3 x 4 = 4 x 1 + x x 3 x 4 = 3. (a) Express the system as a matrix equation. (b) Use matrix multiplication to determine whether or not u = solutions to the system and v = 0 are Determine whether or not each of the following matrices is invertible. If so, find its inverse (a) A = (b) B = [ ] [ ] (c) C = (d) D 3 T D where D = Solve the systems of linear equations using the inverse of the coefficient matrix. (a) (b) x + y z = x y + z = 1 x + y z = 3 x 1 +x +x 3 = x x 3 +x 4 = x 1 +4x +3x 3 = 0 x 1 +x x 3 +x 4 = 4 15

16 13. Provide a counter-example to the statement: For any n n invertible matrices A and B, A + B is invertible. 14. Find an example of a nonidentity matrix whose inverse is its transpose. 15. Using the matrices in Problem #1, compute each of the following, if possible. (a) 3A E T (b) A T B (c) D T (F + G T ) (d) 3A T E (e) CC T + FG (f) (F T + G)D 16. Let A be an n n invertible matrix. (a) Prove that for all m N, A m is invertible and determine a formula for its inverse in terms of A 1. Hint: Use induction and the fact that A n+1 = A n A. (b) Prove that A T is invertible and determine its inverse in terms of A 1. Hint: Use Proposition Determine (B T ) 1 for the matrix B in Problem # We say that an n n matrix A is symmetric provided A T = A; we say that A is skew-symmetric provided A T = A. (a) Give examples of symmetric and skew-symmetric, 3 3, and 4 4 matrices. (b) What can you say about the main diagonal of a skew-symmetric matrix? (c) Prove that for any n n matrix A, A + A T, AA T, and A T A are symmetric and A A T is skew-symmetric. (d) Prove that any n n can be written as the sum of a symmetric and skew-symmetric matrices. Hint: Did you do part (c) yet? 16

### 4. MATRICES Matrices

4. MATRICES 170 4. Matrices 4.1. Definitions. Definition 4.1.1. A matrix is a rectangular array of numbers. A matrix with m rows and n columns is said to have dimension m n and may be represented as follows:

### 2.1: MATRIX OPERATIONS

.: MATRIX OPERATIONS What are diagonal entries and the main diagonal of a matrix? What is a diagonal matrix? When are matrices equal? Scalar Multiplication 45 Matrix Addition Theorem (pg 0) Let A, B, and

### MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 2. x n. a 11 a 12 a 1n b 1 a 21 a 22 a 2n b 2 a 31 a 32 a 3n b 3. a m1 a m2 a mn b m

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS 1. SYSTEMS OF EQUATIONS AND MATRICES 1.1. Representation of a linear system. The general system of m equations in n unknowns can be written a 11 x 1 + a 12 x 2 +

### Math 313 Lecture #10 2.2: The Inverse of a Matrix

Math 1 Lecture #10 2.2: The Inverse of a Matrix Matrix algebra provides tools for creating many useful formulas just like real number algebra does. For example, a real number a is invertible if there is

### Matrix Algebra. Some Basic Matrix Laws. Before reading the text or the following notes glance at the following list of basic matrix algebra laws.

Matrix Algebra A. Doerr Before reading the text or the following notes glance at the following list of basic matrix algebra laws. Some Basic Matrix Laws Assume the orders of the matrices are such that

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

Chapter 1 LINEAR EQUATIONS 1.1 Introduction to linear equations A linear equation in n unknowns x 1, x,, x n is an equation of the form a 1 x 1 + a x + + a n x n = b, where a 1, a,..., a n, b are given

### MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS

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

### DETERMINANTS. b 2. x 2

DETERMINANTS 1 Systems of two equations in two unknowns A system of two equations in two unknowns has the form a 11 x 1 + a 12 x 2 = b 1 a 21 x 1 + a 22 x 2 = b 2 This can be written more concisely in

### Solution to Homework 2

Solution to Homework 2 Olena Bormashenko September 23, 2011 Section 1.4: 1(a)(b)(i)(k), 4, 5, 14; Section 1.5: 1(a)(b)(c)(d)(e)(n), 2(a)(c), 13, 16, 17, 18, 27 Section 1.4 1. Compute the following, if

### Diagonal, Symmetric and Triangular Matrices

Contents 1 Diagonal, Symmetric Triangular Matrices 2 Diagonal Matrices 2.1 Products, Powers Inverses of Diagonal Matrices 2.1.1 Theorem (Powers of Matrices) 2.2 Multiplying Matrices on the Left Right by

### December 4, 2013 MATH 171 BASIC LINEAR ALGEBRA B. KITCHENS

December 4, 2013 MATH 171 BASIC LINEAR ALGEBRA B KITCHENS The equation 1 Lines in two-dimensional space (1) 2x y = 3 describes a line in two-dimensional space The coefficients of x and y in the equation

### Linear Algebra Notes for Marsden and Tromba Vector Calculus

Linear Algebra Notes for Marsden and Tromba Vector Calculus n-dimensional Euclidean Space and Matrices Definition of n space As was learned in Math b, a point in Euclidean three space can be thought of

### Chapter 7. Matrices. Definition. An m n matrix is an array of numbers set out in m rows and n columns. Examples. ( 1 1 5 2 0 6

Chapter 7 Matrices Definition An m n matrix is an array of numbers set out in m rows and n columns Examples (i ( 1 1 5 2 0 6 has 2 rows and 3 columns and so it is a 2 3 matrix (ii 1 0 7 1 2 3 3 1 is a

### Math 312 Homework 1 Solutions

Math 31 Homework 1 Solutions Last modified: July 15, 01 This homework is due on Thursday, July 1th, 01 at 1:10pm Please turn it in during class, or in my mailbox in the main math office (next to 4W1) Please

### MAT188H1S Lec0101 Burbulla

Winter 206 Linear Transformations A linear transformation T : R m R n is a function that takes vectors in R m to vectors in R n such that and T (u + v) T (u) + T (v) T (k v) k T (v), for all vectors u

### Lecture 2 Matrix Operations

Lecture 2 Matrix Operations transpose, sum & difference, scalar multiplication matrix multiplication, matrix-vector product matrix inverse 2 1 Matrix transpose transpose of m n matrix A, denoted A T or

### 1 Introduction to Matrices

1 Introduction to Matrices In this section, important definitions and results from matrix algebra that are useful in regression analysis are introduced. While all statements below regarding the columns

### MATH 304 Linear Algebra Lecture 9: Subspaces of vector spaces (continued). Span. Spanning set.

MATH 304 Linear Algebra Lecture 9: Subspaces of vector spaces (continued). Span. Spanning set. Vector space A vector space is a set V equipped with two operations, addition V V (x,y) x + y V and scalar

### Lecture 6. Inverse of Matrix

Lecture 6 Inverse of Matrix Recall that any linear system can be written as a matrix equation In one dimension case, ie, A is 1 1, then can be easily solved as A x b Ax b x b A 1 A b A 1 b provided that

### Systems of Linear Equations

Systems of Linear Equations Beifang Chen Systems of linear equations Linear systems A linear equation in variables x, x,, x n is an equation of the form a x + a x + + a n x n = b, where a, a,, a n and

### Matrix Algebra and Applications

Matrix Algebra and Applications Dudley Cooke Trinity College Dublin Dudley Cooke (Trinity College Dublin) Matrix Algebra and Applications 1 / 49 EC2040 Topic 2 - Matrices and Matrix Algebra Reading 1 Chapters

### L1-2. Special Matrix Operations: Permutations, Transpose, Inverse, Augmentation 12 Aug 2014

L1-2. Special Matrix Operations: Permutations, Transpose, Inverse, Augmentation 12 Aug 2014 Unfortunately, no one can be told what the Matrix is. You have to see it for yourself. -- Morpheus Primary concepts:

### Notes on Determinant

ENGG2012B Advanced Engineering Mathematics Notes on Determinant Lecturer: Kenneth Shum Lecture 9-18/02/2013 The determinant of a system of linear equations determines whether the solution is unique, without

### Elementary Number Theory We begin with a bit of elementary number theory, which is concerned

CONSTRUCTION OF THE FINITE FIELDS Z p S. R. DOTY Elementary Number Theory We begin with a bit of elementary number theory, which is concerned solely with questions about the set of integers Z = {0, ±1,

### Linear Dependence Tests

Linear Dependence Tests The book omits a few key tests for checking the linear dependence of vectors. These short notes discuss these tests, as well as the reasoning behind them. Our first test checks

### MathQuest: Linear Algebra. 1. Which of the following matrices does not have an inverse?

MathQuest: Linear Algebra Matrix Inverses 1. Which of the following matrices does not have an inverse? 1 2 (a) 3 4 2 2 (b) 4 4 1 (c) 3 4 (d) 2 (e) More than one of the above do not have inverses. (f) All

### The basic unit in matrix algebra is a matrix, generally expressed as: a 11 a 12. a 13 A = a 21 a 22 a 23

(copyright by Scott M Lynch, February 2003) Brief Matrix Algebra Review (Soc 504) Matrix algebra is a form of mathematics that allows compact notation for, and mathematical manipulation of, high-dimensional

### EC9A0: Pre-sessional Advanced Mathematics Course

University of Warwick, EC9A0: Pre-sessional Advanced Mathematics Course Peter J. Hammond & Pablo F. Beker 1 of 55 EC9A0: Pre-sessional Advanced Mathematics Course Slides 1: Matrix Algebra Peter J. Hammond

### Introduction to Matrix Algebra I

Appendix A Introduction to Matrix Algebra I Today we will begin the course with a discussion of matrix algebra. Why are we studying this? We will use matrix algebra to derive the linear regression model

### Chapter 17. Orthogonal Matrices and Symmetries of Space

Chapter 17. Orthogonal Matrices and Symmetries of Space Take a random matrix, say 1 3 A = 4 5 6, 7 8 9 and compare the lengths of e 1 and Ae 1. The vector e 1 has length 1, while Ae 1 = (1, 4, 7) has length

### Lecture Notes: Matrix Inverse. 1 Inverse Definition

Lecture Notes: Matrix Inverse Yufei Tao Department of Computer Science and Engineering Chinese University of Hong Kong taoyf@cse.cuhk.edu.hk Inverse Definition We use I to represent identity matrices,

### Solving Linear Systems, Continued and The Inverse of a Matrix

, Continued and The of a Matrix Calculus III Summer 2013, Session II Monday, July 15, 2013 Agenda 1. The rank of a matrix 2. The inverse of a square matrix Gaussian Gaussian solves a linear system by reducing

### MATH10212 Linear Algebra. Systems of Linear Equations. Definition. An n-dimensional vector is a row or a column of n numbers (or letters): a 1.

MATH10212 Linear Algebra Textbook: D. Poole, Linear Algebra: A Modern Introduction. Thompson, 2006. ISBN 0-534-40596-7. Systems of Linear Equations Definition. An n-dimensional vector is a row or a column

### The Inverse of a Matrix

The Inverse of a Matrix 7.4 Introduction In number arithmetic every number a ( 0) has a reciprocal b written as a or such that a ba = ab =. Some, but not all, square matrices have inverses. If a square

### Continued Fractions and the Euclidean Algorithm

Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction

### MATH 304 Linear Algebra Lecture 18: Rank and nullity of a matrix.

MATH 304 Linear Algebra Lecture 18: Rank and nullity of a matrix. Nullspace Let A = (a ij ) be an m n matrix. Definition. The nullspace of the matrix A, denoted N(A), is the set of all n-dimensional column

### SECTION 8.3: THE INVERSE OF A SQUARE MATRIX

(Section 8.3: The Inverse of a Square Matrix) 8.47 SECTION 8.3: THE INVERSE OF A SQUARE MATRIX PART A: (REVIEW) THE INVERSE OF A REAL NUMBER If a is a nonzero real number, then aa 1 = a 1 a = 1. a 1, or

### SYSTEMS OF EQUATIONS AND MATRICES WITH THE TI-89. by Joseph Collison

SYSTEMS OF EQUATIONS AND MATRICES WITH THE TI-89 by Joseph Collison Copyright 2000 by Joseph Collison All rights reserved Reproduction or translation of any part of this work beyond that permitted by Sections

### Lecture Notes 1: Matrix Algebra Part B: Determinants and Inverses

University of Warwick, EC9A0 Maths for Economists Peter J. Hammond 1 of 57 Lecture Notes 1: Matrix Algebra Part B: Determinants and Inverses Peter J. Hammond email: p.j.hammond@warwick.ac.uk Autumn 2012,

### 4. Matrix inverses. left and right inverse. linear independence. nonsingular matrices. matrices with linearly independent columns

L. Vandenberghe EE133A (Spring 2016) 4. Matrix inverses left and right inverse linear independence nonsingular matrices matrices with linearly independent columns matrices with linearly independent rows

The Hadamard Product Elizabeth Million April 12, 2007 1 Introduction and Basic Results As inexperienced mathematicians we may have once thought that the natural definition for matrix multiplication would

### Helpsheet. Giblin Eunson Library MATRIX ALGEBRA. library.unimelb.edu.au/libraries/bee. Use this sheet to help you:

Helpsheet Giblin Eunson Library ATRIX ALGEBRA Use this sheet to help you: Understand the basic concepts and definitions of matrix algebra Express a set of linear equations in matrix notation Evaluate determinants

### T ( a i x i ) = a i T (x i ).

Chapter 2 Defn 1. (p. 65) Let V and W be vector spaces (over F ). We call a function T : V W a linear transformation form V to W if, for all x, y V and c F, we have (a) T (x + y) = T (x) + T (y) and (b)

### Introduction to Matrices for Engineers

Introduction to Matrices for Engineers C.T.J. Dodson, School of Mathematics, Manchester Universit 1 What is a Matrix? A matrix is a rectangular arra of elements, usuall numbers, e.g. 1 0-8 4 0-1 1 0 11

### 2.5 Elementary Row Operations and the Determinant

2.5 Elementary Row Operations and the Determinant Recall: Let A be a 2 2 matrtix : A = a b. The determinant of A, denoted by det(a) c d or A, is the number ad bc. So for example if A = 2 4, det(a) = 2(5)

### LS.6 Solution Matrices

LS.6 Solution Matrices In the literature, solutions to linear systems often are expressed using square matrices rather than vectors. You need to get used to the terminology. As before, we state the definitions

### MATH 551 - APPLIED MATRIX THEORY

MATH 55 - APPLIED MATRIX THEORY FINAL TEST: SAMPLE with SOLUTIONS (25 points NAME: PROBLEM (3 points A web of 5 pages is described by a directed graph whose matrix is given by A Do the following ( points

### A linear combination is a sum of scalars times quantities. Such expressions arise quite frequently and have the form

Section 1.3 Matrix Products A linear combination is a sum of scalars times quantities. Such expressions arise quite frequently and have the form (scalar #1)(quantity #1) + (scalar #2)(quantity #2) +...

### Basic Terminology for Systems of Equations in a Nutshell. E. L. Lady. 3x 1 7x 2 +4x 3 =0 5x 1 +8x 2 12x 3 =0.

Basic Terminology for Systems of Equations in a Nutshell E L Lady A system of linear equations is something like the following: x 7x +4x =0 5x +8x x = Note that the number of equations is not required

### The Inverse of a Square Matrix

These notes closely follow the presentation of the material given in David C Lay s textbook Linear Algebra and its Applications (3rd edition) These notes are intended primarily for in-class presentation

### Diagonalisation. Chapter 3. Introduction. Eigenvalues and eigenvectors. Reading. Definitions

Chapter 3 Diagonalisation Eigenvalues and eigenvectors, diagonalisation of a matrix, orthogonal diagonalisation fo symmetric matrices Reading As in the previous chapter, there is no specific essential

### Linear Algebra Done Wrong. Sergei Treil. Department of Mathematics, Brown University

Linear Algebra Done Wrong Sergei Treil Department of Mathematics, Brown University Copyright c Sergei Treil, 2004, 2009, 2011, 2014 Preface The title of the book sounds a bit mysterious. Why should anyone

### INTRODUCTORY LINEAR ALGEBRA WITH APPLICATIONS B. KOLMAN, D. R. HILL

SOLUTIONS OF THEORETICAL EXERCISES selected from INTRODUCTORY LINEAR ALGEBRA WITH APPLICATIONS B. KOLMAN, D. R. HILL Eighth Edition, Prentice Hall, 2005. Dr. Grigore CĂLUGĂREANU Department of Mathematics

### 4.5 Linear Dependence and Linear Independence

4.5 Linear Dependence and Linear Independence 267 32. {v 1, v 2 }, where v 1, v 2 are collinear vectors in R 3. 33. Prove that if S and S are subsets of a vector space V such that S is a subset of S, then

### MATH 304 Linear Algebra Lecture 24: Scalar product.

MATH 304 Linear Algebra Lecture 24: Scalar product. Vectors: geometric approach B A B A A vector is represented by a directed segment. Directed segment is drawn as an arrow. Different arrows represent

### Matrix Differentiation

1 Introduction Matrix Differentiation ( and some other stuff ) Randal J. Barnes Department of Civil Engineering, University of Minnesota Minneapolis, Minnesota, USA Throughout this presentation I have

### Solutions to Math 51 First Exam January 29, 2015

Solutions to Math 5 First Exam January 29, 25. ( points) (a) Complete the following sentence: A set of vectors {v,..., v k } is defined to be linearly dependent if (2 points) there exist c,... c k R, not

### 15.062 Data Mining: Algorithms and Applications Matrix Math Review

.6 Data Mining: Algorithms and Applications Matrix Math Review The purpose of this document is to give a brief review of selected linear algebra concepts that will be useful for the course and to develop

### We know a formula for and some properties of the determinant. Now we see how the determinant can be used.

Cramer s rule, inverse matrix, and volume We know a formula for and some properties of the determinant. Now we see how the determinant can be used. Formula for A We know: a b d b =. c d ad bc c a Can we

### 13 MATH FACTS 101. 2 a = 1. 7. The elements of a vector have a graphical interpretation, which is particularly easy to see in two or three dimensions.

3 MATH FACTS 0 3 MATH FACTS 3. Vectors 3.. Definition We use the overhead arrow to denote a column vector, i.e., a linear segment with a direction. For example, in three-space, we write a vector in terms

### Inner products on R n, and more

Inner products on R n, and more Peyam Ryan Tabrizian Friday, April 12th, 2013 1 Introduction You might be wondering: Are there inner products on R n that are not the usual dot product x y = x 1 y 1 + +

### Quotient Rings and Field Extensions

Chapter 5 Quotient Rings and Field Extensions In this chapter we describe a method for producing field extension of a given field. If F is a field, then a field extension is a field K that contains F.

### Matrix Representations of Linear Transformations and Changes of Coordinates

Matrix Representations of Linear Transformations and Changes of Coordinates 01 Subspaces and Bases 011 Definitions A subspace V of R n is a subset of R n that contains the zero element and is closed under

### Math 115A HW4 Solutions University of California, Los Angeles. 5 2i 6 + 4i. (5 2i)7i (6 + 4i)( 3 + i) = 35i + 14 ( 22 6i) = 36 + 41i.

Math 5A HW4 Solutions September 5, 202 University of California, Los Angeles Problem 4..3b Calculate the determinant, 5 2i 6 + 4i 3 + i 7i Solution: The textbook s instructions give us, (5 2i)7i (6 + 4i)(

### NOTES on LINEAR ALGEBRA 1

School of Economics, Management and Statistics University of Bologna Academic Year 205/6 NOTES on LINEAR ALGEBRA for the students of Stats and Maths This is a modified version of the notes by Prof Laura

### Similar matrices and Jordan form

Similar matrices and Jordan form We ve nearly covered the entire heart of linear algebra once we ve finished singular value decompositions we ll have seen all the most central topics. A T A is positive

### NOTES ON LINEAR TRANSFORMATIONS

NOTES ON LINEAR TRANSFORMATIONS Definition 1. Let V and W be vector spaces. A function T : V W is a linear transformation from V to W if the following two properties hold. i T v + v = T v + T v for all

### Notes on Orthogonal and Symmetric Matrices MENU, Winter 2013

Notes on Orthogonal and Symmetric Matrices MENU, Winter 201 These notes summarize the main properties and uses of orthogonal and symmetric matrices. We covered quite a bit of material regarding these topics,

### Brief Introduction to Vectors and Matrices

CHAPTER 1 Brief Introduction to Vectors and Matrices In this chapter, we will discuss some needed concepts found in introductory course in linear algebra. We will introduce matrix, vector, vector-valued

### Lecture notes on linear algebra

Lecture notes on linear algebra David Lerner Department of Mathematics University of Kansas These are notes of a course given in Fall, 2007 and 2008 to the Honors sections of our elementary linear algebra

### CONTENTS 1. Peter Kahn. Spring 2007

CONTENTS 1 MATH 304: CONSTRUCTING THE REAL NUMBERS Peter Kahn Spring 2007 Contents 2 The Integers 1 2.1 The basic construction.......................... 1 2.2 Adding integers..............................

### Cofactor Expansion: Cramer s Rule

Cofactor Expansion: Cramer s Rule MATH 322, Linear Algebra I J. Robert Buchanan Department of Mathematics Spring 2015 Introduction Today we will focus on developing: an efficient method for calculating

### 4.6 Null Space, Column Space, Row Space

NULL SPACE, COLUMN SPACE, ROW SPACE Null Space, Column Space, Row Space In applications of linear algebra, subspaces of R n typically arise in one of two situations: ) as the set of solutions of a linear

### Similarity and Diagonalization. Similar Matrices

MATH022 Linear Algebra Brief lecture notes 48 Similarity and Diagonalization Similar Matrices Let A and B be n n matrices. We say that A is similar to B if there is an invertible n n matrix P such that

### 1 Sets and Set Notation.

LINEAR ALGEBRA MATH 27.6 SPRING 23 (COHEN) LECTURE NOTES Sets and Set Notation. Definition (Naive Definition of a Set). A set is any collection of objects, called the elements of that set. We will most

### 1 Eigenvalues and Eigenvectors

Math 20 Chapter 5 Eigenvalues and Eigenvectors Eigenvalues and Eigenvectors. Definition: A scalar λ is called an eigenvalue of the n n matrix A is there is a nontrivial solution x of Ax = λx. Such an x

### SYSTEMS OF EQUATIONS

SYSTEMS OF EQUATIONS 1. Examples of systems of equations Here are some examples of systems of equations. Each system has a number of equations and a number (not necessarily the same) of variables for which

### MAT 200, Midterm Exam Solution. a. (5 points) Compute the determinant of the matrix A =

MAT 200, Midterm Exam Solution. (0 points total) a. (5 points) Compute the determinant of the matrix 2 2 0 A = 0 3 0 3 0 Answer: det A = 3. The most efficient way is to develop the determinant along the

### Name: Section Registered In:

Name: Section Registered In: Math 125 Exam 3 Version 1 April 24, 2006 60 total points possible 1. (5pts) Use Cramer s Rule to solve 3x + 4y = 30 x 2y = 8. Be sure to show enough detail that shows you are

### The Characteristic Polynomial

Physics 116A Winter 2011 The Characteristic Polynomial 1 Coefficients of the characteristic polynomial Consider the eigenvalue problem for an n n matrix A, A v = λ v, v 0 (1) The solution to this problem

### Section 5.3. Section 5.3. u m ] l jj. = l jj u j + + l mj u m. v j = [ u 1 u j. l mj

Section 5. l j v j = [ u u j u m ] l jj = l jj u j + + l mj u m. l mj Section 5. 5.. Not orthogonal, the column vectors fail to be perpendicular to each other. 5..2 his matrix is orthogonal. Check that

### 26 Integers: Multiplication, Division, and Order

26 Integers: Multiplication, Division, and Order Integer multiplication and division are extensions of whole number multiplication and division. In multiplying and dividing integers, the one new issue

### Mathematics Course 111: Algebra I Part IV: Vector Spaces

Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 1996-7 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are

### 2x + y = 3. Since the second equation is precisely the same as the first equation, it is enough to find x and y satisfying the system

1. Systems of linear equations We are interested in the solutions to systems of linear equations. A linear equation is of the form 3x 5y + 2z + w = 3. The key thing is that we don t multiply the variables

### Solving Systems of Linear Equations

LECTURE 5 Solving Systems of Linear Equations Recall that we introduced the notion of matrices as a way of standardizing the expression of systems of linear equations In today s lecture I shall show how

### Eigenvalues, Eigenvectors, Matrix Factoring, and Principal Components

Eigenvalues, Eigenvectors, Matrix Factoring, and Principal Components The eigenvalues and eigenvectors of a square matrix play a key role in some important operations in statistics. In particular, they

### [1] Diagonal factorization

8.03 LA.6: Diagonalization and Orthogonal Matrices [ Diagonal factorization [2 Solving systems of first order differential equations [3 Symmetric and Orthonormal Matrices [ Diagonal factorization Recall:

### Au = = = 3u. Aw = = = 2w. so the action of A on u and w is very easy to picture: it simply amounts to a stretching by 3 and 2, respectively.

Chapter 7 Eigenvalues and Eigenvectors In this last chapter of our exploration of Linear Algebra we will revisit eigenvalues and eigenvectors of matrices, concepts that were already introduced in Geometry

### 160 CHAPTER 4. VECTOR SPACES

160 CHAPTER 4. VECTOR SPACES 4. Rank and Nullity In this section, we look at relationships between the row space, column space, null space of a matrix and its transpose. We will derive fundamental results

### Linear Algebra Review. Vectors

Linear Algebra Review By Tim K. Marks UCSD Borrows heavily from: Jana Kosecka kosecka@cs.gmu.edu http://cs.gmu.edu/~kosecka/cs682.html Virginia de Sa Cogsci 8F Linear Algebra review UCSD Vectors The length

### Notes from February 11

Notes from February 11 Math 130 Course web site: www.courses.fas.harvard.edu/5811 Two lemmas Before proving the theorem which was stated at the end of class on February 8, we begin with two lemmas. The

PYTHAGOREAN TRIPLES KEITH CONRAD 1. Introduction A Pythagorean triple is a triple of positive integers (a, b, c) where a + b = c. Examples include (3, 4, 5), (5, 1, 13), and (8, 15, 17). Below is an ancient

### 1.4. Arithmetic of Algebraic Fractions. Introduction. Prerequisites. Learning Outcomes

Arithmetic of Algebraic Fractions 1.4 Introduction Just as one whole number divided by another is called a numerical fraction, so one algebraic expression divided by another is known as an algebraic fraction.

### Introduction to Matrix Algebra

Psychology 7291: Multivariate Statistics (Carey) 8/27/98 Matrix Algebra - 1 Introduction to Matrix Algebra Definitions: A matrix is a collection of numbers ordered by rows and columns. It is customary

### Question 2: How do you solve a matrix equation using the matrix inverse?

Question : How do you solve a matrix equation using the matrix inverse? In the previous question, we wrote systems of equations as a matrix equation AX B. In this format, the matrix A contains the coefficients

### Solutions to Review Problems

Chapter 1 Solutions to Review Problems Chapter 1 Exercise 42 Which of the following equations are not linear and why: (a x 2 1 + 3x 2 2x 3 = 5. (b x 1 + x 1 x 2 + 2x 3 = 1. (c x 1 + 2 x 2 + x 3 = 5. (a

### 5 Homogeneous systems

5 Homogeneous systems Definition: A homogeneous (ho-mo-jeen -i-us) system of linear algebraic equations is one in which all the numbers on the right hand side are equal to : a x +... + a n x n =.. a m

### DETERMINANTS TERRY A. LORING

DETERMINANTS TERRY A. LORING 1. Determinants: a Row Operation By-Product The determinant is best understood in terms of row operations, in my opinion. Most books start by defining the determinant via formulas