MATH 106 LINEAR ALGEBRA LECTURE NOTES

Size: px
Start display at page:

Download "MATH 106 LINEAR ALGEBRA LECTURE NOTES"

Transcription

1 MATH 6 LINEAR ALGEBRA LECTURE NOTES FALL - These Lecture Notes are not in a final form being still subject of improvement

2

3 Contents Systems of linear equations and matrices 5 Introduction to systems of linear equations 5 Gaussian elimination 7 3 Matrices and matrix operations 4 Inverses Rules of matrix arithmetic 8 5 Elementary matrices and a method for finding A 6 Further results on systems of equations and invertibility 5 7 Diagonal, Triangular and Symmetric Matrices 7 Determinants 33 The determinant function 33 Evaluating determinants by row reduction 35 3 Properties of determinant function 36 4 Cofactor expansion Cramer s rule 38 3 Euclidean vector spaces 43 3 Euclidean n-space 43 3 Linear transformations from R n to R m Properties of linear transformations from R n to R m 5 3

4 4

5 Chapter Systems of linear equations and matrices Introduction to systems of linear equations Definition A linear equation in the n variables x,, x n, equally called unknowns, is the problem of finding the values of x,, x n such that a x + + a n x n b, where a,, a n, b are constants A solution of a linear equation a x + + a n x n b is a sequence t,, t n of n real numbers such that the equation is satisfied when we replace x t,, x n t n The set of all solutions of the equation is called its solution set or the general solution Definition A finite set of linear equations in the variables x,, x n linear equations or a a linear system A solution of a linear system is called a system of a x + a x + + a n x n b a x + a x + + a n x n b () a m x + a m x + + a mn x n b m with m linear equations and n unknowns, is a sequence t,, t n of n real numbers such that each equation of the system is satisfied when we replace x t,, x n t n The set of all solutions of the linear system is called its solution set or the general solution A system of equations is said to be consistent if it has a solution at least Otherwise it is called inconsistent The augmented matrix 5

6 of the linear system (3) is a a a n b a a a n b a m a m a mn b m Remark 3 The solution set of a linear system unchanges if we perform on the system one of the following operations: Multiply an equation with a nonzero constant; Interchange two equations; 3 Add a multiple of one equation to another The corresponding operations at the level of augmented matrix are: Multiply a row with a nonzero constant; Interchange two rows; 3 Add a multiple of one row to another Example 4 Solve the following linear system x + y 3z + aw 4 3x y + 5z + aw 4x + y + z + aw Solution: The augmented matrix of the system is 3 a 3 5 a 4 a 4 and we have 6

7 successively: 3 a 3 5 a 4 a 4 x + y 3z + aw 4 3x y + 5z + aw 4x + y + z + aw 3r + r r 4r + r 3 r 3 3e + e e 4e + e 3 e 3 3 a 7 4 7a 7 4 7a x + y 3z + aw 4 7y + 4z + 7aw 4 7y + 4z + 7aw 4 r + r 3 r 3 e + e 3 e 3 3 a 7 4 7a 4 4 x + y 3z + aw 4 7y + 4z + 7aw 4 7 r 7 e 3 a a 4 x + y 3z + aw 4 y z aw r + r r e + e e 3a a x + z + 3aw y z aw x +z +3aw Thus, the equivalent system is and its solutions are y z aw x t 3as, y + t + as, z t, w s for s, t R Gaussian elimination Definition A matrix is said to be in reduced row-echelon form if it has the following properties: If a row does not consist entirely of zeros, then the first nonzero number in the row is a, called a leading 7

8 If there are any rows that consist entirely of zeros, then they are grouped together at the bottom of the matrix 3 In any two successive rows that do not consist entirely of zeros, the leading in the lower row occurs farther to the right than the leading in the higher row 4 Each column that contains a leading has zero everywhere else A matrix satisfying just the first 3 properties, namely, and 3, is said to be in row-echelon form We are now going to provide a number of steps in order to reduce a matrix to a (reduced) rowechelon form These are: Locate the lefmost column that does not consist entirely of zeros; Interchange the top row with another row, if necessary, to bring a nonzero entry to the top of the column found in Step ; 3 If the entry that is now at the top of the column found in Step is a, multiply the first row by a in order to introduce a leading ; 4 Add suitable multiples of the top row to the rows below so that all entries below the leading become zeros; 5 Cover the top row in the matrix and begin again with the Step applied to the submatrix that remains Continue in this way until the entire matrix is in row-echelon form 6 Once you got the matrix in row-echelon form, beginning with the last nonzero row and working upward, add suitable multiples of each row to the rows above to introduce zeros above the leading s The variables corresponding to the leading s in row echelon form are called leading variables and the others are called free variables The above procedure for reducing a matrix to reduced row-echelon form is called Gauss-Jordan elimination If we use only the first five steps, the procedure produces a row-echelon form and is called Gaussian elimination Examples Solve the linear system x y + z w x + y z w x + y 4z + w 3x 3w 3 () 8

9 Solution: The augmented matrix is and it can be reduced at reduced row-echelon form as follows: r +r r r + r 3 r r 4 3r + r 4 r r + r 3 r 3 3r + r 4 r 4 r + r r such that the corresponding linear system, equivalent with the initial one, is x t x w y z and its solutions are y s z s, s, t R, w t being infinitely many in this case It is sometimes preferable to solve a linear system by using Gauss elimination procedure for the augmented matrix to bring it just in a row-echelon form and to use the so called back-substitution method afterward For the linear system, a row-echelon form of the augmented matrix is and its corresponding linear system is x y + z w y z The back-substitution method consists in the following three steps: (a) Solve the equations for the leading variables in terms of the free variables; (b) Beginning with the bottom equation and working upward, successively substitute each equation into all the equations above it 9

10 (c) Assign arbitrary values to the free variables, if any In our particular case x, y are the leading variables and z, w are the free variables Therefore the step (a) is The step (b) is x y z + w y z x z z + w y z or equivalently x w y z Finally, the step (c) consists in assigning to the free variables z, w the arbitrary values z s and w t such that the solutions of the initial linear system are: x t y s z s w t, s, t R Solve the linear system x + 7y z 3x y + z 4 x + 6y z 5 7 Solution: The augmented matrix is 3 4 and it can be reduced at reduced 6 5 row-echelon form as follows: r 3r + r r r + r 3 r r + r 3 r /r r + r r 4 4 such that the corresponding linear system, equivalent with the initial one, is 9 7/ x + 4 z 9 y 4 z 7/ and its solutions are x 9 5t y 7+5t z t t R

