# Determinants. Chapter Properties of the Determinant

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 Chapter 4 Determinants Chapter 3 entailed a discussion of linear transformations and how to identify them with matrices. When we study a particular linear transformation we would like its matrix representation to be simple, diagonal if possible. We therefore need some way of deciding if we can simplify the matrix representation and then how to do so. This problem has a solution, and in order to implement it, we need to talk about something called the determinant of a matrix. The determinant of a square matrix is a number. It turns out that this number is nonzero if and only if the matrix is invertible. In the first section of this chapter, different ways of computing the determinant of a matrix are presented. Few proofs are given; in fact no attempt has been made to even give a precise definition of a determinant. Those readers interested in a more rigorous discussion are encouraged to read Appendices C and D. 4.1 Properties of the Determinant The first thing to note is that the determinant of a matrix is defined only if the matrix is square. Thus, if A is a 2 2 matrix, it has a determinant, but if A is a 2 3 matrix it does not. The determinant of a 2 2 matrix is now defined. Definition 4.1. Determinant(A) = det(a) a b = det = ad bc. c d Example 1. Compute the determinants of the following matrices: 1 6 a. det = 3 ( 12) = b. det = 8 0 = c. det = 6 6 =

2 150 CHAPTER 4. DETERMINANTS To compute the determinant of a 3 3 or n n matrix, we need to introduce some notation. Definition 4.2. Let A = [a jk ] be an n n matrix. Let M jk be that (n 1) (n 1) matrix obtained from A by deleting its jth row and kth column. This submatrix of A is referred to as the j,k minor of A. Example 2. Let A = Find M 11, M 23, and M M 11 = M 23 = M 32 = Using minors we demonstrate one way to compute the determinant of a 3 3 matrix. The technique is called expansion by cofactors. Let A be any 3 3 matrix: A = a 11 a 12 a 13 a 21 a 22 a 23 a 31 a 32 a 33 Then det(a) = a 11 det(m 11 ) a 12 det(m 12 )+a 13 det(m 13 ) Notethat anyminorofa3 3matrixisa2 2matrix, and henceitsdeterminant is defined. We also wish to stress that we did not have to expand across the first row. We could have used any row or column. Example 3. Compute the determinant of the matrix below by expanding across the first row and also by expanding down the second column. A = Expanding across the first row we have det(a) = a 11 det(m 11 ) a 12 det(m 12 )+a 13 det(m 13 ) = ( 1)det (2)det +(4)det = ( 35) 2(15)+4(42+9) = Expanding down the second column we have det(a) = a 12 det(m 12 )+a 22 det(m 22 ) a 32 det(m 32 ) = (2)det +(3)det (7)det = ( 2)(15)+3(12) 7( 29) = 209

3 4.1. PROPERTIES OF THE DETERMINANT 151 It seems from the above two computations that minus signs creep in at random. That is not true. There is a rule for deciding whether or not a minus sign should appear, and it is given in the following theorem. Theorem 4.1. Let A = [a jk ] be any n n matrix. Then det(a) = det(a) = n ( 1) j+k a jk det(m jk ) k = 1,2...,n j=1 expansion down the kth column n ( 1) j+k a jk det(m jk ) j = 1,2...,n k=1 expansion across the jth row (4.1) Figure 4.1 should clarify whether or not a minussign precedes the term det(m jk ). Notice that the 1,1 entry has a + sign, and whenever we move one space horizontally or vertically the sign changes. Since it takes three moves to go from 1, 1 to 2, 3, the coefficient of a 23 in (4.1) equals det(m 23 ). The terms ( 1) j+k det(m jk ) arecalled the cofactorsof a jk, hence the phrase expansion by cofactors. Notice that this theorem reduces the problem of computing the determinant of an n n matrix to the problem of calculating the determinant of an (n 1) (n 1) matrix. Continued use of this procedure will reduce the original problem to one of calculating the determinants of 2 2 matrices Figure 4.1 It is clear that computing the determinant of a matrix, especially a large one, is painful. It s also clear that the more zeros in a matrix the easier the chore. The following theorems enable us to increase the number of zeros in a matrix and at the same time keep track of how the value of the determinant changes. Theorem 4.2. Let A be a square matrix. If A 1 is a matrix obtained from A by interchanging any two rows or columns, then det(a 1 ) = det(a).

4 152 CHAPTER 4. DETERMINANTS Example 4. det = det : rows one and two interchanged det = det : columns two and three interchanged Corollary 4.1. If an n n matrix has two identical rows or columns, its determinant must equal zero. Proof. The preceding theorem says that if you interchange any two rows or columns, the determinant changes sign. But if the two rows interchanged are identical, the determinant must remain unchanged. Since zero is the only number equal to its negative, we have det(a) = 0. Example a. det = 2 2 = b. det = 0: rows one and three are identical Theorem 4.3. If any row or column of a square matrix A is multiplied by a constant c to get a matrix A 1, then det(a 1 ) = c[det(a)]. Corollary 4.2. If a square matrix A has a row or column of zeros, then det(a) = 0. Example 6. det (1) = det 3(2) = 3det (3) = 3det (1) 2(8) 2(15) = 6det 1 4 3(4) 1 8 3(5) = 18det 1 4(1) 4 1 4(2) (7) 3 4(2) 7 = 72det