11 3 Solve the linear system x x + x 3 4x 4 x + 3x + 7x 3 + x 4 x x x 3 6x Solution: The augmented matrix is 3 7 and it can be reduced at 6 5 reduced row-echelon form as follows: 4 4 r r r r r 3 r 3 r + r 3 r r + r 3 r Thus the system is inconsistent, that is it has no solutions at all, since For which values of a R the following linear system has no solution? Exactly one solution? Infinitely many solutions? When the system is consistent, find its solution set x y z x 4y 6z 6 3x 5y + (a 4)z a 4 Solution: The augmented matrix is and it will be reduced by 3 5 a 4 a 4 performing successively the following row-operations: r r r 4 6 r 3r 3 5 a + r 3 r 3 4 a 4 a 8 a 4 r a 8 r 3 + r 3 r 3 3 a 4 a 4 a + }{{} ( ) a 4 if a {±}

12 a 4 if a {±} 3 a r + r r if a {±} 3 3a 8 a r 3 +r r r 3 + r r if a {±} a a 3 a a r + r r if a {±} Therefore for a {±} the given linear system has the unique solutions x 3, y 3a 8 a, z a If a, the ( ) reduced matrix becomes r 3 + r r and in this case the given linear system has infinitely many solutions 3 3, x 3, y 3 s, z s, s R Finally, when a, the ( ) reduced matrix becomes solutions at all in this case 3 4 and linear system has no 3 Matrices and matrix operations Definition 3 A matrix A a a a n a a a n a m a m a mn row row row m col col coln equally written [a ij ] m n (or simply [a ij ]), is a rectangular array of numbers The numbers in the array are called entries The entry in row i and column j of a matrix A is commonly denoted by (A) ij, in our particular case (A) ij a ij The size of a matrix is described in terms of the number of rows and the number of columns it has The above matrix A has size m n A matrix x x x x m

13 with only one column is called a column matrix (or a column vector), and a matrix [ y y y y n ] with only one row is called row matrix (or a row vector) A matrix a a a n a A a a n, a n a n a nn with n rows and n columns, that is of size n n, is called a square matrix of order n and the entries a, a,, a nn are said to be on the main diagonal of A Definition 3 Two matrices are said to be equal if they have the same size and their corresponding entries are equal Definition 33 If A a a a n a a a n, B b b b n b b b n, a m a m a mn b m b m b mn are matrices of the same size, then their sum is the matrix a + b a + b a n + b n a A + B + b a + b a n + b n, and their difference is the matrix A B a m + b m a m + b m a mn + b mn a b a b a n b n a b a b a n b n a m b m a m b m a mn b mn One can shortly define the entries of the sum and the difference matrices in the following way: (A + B) ij (A) ij + (B) ij and (A B) ij (A) ij (B) ij 3

14 If the matrices A and B have different sizes, then their sum and difference is not defined If c is any scalar (number), then the product ca is the matrix ca ca ca n ca ca ca n ca m ca m ca mn obtained by multiplying each entry of A with c and its entries can be shortly written as (ca) ij c(a) ij If A, A,, A n are matrices of the same size and c, c,, c n are scalars, then the matrix c A + c A + + c n A n is defined and it is called a linear combination of A, A,, A n with coefficients c, c,, c n Examples 34 Consider the matrices A 3, B 4 3, C 3 4 5, D Compute, when is possible, A B, C + D, B C, A + C, Solution: A B D + E B C and A + C are not defined Compute, when possible, 3A, ( )B, A B, 3C + D, 5B + 6D Solution: 3 A 3, ( )B A B C+D B + 6D is not defined 4

15 Definition 35 Lat A be an m n matrix and B be an n p matrix Then the product AB is the m p matrix C whose entry c ij in row i and column j is obtained as follows: Sum the products formed by multiplying, in order, each entry in row i of the matrix A with the corresponding entry in column j of the matrix B More precisely c ij a i b j + a i b j + + a in b nj n a ik b kj k A B C m n n p m p must be the same size of product AB a a a n a a a n a i a i a in a m a m a mn b b b j b p b b b j b p b n b n b nj b np n a k b k k n a k b k k n a ik b k k n a mk b k k n a k b k k n a k b k k n a k b kj k n a k b kj k n a k b kp k n a k b kp k n n n a ik b k a ik b kj a ik b kp k k k n n n a mk b k a mk b kj a mk b kp k Definition 36 The transpose of an m n matrix A, denoted by A T, is the n m matrix whose i th row is the i th column of A Thus (A T ) ij (A) ji Observe that for any matrix A we have (A T ) T A Example 37 If A 3 matrices AB, BA, (AB) T, (BA) T, A T B T, B T A T k k and B 3, find, when possible, the 4 3 5

16 Solution: then we have AB 3 3 }{{} }{{} ( ) 4 + ( ) + ( ) 3 + ( ) + ( ) + + ( ) ( ) ( ) , such that (AB) T }{{} 4 3 }{{} 4 Observe that the product BA, (BA) T, A T B T are not defined However, observe that 3 4 B T 3 and A T, 3 }{{}}{{} such that the product B T A T is also defined and B T A T 3 7 (AB) T 4 3 }{{} 3 }{{} 3 }{{} Definition 38 If A is a square matrix, then the trace of A, denoted by tr(a), is defined to be the sum of the entries on the main diagonal, namely tr(a) : (A) + (A) + + (A) nn, where n is the order of A The trace of A is not defined if A is not a square matrix Example 39 Find, when possible, tr(aa T ) and tr(ab), where A and B

17 We first observe that AA T 3 3, such that tr(aa T ) }{{} Since AB is not a square matrix, its trace is not defined } 8 7 {{ 4 3 } 4 If A ij, i m, j n are matrices of suitable sizes, then we can form a new matrix A A A n A A A A n A m A m A mn and call partition of the matrix A the above kind of subdivision For example A A A A A 3 A where A, A 3, A 3 3 5, A 5, A 7, A 3 6 An application of matrix multiplication operation consists in transforming a system of linear equations into a matrix equation Indeed, for a linear system we have successively: a x + a x + + a n x n b a x + a x + + a n x n b a x + a x + + a n x n a x + a x + + a n x n b b a m x + a m x + + a mn x n b m a m x + a m x + + a mn x n b m 7

18 a a a n a a a n x x b b AX B The matrix } a m a m {{ a mn }} x n {{ } A X a a a n a A a a n b m } {{ } B a m a m a mn is called the coefficient matrix of the linear system Observe that the augmented matrix of the [ ] system is A B 4 Inverses Rules of matrix arithmetic Theorem 4 Assuming that the sizes of matrices are such that the indicated operations can be performed, the following rules of matrix arithmetic are valid: A + B B + A; (A + B) + C A + (B + C); 3 (AB)C A(BC); 4 A(B + C) AB + AC; 5 (A + B)C AC + BC; 6 A(B C) AB AC; 7 (A B)C AC BC; 8 a(b + C) ab + ac; 9 a(b C) ab ac; (a + b)c ac + bc; (a b)c ac bc; a(bc) (ab)c; 8

19 3 a(bc) (ab)c B(aC) Remark 4 The matrix multiplication is not commutative Indeed, for example if A, B, 3 3 then AB BA Define the m n zero matrix to be the matrix O m n : denoted by O when the size is understood from context and it will be equally m n Theorem 43 Assuming that the sizes of the matrices are such that the indicated operations can be performed, the following rules of matrix arithmetic are valid A + O O + A A; A A O; 3 O A A; 4 AO O The identity matrix of order n is defined to be the square the n n matrix I n :, and it will be equally denoted by I when the order is understood from context Remark 44 If A is an m n matrix, then AI n I m A A n n Theorem 45 If R is the reduced row-echelon form of an n n matrix A, then either R has a row of zeros, or R is the identity matrix 9

20 Definition 46 A square matrix A is said to be invertible if there is another square matrix B, of the same size, such that AB BA I Remark 47 If B, C are both inverses of a A, then B C Indeed, we have successively: B BI B(AC) (BA)C IC C Therefore, the inverse of an invertible matrix A is unique and denoted by A, being characterized by the equalities: AA A A I Example 48 If a, b, c, d R are such that ad bc, then the matrix A invertible and A ad bc a b } c d {{ } A d b c a d ad bc b ad bc c ad bc a ad bc d ad bc b ad bc c ad bc ad bc ad bc cd dc ad bc a ad bc Indeed we have ab+ba ad bc cb+da ad bc a c b d is and similarly d ad bc b ad bc c ad bc a ad bc a c b d } {{ } A da bc ad bc ca+ac ad bc db bd ad bc cb+ad ad bc If A is a square matrix, then its positive powers are defined to be A I, A n AA }{{ A} for n > n times Moreover, if A is invertible, then A n A} A {{ A }, also for n > n times Theorem 49 If A is an invertible matrix, then A is also invertible and (A ) A; A n is invertible and (A n ) (A ) n for n {,,, }; 3 A T is invertible and (A T ) (A ) T ; 4 For any non-zero scalar k, the matrix ka is invertible and (ka) k A ; 5 A m A n A m+n for any integers m, n; 6 (A m ) n A mn for any integers m, n Theorem 4 If the sizes of the involved matrices are such that the stated operations can be performed, then

21 (A T ) T A; (A + B) T A T + B T and (A B) T A T B T ; 3 (ka) T ka T, where k is any scalar; 4 (AB) T B T A T Example 4 Find the matrix A knowing that (I + A) 4 5 Solution: Since (I + A), it follows that [(I + A) ] Therefore we have successively I + A 5 ( ) I + A A A A A A A If A cos θ sin θ sin θ cos θ, show that A cos θ sin θ sin θ cos θ and A 3 cos 3θ sin 3θ sin 3θ cos 3θ Solution: Indeed, A cos θ sin θ sin θ cos θ cos θ sin θ sin θ cos θ cos θ sin θ sin θ cos θ sin θ cos θ cos θ sin θ cos θ sin θ sin θ cos θ

22 A 3 AA cos θ sin θ sin θ cos θ cos θ sin θ sin θ cos θ cos θ cos θ sin θ sin θ (cos θ sin θ + sin θ cos θ) sin θ cos θ + cos θ sin θ sin θ sin θ + cos θ cos θ cos(θ + θ) sin(θ + θ) sin(θ + θ) cos(θ + θ) cos 3θ sin 3θ sin 3θ cos 3θ 5 Elementary matrices and a method for finding A Definition 5 An n n matrix is called an elementary matrix if it can be obtain from the n n identity matrix I n by performing a single elementary row operation Example 5 3r I 3 + r 3 r 3 E elementary matrix If A 6 3, then EA 6 3 r 3 r 3 +r A Theorem 53 If the elementary matrix E results from performing a certain row operation on I m and A is an m n matrix, then the product EA is the matrix that results when the same row operation is performed on A If an elementary operation is performed on the identity matrix I to obtain an elementary matrix E, then there is another operation, called the corresponding inverse operation, when apply to E to obtain I back again Direct Operation Corresponding Inverse operation Multiply row i by c (cr i ) Multiply row i by c ( c r ) i Interchange rows i and j (i j) Interchange rows i and j (i j) Add c times row i to row j (cr i + r j r j ) Add c times row i to row j ( cr i + r j r j )

23 Theorem 54 Every elementary matrix is invertible, and the inverse is also an elementary matrix Proof If I dir op E inv op I Dacă I inv op E, then E E I and EE I, namely E is invertible Theorem 55 If A is an n n matrix, then the following statements are equivalent: A is invertible; The homogeneous linear system AX O has only the trivial solution; 3 The reduced row-echelon form of A is I n ; 4 A is expressible as a product of elementary matrices The last statement, (4), of theorem 67 is of particular importance since it provide us a method of finding the reduced row-echelon form of a matrix and a method of finding the inverse of an invertible matrix Let A be a matrix and R be its reduced row-echelon form, namely A op op A op 3 op A n R, then R E n E A, where I op E, I op E,, I op n E n Therefore A (E n E ) R E E n R If A is particularly invertible, then R I, such that A E E and implicitly n A E n E Thus, in order to find the inverse of an invertible matrix A, we first observe that we have the general property A[BC] [ABAC] and that we have successively: [AI] op E [AI] [E AE I] op E [E AE I] [E E AE E I] op 3 op n [E n E A }{{} I E n E I] }{{} A 4 Examples 56 Find the inverse of the matrix A 3 7 and write A as a 5 product of elementary matrices; 3

24 Express the matrix 7 8 A in the form A EF GR, where E, F, G are elementary matrices and R in row-echelon form () 4 3 r r r 3r r r r + r 3 r r r r 3r 3 + r r }{{} A Therefore E 5 E 4 E 3 E E A I 3, where r I 3 + r r : E 3r I 3 + r r 3 : E r I 3 + r 3 r 3 : E 3 r I r r : E 4 3 3r I r r : E 5 () r A r r r 3 r

25 r + r 3 r r + r 3 r R matrix in row-echelon form Consequently R E 3 E E A, or equivalently A E E E R, where 3 r I 3 r : E E I 3 r + r 3 r 3 r + r 3 r 3 :E :E I 3 r + r 3 r 3 r + r 3 r 3 :E 3 :E 3 Now it is enough to take E E, F E, G E 3 6 Further results on systems of equations and invertibility Theorem 6 Every system of linear equations has either no solution, exactly one solution or infinitely many solutions Theorem 6 If A is an invertible n n matrix, then for each n matrix b, the system of linear equations AX B has exactly one solution, namely X A B Example 63 Find the solution set of the following linear system: x y + 4z 3x + y 7z x 5z 5

26 Solution: We first observe that the coefficient matrix of the given linear system is A , which is invertible and its inverse is A The given linear 5 x system can be written in the form AX B, where X y and B Consequently the z unique solution of the given linear system is x A B Frequently, one have to solve a sequence of linear systems AX B, AX B,, AX B k each of which has the same square matrix A If A is invertible then the solutions are X A B, X A B,, X k A B k Otherwise the method of solving those systems, which works both for A invertible or A noninvertible, consists in forming the matrix [A B B B k ] and by reducing it to the reduced row-echelon form Example 64 Solve the following linear systems: x y + 4z 3x + y 7z x 5z, x y + 4z 3x + y 7z x 5z 3 Theorem 65 Let A be a square matrix If B is a square matrix satisfying BA I, then B A ; If B is a square matrix satisfying AB I, then B A Theorem 66 Theorem 67 If A is an n n matrix, then the following statements are equivalent: A is invertible (*); 6

27 The homogeneous linear system AX O has only the trivial solution; 3 The reduced row-echelon form of A is I n ; 4 A is expressible as a product of elementary matrices 5 AX B is consistent for every n matrix B;(*) 6 AX B has exactly one solution for every n matrix B(*) Theorem 68 Let A and B be square matrices of the same size If AB is invertible, then A and B are both invertible Fundamental Problem 69 Let A be a fixed m n matrix Find all m matrices B such that the system of equations AX B is consistent Example 6 What conditions must a, b, b, b 3 satisfy in order for the system of the linear system x + y z b x y + z b to be consistent? x + y + z b 3 Solution: For the augmented matrix of the given linear system we have successively: b a b r + r r r + r r b 3 3 b r + r 3 r 3 b b b 3 + b a b r + r r 3 3 b b b 3 + b + b Thus, the given linear system is consistent if and only if b 3 + b + b 7 Diagonal, Triangular and Symmetric Matrices Definition 7 A square matrix in which all the entries off the diagonal are zero is called a diagonal matrix The general form a of a diagonal matrix is d d D d n 7

28 Remarks 7 The diagonal matrix D d d d n is invertible iff all of its diagonal entries are non-zero In this case d D d d n Powers of diagonal matrices are easy to be computed More precisely, if d d k d D then D k d k d n d k n 3 If A [a ij ] is an m n matrix, then δ a a a n δ a a a n δ a δ a δ a n δ a δ a δ a n δ m a m a m a mn δ m a m δ m a m δ m a mn and a a a n a a a n d d a d a d a n d n a d a d a n d n a m a m a mn d n a m d a m d a mn d n Examples 73 Find a diagonal matrix A satisfying 9 A 4 8

29 Solution: We have successively: A 9 4 [A ] 9 4 A 9 4 A ( 3 ) ( Thus, such a matrix is A 3 Definition 74 A square matrix in which all the entries above the main diagonal are zero is called lower triangular and a square matrix in which all the entries below the main diagonal are zero is called upper triangular A matrix which is either lower triangular or upper triangular is called triangular The general form a of a lower triangular matrix is a a a a n a n a nn and the general form a of a upper triangular matrix is a a a n a a n a nn Remark 75 A square matrix A [a ij ] is upper triangular iff a ij for i > j; A square matrix A [a ij ] is lower triangular iff a ij for i < j Theorem 76 The transpose of a lower triangular matrix is upper triangular, and the transpose of an upper triangular matrix is lower triangular; The product of lower triangular matrices is a lower triangular matrix; 9

30 3 The product of upper triangular matrices is a upper triangular matrix; 4 A triangular matrix is invertible if and only if its diagonal entries are all nonzero; 5 The inverse of a lower triangular matrix is lower triangular and the inverse of an upper triangular matrix is upper triangular Example 77 If A 3 and B 3 5, show that AB is also upper triangular and find (AB) and B A Solution: R, R, 5 R R + R 3 R 5 Thus 9 (AB) B A 9 5 R + R R 9 R + R R Definition 78 A square matrix A is called symmetric if A T A, or equivalently (A) ij (A) ji Theorem 79 If A, B are symmetric matrices of the same size and k is any scalar, then: A T is symmetric; A + B and A B are symmetric; 3 ka is symmetric Theorem 7 matrices commute; The product of two symmetric matrices is symmetric if and only if the 3

31 If A is an invertible symmetric matrix, then A is symmetric Theorem 7 If A is an arbitrary matrix, then AA T and A T A are symmetric matrices; If A is an invertible matrix, then AA T and A T A are invertible matrices Example 7 Find the values of a, b, c R for which the matrix A is symmetric, where a + b + c 4b 3c A 5 a + c 4 6 Solution: The required values are solutions of the linear system a + b + c 5 4b 3c a + c 4 can be solved by performing row-reduction operations in the corresponding augumented matrix, namely: 5 5 r +r 3 r r 4 r r +r 3 r r The corresponding linear system of the last matrix in the above row-reduction process, which is equivalent with the initial one, has the unique solution a, b c that 3

32 3

33 Chapter Determinants The determinant function Definition A permutation of the set {,,, n} is a bijective function σ : {,,, n} {,,, n}, namely an arrangement of the integers,,, n without omissions or repetitions It is also written σ n σ() σ() σ(n) An inversion of the permutation σ is a pair (i, j) such that i < j and σ(i) > σ(j) Denote by m(σ) the number of inversions of σ and by ε(σ) the signature ( ) ε(σ) of σ A permutation σ is called even/odd if m(σ) is even/odd, or equivalently ε(σ) +/ε(σ) Definition The determinant of a square n n matrix A [a ij ] is defined to be det(a) ε(σ)a σ() a σ() a nσ(n) It is denoted either by det(a) or by a a a n a a a n a n a n a nn Remarks 3 If A a a is a square matrix, then det(a) a a a a a a Indeed, the only permutations are e and σ and ε(e), 33

34 ε(σ) since m(e) and m(σ) Thus det a a a a a a a a ε(e)a a + ε(σ)a a a a a a e() e() σ() σ() For example 3 ( ) A matrix A a a a a is invertible if and only if det(a) In this case A a a det(a) a a a a a 3 3 If A a a a 3 is a square matrix, then a 3 a 3 a 33 a a a 3 det(a) a a a 3 a 3 a 3 a 33 a a a 33 +a a 3 a 3 +a 3 a a 3 a 3 a a 3 a a a 33 a a 3 a 3 a a a a a 3 a a a a a 3 a 3 a 3 a 33 a 3 a Indeed, the only 3 3 square matrices are e 3, σ : 3, σ 3, σ 3 3, σ 4 3, σ and ε(e) ε(σ 4 ) ε(σ 5 ) while ε(σ ) ε(σ ) ε(σ 4 ) since m(e), m(σ 4 ) m(σ 5 ) and m(σ ), m(σ ) 3, m(σ 3 ) For example ( 8)

35 Evaluating determinants by row reduction Theorem Let A be a square matrix If A has a row of zeros, then det(a) det(a) det(a T ) Theorem If A is an n n triangular matrix, then det(a) is the product of the entries on the main diagonal, namely det(a) a a a nn Theorem 3 Let A be an n n square matrix If B is the matrix that results when a single row or a single column of A is multiplied by a scalar k, then det(b) k det(a); Consequently det(ka) k n det(a) If B is the matrix that results when two rows or two columns of A are interchanged, then det(b) det(a); 3 If B is the matrix that results when a multiple of one row of A is added to another row or when a multiple of one column of A is added to another column, then det(b) det(a) Corollary 4 If A is a square matrix with two proportional rows or two proportional columns, then (A) Example 5 Find the determinant of A 3 4 Solution: ( ) det(a) 3 4 r + r r 3 4 ( ) ( + ) 4 35

36 3 Properties of determinant function Theorem 3 Let A, B and C be n n matrices that differ only in a single row, say the r th, and assume that the r th row of C can be obtained by adding corresponding entries in the r th row of A and B Then det(c) det(a) + det(b) In other words a a a n a a a n a + a a + a a n + a n a m a m a mn a a a n a a a n a a a n a m a m a mn + a a a n a a a n a a a n a m a m a mn Theorem 3 If A and B are square matrices of the same size, then det(ab) det(a) det(b) Theorem 33 If A is an invertible matrix, then det(a ) det(a) Theorem 34 If A is an n n matrix, then the following statements are equivalent: A is invertible;(*) The homogeneous linear system AX O has only the trivial solution; 3 The reduced row-echelon form of A is I n ; 4 A is expressible as a product of elementary matrices 5 AX B is consistent for every n matrix B; 6 AX B has exactly one solution for every n matrix B 7 det(a) (*) Example 35 Consider the matrix A for all x, y, z, w R x y z w w x y z y + z z + w w + x x + y Show that det(a) Solution: For the determinant of A we have successively: x y z w r +r 4 r 4 x y z w w x y z w x y z y + z z + w w + x x + y x + y + z y + z + w z + w + x w + x + y 36

37 r 3 +r 4 r 4 x y z w w x y z x + y + z + w x + y + z + w y + z + w + x z + w + x + y (x + y + z + w) x y z w w x y z for all x, y, z, w R Let A a b c d e f g h i Assuming that det(a) 7, find det(3a), det(a ), det(a ) and det a g d b h e c i f Solution: det(3a) 3 3 det(a) 7( 7) det(a ) det(a) 7 7 ( ) det(a ) 3 det(a ) det a g d b h e c i f det a g d b h e c i f T a b c g h i d e f a b c d e f g h i ( 7) 7 3 Show that a + b t a + b t a 3 + b 3 t a t + b a t + b a 3 t + b 3 c c c 3 ( t ) a a a 3 b b b 3 c c c 3 37

38 Solution: Indeed, we have successively: a + b t a + b t a 3 + b 3 t a t + b a t + b a 3 t + b 3 c c c 3 a a a 3 a t + b a t + b a 3 t + b 3 c c c 3 + b t b t b 3 t a t + b a t + b a 3 t + b 3 c c c 3 a a a 3 a t a t a 3 t c c c 3 }{{} + a a a 3 b b b 3 c c c 3 + b t b t b 3 t a t a t a 3 t c c c 3 + b t b t b 3 t b b b 3 c c c 3 }{{} a a a 3 b b b 3 c c c 3 + t b b b 3 a a a 3 c c c 3 a a a 3 b b b 3 c c c 3 t a a a 3 b b b 3 c c c 3 ( t ) a a a 3 b b b 3 c c c 3 4 Cofactor expansion Cramer s rule Definition 4 If A is a square matrix, then the minor of entry a ij is denoted by M ij and is defined to be the determinant of the submatrix that remains after the i th row and the j th column are deleted from A The number ( ) i+j M ij is denoted by C ij and is called the cofactor of entry a ij Example 4 a a a 3 a a a 3 a 3 a 3 a 33 a a a 33 + a a 3 a 3 + a 3 a a 3 a 3 a a 3 a a a 33 a a 3 a 3 a (a a 33 a 3 a 3 ) a (a a a 33 a 3 a 3 ) + a 3 (a a 3 a a 3 ) ( ) + a a a 3 a 3 a 33 + ( )+ a a a 3 a 3 a 33 + ( )+3 a 3 a a a 3 a 3 a C + a C + a 3 C 3 38

39 Similarly a a a 3 a a a 3 a 3 a 3 a 33 a a a 33 + a a 3 a 3 + a 3 a a 3 a 3 a a 3 a a a 33 a a 3 a 3 a (a a 33 a 3 a 3 ) + a (a a 33 a 3 a 3 ) a 3 (a a 3 a 3 a ) ( ) + a a 3 a 3 a 33 + ( )+ a a 3 a 3 a 33 + ( )3+ a a 3 a a 3 a C + a C + a 3 C 3 Theorem 43 If A [a ij ] is a square n n matrix, then det(a) a i C i + a i C i + + a in C in }{{} The cofactor expansion of det(a) along the i th row a j C j + a j C j + + a nj C nj }{{} The cofactor expansion of det(a) along the j th column Example 44 Show that: a a a 3 a 4 a a a 3 a 4 a 3 a 3 a 3 3 a 3 4 (a a )(a a 3 )(a a 4 )(a a 3 )(a a 4 )(a 3 a 4 ) If A [a ij ] is a square n n matrix and C ij is the cofactor of the entry a ij, then the matrix C C C n C C C n C n C n C nn is called the matrix of cofactors from A The transpose of this matrix is called the adjoint of A and is denoted by adj(a) If A is an invertible matrix, then A det(a) adj(a) The inverse of an invertible lower triangular matrix is lower triangular and the inverse of an invertible upper triangular matrix is upper triangular Find necessary and sufficient conditions on a, b, c R A a a a a a a such that the matrix A is invertible In those cases find A 39

40 According to theorem 34, A is invertible if and only if det(a) But since det(a) V (a, b, c) a b c (c a)(c b)(b a), a b c it follows that A is invertible if and only if a b, b c and c a In this case C A det(a) adj(a) C C 3 C det(a) C C 3 T C 3 C 3 C 33 (c a)(c b)(b a) b c b c b c b c a c a c a c a c a b a b a b a b T (c a)(c b)(b a) bc(c b) ac(c a) ab(b a) (c b ) c a (b a ) c b (c a) b a T (c a)(c b)(b a) bc(c b) b c c b ac(a c) c a a c ab(b a) a b b a bc(c b) (c a)(c b)(b a) ac(a c) (c a)(c b)(b a) ab(b a) (c a)(c b)(b a) (b c)(b+c) (c a)(c b)(b a) (c a)(c+a) (c a)(c b)(b a) (a b)(a+b) (c a)(c b)(b a) c b (c a)(c b)(b a) a c (c a)(c b)(b a) b a (c a)(c b)(b a) bc (c a)(b a) ac (c b)(a b) ab (c a)(c b) b+c (a c)(b a) c+a (c b)(b a) a+b (c a)(b c) (c a)(b a) (c b)(a b) (c a)(c b) (Cramer s Rule) If AX B is a system of n linear equations in n unknowns such that det(a), then the system has a unique solution This solution s where A j matrix B x det(a ) det(a), x det(a ) det(a),, x n det(a n) det(a), is the matrix obtained from A by replacing its j th row with the entries of the column Provide necessary and sufficient conditions on a, a, a 3, a 4 R such that the linear 4

41 system x + y + z + w ax + by + cz + dw α a x + b y + c z + d w α a 3 x + b 3 y + c 3 z + d 3 w α 3 () has exactly one solution for each α R In this case solve the system by using the Cramer s rule The given linear system has a unique solution for each α R if and only if its coefficient matrix A is invertible, or, equivalently det(a) But since a b c d a b c d a 3 b 3 c 3 d 3 det(a) V (a, b, c, d) (d a)(d b)(d c)(c a)(c b)(b a), it follows that the given linear system has unique solution for each α R if and only if the scalars a, b, c, d are pairwise disjoint By Crammer s rule, it follows that the unique solution of the system is x y z w V (α, b, c, d) V (a, b, c, d) V (a, α, c, d) V (a, b, c, d) V (a, b, α, d) V (a, b, c, d) V (a, b, c, α) V (a, b, c, d) (d α)(c α)(b α) (d a)(c a)(b a) ; (α a)(c α)(d α) (b a)(c b)(d b) ; (α a)(α b)(d α) (c a)(c b)(d c) ; (α a)(α b)(α c) (d a)(d b)(d c) 4

42 4

43 Chapter 3 Euclidean vector spaces 3 Euclidean n-space Definition 3 If n is a positive integer, then an ordered n-tuple is a sequence of n numbers (a, a,, a n ) The set of R n of all n-tuples is called n-space A -tuple is also called ordered pair and a 3-tuple is called ordered triple and both of them have geometric interpretation Thus an n-tuple can be viewed as either an generalized point or a generalized vector Definition 3 Two vectors u (u, u,, u n ) and v (v, v,, v n ) in R n are called equal if u v, u v,, u n v n Their sum u + v is defined by u + v (u + v, u + v,, u n + v n ) and, for a sscalar k, the scalar multiple is defined by ku (ku, ku,, ku n ) The zerovector in R n is denoted by and is defined to be the vector (,,, ) If u (u, u,, u n ) R n is any vector, the negative or additive inverse of u is denoted by u and is defined by u ( u, u,, u n ) The difference u v of the vectors (u, u,, u n ), v (v, v,, v n ) R n is defined by u v : u + ( v) In termes of components we have u v (u v, u v,, u n v n ) Theorem 33 If u (u, u,, u n ), v (v, v,, v n ), w (w, w,, w n ) R n and k, l are scalars, then u + v v + u u + (v + w) (u + v) + w 3 u + + u u 4 u + ( u), namely u u 43

44 5 k(lu) (kl)u 6 k(u + v) ku + kv 7 (k + l)u ku + lu 8 u u Definition 34 If u (u, u,, u n ), v (v, v,, v n ) R n are any vectors, then the Euclidean Product u v is defined by u v : u v + u v + + u n v n Theorem 35 If u (u, u,, u n ), v (v, v,, v n ), w (w, w,, w n ) R n and k, l are scalars, then u v v u k(u v) (ku) v u (kv) 3 (u + v) w u w + v w 4 u u and u u if and only if u Definition 36 The Euclidean norm or the Euclidean length u of a vector u (u, u,, u n ) R n is defined by u : u u u + u + + u and the distance d(u, v) n between the points u (u, u,, u n ), v (v, v,, v n ) R n is defined by d(u, v) u v (u v ) + (u v ) + + (u n v n ) Theorem 37 (Cauchy-Schwarz Inequality in R n ) If u (u, u,, u n ), v (v, v,, v n ) R n, then u v u v In terms of components, the inequality becomes u v + u v + + u n v n u + u + + u v + n v + + v n Theorem 38 If u, v R n and k is any scalar, then u u if and only if u 3 ku k u 44

45 4 u + v u + v (Triangle inequality) Theorem 39 If u, v, w R n and k is any scalar, then d(u, v) d(u, v) if and only if u v 3 d(u, v) d(v, u) 4 d(u, v) d(u, w) + d(w, v) (Triangle inequality) Theorem 3 If u, v R n, then u v 4 u + v 4 u v Proof Indeed, by adding the identities u + v (u + v) (u + v) u + u v + v u v (u v) (u v) u u v + v, we immediately get the required identity Definition 3 Two vectors u, v R n are said to be orthogonal if u v Theorem 3 (Theorem of Pythagoras for R n ) If u, v R n are orthogonal vectors, then the equality u + v u + v holds Proof Indeed, we have successively: u + v (u + v) (u + v) u + u v + v u + v A vector u (u,, u n ) R n can be naturally identified with a column or with a row matrix, namely with u u u or u [u u u n ] u n Consequently, the set R n of n-tuples can be naturally identified with either the space of column matrices, or with the space of row matrices The sum u + v of two vectors u (u,, u n ), v (v,, v n ) will be identified consquently identified with the sum u v u + v u u + v v + u + v u n v n u n + v n 45

46 of the column matrices u and v, or with the sum u + v [u u u n ] + [v v v n ] [u + v u + v u n + v n ] of the row matrices u and v Similarly, the scalar multiple ku of the real k with the ordered n-tuple u (u, u,, u n ) can be either identified with the scalar multiple ku k u u u n ku ku ku n, or with the scalar multiple ku k[u, u,, u n ] [ku, ku, ku n ] 3 Linear transformations from R n to R m Definition 3 A mapping T A : R n R m, T A (x) Ax, where A is an m n matrix, is called linear transformation, or linear operator, if m n The linear transformation T A is equally called the multiplication by A If A [a ij ] mn, then T ( x x x n ) a a a n a a a n a m a m a mn x x x n a x + a x + + a n x n a x + a x + + a n x n a m x + a m x + + a mn x n Observe that T ( ) a a a m, T ( ) a a a m,, T ( ) a n a n a mn The matrix A is called the standard matrix of the linear transformation T and it is usually denoted by [T ] and the multiplication by A mapping is also denoted by T A Therefore [T ] 46

47 [T (e )T (e ) T (e n )], where e, e,, e n The orthogonal projection of R on the x-axis, p x : R R, p x (x, x ) (x, ) is a linear mapping since and [p x ] ( p x x x Its equations are : ) x w x w x x The orthogonal projection of R on the y-axis, p y : R R, p y (y, y ) (, y ) is a linear mapping since and [p y ] ( p y y y Its equations are : ) y w w y y y 3 The reflection of R 3 about the x x -plane, S x x : R 3 R 3, S x x (x, y, z) (x, y, z) is a linear mapping since ( S x x x y z ) x y z x y z and [S x x ] Its equations are : w x w y w 3 z 4 The reflection of R 3 about the x x 3 -plane, S x x 3 : R 3 R 3, S x x 3 (x, y, z) (x, y, z) is a linear mapping since ( S x x 3 x y z ) x y z x y z 47

48 and [S x x 3 ] Its equations are : w x w y w 3 z 5 The reflection of R 3 about the x x 3 -plane, S x x 3 : R 3 R 3, S x x 3 (x, y, z) (x, y, z) is a linear mapping since x x ( ) S x x 3 y y z z w x and [S x x 3 ] Its equations are : w y w 3 z x y z 6 The orthogonal projection of R 3 on the x x -plane, P x x : R 3 R 3, P x x (x, y, z) (x, y, ) is a linear mapping since x x ( ) P x x y y z w x and [P x x ] Its equations are : w y w 3 x y z 7 The orthogonal projection of R 3 on the x x 3 -plane, P x x 3 : R 3 R 3, P x x 3 (x, y, z) (x,, z) is a linear mapping since x x ( ) P x x 3 y z z w x and [P x x 3 ] Its equations are : w w 3 z x y z 8 The orthogonal projection of R 3 on the x x 3 -plane, P x x 3 : R 3 R 3, P x x 3 (x, y, z) (, y, z) is a linear mapping since ( P x x 3 x y z ) y z x y z 48

49 and [P x x 3 ] Its equations are: w w y w 3 z 9 The rotation operator of R through a fixed angle θ, R θ : R R, R θ (x cos θ y sin θ, x sin θ + y cos θ) is a linear mapping since ( R x ) x cos θ y sin θ θ cos θ sin θ x y x sin θ + y cos θ sin θ cos θ y and [R θ ] cos θ sin θ w x cos θ y sin θ Its equations are: sin θ cos θ w x sin θ + y cos θ Indeed, the rotation operator R θ rotates the point (x, y) (r cos ϕ, r sin ϕ), counterclockwise with the angle θ if θ > and clockwise if θ <, the coordinates of the rotated point being w x cos θ y sin θ (w, w ) (r cos(θ + ϕ), r sin(θ + ϕ)), such that one gets w x sin θ + y cos θ The rotation operator of R 3 through a fixed angle θ about an oriented axis, rotates about the axis of rotation each point of R 3 in such a way that its associated vector sweeps out some portion of the cone determine by the vector itself an by a vector which gives the direction and the orientation of the considered oriented axis The angle of the rotattion is measured at the base of the cone and it is measured clockwise or counterclockwise in relation with a viewpoint along the axis looking toward the origin As in R, the positives angles generates counterclockwise roattions and negative angles generates clockwise roattions The counterclockwise sense of rotaion can be determined by the right-hand rule: If the thumb of the right hand points the direction of the direction of the oriented axis, then the cupped fingers points in a counterclockwise direction The rotation operators in R 3 are linear For example (a) The counterclockwise rotation about the positive x-axis through an angle θ has the w x equations w y cos θ z sin θ, its standard matrix is cos θ sin θ w 3 y sin θ + z cos θ sin θ cos θ (b) The counterclockwise rotation about the positive y-axis through an angle θ has the w x cos θ + z sin θ cos θ sin θ equations w y, its standard matrix is w 3 x sin θ + z cos θ sin θ cos θ 49

50 (c) The counterclockwise rotation about the positive z-axis through an angle θ has the w x cos θ y sin θ cos θ sin θ equations w x sin θ + y cos θ, its standard matrix is sin θ cos θ w 3 z (d) The homotopy of ratio k R is the linear operator H k : R n R n, H k (x) kx, Its standard matrix is k w kx k w kx and its equations are k w n kx n If k, then H k is called contraction, and for k, H k is called dilatation Let A, B be matrices of sizes n k and k m respectively, and T A : R n R k, T B : R k R m are the linear transformations of standard matrices A and B respectively, namely T A (x) Ax, T B (y) By Then the composed mapping T B T A is also linear and T B T A T BA Indeed (T B T A )(x) T B (T A )(x)) T B (Ax) B(Ax) (BA)x T BA (x) We have just proved that [T T ] [T ][T ] for any two linear mappings whose composition T T is defined Similarly, if the composed map T 3 T T, of the linear mappings T 3,T,T, is defined, then [T 3 T T ] [T 3 ][T ][T ] Let T : R R be the reflection operator about the line y x and let T : R R be the orthogonal projection about the y-axis Find T T, T T and their standard matrices Show that R θ R θ R θ R θ and it is the rotation of angle θ + θ 33 Properties of linear transformations from R n to R m Definition 33 A linear transformation T : R n R m is said to be one-to-one if u, u R n, u u T u T u It follows that each vector w in the range {T x : x R n } of an one-to-one linear transformation T : R n R m there is exactly one vector x such that T x w Theorem 33 If A is an n n matrix and T A following statements are equivalent: : R n R n is the multiplication by A, then the 5

51 A is invertible The range of T A is R n 3 T A is one-to-one If T A : R n R n is a one-to-one linear operator, then the matrix A is invertible and T A is also linear Moreover, : Rn R n T A (T A (x)) AA x x T I x id R n (x), x R n T A (T A (x)) A Ax x T I x id R n (x), x R n Consequently T A is also invertible and its inverse is T A T A Therefore, for the standard matrix of the inverse of an one-to-one linear operator T : R n R n, we have [T ] [T ] Examples 333 The rotation operator of R through a fixed angle θ, R θ : R R, R θ (x cos θ y sin θ, x sin θ + y cos θ) is a linear mapping since has the standard matric and [R θ ] cos θ sin θ, which is invertible sin θ cos θ and [R θ ] cos θ sin θ cos( θ) sin( θ) [R θ ] Consequently R θ is invertible sin θ cos θ sin( θ) cos( θ) and R R θ θ Theorem 334 A transformation T : R n R m is linear if and only if T (u + v) T (u) + T (v) for all u, v R n T (cu) ct (u) for all u R n Proof Indeed, if T T A, then T T A, namely T A (u + v) A(u + v) Au + Av T A u + T A v Conversely, if the given conditions are satisfied, then one can easily show that for any k vectors u,, u k R n we have T(u + + u k ) T(u ) + + T(u k ) Oncan now show that T T A, where A [T(e ) T(e n )], where e, e,, e n 5

52 Indeed, for x x x x n x + x + + x n x e + x e + + x n e n we have T(x) T(x e + x e + + x n e n ) x T(e ) + x T(e ) + + x n T(e n ) Ax 5

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

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

More information

Linear Systems and Matrices

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

More information

Systems of Linear Equations and Matrices

Systems of Linear Equations and Matrices Chapter 1 Systems of Linear Equations and Matrices System of linear algebraic equations and their solution constitute one of the major topics studied in the course known as linear algebra. In the first

More information

Systems of Linear Equations and Matrices

Systems of Linear Equations and Matrices Chapter 1 Systems of Linear Equations and Matrices System of linear algebraic equations and their solution constitute one of the major topics studied in the course known as linear algebra. In the first

More information

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

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

More information

Chapter 1: Systems of linear equations and matrices. Section 1.1: Introduction to systems of linear equations

Chapter 1: Systems of linear equations and matrices. Section 1.1: Introduction to systems of linear equations Chapter 1: Systems of linear equations and matrices Section 1.1: Introduction to systems of linear equations Definition: A linear equation in n variables can be expressed in the form a 1 x 1 + a 2 x 2

More information

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

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

More information

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

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

More information

MATH2210 Notebook 2 Spring 2018

MATH2210 Notebook 2 Spring 2018 MATH2210 Notebook 2 Spring 2018 prepared by Professor Jenny Baglivo c Copyright 2009 2018 by Jenny A. Baglivo. All Rights Reserved. 2 MATH2210 Notebook 2 3 2.1 Matrices and Their Operations................................

More information

Lecture Notes in Linear Algebra

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

More information

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

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

More information

Matrix & Linear Algebra

Matrix & Linear Algebra Matrix & Linear Algebra Jamie Monogan University of Georgia For more information: http://monogan.myweb.uga.edu/teaching/mm/ Jamie Monogan (UGA) Matrix & Linear Algebra 1 / 84 Vectors Vectors Vector: A

More information

Math113: Linear Algebra. Beifang Chen

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

More information

Linear Algebra March 16, 2019

Linear Algebra March 16, 2019 Linear Algebra March 16, 2019 2 Contents 0.1 Notation................................ 4 1 Systems of linear equations, and matrices 5 1.1 Systems of linear equations..................... 5 1.2 Augmented

More information

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

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

More information

MATH 213 Linear Algebra and ODEs Spring 2015 Study Sheet for Midterm Exam. Topics

MATH 213 Linear Algebra and ODEs Spring 2015 Study Sheet for Midterm Exam. Topics MATH 213 Linear Algebra and ODEs Spring 2015 Study Sheet for Midterm Exam This study sheet will not be allowed during the test Books and notes will not be allowed during the test Calculators and cell phones

More information

Digital Workbook for GRA 6035 Mathematics

Digital Workbook for GRA 6035 Mathematics Eivind Eriksen Digital Workbook for GRA 6035 Mathematics November 10, 2014 BI Norwegian Business School Contents Part I Lectures in GRA6035 Mathematics 1 Linear Systems and Gaussian Elimination........................

More information

Chapter 4 - MATRIX ALGEBRA. ... a 2j... a 2n. a i1 a i2... a ij... a in

Chapter 4 - MATRIX ALGEBRA. ... a 2j... a 2n. a i1 a i2... a ij... a in Chapter 4 - MATRIX ALGEBRA 4.1. Matrix Operations A a 11 a 12... a 1j... a 1n a 21. a 22.... a 2j... a 2n. a i1 a i2... a ij... a in... a m1 a m2... a mj... a mn The entry in the ith row and the jth column

More information

Chapter 2:Determinants. Section 2.1: Determinants by cofactor expansion

Chapter 2:Determinants. Section 2.1: Determinants by cofactor expansion Chapter 2:Determinants Section 2.1: Determinants by cofactor expansion [ ] a b Recall: The 2 2 matrix is invertible if ad bc 0. The c d ([ ]) a b function f = ad bc is called the determinant and it associates

More information

MATH 240 Spring, Chapter 1: Linear Equations and Matrices

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

More information

ELEMENTARY LINEAR ALGEBRA

ELEMENTARY LINEAR ALGEBRA ELEMENTARY LINEAR ALGEBRA K R MATTHEWS DEPARTMENT OF MATHEMATICS UNIVERSITY OF QUEENSLAND First Printing, 99 Chapter LINEAR EQUATIONS Introduction to linear equations A linear equation in n unknowns x,

More information

MAT 2037 LINEAR ALGEBRA I web:

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

More information

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

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

More information

NOTES FOR LINEAR ALGEBRA 133

NOTES FOR LINEAR ALGEBRA 133 NOTES FOR LINEAR ALGEBRA 33 William J Anderson McGill University These are not official notes for Math 33 identical to the notes projected in class They are intended for Anderson s section 4, and are 2

More information

Chapter 5. Linear Algebra. A linear (algebraic) equation in. unknowns, x 1, x 2,..., x n, is. an equation of the form

Chapter 5. Linear Algebra. A linear (algebraic) equation in. unknowns, x 1, x 2,..., x n, is. an equation of the form Chapter 5. Linear Algebra A linear (algebraic) equation in n unknowns, x 1, x 2,..., x n, is an equation of the form a 1 x 1 + a 2 x 2 + + a n x n = b where a 1, a 2,..., a n and b are real numbers. 1

More information

Properties of the Determinant Function

Properties of the Determinant Function Properties of the Determinant Function MATH 322, Linear Algebra I J. Robert Buchanan Department of Mathematics Spring 2015 Overview Today s discussion will illuminate some of the properties of the determinant:

More information

a 11 x 1 + a 12 x a 1n x n = b 1 a 21 x 1 + a 22 x a 2n x n = b 2.

a 11 x 1 + a 12 x a 1n x n = b 1 a 21 x 1 + a 22 x a 2n x n = b 2. Chapter 1 LINEAR EQUATIONS 11 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 real

More information

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

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

More information

MAC Module 3 Determinants. Learning Objectives. Upon completing this module, you should be able to:

MAC Module 3 Determinants. Learning Objectives. Upon completing this module, you should be able to: MAC 2 Module Determinants Learning Objectives Upon completing this module, you should be able to:. Determine the minor, cofactor, and adjoint of a matrix. 2. Evaluate the determinant of a matrix by cofactor

More information

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

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

More information

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

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

More information

A matrix is a rectangular array of. objects arranged in rows and columns. The objects are called the entries. is called the size of the matrix, and

A matrix is a rectangular array of. objects arranged in rows and columns. The objects are called the entries. is called the size of the matrix, and Section 5.5. Matrices and Vectors A matrix is a rectangular array of objects arranged in rows and columns. The objects are called the entries. A matrix with m rows and n columns is called an m n matrix.

More information

ELEMENTARY LINEAR ALGEBRA

ELEMENTARY LINEAR ALGEBRA ELEMENTARY LINEAR ALGEBRA K. R. MATTHEWS DEPARTMENT OF MATHEMATICS UNIVERSITY OF QUEENSLAND Corrected Version, 7th April 013 Comments to the author at keithmatt@gmail.com Chapter 1 LINEAR EQUATIONS 1.1

More information

A matrix is a rectangular array of. objects arranged in rows and columns. The objects are called the entries. is called the size of the matrix, and

A matrix is a rectangular array of. objects arranged in rows and columns. The objects are called the entries. is called the size of the matrix, and Section 5.5. Matrices and Vectors A matrix is a rectangular array of objects arranged in rows and columns. The objects are called the entries. A matrix with m rows and n columns is called an m n matrix.

More information

Matrices and systems of linear equations

Matrices and systems of linear equations Matrices and systems of linear equations Samy Tindel Purdue University Differential equations and linear algebra - MA 262 Taken from Differential equations and linear algebra by Goode and Annin Samy T.

More information

Systems of Linear Equations. By: Tri Atmojo Kusmayadi and Mardiyana Mathematics Education Sebelas Maret University

Systems of Linear Equations. By: Tri Atmojo Kusmayadi and Mardiyana Mathematics Education Sebelas Maret University Systems of Linear Equations By: Tri Atmojo Kusmayadi and Mardiyana Mathematics Education Sebelas Maret University Standard of Competency: Understanding the properties of systems of linear equations, matrices,

More information

Determinants Chapter 3 of Lay

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

More information

Chapter 2: Matrices and Linear Systems

Chapter 2: Matrices and Linear Systems Chapter 2: Matrices and Linear Systems Paul Pearson Outline Matrices Linear systems Row operations Inverses Determinants Matrices Definition An m n matrix A = (a ij ) is a rectangular array of real numbers

More information

Fundamentals of Engineering Analysis (650163)

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

More information

MTH 102A - Linear Algebra II Semester

MTH 102A - Linear Algebra II Semester MTH 0A - Linear Algebra - 05-6-II Semester Arbind Kumar Lal P Field A field F is a set from which we choose our coefficients and scalars Expected properties are ) a+b and a b should be defined in it )

More information

Undergraduate Mathematical Economics Lecture 1

Undergraduate Mathematical Economics Lecture 1 Undergraduate Mathematical Economics Lecture 1 Yu Ren WISE, Xiamen University September 15, 2014 Outline 1 Courses Description and Requirement 2 Course Outline ematical techniques used in economics courses

More information

Graduate Mathematical Economics Lecture 1

Graduate Mathematical Economics Lecture 1 Graduate Mathematical Economics Lecture 1 Yu Ren WISE, Xiamen University September 23, 2012 Outline 1 2 Course Outline ematical techniques used in graduate level economics courses Mathematics for Economists

More information

II. Determinant Functions

II. Determinant Functions Supplemental Materials for EE203001 Students II Determinant Functions Chung-Chin Lu Department of Electrical Engineering National Tsing Hua University May 22, 2003 1 Three Axioms for a Determinant Function

More information

Elementary Row Operations on Matrices

Elementary Row Operations on Matrices King Saud University September 17, 018 Table of contents 1 Definition A real matrix is a rectangular array whose entries are real numbers. These numbers are organized on rows and columns. An m n matrix

More information

ELEMENTARY LINEAR ALGEBRA

ELEMENTARY LINEAR ALGEBRA ELEMENTARY LINEAR ALGEBRA K R MATTHEWS DEPARTMENT OF MATHEMATICS UNIVERSITY OF QUEENSLAND Second Online Version, December 998 Comments to the author at krm@mathsuqeduau All contents copyright c 99 Keith