5 4.1. PROPERTIES OF THE DETERMINANT 153 Theorem 4.4. If any multiple of a row (column) is added to another row (column) of a square matrix A to get another matrix A 1, then det(a 1 ) = det(a). Example 7. det = det = det = det ] = (1)det[ = This last example illustrates perhaps the easiest way to evaluate the determinant of a matrix. That is, use the elementary row or column operations to get a row or column with at most one nonzero entry and then use Theorem 4.1. Our next example also demonstrates this idea. The reader might try computing the determinant in this example by using Theorem 4.1 directly and then comparing the two techniques. Example det = det = det = det ] = det[ = Theorem 4.5. Let A and B be two n n matrices. Then Example 9. Let A = two matrices. det(ab) = det(a) det(b) 3 4, B = Verify Theorem 4.5 for these 2 8 Solution det(a) = det = 10 det(b) = det = det(ab) = det = 140 = ( 10)(14) = det(a)det(b) 5 13 Theorem 4.6. Let A be any square matrix and let A T be its transpose, then det(a) = det(a T )

6 154 CHAPTER 4. DETERMINANTS Example 10. Verify Theorem 4.6 for the matrix A = Solution det(a) = det = 18 ( 8) = det(a T 6 2 ) = det = 18 ( 8) = 26 = det(a) 4 3 Theorem 4.7. A square matrix A is invertible if and only if det(a) is nonzero. This last theorem is one that we use repeatedly in the remainder of this text. For example, in the next section we discuss how to compute the inverse of a matrix in terms of the determinants of its minors, and in Chapter 5 we use an equivalent version of Theorem 4.7 that says, if ker(a) has nonzero vectors in it, then det(a) = 0. Problem Set Compute the determinants of each of the following matrices: a. b. c d Compute the determinants of each of the following matrices: a. b. c d a 1 a 2 a 3 3. a. det b. det a 1 +k a 2 +k a 3 +k a 1 +2k a 2 +2k a 3 +2k 4. a. det b. det If E is an elementary row matrix associated with adding a multiple of one row to another, then det(e) =? 6. Let A be any upper or lower triangular matrix., Show that det(a) = a 11 a 22...a nn ; that is, the determinant of A equals the product of the diagonal entries of A.

7 4.1. PROPERTIES OF THE DETERMINANT Let a j,j = 1,...,n be arbitrary numbers and let k be any number. We assume below that n > 2. a. Show that a 1 a 2... a n a 1 +k a 2 +k... a n +k det a 1 +2k a 2 +2k... a n +2k... = 0 a 1 +(n 2)k a 2 +(n 2)k... a n +(n 2)k a 1 +(n 1)k a 2 +(n 1)k... a n +(n 1)k b. Show that det n n+1 n n 2n+1 2n n+n... n(n 1)+1... n 2 = 0 c. What happens if n = 2? 0 a2 8. Let A 2 =. Let A a = 0 0 a 3 0 a 2 0, and a a n a n 1 0 let A n =... 0 a Thus, A n is an n n matrix whose a only possible nonzero entries occur in the (n i+1)st column of the ith row. Show that det(a n ) = ( 1) n(n 1)/2 a 1 a 2...a n. 9. Let x 1,x 2,...,x n be any n numbers. Let 1 1 = A x 1 x x 1 x 2 x 3 = A 2 2 x 2 1 x 2 2 x x 1 x 2... x n... = A n x1 n 1... xn n 1 The reader should note that these matrices (actually their transposes) appeared in Section 3.4, when we discussed fitting polynomials to prescribed data. The determinants in this problem are called Vandermonde determinants.

8 156 CHAPTER 4. DETERMINANTS a. Show that det(a 2 ) = x 2 x 1. b. det(a 3 ) = (x 3 x 2 )(x 3 x 1 )(x 2 x 1 ). c. Find a similar formula for det(a n ). 10. Let A be any n n matrix. Show that det(a) equals zero if and only if the rows (columns) of A form a linearly dependent set of vectors in R n. (Hint: Use Theorems 4.4 and 4.7.) 11. Let A be a nonsingular matrix. Show that det(a 1 ) = [det(a)] 1. (Hint: AA 1 = I n. Now use Theorem 4.5.) 12. Let S be any scalar matrix, that is, S = ci n for some number c. Show that det(s) = c n. 13. Let A and B be any two similar matrices; that is, there is a nonsingular matrix P such that A = PBP 1. Show that det(a) = det(b). 14. Compute the determinants of the following matrices: a b A matrix is said to be skew symmetric if A = A T. Thus 0 1 skew symmetric, while is not is 1 0 a. Show that all the diagonal elements of a skew symmetric matrix are equal to zero. b. Let A be a 3 3 skew symmetric matrix. Show that det(a) = 0. c. If A is a 2 2 skew symmetric matrix, must det(a) = 0? d. What happens if A is an n n skew symmetric matrix? 16. Let P be an n n permutation matrix. Show that det(p) = ±1. For the definition of a permutation matrix see problem 13 in Problem Set The Adjoint Matrix and A 1 Theorem 4.7 states that A is invertible if and only if det(a) is nonzero. In this section we show how to compute the inverse of a matrix by using the determinants of its (n 1) (n 1) minors (cf. Definition 4.2). Since these determinants will appear quite frequently, we introduce a special notation for them.

9 4.2. THE ADJOINT MATRIX AND A Definition 4.3. Let A = [a jk ] be any n n matrix. The cofactor of a jk, denoted by A jk, is defined to be where M jk is the j,k minor ofa. Example 1. Let A = A jk = ( 1) j+k det(m jk ) A 11 = ( 1) 2 ( 72) A 12 = ( 1) 3 (14 36) A 13 = ( 1) 4 (16) A 21 = (42 24) A 22 = ( 7 12) A 23 = ( 8 24) A 31 = (54) A 32 = ( 9 6) A 33 = ( 12) Using the cofactors of a matrix, we construct its adjoint matrix. Definition 4.4. Let A = [a jk ] be an n n matrix. The adjoint matrix of A is the following n n matrix: where A jk are the cofactors of A. adj(a) = [A jk ] T Note that the transpose of the matrix [A jk ] must be taken. Example 2. Let A = From Example 1 and the definition of adj(a) we have adj(a) = = Example 3. Let A be the matrix in the preceding example. Compute det(a) and A[adj(A)]. det(a) = det = det = A[adj(A)] = = = 252I 3 = det(a)i 3 T

12 160 CHAPTER 4. DETERMINANTS 4.3 Cramer s Rule Cramer s rule is a formula for computing the solution to a system of linear equations when the coefficient matrix A is nonsingular. This formula is just the component verseion of the equation A 1 = (det(a)) 1 adj(a) (4.2) WederiveCramer sruleforasystemoftwoequationswith twounknownsbefore stating the rule for n equations with n unknowns. Example 1. Find the solution to Assuming that det(a) = a 11 a 22 a 12 a 21 0, a 11 x 1 +a 12 x 2 = b 1 a 21 x 1 +a 22 x 2 = b 2 (4.3) A 1 = (det(a)) 1 adj(a) = (deta) 1 a22 a 22 a 21 a 11 Thus, and Thus, [ x1 x 2 ] = A 1 [ b1 b 2 ] [ x1 ] = x 2 = (deta) 1 a22 a 22 b1 a 21 a 11 b 2 b1 a 22 b 2 a 12 (deta) b 2 a 11 b 1 a 1 21 x 1 = b 1a 22 b 2 a 12 det(a) x 2 = b 2a 11 b 1 a 21 det(a) b1 a det 12 b 2 a 22 = det(a) a11 b det 1 a 21 b 2 = det(a) Thus we see that x 1 can be expressed as the ratio of two determinants. The matrix in the numerator is obtained by replacing the first column of A with the right-hand side of (4.3). To calculate x 2, the matrix in the numerator is obtained by replacing the second column of A with the right-hand side of (4.3). Consider the general system with n equations and n unknowns Ax = b (4.4) where A = [a jk ] is an n n nonsingular matrix x = [x 1,...,x n ] T, and b = [b 1,...,b n ] T. We know that x = A 1 b = (deta) 1 adj(a)b (4.5)

13 4.3. CRAMER S RULE 161 Using (4.5), we write x k in terms of b: x k = (deta) 1 (A 1k b 1 +A 2k b 2 + +A nk b n ) (4.6) remember adj(a) = [A jk ] T, where A jk is the cofactor of a jk. The last factor in (4.6) can be thought of as the expansion by minors (going down the kth column) of the determinant of the matrix obtained by replacing the kth column of A with the column [b 1,...,b n ] T. That is, a a 1(k 1) b 1 a 1(k+1)... a 1n... det a j1... b j... a jn... a n1... a n(k 1) b n a n(k+1)... a nn x k = det(a) (4.7) Formula (4.7) is Cramer s rule. Note that it is valid only for systems whose coefficient matrix is nonsingular. Example 2. Find the value of x 4 for which x 1,x 2,x 3,x 4, and x 5 solves the following system: 2x 1 + x 2 +2x 5 = 2 x 1 + x 4 = 2 3x 2 +x 3 +2x 4 = 1 x 1 + x 2 + x 4 + x 5 = 1 x 3 + x 4 + x 5 = 1 An easy computation shows that the coefficient matrix A has a determinant equal to 7. Thus, A is nonsingular and we have det ( ) x 4 = = det(a) 7 We now have three techniques for solving systems of equations: Gaussian elimination, which always works; inversion of the coefficient matrix A, i.e., compute A 1 ; and Cramer s rule. The last two methods assume, of course, that A is invertible. For small systems, n = 2,3, or 4, any of these methods would be fine, at least if A is invertible. For large n, however, the most efficient method to use in solving a system of equations is usually Gaussian elimination. It is for this reason that Cramer s rule is a theoretical rather than a problem-solving tool.

14 162 CHAPTER 4. DETERMINANTS Problem Set Use Cramer s rule to solve each of the following systems of equations: a. 2x 1 +2x 2 = 7 b. 8x 1 +6x 2 = 4 8x 1 + x 2 = 2 3x 1 +2x 2 = 6 2. Use Gaussian elimination to solve each of the systems in problem Use Cramer s rule to solve the following system: 2x 1 6x 2 +x 3 = 2 x 2 +x 3 = 1 x 1 x 2 x 3 = 0 4. Consider the following system of equations: 2x 1 +x 2 +x 3 x 4 = 1 3x 1 x 2 +x 3 +x 4 = 0 x 1 +x 2 x 3 +x 4 = 0 6x 1 x 2 +x 4 = 0 a. Use Cramer s rule to solve for x 1. b. Use Gaussian elimination to solve for x Consider the following system of equations: x 1 +3x 2 + x 3 = 7 x 1 x 2 x 3 = 2 x 1 +6x 2 +2x 3 = 3 a. Solve this systsem using Cramer s rule. b. Solve using Gaussian elimination. c. Solve by finding the inverse of the coefficient matrix. 6. Solve the following system by using Cramer s rule. 7. Solve using Cramers rule. 8. Solve using Cramer s rule. 2x 1 x 3 = 1 2x 1 +4x 2 x 3 = 0 x 1 8x 2 3x 3 = 2 x 1 + x 2 + x 3 = a x 1 +(1+a)x 2 + x 3 = 2a x 1 + x 2 +(1+a)x 3 = 0 x 1 + x 2 + x 3 + x 4 = 4 x 1 +2x 2 +2x 3 +2x 4 = 1 x 1 + x 2 +2x 3 +2x 4 = 2 x 1 + x 2 + x 3 +2x 4 = 3

15 4.4. AREA AND VOLUME Area and Volume Given any two vectors in R 2 that are not parallel, they determine a parallelogram; cf. problems 9 and 10 in Section 2.1. With a few manipulations it is possible to express the area of this parallelogram as the absolute values of the determinant of a matrix constructed from the coordinates of these vectors. Example 1. Compute the area of the parallelogram determined by the vectors (1,2) and (8,0) (see Figure 4.2). The area of this parallelogram is the base length 8 times the height Area = 8 2 = det (4.8) where the columns of the matrix are the coordinates of the two vectors 0 2 (8,0) and (1,2), with respect to the standard basis of R 2. x 2 (1,2) (8,0) x 1 Figure 4.2 We derive a similar formula for any two vectors (a 1,a 2 ) and (b 1,b 2 ). Our proof and picture assume that both vectors lie in the first quadrant, but the other cases can be handled in a similar manner. Considertheparallelogramdeterminedbythetwovectors(a 1,a 2 )and(b 1,b 2 ) (see Figure 4.3). Area of parallelogram OBCA = area of triangle(obp 2 ) +area of trapezoid(p 2 BCP 3 ) area of triangle(oap 1 ) area of trapezoid(p 1 ACP 3 ) = 1 2 (b 1b 2 )+ 1 2 (a 1)(b 2 +a 2 +b 2 ) 1 2 (a 1a 2 ) 1 2 (b 1)(a 2 +a 2 +b 2 ) a1 b = a 1 b 2 a 2 b 1 = det 1 a 2 b 2

16 164 CHAPTER 4. DETERMINANTS Since we do not wish to worry about the order in which we list the columns of the above matrix, we write the area as Area = det a1 b 1 a 2 b 2 We formally state this in the following theorem. B(b 1,b 2) C(a 1 +b 1,a 2 +b 2) A(a 1,a 2) 0 P 1 P 2 P 3 Figure 4.3 Theorem 4.9. Let a = (a 1,a 2 ) and b = (b 1,b 2 ) be any two vectors in R 2. Let P be the parallelogram generated by these two vectors, i.e., P = {x: x = t 1 a+t 2 b,t 1 and t 2 arbitrary scalars between 0 and 1}. Then Area(P) = det a1 b 1 a 2 b 2 Example 2. a. Sketch the parallelogram determined by the vectors ( 6, 4) and (3, 2) and calculate its areas. We see from Figure 4.4a that the parallelogram is just the straight-line segment joining the two points ( 6,4) and (3, 2). Thus the area should be zero. Indeed, we have Area(P) = 6 3 det = = b. Repeattheabove,usingthevectors(1, 2)and( 6, 3)(seeFigure4.4b). Area(P) = 1 6 det = ( 3 12) =

17 4.4. AREA AND VOLUME 165 ( 6, 4) (3, 2) (a) ( 6, 3) (1, 2) (b) Figure 4.4 As one would expect, there is a generalization of this formula to higher dimensions, and we state it in the next theorem. Theorem Let {x 1,...,x n } be any n vectors in R n. Let P be the n- dimensional parallelepiped generated by these vectors, that is, P = {y: y = t 1 x 1 + +t n x n, 0 t j 1} Then the n-dimensional volume of P equals x 1 x 2 Vol(P) = det x n.. (4.9) The matrix in (4.9) is obtained by using the coordinates of the vector x j (with respect to the standard basis) as the jth column. Thus, if we had the four

18 166 CHAPTER 4. DETERMINANTS vectors x 1 = (1,1,2,1) x 2 = ( 1, 1,3,4) x 3 = (8,9,1,1) x 4 = (10,11,1,0) then the matrix would be Example 3. Sketch the parallelepiped generated by the three vectors a = (1,1,0),b = (0,1,1),andc = (1,0,1)(seeFigure4.5), anddetermineitsvolume. Vol(P) = det [ = det det ] = 1+1 = 2 (1,0,1) (0,1,1) Figure 4.5 (1,1,0) We remark that these determinants will be zero if and only if the n vectors used to form the matrices are linearly dependent. In that case, the solid they generate

19 4.4. AREA AND VOLUME 167 will lie in an (n 1)-dimensional plane, and hence should have n-dimensional volume equal to zero. See Example 2a. If L is a linear transformation from R 2 to R 2, it has a matrix representation A, where a11 a A = 12 a 21 a 22 As we saw in Chapter 3, L(e 1 ) = (a 11,a 21 ) and L(e 2 ) = (a 12,a 22 ). Thus, geometrically we can picture L as transforming the parallelogram generated by e 1 and e 2 into the parallelogram generated by (a 11,a 21 ) and (a 12,a 22 ) (see Figure 4.6). Moreover, we have Area(L(P)) = det a11 a 12 = det(a) a 21 a 22 Since in this particular case we have area(p) = 1, we may rewrite this formula as Area(L(P)) = det(a) area(p) To see that this formula is true in general let x = (x 1,x 2 ) and y = (y 1,y 2 ). Let P be the parallelogram generated by x and y, that is, P = {t 1 x+t 2 y: 0 t 1 1,0 t 2 1} L[e 2] e 2 P L[P] L[e 1] e 1 Figure 4.6 Then where and L(P) = {t 1 L(x)+t 2 L(y): 0 t 1 1,0 t 2 1} L(x) = (a 11 x 1 +a 12 x 2,a 21 x 1 +a 22 x 2 ) L(y) = (a 11 y 1 +a 12 y 2,a 21 y 1 +a 22 y 2 ).

20 168 CHAPTER 4. DETERMINANTS We have from (4.9) that Area(L(P)) = det a11 x 1 +a 12 x 2 a 11 y 1 +a 12 y 2 a 21 x 1 +a 22 x 2 a 21 y 1 +a 22 y 2 () = det a11 a 12 x1 y 1 a 21 a 22 x 2 y 2 = det a11 a 12 x1 y det 1 a 21 a 22 y 2 = det(a) [area(p)] Thus, a linear transformation from R 2 to R 2 maps parallelograms into parallelograms (rank A = 2), or line segments (rank A = 1), or a point (rank A = 0). Moreover, the change in area depends only on the linear transformation and not on the particular parallelogram. Naturally there is a generalization of this to higher dimensions which we state below. Theorem Let A be the n n matrix representation of L: R n R n, with respect to the standard basis of R n. Let P be an n-dimensional parallelogram generated by the n vectors {x 1,...,x n }. Then L(P) is generated by the n vectors {L(x 1 ),...,L(x n )} and their volumes are related by the formula x 2 Vol(L(P)) = det(a) Vol(P) (4.10) Problem Set Calculate the area of the triangles whose vertices are: a. (0,0), (1,6), ( 2,3) b. (8,17), (9,2), (4,6) 2. Calculate the volume of the tetrahedron whose vertices are: a. (0,0,0), (1, 1,2), ( 3,6,7), (1,1,1) b. (1,1,1), ( 1, 1, 1), (0,4,8), ( 3,0,2) 3. Find the area of the parallelograms determined by the following vectors; cf. problem 1. a. (1,6), ( 2,3) b. (1, 15),( 4, 11) 4. Sketch the parallelograms P generated by the following pairs of vectors. Let O be the parallelogram generated by the standard basis vectors. For each of the parallelograms P find a linear transformation L such that P = L(O). a. (1,0), (1,2) b. (1, 1), (3,6)

21 4.4. AREA AND VOLUME In R 2, show that the straight line passing through the two points (a 1,a 2 ) and (b 1,b 2 ) has equation det x 1 x 2 1 a 1 a 2 1 = 0 b 1 b Let L, a linear transformation from R 2 to R 2, have matrix representation 1 2 A = 1 2 Let P be the parallelogram generated by the vectors ( 1,2) and (1,3). Sketch P and L(P) and compute their areas. Then verify (4.10) LetA = be the matrix representation of a linear transformation 2 1 L. Let P be the parallelogram generated by the following pairs of vectors: a. (1,0), (0,1) b. (1,1), ( 1,1) In each case sketch P,L(P), and verify (4.10). 8. Let A = be the matrix representation of a linear transformation L. Let P be the solid generated by the following vectors: a. (1,0,0), (0,1,0), (0,0,1) b. (1,1,0), (1,0,1), (0,1,1) In each case sketch P,L(P), and verify (4.10). Supplementary Problems 1. Let A = [a jk ] be an n n matrix. Define each of the following: a. M jk minor of A b. Cofactor of a jk c. Adj(A) 2. Compute the determinant and adjoint of each of the following matrices: a

22 170 CHAPTER 4. DETERMINANTS b Let A = 2 x 1 x 1 1. Find all values of x for which det(a) = Find all values of λ for which the following system of equations has a nontrivial solution: 2x 1 7x 2 = λx 1 4x 1 + x 2 = λx 2 a(t) b(t) 5. Let f(t) = det, which a(t), b(t), c(t), and d(t) are differential c(t) d(t) functions of t. a a. Show that f b (t) = det a b +det c d c d. b. Derive a similar formula for the determinant of a 3 3 matrix of functions. 6. Let y 1 (t) and y 2 (t) be two solutions of the differential equation ay +by +cy = 0 Define the Wronskian W(t) of the solutions y j (t) by y1 (t) y W(t) = det 2 (t) y 1(t) y 2(t) Show that the Wronskian satisfies the differential equation aw +bw = 0 7. Using the fact that a matrix has nonzero determinant if and only if its rows (columns) are linearly independent, determine which of the following sets are linearly independent: a. (2,1), ( 3,4) b. (2,1, 2,3), (0,1,0,1), (1,1,1,0), (3,3, 1,4) 8. If A = (a 1,a 2,a 3 ) and B = (b 1,b 2,b 3 ), then the cross product of A and B is defined as A B = det i j k a 1 a 2 a 3 b 1 b 2 b 3 = (a 2 b 3 a 3 b 2,a 3 b 1 a 1 b 3,a 1 b 2 a 2 b 1 ) The reader should realize that the term involving the determinant is merely a mnemonic, useful in remembering the last expression. Show that A B = B A and the A A = 0.

23 4.4. AREA AND VOLUME Verify the following formulas: a. det a b 0 ] c d 0 a b = det[ e c d 0 0 e a b 0 0 b. det c d 0 0 a b e f 0 0 e f = det det c d g h 0 0 g h A Let A = be an n n matrix, where A 0 A 1 is an m m matrix and 2 A 2 is an (n m) (n m) matrix, 1 m n 1. Show that det(a) = det(a 1 )det(a 2 ) 11. A group (G, ) is a mathematical system that consists of a collection of objects G and an operation between two elements of G, which gives an element of G. Thus, if x and y are elements of G, then x y (we drop the dot in the future) is also in G. We also suppose that this operation, called multiplication, satisfies the following properties: 1. (xy)z = x(yz). 2. There is an identity element e in G such that ex = xe = x for every x in G. 3. For each x in G, there is an x 1 in G such that xx 1 = x 1 x = e a. Show that the set of vectors in a vector space forms a group, the group operation being vector addition. b. Let GL(n) denote the set of invertible n n matrices, with the group operation being matrix multiplication. Show that GL(n) forms a group. This group is called the general linear group of order n. c. Let SL(n) denote the set of invertible n n matrices with determinant equal to 1. Show that SL(n), with the group operation being matrix multiplication, is a group. This group is called the special linear group of order n. d. Show that the set of all n n matrices under matrix multiplication does not form a group. 12. An n n matrix P is said to be orthogonal if P 1 = P T. a. Show that if P is orthogonal, then det(p) = ±1. b. Deduce from part a that if P is orthogonal and if K is some n- dimensional parallelepiped, then vol(p K) = vol(k).

24 172 CHAPTER 4. DETERMINANTS c. Find a 2 2 matrix P that is not orthogonal, and for which det(p) equals 1. d. Show that O(n), the set of n n orthogonal matrices, forms a group under the operation of matrix multiplication; cf. problem A matrix B is said to be similar to the matrix A if there is a nonsingular matrix P such that B = PAP 1. a. Show that if B is similar to A, then det(b) = det(a). b. Find a pair of 2 2 matrices A and B for which det(a) = det(b) and B is not similar to A. Hint: If B is similar to a scalar matrix, then B = A. 14. Find two 2 2 matrices A and B for which det(a+b) det(a)+det(b).

### 2.1: Determinants by Cofactor Expansion. Math 214 Chapter 2 Notes and Homework. Evaluate a Determinant by Expanding by Cofactors

2.1: Determinants by Cofactor Expansion Math 214 Chapter 2 Notes and Homework Determinants The minor M ij of the entry a ij is the determinant of the submatrix obtained from deleting the i th row and the

### MATH 240 Fall, Chapter 1: Linear Equations and Matrices

MATH 240 Fall, 2007 Chapter Summaries for Kolman / Hill, Elementary Linear Algebra, 9th Ed. written by Prof. J. Beachy Sections 1.1 1.5, 2.1 2.3, 4.2 4.9, 3.1 3.5, 5.3 5.5, 6.1 6.3, 6.5, 7.1 7.3 DEFINITIONS

### 1 Determinants. Definition 1

Determinants The determinant of a square matrix is a value in R assigned to the matrix, it characterizes matrices which are invertible (det 0) and is related to the volume of a parallelpiped described

### (a) The transpose of a lower triangular matrix is upper triangular, and the transpose of an upper triangular matrix is lower triangular.

Theorem.7.: (Properties of Triangular Matrices) (a) The transpose of a lower triangular matrix is upper triangular, and the transpose of an upper triangular matrix is lower triangular. (b) The product

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

### 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. Dr. Doreen De Leon Math 152, Fall 2015

Determinants Dr. Doreen De Leon Math 52, Fall 205 Determinant of a Matrix Elementary Matrices We will first discuss matrices that can be used to produce an elementary row operation on a given matrix A.

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

### Matrix Inverse and Determinants

DM554 Linear and Integer Programming Lecture 5 and Marco Chiarandini Department of Mathematics & Computer Science University of Southern Denmark Outline 1 2 3 4 and Cramer s rule 2 Outline 1 2 3 4 and

### Lecture 11. Shuanglin Shao. October 2nd and 7th, 2013

Lecture 11 Shuanglin Shao October 2nd and 7th, 2013 Matrix determinants: addition. Determinants: multiplication. Adjoint of a matrix. Cramer s rule to solve a linear system. Recall that from the previous

### Using determinants, it is possible to express the solution to a system of equations whose coefficient matrix is invertible:

Cramer s Rule and the Adjugate Using determinants, it is possible to express the solution to a system of equations whose coefficient matrix is invertible: Theorem [Cramer s Rule] If A is an invertible

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

### UNIT 2 MATRICES - I 2.0 INTRODUCTION. Structure

UNIT 2 MATRICES - I Matrices - I Structure 2.0 Introduction 2.1 Objectives 2.2 Matrices 2.3 Operation on Matrices 2.4 Invertible Matrices 2.5 Systems of Linear Equations 2.6 Answers to Check Your Progress

### Chapter 8. Matrices II: inverses. 8.1 What is an inverse?

Chapter 8 Matrices II: inverses We have learnt how to add subtract and multiply matrices but we have not defined division. The reason is that in general it cannot always be defined. In this chapter, we

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

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

### Topic 1: Matrices and Systems of Linear Equations.

Topic 1: Matrices and Systems of Linear Equations Let us start with a review of some linear algebra concepts we have already learned, such as matrices, determinants, etc Also, we shall review the method

### 5.3 Determinants and Cramer s Rule

290 5.3 Determinants and Cramer s Rule Unique Solution of a 2 2 System The 2 2 system (1) ax + by = e, cx + dy = f, has a unique solution provided = ad bc is nonzero, in which case the solution is given

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

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

### Linear Algebra Test 2 Review by JC McNamara

Linear Algebra Test 2 Review by JC McNamara 2.3 Properties of determinants: det(a T ) = det(a) det(ka) = k n det(a) det(a + B) det(a) + det(b) (In some cases this is true but not always) A is invertible

### ( % . This matrix consists of \$ 4 5 " 5' the coefficients of the variables as they appear in the original system. The augmented 3 " 2 2 # 2 " 3 4&

Matrices define matrix We will use matrices to help us solve systems of equations. A matrix is a rectangular array of numbers enclosed in parentheses or brackets. In linear algebra, matrices are important

### MATH36001 Background Material 2015

MATH3600 Background Material 205 Matrix Algebra Matrices and Vectors An ordered array of mn elements a ij (i =,, m; j =,, n) written in the form a a 2 a n A = a 2 a 22 a 2n a m a m2 a mn is said to be

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

### The Determinant: a Means to Calculate Volume

The Determinant: a Means to Calculate Volume Bo Peng August 20, 2007 Abstract This paper gives a definition of the determinant and lists many of its well-known properties Volumes of parallelepipeds are

### Problems. Universidad San Pablo - CEU. Mathematical Fundaments of Biomedical Engineering 1. Author: First Year Biomedical Engineering

Universidad San Pablo - CEU Mathematical Fundaments of Biomedical Engineering 1 Problems Author: First Year Biomedical Engineering Supervisor: Carlos Oscar S. Sorzano September 15, 013 1 Chapter 3 Lay,

### Chapter 1. Determinants

Chapter 1. Determinants This material is in Chapter 2 of Anton & Rorres (or most of it is there). See also section 3.5 of that book. 1.1 Introductory remarks The determinant of a square matrix A is a number

### 8 Square matrices continued: Determinants

8 Square matrices continued: Determinants 8. Introduction Determinants give us important information about square matrices, and, as we ll soon see, are essential for the computation of eigenvalues. You

### Calculus and linear algebra for biomedical engineering Week 4: Inverse matrices and determinants

Calculus and linear algebra for biomedical engineering Week 4: Inverse matrices and determinants Hartmut Führ fuehr@matha.rwth-aachen.de Lehrstuhl A für Mathematik, RWTH Aachen October 30, 2008 Overview

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

### Mathematics Notes for Class 12 chapter 3. Matrices

1 P a g e Mathematics Notes for Class 12 chapter 3. Matrices A matrix is a rectangular arrangement of numbers (real or complex) which may be represented as matrix is enclosed by [ ] or ( ) or Compact form

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

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

### = [a ij ] 2 3. Square matrix A square matrix is one that has equal number of rows and columns, that is n = m. Some examples of square matrices are

This document deals with the fundamentals of matrix algebra and is adapted from B.C. Kuo, Linear Networks and Systems, McGraw Hill, 1967. It is presented here for educational purposes. 1 Introduction In

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

### LINEAR ALGEBRA. September 23, 2010

LINEAR ALGEBRA September 3, 00 Contents 0. LU-decomposition.................................... 0. Inverses and Transposes................................. 0.3 Column Spaces and NullSpaces.............................

### 1 Determinants and the Solvability of Linear Systems

1 Determinants and the Solvability of Linear Systems In the last section we learned how to use Gaussian elimination to solve linear systems of n equations in n unknowns The section completely side-stepped

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

### Math 315: Linear Algebra Solutions to Midterm Exam I

Math 35: Linear Algebra s to Midterm Exam I # Consider the following two systems of linear equations (I) ax + by = k cx + dy = l (II) ax + by = 0 cx + dy = 0 (a) Prove: If x = x, y = y and x = x 2, y =

### Unit 18 Determinants

Unit 18 Determinants Every square matrix has a number associated with it, called its determinant. In this section, we determine how to calculate this number, and also look at some of the properties of

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

### 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)(

### 10. Graph Matrices Incidence Matrix

10 Graph Matrices Since a graph is completely determined by specifying either its adjacency structure or its incidence structure, these specifications provide far more efficient ways of representing a

### 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 5. Matrices. 5.1 Inverses, Part 1

Chapter 5 Matrices The classification result at the end of the previous chapter says that any finite-dimensional vector space looks like a space of column vectors. In the next couple of chapters we re

### Solution. Area(OABC) = Area(OAB) + Area(OBC) = 1 2 det( [ 5 2 1 2. Question 2. Let A = (a) Calculate the nullspace of the matrix A.

Solutions to Math 30 Take-home prelim Question. Find the area of the quadrilateral OABC on the figure below, coordinates given in brackets. [See pp. 60 63 of the book.] y C(, 4) B(, ) A(5, ) O x Area(OABC)

### 5.3 The Cross Product in R 3

53 The Cross Product in R 3 Definition 531 Let u = [u 1, u 2, u 3 ] and v = [v 1, v 2, v 3 ] Then the vector given by [u 2 v 3 u 3 v 2, u 3 v 1 u 1 v 3, u 1 v 2 u 2 v 1 ] is called the cross product (or

### Preliminaries of linear algebra

Preliminaries of linear algebra (for the Automatic Control course) Matteo Rubagotti March 3, 2011 This note sums up the preliminary definitions and concepts of linear algebra needed for the resolution

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

### Using row reduction to calculate the inverse and the determinant of a square matrix

Using row reduction to calculate the inverse and the determinant of a square matrix Notes for MATH 0290 Honors by Prof. Anna Vainchtein 1 Inverse of a square matrix An n n square matrix A is called invertible

### Inverses. Stephen Boyd. EE103 Stanford University. October 27, 2015

Inverses Stephen Boyd EE103 Stanford University October 27, 2015 Outline Left and right inverses Inverse Solving linear equations Examples Pseudo-inverse Left and right inverses 2 Left inverses a number

### 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 4: Matrix multiplication. Diagonal matrices. Inverse matrix.

MATH 304 Linear Algebra Lecture 4: Matrix multiplication. Diagonal matrices. Inverse matrix. Matrices Definition. An m-by-n matrix is a rectangular array of numbers that has m rows and n columns: a 11

### GRA6035 Mathematics. Eivind Eriksen and Trond S. Gustavsen. Department of Economics

GRA635 Mathematics Eivind Eriksen and Trond S. Gustavsen Department of Economics c Eivind Eriksen, Trond S. Gustavsen. Edition. Edition Students enrolled in the course GRA635 Mathematics for the academic

### We call this set an n-dimensional parallelogram (with one vertex 0). We also refer to the vectors x 1,..., x n as the edges of P.

Volumes of parallelograms 1 Chapter 8 Volumes of parallelograms In the present short chapter we are going to discuss the elementary geometrical objects which we call parallelograms. These are going to

### 2.5 Gaussian Elimination

page 150 150 CHAPTER 2 Matrices and Systems of Linear Equations 37 10 the linear algebra package of Maple, the three elementary 20 23 1 row operations are 12 1 swaprow(a,i,j): permute rows i and j 3 3

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

### 9 Matrices, determinants, inverse matrix, Cramer s Rule

AAC - Business Mathematics I Lecture #9, December 15, 2007 Katarína Kálovcová 9 Matrices, determinants, inverse matrix, Cramer s Rule Basic properties of matrices: Example: Addition properties: Associative:

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

### Summary of week 8 (Lectures 22, 23 and 24)

WEEK 8 Summary of week 8 (Lectures 22, 23 and 24) This week we completed our discussion of Chapter 5 of [VST] Recall that if V and W are inner product spaces then a linear map T : V W is called an isometry

### MATH 304 Linear Algebra Lecture 8: Inverse matrix (continued). Elementary matrices. Transpose of a matrix.

MATH 304 Linear Algebra Lecture 8: Inverse matrix (continued). Elementary matrices. Transpose of a matrix. Inverse matrix Definition. Let A be an n n matrix. The inverse of A is an n n matrix, denoted

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

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

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

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

### A matrix over a field F is a rectangular array of elements from F. The symbol

Chapter MATRICES Matrix arithmetic A matrix over a field F is a rectangular array of elements from F The symbol M m n (F) denotes the collection of all m n matrices over F Matrices will usually be denoted

### x1 x 2 x 3 y 1 y 2 y 3 x 1 y 2 x 2 y 1 0.

Cross product 1 Chapter 7 Cross product We are getting ready to study integration in several variables. Until now we have been doing only differential calculus. One outcome of this study will be our ability

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

### 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 LECTURE 1. Simultaneous Equations Consider a system of m linear equations in n unknowns: y 1 = a 11 x 1 + a 12 x 2 + +a 1n x n,

LECTURE 1 Matrix Algebra Simultaneous Equations Consider a system of m linear equations in n unknowns: y 1 a 11 x 1 + a 12 x 2 + +a 1n x n, (1) y 2 a 21 x 1 + a 22 x 2 + +a 2n x n, y m a m1 x 1 +a m2 x

### 1.5 Elementary Matrices and a Method for Finding the Inverse

.5 Elementary Matrices and a Method for Finding the Inverse Definition A n n matrix is called an elementary matrix if it can be obtained from I n by performing a single elementary row operation Reminder:

### Matrices 2. Solving Square Systems of Linear Equations; Inverse Matrices

Matrices 2. Solving Square Systems of Linear Equations; Inverse Matrices Solving square systems of linear equations; inverse matrices. Linear algebra is essentially about solving systems of linear equations,

### Linear Systems. Singular and Nonsingular Matrices. Find x 1, x 2, x 3 such that the following three equations hold:

Linear Systems Example: Find x, x, x such that the following three equations hold: x + x + x = 4x + x + x = x + x + x = 6 We can write this using matrix-vector notation as 4 {{ A x x x {{ x = 6 {{ b General

### Determinants LECTURE Calculating the Area of a Parallelogram. Definition Let A be a 2 2 matrix. A = The determinant of A is the number

LECTURE 13 Determinants 1. Calculating the Area of a Parallelogram Definition 13.1. Let A be a matrix. [ a c b d ] The determinant of A is the number det A) = ad bc Now consider the parallelogram formed

### Chapter 1 - Matrices & Determinants

Chapter 1 - Matrices & Determinants Arthur Cayley (August 16, 1821 - January 26, 1895) was a British Mathematician and Founder of the Modern British School of Pure Mathematics. As a child, Cayley enjoyed

### Chapter 4: Binary Operations and Relations

c Dr Oksana Shatalov, Fall 2014 1 Chapter 4: Binary Operations and Relations 4.1: Binary Operations DEFINITION 1. A binary operation on a nonempty set A is a function from A A to A. Addition, subtraction,

### Section 1.1. Introduction to R n

The Calculus of Functions of Several Variables Section. Introduction to R n Calculus is the study of functional relationships and how related quantities change with each other. In your first exposure to

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

### NON SINGULAR MATRICES. DEFINITION. (Non singular matrix) An n n A is called non singular or invertible if there exists an n n matrix B such that

NON SINGULAR MATRICES DEFINITION. (Non singular matrix) An n n A is called non singular or invertible if there exists an n n matrix B such that AB = I n = BA. Any matrix B with the above property is called

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

### SCHOOL OF MATHEMATICS MATHEMATICS FOR PART I ENGINEERING. Self Study Course

SCHOOL OF MATHEMATICS MATHEMATICS FOR PART I ENGINEERING Self Study Course MODULE 17 MATRICES II Module Topics 1. Inverse of matrix using cofactors 2. Sets of linear equations 3. Solution of sets of linear

### v w is orthogonal to both v and w. the three vectors v, w and v w form a right-handed set of vectors.

3. Cross product Definition 3.1. Let v and w be two vectors in R 3. The cross product of v and w, denoted v w, is the vector defined as follows: the length of v w is the area of the parallelogram with

### The Solution of Linear Simultaneous Equations

Appendix A The Solution of Linear Simultaneous Equations Circuit analysis frequently involves the solution of linear simultaneous equations. Our purpose here is to review the use of determinants to solve

### Numerical Analysis Lecture Notes

Numerical Analysis Lecture Notes Peter J. Olver 4. Gaussian Elimination In this part, our focus will be on the most basic method for solving linear algebraic systems, known as Gaussian Elimination in honor

### Factorization Theorems

Chapter 7 Factorization Theorems This chapter highlights a few of the many factorization theorems for matrices While some factorization results are relatively direct, others are iterative While some factorization

### Computational Methods CMSC/AMSC/MAPL 460. Eigenvalues and Eigenvectors. Ramani Duraiswami, Dept. of Computer Science

Computational Methods CMSC/AMSC/MAPL 460 Eigenvalues and Eigenvectors Ramani Duraiswami, Dept. of Computer Science Eigen Values of a Matrix Definition: A N N matrix A has an eigenvector x (non-zero) with

Facts About Eigenvalues By Dr David Butler Definitions Suppose A is an n n matrix An eigenvalue of A is a number λ such that Av = λv for some nonzero vector v An eigenvector of A is a nonzero vector v

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

### Direct Methods for Solving Linear Systems. Matrix Factorization

Direct Methods for Solving Linear Systems Matrix Factorization Numerical Analysis (9th Edition) R L Burden & J D Faires Beamer Presentation Slides prepared by John Carroll Dublin City University c 2011

### Practice Math 110 Final. Instructions: Work all of problems 1 through 5, and work any 5 of problems 10 through 16.

Practice Math 110 Final Instructions: Work all of problems 1 through 5, and work any 5 of problems 10 through 16. 1. Let A = 3 1 1 3 3 2. 6 6 5 a. Use Gauss elimination to reduce A to an upper triangular

### Adding vectors We can do arithmetic with vectors. We ll start with vector addition and related operations. Suppose you have two vectors

1 Chapter 13. VECTORS IN THREE DIMENSIONAL SPACE Let s begin with some names and notation for things: R is the set (collection) of real numbers. We write x R to mean that x is a real number. A real number

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

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

### MATH10212 Linear Algebra B Homework 7

MATH22 Linear Algebra B Homework 7 Students are strongly advised to acquire a copy of the Textbook: D C Lay, Linear Algebra and its Applications Pearson, 26 (or other editions) Normally, homework assignments

### 1. True/False: Circle the correct answer. No justifications are needed in this exercise. (1 point each)

Math 33 AH : Solution to the Final Exam Honors Linear Algebra and Applications 1. True/False: Circle the correct answer. No justifications are needed in this exercise. (1 point each) (1) If A is an invertible

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

### Notes on Linear Algebra. Peter J. Cameron

Notes on Linear Algebra Peter J. Cameron ii Preface Linear algebra has two aspects. Abstractly, it is the study of vector spaces over fields, and their linear maps and bilinear forms. Concretely, it is