More information

IMPORTANT DEFINITIONS AND THEOREMS REFERENCE SHEET

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

More information

Introduction. Vectors and Matrices. Vectors [1] Vectors [2]

Introduction. Vectors and Matrices. Vectors [1] Vectors [2] Introduction Vectors and Matrices Dr. TGI Fernando 1 2 Data is frequently arranged in arrays, that is, sets whose elements are indexed by one or more subscripts. Vector - one dimensional array Matrix -

More information

3 Matrix Algebra. 3.1 Operations on matrices

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

More information

Things we can already do with matrices. Unit II - Matrix arithmetic. Defining the matrix product. Things that fail in matrix arithmetic

Things we can already do with matrices. Unit II - Matrix arithmetic. Defining the matrix product. Things that fail in matrix arithmetic Unit II - Matrix arithmetic matrix multiplication matrix inverses elementary matrices finding the inverse of a matrix determinants Unit II - Matrix arithmetic 1 Things we can already do with matrices equality

More information

ELEMENTARY LINEAR ALGEBRA

ELEMENTARY LINEAR ALGEBRA ELEMENTARY LINEAR ALGEBRA K. R. MATTHEWS DEPARTMENT OF MATHEMATICS UNIVERSITY OF QUEENSLAND Second Online Version, December 1998 Comments to the author at krm@maths.uq.edu.au Contents 1 LINEAR EQUATIONS

More information

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

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

More information

MATRICES. a m,1 a m,n A =

MATRICES. a m,1 a m,n A = MATRICES Matrices are rectangular arrays of real or complex numbers With them, we define arithmetic operations that are generalizations of those for real and complex numbers The general form a matrix of

More information

Math Linear Algebra Final Exam Review Sheet

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

More information

TOPIC III LINEAR ALGEBRA

TOPIC III LINEAR ALGEBRA [1] Linear Equations TOPIC III LINEAR ALGEBRA (1) Case of Two Endogenous Variables 1) Linear vs. Nonlinear Equations Linear equation: ax + by = c, where a, b and c are constants. 2 Nonlinear equation:

More information

Formula for the inverse matrix. Cramer s rule. Review: 3 3 determinants can be computed expanding by any row or column

Formula for the inverse matrix. Cramer s rule. Review: 3 3 determinants can be computed expanding by any row or column Math 20F Linear Algebra Lecture 18 1 Determinants, n n Review: The 3 3 case Slide 1 Determinants n n (Expansions by rows and columns Relation with Gauss elimination matrices: Properties) Formula for the

More information

Vectors and matrices: matrices (Version 2) This is a very brief summary of my lecture notes.

Vectors and matrices: matrices (Version 2) This is a very brief summary of my lecture notes. Vectors and matrices: matrices (Version 2) This is a very brief summary of my lecture notes Matrices and linear equations A matrix is an m-by-n array of numbers A = a 11 a 12 a 13 a 1n a 21 a 22 a 23 a

More information

Linear Algebra Highlights

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

More information

1. General Vector Spaces

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

More information

IMPORTANT DEFINITIONS AND THEOREMS REFERENCE SHEET

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

More information

MTH501- Linear Algebra MCQS MIDTERM EXAMINATION ~ LIBRIANSMINE ~

MTH501- Linear Algebra MCQS MIDTERM EXAMINATION ~ LIBRIANSMINE ~ MTH501- Linear Algebra MCQS MIDTERM EXAMINATION ~ LIBRIANSMINE ~ Question No: 1 (Marks: 1) If for a linear transformation the equation T(x) =0 has only the trivial solution then T is One-to-one Onto Question

More information

APPENDIX: MATHEMATICAL INDUCTION AND OTHER FORMS OF PROOF

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

More information

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

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

More information

Fall Inverse of a matrix. Institute: UC San Diego. Authors: Alexander Knop

Fall Inverse of a matrix. Institute: UC San Diego. Authors: Alexander Knop Fall 2017 Inverse of a matrix Authors: Alexander Knop Institute: UC San Diego Row-Column Rule If the product AB is defined, then the entry in row i and column j of AB is the sum of the products of corresponding

More information

Determinants - Uniqueness and Properties

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

More information

Extra Problems for Math 2050 Linear Algebra I

Extra Problems for Math 2050 Linear Algebra I Extra Problems for Math 5 Linear Algebra I Find the vector AB and illustrate with a picture if A = (,) and B = (,4) Find B, given A = (,4) and [ AB = A = (,4) and [ AB = 8 If possible, express x = 7 as

More information

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

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

More information

Matrices and Linear Algebra

Matrices and Linear Algebra Contents Quantitative methods for Economics and Business University of Ferrara Academic year 2017-2018 Contents 1 Basics 2 3 4 5 Contents 1 Basics 2 3 4 5 Contents 1 Basics 2 3 4 5 Contents 1 Basics 2

More information

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

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

More information

LINEAR ALGEBRA WITH APPLICATIONS

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

More information

Matrix Arithmetic. j=1

Matrix Arithmetic. j=1 An m n matrix is an array A = Matrix Arithmetic a 11 a 12 a 1n a 21 a 22 a 2n a m1 a m2 a mn of real numbers a ij An m n matrix has m rows and n columns a ij is the entry in the i-th row and j-th column

More information

Lecture 10: Determinants and Cramer s Rule

Lecture 10: Determinants and Cramer s Rule Lecture 0: Determinants and Cramer s Rule The determinant and its applications. Definition The determinant of a square matrix A, denoted by det(a) or A, is a real number, which is defined as follows. -by-

More information

Chapter 1: Systems of Linear Equations

Chapter 1: Systems of Linear Equations Chapter : Systems of Linear Equations February, 9 Systems of linear equations Linear systems Lecture 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

More information

1 Determinants. 1.1 Determinant

1 Determinants. 1.1 Determinant 1 Determinants [SB], Chapter 9, p.188-196. [SB], Chapter 26, p.719-739. Bellow w ll study the central question: which additional conditions must satisfy a quadratic matrix A to be invertible, that is to

More information

A FIRST COURSE IN LINEAR ALGEBRA. An Open Text by Ken Kuttler. Matrix Arithmetic

A FIRST COURSE IN LINEAR ALGEBRA. An Open Text by Ken Kuttler. Matrix Arithmetic A FIRST COURSE IN LINEAR ALGEBRA An Open Text by Ken Kuttler Matrix Arithmetic Lecture Notes by Karen Seyffarth Adapted by LYRYX SERVICE COURSE SOLUTION Attribution-NonCommercial-ShareAlike (CC BY-NC-SA)

More information

Linear Algebra (part 1) : Matrices and Systems of Linear Equations (by Evan Dummit, 2016, v. 2.02)

Linear Algebra (part 1) : Matrices and Systems of Linear Equations (by Evan Dummit, 2016, v. 2.02) Linear Algebra (part ) : Matrices and Systems of Linear Equations (by Evan Dummit, 206, v 202) Contents 2 Matrices and Systems of Linear Equations 2 Systems of Linear Equations 2 Elimination, Matrix Formulation

More information

1 Matrices and Systems of Linear Equations

1 Matrices and Systems of Linear Equations Linear Algebra (part ) : Matrices and Systems of Linear Equations (by Evan Dummit, 207, v 260) Contents Matrices and Systems of Linear Equations Systems of Linear Equations Elimination, Matrix Formulation

More information

Linear equations in linear algebra

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

More information

Elementary maths for GMT

Elementary maths for GMT Elementary maths for GMT Linear Algebra Part 2: Matrices, Elimination and Determinant m n matrices The system of m linear equations in n variables x 1, x 2,, x n a 11 x 1 + a 12 x 2 + + a 1n x n = b 1

More information

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

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

More information

1 Multiply Eq. E i by λ 0: (λe i ) (E i ) 2 Multiply Eq. E j by λ and add to Eq. E i : (E i + λe j ) (E i )

1 Multiply Eq. E i by λ 0: (λe i ) (E i ) 2 Multiply Eq. E j by λ and add to Eq. E i : (E i + λe j ) (E i ) Direct Methods for Linear Systems Chapter Direct Methods for Solving Linear Systems Per-Olof Persson persson@berkeleyedu Department of Mathematics University of California, Berkeley Math 18A Numerical

More information

LINEAR SYSTEMS, MATRICES, AND VECTORS

LINEAR SYSTEMS, MATRICES, AND VECTORS ELEMENTARY LINEAR ALGEBRA WORKBOOK CREATED BY SHANNON MARTIN MYERS LINEAR SYSTEMS, MATRICES, AND VECTORS Now that I ve been teaching Linear Algebra for a few years, I thought it would be great to integrate

More information

ENGI 9420 Lecture Notes 2 - Matrix Algebra Page Matrix operations can render the solution of a linear system much more efficient.

ENGI 9420 Lecture Notes 2 - Matrix Algebra Page Matrix operations can render the solution of a linear system much more efficient. ENGI 940 Lecture Notes - Matrix Algebra Page.0. Matrix Algebra A linear system of m equations in n unknowns, a x + a x + + a x b (where the a ij and i n n a x + a x + + a x b n n a x + a x + + a x b m

More information

Math 320, spring 2011 before the first midterm

Math 320, spring 2011 before the first midterm Math 320, spring 2011 before the first midterm Typical Exam Problems 1 Consider the linear system of equations 2x 1 + 3x 2 2x 3 + x 4 = y 1 x 1 + 3x 2 2x 3 + 2x 4 = y 2 x 1 + 2x 3 x 4 = y 3 where x 1,,

More information

1 - Systems of Linear Equations

1 - Systems of Linear Equations 1 - Systems of Linear Equations 1.1 Introduction to Systems of Linear Equations Almost every problem in linear algebra will involve solving a system of equations. ü LINEAR EQUATIONS IN n VARIABLES We are

More information

Phys 201. Matrices and Determinants

Phys 201. Matrices and Determinants Phys 201 Matrices and Determinants 1 1.1 Matrices 1.2 Operations of matrices 1.3 Types of matrices 1.4 Properties of matrices 1.5 Determinants 1.6 Inverse of a 3 3 matrix 2 1.1 Matrices A 2 3 7 =! " 1

More information

Chapter 4. Matrices and Matrix Rings

Chapter 4. Matrices and Matrix Rings Chapter 4 Matrices and Matrix Rings We first consider matrices in full generality, i.e., over an arbitrary ring R. However, after the first few pages, it will be assumed that R is commutative. The topics,

More information

Daily Update. Math 290: Elementary Linear Algebra Fall 2018

Daily Update. Math 290: Elementary Linear Algebra Fall 2018 Daily Update Math 90: Elementary Linear Algebra Fall 08 Lecture 7: Tuesday, December 4 After reviewing the definitions of a linear transformation, and the kernel and range of a linear transformation, we

More information

Determinants by Cofactor Expansion (III)

Determinants by Cofactor Expansion (III) Determinants by Cofactor Expansion (III) Comment: (Reminder) If A is an n n matrix, then the determinant of A can be computed as a cofactor expansion along the jth column det(a) = a1j C1j + a2j C2j +...

More information

CHAPTER 6. Direct Methods for Solving Linear Systems

CHAPTER 6. Direct Methods for Solving Linear Systems CHAPTER 6 Direct Methods for Solving Linear Systems. Introduction A direct method for approximating the solution of a system of n linear equations in n unknowns is one that gives the exact solution to

More information

MAC Module 2 Systems of Linear Equations and Matrices II. Learning Objectives. Upon completing this module, you should be able to :

MAC Module 2 Systems of Linear Equations and Matrices II. Learning Objectives. Upon completing this module, you should be able to : MAC 0 Module Systems of Linear Equations and Matrices II Learning Objectives Upon completing this module, you should be able to :. Find the inverse of a square matrix.. Determine whether a matrix is invertible..

More information

Final Examination 201-NYC-05 - Linear Algebra I December 8 th, and b = 4. Find the value(s) of a for which the equation Ax = b

Final Examination 201-NYC-05 - Linear Algebra I December 8 th, and b = 4. Find the value(s) of a for which the equation Ax = b Final Examination -NYC-5 - Linear Algebra I December 8 th 7. (4 points) Let A = has: (a) a unique solution. a a (b) infinitely many solutions. (c) no solution. and b = 4. Find the value(s) of a for which

More information

Matrices. In this chapter: matrices, determinants. inverse matrix

Matrices. In this chapter: matrices, determinants. inverse matrix Matrices In this chapter: matrices, determinants inverse matrix 1 1.1 Matrices A matrix is a retangular array of numbers. Rows: horizontal lines. A = a 11 a 12 a 13 a 21 a 22 a 23 a 31 a 32 a 33 a 41 a

More information

4. Determinants.

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

More information

Chapter 5: Matrices. Daniel Chan. Semester UNSW. Daniel Chan (UNSW) Chapter 5: Matrices Semester / 33

Chapter 5: Matrices. Daniel Chan. Semester UNSW. Daniel Chan (UNSW) Chapter 5: Matrices Semester / 33 Chapter 5: Matrices Daniel Chan UNSW Semester 1 2018 Daniel Chan (UNSW) Chapter 5: Matrices Semester 1 2018 1 / 33 In this chapter Matrices were first introduced in the Chinese Nine Chapters on the Mathematical

More information

Math 3108: Linear Algebra

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

More information

Chapter Contents. A 1.6 Further Results on Systems of Equations and Invertibility 1.7 Diagonal, Triangular, and Symmetric Matrices

Chapter Contents. A 1.6 Further Results on Systems of Equations and Invertibility 1.7 Diagonal, Triangular, and Symmetric Matrices Chapter Contents. Introduction to System of Linear Equations. Gaussian Elimination.3 Matrices and Matri Operations.4 Inverses; Rules of Matri Arithmetic.5 Elementary Matrices and a Method for Finding A.6

More information

Linear Algebra: Lecture Notes. Dr Rachel Quinlan School of Mathematics, Statistics and Applied Mathematics NUI Galway

Linear Algebra: Lecture Notes. Dr Rachel Quinlan School of Mathematics, Statistics and Applied Mathematics NUI Galway Linear Algebra: Lecture Notes Dr Rachel Quinlan School of Mathematics, Statistics and Applied Mathematics NUI Galway November 6, 23 Contents Systems of Linear Equations 2 Introduction 2 2 Elementary Row

More information

INSTITIÚID TEICNEOLAÍOCHTA CHEATHARLACH INSTITUTE OF TECHNOLOGY CARLOW MATRICES

INSTITIÚID TEICNEOLAÍOCHTA CHEATHARLACH INSTITUTE OF TECHNOLOGY CARLOW MATRICES 1 CHAPTER 4 MATRICES 1 INSTITIÚID TEICNEOLAÍOCHTA CHEATHARLACH INSTITUTE OF TECHNOLOGY CARLOW MATRICES 1 Matrices Matrices are of fundamental importance in 2-dimensional and 3-dimensional graphics programming

More information

CHAPTER 8: Matrices and Determinants

CHAPTER 8: Matrices and Determinants (Exercises for Chapter 8: Matrices and Determinants) E.8.1 CHAPTER 8: Matrices and Determinants (A) means refer to Part A, (B) means refer to Part B, etc. Most of these exercises can be done without a

More information

Chapter 2. Square matrices

Chapter 2. Square matrices Chapter 2. Square matrices Lecture notes for MA1111 P. Karageorgis pete@maths.tcd.ie 1/18 Invertible matrices Definition 2.1 Invertible matrices An n n matrix A is said to be invertible, if there is a

More information