Lecture 10: Invertible matrices. Finding the inverse of a matrix
|
|
|
- Melinda Wilkins
- 7 years ago
- Views:
Transcription
1 Lecture 10: Invertible matrices. Finding the inverse of a matrix Danny W. Crytser April 11, 2014
2 Today s lecture Today we will
3 Today s lecture Today we will 1 Single out a class of especially nice matrices called the invertible matrices.
4 Today s lecture Today we will 1 Single out a class of especially nice matrices called the invertible matrices. 2 Discuss how to compute the inverse of a invertible matrix.
5 Today s lecture Today we will 1 Single out a class of especially nice matrices called the invertible matrices. 2 Discuss how to compute the inverse of a invertible matrix. 3 State a theorem which says when a square matrix possesses an inverse.
6 Today s lecture Today we will 1 Single out a class of especially nice matrices called the invertible matrices. 2 Discuss how to compute the inverse of a invertible matrix. 3 State a theorem which says when a square matrix possesses an inverse.
7 Multiplication of matrices We saw on Wednesday s lecture that if A is an m n matrix and B is an n p matrix, then the product AB is defined and AB = [ Ab 1 Ab 2... Ab p ].
8 Multiplication of matrices We saw on Wednesday s lecture that if A is an m n matrix and B is an n p matrix, then the product AB is defined and AB = [ Ab 1 Ab 2... Ab p ]. Unlike the situation with real numbers, you can find (with not too much difficulty) matrices A, B, C such that AB = AC and yet B C.
9 Multiplication of matrices We saw on Wednesday s lecture that if A is an m n matrix and B is an n p matrix, then the product AB is defined and AB = [ Ab 1 Ab 2... Ab p ]. Unlike the situation with real numbers, you can find (with not too much difficulty) matrices A, B, C such that AB = AC and yet B C. That is, you cannot divide out by a general matrix A.
10 Multiplication of matrices We saw on Wednesday s lecture that if A is an m n matrix and B is an n p matrix, then the product AB is defined and AB = [ Ab 1 Ab 2... Ab p ]. Unlike the situation with real numbers, you can find (with not too much difficulty) matrices A, B, C such that AB = AC and yet B C. That is, you cannot divide out by a general matrix A. Today we will describe all the matrices that you can divide out by.
11 Multiplication of matrices We saw on Wednesday s lecture that if A is an m n matrix and B is an n p matrix, then the product AB is defined and AB = [ Ab 1 Ab 2... Ab p ]. Unlike the situation with real numbers, you can find (with not too much difficulty) matrices A, B, C such that AB = AC and yet B C. That is, you cannot divide out by a general matrix A. Today we will describe all the matrices that you can divide out by. This entails finding the reciprocal of a matrix A, which is only possible for some matrices.
12 The Identity Matrix We aim to define the inverse of a matrix in (very) rough analogy with the reciprocal of a real number.
13 The Identity Matrix We aim to define the inverse of a matrix in (very) rough analogy with the reciprocal of a real number. As x 1 := 1 x, we will need to know what 1 means in a matrix context.
14 The Identity Matrix We aim to define the inverse of a matrix in (very) rough analogy with the reciprocal of a real number. As x 1 := 1 x, we will need to know what 1 means in a matrix context. Definition Let m 1 be an integer.
15 The Identity Matrix We aim to define the inverse of a matrix in (very) rough analogy with the reciprocal of a real number. As x 1 := 1 x, we will need to know what 1 means in a matrix context. Definition Let m 1 be an integer. Then I m, the m m identity matrix, is the m m matrix given by I m :=
16 The Identity Matrix We aim to define the inverse of a matrix in (very) rough analogy with the reciprocal of a real number. As x 1 := 1 x, we will need to know what 1 means in a matrix context. Definition Let m 1 be an integer. Then I m, the m m identity matrix, is the m m matrix given by I m := That is, I m is a diagonal matrix with 1s on the diagonal.
17 Examples of identity matrices Example I 2 = [ ]
18 Examples of identity matrices Example I 2 = [ ] I 3 =
19 Examples of identity matrices Example I 2 = [ ] I 3 = I 4 =
20 Examples of identity matrices Example I 2 = [ ] I 3 = I 4 = The interesting thing about the identity matrices is that for any m n matrix A, I m A = A and AI n = A.
21 Examples of identity matrices Example I 2 = [ ] I 3 = I 4 = The interesting thing about the identity matrices is that for any m n matrix A, I m A = A and AI n = A. (Use row-column rule).
22 Examples of identity matrices Example I 2 = [ ] I 3 = I 4 = The interesting thing about the identity matrices is that for any m n matrix A, I m A = A and AI n = A. (Use row-column rule). Sometimes when the context is abundantly clear, we ll write I instead of I n, but we ll try to retain the subscript to avoid confusion.
23 Examples of identity matrices Example I 2 = [ ] I 3 = I 4 = The interesting thing about the identity matrices is that for any m n matrix A, I m A = A and AI n = A. (Use row-column rule). Sometimes when the context is abundantly clear, we ll write I instead of I n, but we ll try to retain the subscript to avoid confusion.
24 Invertible matrices Definition An n n matrix A is invertible if there exists an n n matrix C such that AC = I n = CA.
25 Invertible matrices Definition An n n matrix A is invertible if there exists an n n matrix C such that AC = I n = CA. If such a C exists, we denote it by A 1 and refer to it as the inverse of A.
26 Invertible matrices Definition An n n matrix A is invertible if there exists an n n matrix C such that AC = I n = CA. If such a C exists, we denote it by A 1 and refer to it as the inverse of A. (Don t sweat about it too much, but a matrix which is not invertible is sometimes called a singular matrix, and an invertible matrix is sometimes referred to as a non-singular matrix.)
27 Invertible matrices Definition An n n matrix A is invertible if there exists an n n matrix C such that AC = I n = CA. If such a C exists, we denote it by A 1 and refer to it as the inverse of A. (Don t sweat about it too much, but a matrix which is not invertible is sometimes called a singular matrix, and an invertible matrix is sometimes referred to as a non-singular matrix.) Example Let A = [ ] and C = [ ].
28 Invertible matrices Definition An n n matrix A is invertible if there exists an n n matrix C such that AC = I n = CA. If such a C exists, we denote it by A 1 and refer to it as the inverse of A. (Don t sweat about it too much, but a matrix which is not invertible is sometimes called a singular matrix, and an invertible matrix is sometimes referred to as a non-singular matrix.) Example Let A = that [ ] and C = [ AC = CA = I 2 Thus A is invertible and A 1 = C. ]. Then you can check
29 Examples Example If A = I 2 = [ ], then A is invertible and A = A 1.
30 Examples Example If A = I 2 = Example [ The matrix A = ], then A is invertible and A = A 1. [ ] is not invertible.
31 Examples Example If A = I 2 = Example [ The matrix A = ], then A is invertible and A = A 1. [ [ ] is not invertible. Note that ] [ ] a b = c d [ a b 0 0 ].
32 Examples Example If A = I 2 = Example [ The matrix A = ], then A is invertible and A = A 1. [ [ ] is not invertible. Note that ] [ ] a b = c d [ a b 0 0 So no matter what you multiply A by, you can t get the identity matrix. ].
33 Inverses for 2 2 matrices Probably you noticed a relationship between the entries of the matrices in the previous example. [ ] [ ] 7 2 A = and A =
34 Inverses for 2 2 matrices Probably you noticed a relationship between the entries of the matrices in the previous example. [ ] [ ] 7 2 A = and A = There is a rule for 2 2 matrices describing this precisely. Theorem [ a b Let A = c d ].
35 Inverses for 2 2 matrices Probably you noticed a relationship between the entries of the matrices in the previous example. [ ] [ ] 7 2 A = and A = There is a rule for 2 2 matrices describing this precisely. Theorem [ a b Let A = c d ]. If ad bc 0, then A is invertible and A 1 = 1 ad bc [ d b c a ].
36 Inverses for 2 2 matrices Probably you noticed a relationship between the entries of the matrices in the previous example. [ ] [ ] 7 2 A = and A = There is a rule for 2 2 matrices describing this precisely. Theorem [ a b Let A = c d ]. If ad bc 0, then A is invertible and A 1 = 1 ad bc If ad bc = 0 then A is not invertible. [ d b c a ].
37 Inverses for 2 2 matrices Probably you noticed a relationship between the entries of the matrices in the previous example. [ ] [ ] 7 2 A = and A = There is a rule for 2 2 matrices describing this precisely. Theorem [ a b Let A = c d ]. If ad bc 0, then A is invertible and A 1 = 1 ad bc If ad bc = 0 then A is not invertible. [ d b c a The quantity ad bc (diagonal product minus off-diagonal product) is called the determinant of A. ].
38 Inverses for 2 2 matrices, ctd. A 1 = 1 ad bc [ d b c a ]
39 Inverses for 2 2 matrices, ctd. A 1 = 1 ad bc [ d b c a ] Example Let B = [ ].
40 Inverses for 2 2 matrices, ctd. A 1 = 1 ad bc [ d b c a ] Example Let B = [ ]. Is B invertible?
41 Inverses for 2 2 matrices, ctd. A 1 = 1 ad bc [ d b c a ] Example [ ] 1 1 Let B =. Is B invertible? We compute the determinant: 2 2 (1)(2) (2)(1) = 0.
42 Inverses for 2 2 matrices, ctd. A 1 = 1 ad bc [ d b c a ] Example [ ] 1 1 Let B =. Is B invertible? We compute the determinant: 2 2 (1)(2) (2)(1) = 0. The determinant is 0, so B is not invertible.
43 Inverses for 2 2 matrices, ctd. A 1 = 1 ad bc [ d b c a ] Example [ ] 1 1 Let B =. Is B invertible? We compute the determinant: 2 2 (1)(2) (2)(1) = 0. The determinant is 0, so B is not invertible. Example Let A = [ ].
44 Inverses for 2 2 matrices, ctd. A 1 = 1 ad bc [ d b c a ] Example [ ] 1 1 Let B =. Is B invertible? We compute the determinant: 2 2 (1)(2) (2)(1) = 0. The determinant is 0, so B is not invertible. Example Let A = [ So A is invertible. ]. Compute the determinant: (5)(1) (2)(2) = 1.
45 Inverses for 2 2 matrices, ctd. A 1 = 1 ad bc [ d b c a ] Example [ ] 1 1 Let B =. Is B invertible? We compute the determinant: 2 2 (1)(2) (2)(1) = 0. The determinant is 0, so B is not invertible. Example [ ] 5 2 Let A =. Compute the determinant: (5)(1) (2)(2) = [ ] [ ] So A is invertible. We have A 1 = =
46 Using inverse matrices to solve equations You can solve equations with the matrix inverse.
47 Using inverse matrices to solve equations You can solve equations with the matrix inverse. Theorem Let A be an invertible n n matrix. Then for each b R n, the equation Ax = b is consistent and has unique solution x = A 1 b.
48 Using inverse matrices to solve equations You can solve equations with the matrix inverse. Theorem Let A be an invertible n n matrix. Then for each b R n, the equation Ax = b is consistent and has unique solution x = A 1 b. Proof. First we show that A 1 b is a solution.
49 Using inverse matrices to solve equations You can solve equations with the matrix inverse. Theorem Let A be an invertible n n matrix. Then for each b R n, the equation Ax = b is consistent and has unique solution x = A 1 b. Proof. First we show that A 1 b is a solution.check: A(A 1 b) = (AA 1 )b, and AA 1 = I n. So A(A 1 b) = I n b = b. Thus x = A 1 b is a solution to Ax = b.
50 Using inverse matrices to solve equations You can solve equations with the matrix inverse. Theorem Let A be an invertible n n matrix. Then for each b R n, the equation Ax = b is consistent and has unique solution x = A 1 b. Proof. First we show that A 1 b is a solution.check: A(A 1 b) = (AA 1 )b, and AA 1 = I n. So A(A 1 b) = I n b = b. Thus x = A 1 b is a solution to Ax = b. If x is a solution to Ax = b, then multiply both sides of the equation to obtain A 1 (Ax) = A 1 b.
51 Using inverse matrices to solve equations You can solve equations with the matrix inverse. Theorem Let A be an invertible n n matrix. Then for each b R n, the equation Ax = b is consistent and has unique solution x = A 1 b. Proof. First we show that A 1 b is a solution.check: A(A 1 b) = (AA 1 )b, and AA 1 = I n. So A(A 1 b) = I n b = b. Thus x = A 1 b is a solution to Ax = b. If x is a solution to Ax = b, then multiply both sides of the equation to obtain A 1 (Ax) = A 1 b. Then rearrange and cancel on the left to obtain x = A 1 b
52 Example: solving systems with inverses Lets solve 3x + y = 11 3x + 2y = 5 using inverses of matrices.
53 Example: solving systems with inverses Lets solve 3x + y = 11 3x + 2y = 5 using inverses [ of matrices. ] This [ is equivalent ] to solving Ax = b, where A = and b =
54 Example: solving systems with inverses Lets solve 3x + y = 11 3x + 2y = 5 using inverses [ of matrices. ] This [ is equivalent ] to solving Ax = b, where A = and b =. The determinant of A is (3)(2) (3) = 3.
55 Example: solving systems with inverses Lets solve 3x + y = 11 3x + 2y = 5 using inverses [ of matrices. ] This [ is equivalent ] to solving Ax = b, where A = and b =. The determinant of A is [ ] [ ] (3)(2) (3) = 3. Thus A 1 = /3 1/3 3 =
56 Example: solving systems with inverses Lets solve 3x + y = 11 3x + 2y = 5 using inverses [ of matrices. ] This [ is equivalent ] to solving Ax = b, where A = and b =. The determinant of A is [ ] [ ] (3)(2) (3) = 3. Thus A 1 = /3 1/3 3 = Thus the solution x to the above equation is x = A 1 b
57 Example: solving systems with inverses Lets solve 3x + y = 11 3x + 2y = 5 using inverses [ of matrices. ] This [ is equivalent ] to solving Ax = b, where A = and b =. The determinant of A is [ ] [ ] (3)(2) (3) = 3. Thus A 1 = /3 1/3 3 = Thus the solution x to the above equation is [ ] [ ] x = A 1 2/3 1/3 11 b = 1 1 5
58 Example: solving systems with inverses Lets solve 3x + y = 11 3x + 2y = 5 using inverses [ of matrices. ] This [ is equivalent ] to solving Ax = b, where A = and b =. The determinant of A is [ ] [ ] (3)(2) (3) = 3. Thus A 1 = /3 1/3 3 = Thus the solution x to the above equation is [ ] [ ] [ ] x = A 1 2/3 1/ /3 5/3 b = =
59 Example: solving systems with inverses Lets solve 3x + y = 11 3x + 2y = 5 using inverses [ of matrices. ] This [ is equivalent ] to solving Ax = b, where A = and b =. The determinant of A is [ ] [ (3)(2) (3) = 3. Thus A 1 = /3 1/3 3 = Thus the solution x to the above equation is [ ] [ ] [ ] x = A 1 2/3 1/ /3 5/3 b = = = ]. [ 17/3 6 ].
60 Example: solving systems with inverses Lets solve 3x + y = 11 3x + 2y = 5 using inverses [ of matrices. ] This [ is equivalent ] to solving Ax = b, where A = and b =. The determinant of A is [ ] [ (3)(2) (3) = 3. Thus A 1 = /3 1/3 3 = Thus the solution x to the above equation is [ ] [ ] [ ] x = A 1 2/3 1/ /3 5/3 b = = = Thus the unique solution is x = [ 17/3 6 ]. ]. [ 17/3 6 ].
61 Example: solving systems with inverses Lets solve 3x + y = 11 3x + 2y = 5 using inverses [ of matrices. ] This [ is equivalent ] to solving Ax = b, where A = and b =. The determinant of A is [ ] [ (3)(2) (3) = 3. Thus A 1 = /3 1/3 3 = Thus the solution x to the above equation is [ ] [ ] [ ] x = A 1 2/3 1/ /3 5/3 b = = = Thus the unique solution is x = y = 6. [ 17/3 6 ].So x = 17/3 and ]. [ 17/3 6 ].
62 Properties of invertible matrices
63 Properties of invertible matrices Theorem 1 If A is an invertible matrix, then A 1 is also invertible, and the inverse of A 1 is A.
64 Properties of invertible matrices Theorem 1 If A is an invertible matrix, then A 1 is also invertible, and the inverse of A 1 is A. 2 If A and B are n n invertible matrices, then so is AB, and the inverse of AB is B 1 A 1 [Similar to the formula for the transpose of a product]
65 Properties of invertible matrices Theorem 1 If A is an invertible matrix, then A 1 is also invertible, and the inverse of A 1 is A. 2 If A and B are n n invertible matrices, then so is AB, and the inverse of AB is B 1 A 1 [Similar to the formula for the transpose of a product] 3 The transpose of an invertible matrix is invertible, and (A T ) 1 = (A 1 ) T.
66 Properties of invertible matrices Theorem 1 If A is an invertible matrix, then A 1 is also invertible, and the inverse of A 1 is A. 2 If A and B are n n invertible matrices, then so is AB, and the inverse of AB is B 1 A 1 [Similar to the formula for the transpose of a product] 3 The transpose of an invertible matrix is invertible, and (A T ) 1 = (A 1 ) T. Proof. Proof in the book is uncomplicated but you should read it. You really only need associativity of matrix multiplication, the fact that I n A = A = AI n for n n matrices, and properties of the transpose.
67 Properties of invertible matrices Theorem 1 If A is an invertible matrix, then A 1 is also invertible, and the inverse of A 1 is A. 2 If A and B are n n invertible matrices, then so is AB, and the inverse of AB is B 1 A 1 [Similar to the formula for the transpose of a product] 3 The transpose of an invertible matrix is invertible, and (A T ) 1 = (A 1 ) T. Proof. Proof in the book is uncomplicated but you should read it. You really only need associativity of matrix multiplication, the fact that I n A = A = AI n for n n matrices, and properties of the transpose. In general, if A 1, A 2,..., A k are a bunch of invertible n n matrices then so is A 1 A 2... A k, and (A 1 A 2... A k ) 1 = A 1... A 1 k 2 A 1 1.
68 Elementary matrices and row operations Recall the elementary row operations: interchange, replacement, scaling.
69 Elementary matrices and row operations Recall the elementary row operations: interchange, replacement, scaling. We want to reformulate them so that performing an elementary row operation on the square matrix A is the same as taking the product EA by some invertible matrix E. This will allow us effective computation of matrix inverses.
70 Elementary matrices and row operations Recall the elementary row operations: interchange, replacement, scaling. We want to reformulate them so that performing an elementary row operation on the square matrix A is the same as taking the product EA by some invertible matrix E. This will allow us effective computation of matrix inverses. Definition An elementary matrix is a matrix obtained by performing an elementary row operation on an identity matrix.
71 Elementary matrices and row operations Recall the elementary row operations: interchange, replacement, scaling. We want to reformulate them so that performing an elementary row operation on the square matrix A is the same as taking the product EA by some invertible matrix E. This will allow us effective computation of matrix inverses. Definition An elementary matrix is a matrix obtained by performing an elementary row operation on an identity matrix. Example [ ]
72 Elementary matrices and row operations Recall the elementary row operations: interchange, replacement, scaling. We want to reformulate them so that performing an elementary row operation on the square matrix A is the same as taking the product EA by some invertible matrix E. This will allow us effective computation of matrix inverses. Definition An elementary matrix is a matrix obtained by performing an elementary row operation on an identity matrix. Example [ ]
73 Elementary matrices and row operations Recall the elementary row operations: interchange, replacement, scaling. We want to reformulate them so that performing an elementary row operation on the square matrix A is the same as taking the product EA by some invertible matrix E. This will allow us effective computation of matrix inverses. Definition An elementary matrix is a matrix obtained by performing an elementary row operation on an identity matrix. Example [ ]
74 Elementary matrices and row operations Recall the elementary row operations: interchange, replacement, scaling. We want to reformulate them so that performing an elementary row operation on the square matrix A is the same as taking the product EA by some invertible matrix E. This will allow us effective computation of matrix inverses. Definition An elementary matrix is a matrix obtained by performing an elementary row operation on an identity matrix. Example [ ] are all elementary matrices
75 Elementary matrices are invertible Remember that the elementary row operations can be reversed:
76 Elementary matrices are invertible Remember that the elementary row operations can be reversed: 1 interchanging rows i 1 and i 2 is reversed by interchanging the rows again.
77 Elementary matrices are invertible Remember that the elementary row operations can be reversed: 1 interchanging rows i 1 and i 2 is reversed by interchanging the rows again. 2 scaling a row by c is reversed by scaling the same row by 1 c
78 Elementary matrices are invertible Remember that the elementary row operations can be reversed: 1 interchanging rows i 1 and i 2 is reversed by interchanging the rows again. 2 scaling a row by c is reversed by scaling the same row by 1 c 3 replacing row i 1 with c times row i 2 is reversed by subtracting c times row i 2 from row i 1
79 Elementary matrices are invertible Remember that the elementary row operations can be reversed: 1 interchanging rows i 1 and i 2 is reversed by interchanging the rows again. 2 scaling a row by c is reversed by scaling the same row by 1 c 3 replacing row i 1 with c times row i 2 is reversed by subtracting c times row i 2 from row i 1 This gives us that every elementary matrix E corresponding to a row operation is invertible, and E 1 is the elementary matrix corresponding to the reverse elementary row operation.
80 Elementry matrices are invertible Example [ ] 1 0 Let E =. Then E is the elementary matrix corresponding 5 1 to the row operation add 5 times the first row to the second row.
81 Elementry matrices are invertible Example [ ] 1 0 Let E =. Then E is the elementary matrix corresponding 5 1 to the row operation add 5 times the first row to the second row. Then its inverse is the elementary matrix corresponding to the row operation subtract 5 times the first row from the second row.
82 Elementry matrices are invertible Example [ ] 1 0 Let E =. Then E is the elementary matrix corresponding 5 1 to the row operation add 5 times the first row to the second row. Then its inverse is the elementary matrix corresponding to the row operation subtract 5 times the first row from the second row. That is, E 1 = [ ].
83 Elementary matrices in action Example Let E 1 be the elementary matrix obtained by adding the first row of I 2 to its second row. [ ] 1 0 E 1 =. 1 1
84 Elementary matrices in action Example Let E 1 be the elementary matrix obtained by adding the first row of I 2 to its second row. [ ] 1 0 E 1 =. 1 1 [ ] a b Then for any 2 2 matrix A = we have c d
85 Elementary matrices in action Example Let E 1 be the elementary matrix obtained by adding the first row of I 2 to its second row. [ ] 1 0 E 1 =. 1 1 [ ] a b Then for any 2 2 matrix A = we have c d E 1 A
86 Elementary matrices in action Example Let E 1 be the elementary matrix obtained by adding the first row of I 2 to its second row. [ ] 1 0 E 1 =. 1 1 [ ] a b Then for any 2 2 matrix A = we have c d E 1 A = [ ] [ a b ] c d
87 Elementary matrices in action Example Let E 1 be the elementary matrix obtained by adding the first row of I 2 to its second row. [ ] 1 0 E 1 =. 1 1 [ ] a b Then for any 2 2 matrix A = we have c d [ ] [ ] [ 1 0 a b E 1 A = = 1 1 c d a a + c b b + d ].
88 Invertibility and elementary row ops. Theorem Let A be an n n matrix. Then A is invertible if and only if A is row equivalent to I n, and any sequence of row operations that transforms A into I applied in the same order to I transforms I into A 1.
89 Invertibility and elementary row ops. Theorem Let A be an n n matrix. Then A is invertible if and only if A is row equivalent to I n, and any sequence of row operations that transforms A into I applied in the same order to I transforms I into A 1. Put another way, if E 1, E 2,..., E k are the elementary matrices corresponding to the row operations transforming A into I, so that E 1 E 2... E k A = I,
90 Invertibility and elementary row ops. Theorem Let A be an n n matrix. Then A is invertible if and only if A is row equivalent to I n, and any sequence of row operations that transforms A into I applied in the same order to I transforms I into A 1. Put another way, if E 1, E 2,..., E k are the elementary matrices corresponding to the row operations transforming A into I, so that E 1 E 2... E k A = I, then we necessarily have that E 1 E 2... E k I = E 1... E k = A 1.
91 Matrix inversion algorithm
92 Matrix inversion algorithm The theorem in the preceding slide tells us how to compute the inverse of any invertible matrix, and it encodes a way to check if an n n matrix is invertible, all through row reduction.
93 Matrix inversion algorithm The theorem in the preceding slide tells us how to compute the inverse of any invertible matrix, and it encodes a way to check if an n n matrix is invertible, all through row reduction. Fact Let A be an n n matrix and form the augmented matrix [A I n ]. Row reduce this matrix as usual. If the reduced echelon form looks like [I n C] then A is invertible and C = A 1.
94 Matrix inversion algorithm The theorem in the preceding slide tells us how to compute the inverse of any invertible matrix, and it encodes a way to check if an n n matrix is invertible, all through row reduction. Fact Let A be an n n matrix and form the augmented matrix [A I n ]. Row reduce this matrix as usual. If the reduced echelon form looks like [I n C] then A is invertible and C = A 1. If the reduced echelon form looks any other way, then A is not invertible (in fact, you can decide if A is invertible just by transforming to echelon form and seeing if there are any rows that have n 0s in the left half.
95 Example of MIA Let s find determine if the matrix A = is invertible and find its inverse, if possible. Form the augmented system
96 Ex. of MIA, pt. II
97 Ex. of MIA, pt. II
98 Ex. of MIA, pt. II
99 Ex. of MIA, pt. II
100 Ex. of MIA, pt. II
101 Ex. of MIA, pt. II Now we can pause at echelon form to say that there are no bad rows..
102 Row reduction details We keep row reducing the entire augmented matrix /18 1/18 5/
103 Row reduction details We keep row reducing the entire augmented matrix /18 1/18 5/ /18 3/18 15/ /18 5/18 7/ /18 1/18 5/18
104 Row reduction details We keep row reducing the entire augmented matrix /18 1/18 5/ This is in reduced echelon form /18 3/18 15/ /18 5/18 7/ /18 1/18 5/ /18 7/8 1/ /18 5/18 7/ /18 1/18 5/18
105 Row reduction details We keep row reducing the entire augmented matrix /18 1/18 5/ /18 3/18 15/ /18 5/18 7/ /18 1/18 5/ /18 7/8 1/ /18 5/18 7/ /18 1/18 5/18 This is in reduced echelon form. The right half of the augmented matrix is the inverse of A.
106 Inverse We computed that = 5/18 7/18 1/18 1/18 5/18 7/18 7/18 1/18 5/18.
107 Inverse We computed that = 5/18 7/18 1/18 1/18 5/18 7/18 7/18 1/18 5/18. If you multiply the two matrices you get the identity /18 7/18 1/ /18 5/18 7/18 = /18 1/18 5/
108 When is a matrix invertible? We have seen that a matrix is invertible if you can reduce it to the identity matrix via row operations. This description is not complete enough for our purposes we don t always want to have to run the row reduction algorithm every time.
109 Theorem (The Invertible Matrix Theorem) If A is an n n matrix then the following are equivalent: 1 A is invertible
110 Theorem (The Invertible Matrix Theorem) If A is an n n matrix then the following are equivalent: 1 A is invertible 2 A is row equivalent to I n
111 Theorem (The Invertible Matrix Theorem) If A is an n n matrix then the following are equivalent: 1 A is invertible 2 A is row equivalent to I n 3 A has n pivot columns
112 Theorem (The Invertible Matrix Theorem) If A is an n n matrix then the following are equivalent: 1 A is invertible 2 A is row equivalent to I n 3 A has n pivot columns 4 the equation Ax = 0 has only the trivial solution
113 Theorem (The Invertible Matrix Theorem) If A is an n n matrix then the following are equivalent: 1 A is invertible 2 A is row equivalent to I n 3 A has n pivot columns 4 the equation Ax = 0 has only the trivial solution 5 the columns of A form a linearly independent set
114 Theorem (The Invertible Matrix Theorem) If A is an n n matrix then the following are equivalent: 1 A is invertible 2 A is row equivalent to I n 3 A has n pivot columns 4 the equation Ax = 0 has only the trivial solution 5 the columns of A form a linearly independent set 6 the linear transformation x Ax is one-to-one
115 Theorem (The Invertible Matrix Theorem) If A is an n n matrix then the following are equivalent: 1 A is invertible 2 A is row equivalent to I n 3 A has n pivot columns 4 the equation Ax = 0 has only the trivial solution 5 the columns of A form a linearly independent set 6 the linear transformation x Ax is one-to-one 7 the equation Ax = b has at least one solution for each b R n
116 Theorem (The Invertible Matrix Theorem) If A is an n n matrix then the following are equivalent: 1 A is invertible 2 A is row equivalent to I n 3 A has n pivot columns 4 the equation Ax = 0 has only the trivial solution 5 the columns of A form a linearly independent set 6 the linear transformation x Ax is one-to-one 7 the equation Ax = b has at least one solution for each b R n 8 the columns of A span R n
117 Theorem (The Invertible Matrix Theorem) If A is an n n matrix then the following are equivalent: 1 A is invertible 2 A is row equivalent to I n 3 A has n pivot columns 4 the equation Ax = 0 has only the trivial solution 5 the columns of A form a linearly independent set 6 the linear transformation x Ax is one-to-one 7 the equation Ax = b has at least one solution for each b R n 8 the columns of A span R n 9 the linear transformation x Ax maps R n onto R n
118 Theorem (The Invertible Matrix Theorem) If A is an n n matrix then the following are equivalent: 1 A is invertible 2 A is row equivalent to I n 3 A has n pivot columns 4 the equation Ax = 0 has only the trivial solution 5 the columns of A form a linearly independent set 6 the linear transformation x Ax is one-to-one 7 the equation Ax = b has at least one solution for each b R n 8 the columns of A span R n 9 the linear transformation x Ax maps R n onto R n 10 there is an n n matrix C such that CA = I n
119 Theorem (The Invertible Matrix Theorem) If A is an n n matrix then the following are equivalent: 1 A is invertible 2 A is row equivalent to I n 3 A has n pivot columns 4 the equation Ax = 0 has only the trivial solution 5 the columns of A form a linearly independent set 6 the linear transformation x Ax is one-to-one 7 the equation Ax = b has at least one solution for each b R n 8 the columns of A span R n 9 the linear transformation x Ax maps R n onto R n 10 there is an n n matrix C such that CA = I n 11 there is an n n matrix D such that AD = I n
120 Theorem (The Invertible Matrix Theorem) If A is an n n matrix then the following are equivalent: 1 A is invertible 2 A is row equivalent to I n 3 A has n pivot columns 4 the equation Ax = 0 has only the trivial solution 5 the columns of A form a linearly independent set 6 the linear transformation x Ax is one-to-one 7 the equation Ax = b has at least one solution for each b R n 8 the columns of A span R n 9 the linear transformation x Ax maps R n onto R n 10 there is an n n matrix C such that CA = I n 11 there is an n n matrix D such that AD = I n 12 A T is invertible
121 Proving the IMT: 1 implies 2 implies 3 implies 4 implies 5 If A is invertible then A is row equivalent to I n by the previous section. So (1) implies (2).
122 Proving the IMT: 1 implies 2 implies 3 implies 4 implies 5 If A is invertible then A is row equivalent to I n by the previous section. So (1) implies (2). If A is row-equivalent to I n, then the row-operations that transform A to I n actually transform A into reduced echelon form. Since I n has no non-pivot columns, A has no non-pivot columns. So (2) implies (3)
123 Proving the IMT: 1 implies 2 implies 3 implies 4 implies 5 If A is invertible then A is row equivalent to I n by the previous section. So (1) implies (2). If A is row-equivalent to I n, then the row-operations that transform A to I n actually transform A into reduced echelon form. Since I n has no non-pivot columns, A has no non-pivot columns. So (2) implies (3) Suppose A has n pivot columns. If we augment A with 0 and row-reduce, there are no free variables. Thus Ax = 0 has only the trivial solution. So (3) implies (4)
124 Proving the IMT: 1 implies 2 implies 3 implies 4 implies 5 If A is invertible then A is row equivalent to I n by the previous section. So (1) implies (2). If A is row-equivalent to I n, then the row-operations that transform A to I n actually transform A into reduced echelon form. Since I n has no non-pivot columns, A has no non-pivot columns. So (2) implies (3) Suppose A has n pivot columns. If we augment A with 0 and row-reduce, there are no free variables. Thus Ax = 0 has only the trivial solution. So (3) implies (4) Any linear dependence relation among the columns of A gives a non-trivial solution to Ax = 0. Thus (4) implies (5).
125 Application of the IMT We can use the IMT to check if things are non-invertible really easily.
126 Application of the IMT We can use the IMT to check if things are non-invertible really easily. Example Let A =
127 Application of the IMT We can use the IMT to check if things are non-invertible really easily. Example Let A = reduction Let s see if A is invertible without row
128 Application of the IMT We can use the IMT to check if things are non-invertible really easily. Example Let A = Let s see if A is invertible without row reduction. There s a whole bunch of ways to check, but one that is nice is: if A has linearly dependent columns, then A is not invertible.
129 Application of the IMT We can use the IMT to check if things are non-invertible really easily. Example Let A = Let s see if A is invertible without row reduction. There s a whole bunch of ways to check, but one that is nice is: if A has linearly dependent columns, then A is not invertible. We note that the fourth column of A is 2 times the first column of A.
130 Application of the IMT We can use the IMT to check if things are non-invertible really easily. Example Let A = Let s see if A is invertible without row reduction. There s a whole bunch of ways to check, but one that is nice is: if A has linearly dependent columns, then A is not invertible. We note that the fourth column of A is 2 times the first column of A. Thus the columns of A are linearly dependent, so A is not invertible by the IMT.
131 Invertible maps Definition A function f : X Y is called invertible (or bijective) if there is a map g : Y X such that f (g(y)) = y for all y Y and g(f (x)) = x for all x X. If such a g exists, it is called the inverse of f.
132 Invertible maps Definition A function f : X Y is called invertible (or bijective) if there is a map g : Y X such that f (g(y)) = y for all y Y and g(f (x)) = x for all x X. If such a g exists, it is called the inverse of f. When is a linear transformation T given by x Ax invertible?
133 Invertible maps Definition A function f : X Y is called invertible (or bijective) if there is a map g : Y X such that f (g(y)) = y for all y Y and g(f (x)) = x for all x X. If such a g exists, it is called the inverse of f. When is a linear transformation T given by x Ax invertible? Precisely when A is an invertible matrix.
134 Theorem Let A be n n and let T be the linear transformation x Ax.
135 Theorem Let A be n n and let T be the linear transformation x Ax.Then T is invertible if and only if A is invertible.
136 Theorem Let A be n n and let T be the linear transformation x Ax.Then T is invertible if and only if A is invertible. Proof. Suppose that A is invertible. Define S : R n R n by S(x) = A 1 x.
137 Theorem Let A be n n and let T be the linear transformation x Ax.Then T is invertible if and only if A is invertible. Proof. Suppose that A is invertible. Define S : R n R n by S(x) = A 1 x. Then T (S(x)) = AA 1 (x) = x and S(T (x)) = x for all x R n.
138 Theorem Let A be n n and let T be the linear transformation x Ax.Then T is invertible if and only if A is invertible. Proof. Suppose that A is invertible. Define S : R n R n by S(x) = A 1 x. Then T (S(x)) = AA 1 (x) = x and S(T (x)) = x for all x R n. Suppose that T is invertible with inverse S. We show that Ax = 0 has only the trivial solution.
139 Theorem Let A be n n and let T be the linear transformation x Ax.Then T is invertible if and only if A is invertible. Proof. Suppose that A is invertible. Define S : R n R n by S(x) = A 1 x. Then T (S(x)) = AA 1 (x) = x and S(T (x)) = x for all x R n. Suppose that T is invertible with inverse S. We show that Ax = 0 has only the trivial solution. If T (x) = T (0) then S(T (x)) = S(T (0)). But S is the inverse of T, so x = 0. Thus the only solution to Ax = 0 is the trivial solution. The IMT tells us that A is invertible.
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
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
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
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
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
Solutions to Math 51 First Exam January 29, 2015
Solutions to Math 5 First Exam January 29, 25. ( points) (a) Complete the following sentence: A set of vectors {v,..., v k } is defined to be linearly dependent if (2 points) there exist c,... c k R, not
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
MATH10212 Linear Algebra. Systems of Linear Equations. Definition. An n-dimensional vector is a row or a column of n numbers (or letters): a 1.
MATH10212 Linear Algebra Textbook: D. Poole, Linear Algebra: A Modern Introduction. Thompson, 2006. ISBN 0-534-40596-7. Systems of Linear Equations Definition. An n-dimensional vector is a row or a column
Row Echelon Form and Reduced Row Echelon Form
These notes closely follow the presentation of the material given in David C Lay s textbook Linear Algebra and its Applications (3rd edition) These notes are intended primarily for in-class presentation
Lecture 2 Matrix Operations
Lecture 2 Matrix Operations transpose, sum & difference, scalar multiplication matrix multiplication, matrix-vector product matrix inverse 2 1 Matrix transpose transpose of m n matrix A, denoted A T or
DETERMINANTS TERRY A. LORING
DETERMINANTS TERRY A. LORING 1. Determinants: a Row Operation By-Product The determinant is best understood in terms of row operations, in my opinion. Most books start by defining the determinant via formulas
a 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2.
Chapter 1 LINEAR EQUATIONS 1.1 Introduction to linear equations A linear equation in n unknowns x 1, x,, x n is an equation of the form a 1 x 1 + a x + + a n x n = b, where a 1, a,..., a n, b are given
MAT188H1S Lec0101 Burbulla
Winter 206 Linear Transformations A linear transformation T : R m R n is a function that takes vectors in R m to vectors in R n such that and T (u + v) T (u) + T (v) T (k v) k T (v), for all vectors u
MATH2210 Notebook 1 Fall Semester 2016/2017. 1 MATH2210 Notebook 1 3. 1.1 Solving Systems of Linear Equations... 3
MATH0 Notebook Fall Semester 06/07 prepared by Professor Jenny Baglivo c Copyright 009 07 by Jenny A. Baglivo. All Rights Reserved. Contents MATH0 Notebook 3. Solving Systems of Linear Equations........................
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
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
MATH 551 - APPLIED MATRIX THEORY
MATH 55 - APPLIED MATRIX THEORY FINAL TEST: SAMPLE with SOLUTIONS (25 points NAME: PROBLEM (3 points A web of 5 pages is described by a directed graph whose matrix is given by A Do the following ( points
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
1.2 Solving a System of Linear Equations
1.. SOLVING A SYSTEM OF LINEAR EQUATIONS 1. Solving a System of Linear Equations 1..1 Simple Systems - Basic De nitions As noticed above, the general form of a linear system of m equations in n variables
Solving Systems of Linear Equations
LECTURE 5 Solving Systems of Linear Equations Recall that we introduced the notion of matrices as a way of standardizing the expression of systems of linear equations In today s lecture I shall show how
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
Orthogonal Projections
Orthogonal Projections and Reflections (with exercises) by D. Klain Version.. Corrections and comments are welcome! Orthogonal Projections Let X,..., X k be a family of linearly independent (column) vectors
Similar matrices and Jordan form
Similar matrices and Jordan form We ve nearly covered the entire heart of linear algebra once we ve finished singular value decompositions we ll have seen all the most central topics. A T A is positive
160 CHAPTER 4. VECTOR SPACES
160 CHAPTER 4. VECTOR SPACES 4. Rank and Nullity In this section, we look at relationships between the row space, column space, null space of a matrix and its transpose. We will derive fundamental results
( ) which must be a vector
MATH 37 Linear Transformations from Rn to Rm Dr. Neal, WKU Let T : R n R m be a function which maps vectors from R n to R m. Then T is called a linear transformation if the following two properties are
LS.6 Solution Matrices
LS.6 Solution Matrices In the literature, solutions to linear systems often are expressed using square matrices rather than vectors. You need to get used to the terminology. As before, we state the definitions
MAT 200, Midterm Exam Solution. a. (5 points) Compute the determinant of the matrix A =
MAT 200, Midterm Exam Solution. (0 points total) a. (5 points) Compute the determinant of the matrix 2 2 0 A = 0 3 0 3 0 Answer: det A = 3. The most efficient way is to develop the determinant along the
Math 312 Homework 1 Solutions
Math 31 Homework 1 Solutions Last modified: July 15, 01 This homework is due on Thursday, July 1th, 01 at 1:10pm Please turn it in during class, or in my mailbox in the main math office (next to 4W1) Please
by the matrix A results in a vector which is a reflection of the given
Eigenvalues & Eigenvectors Example Suppose Then So, geometrically, multiplying a vector in by the matrix A results in a vector which is a reflection of the given vector about the y-axis We observe that
Continued Fractions and the Euclidean Algorithm
Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction
SYSTEMS OF EQUATIONS AND MATRICES WITH THE TI-89. by Joseph Collison
SYSTEMS OF EQUATIONS AND MATRICES WITH THE TI-89 by Joseph Collison Copyright 2000 by Joseph Collison All rights reserved Reproduction or translation of any part of this work beyond that permitted by Sections
Methods for Finding Bases
Methods for Finding Bases Bases for the subspaces of a matrix Row-reduction methods can be used to find bases. Let us now look at an example illustrating how to obtain bases for the row space, null space,
Matrix Algebra. Some Basic Matrix Laws. Before reading the text or the following notes glance at the following list of basic matrix algebra laws.
Matrix Algebra A. Doerr Before reading the text or the following notes glance at the following list of basic matrix algebra laws. Some Basic Matrix Laws Assume the orders of the matrices are such that
[1] Diagonal factorization
![[1] Diagonal factorization](/thumbs/40/21671034.jpg "[1] Diagonal factorization")
8.03 LA.6: Diagonalization and Orthogonal Matrices [ Diagonal factorization [2 Solving systems of first order differential equations [3 Symmetric and Orthonormal Matrices [ Diagonal factorization Recall:
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
Subspaces of R n LECTURE 7. 1. Subspaces
LECTURE 7 Subspaces of R n Subspaces Definition 7 A subset W of R n is said to be closed under vector addition if for all u, v W, u + v is also in W If rv is in W for all vectors v W and all scalars r
18.06 Problem Set 4 Solution Due Wednesday, 11 March 2009 at 4 pm in 2-106. Total: 175 points.
806 Problem Set 4 Solution Due Wednesday, March 2009 at 4 pm in 2-06 Total: 75 points Problem : A is an m n matrix of rank r Suppose there are right-hand-sides b for which A x = b has no solution (a) What
Reduced echelon form: Add the following conditions to conditions 1, 2, and 3 above:
Section 1.2: Row Reduction and Echelon Forms Echelon form (or row echelon form): 1. All nonzero rows are above any rows of all zeros. 2. Each leading entry (i.e. left most nonzero entry) of a row is in
Linearly Independent Sets and Linearly Dependent Sets
These notes closely follow the presentation of the material given in David C. Lay s textbook Linear Algebra and its Applications (3rd edition). These notes are intended primarily for in-class presentation
Notes on Orthogonal and Symmetric Matrices MENU, Winter 2013
Notes on Orthogonal and Symmetric Matrices MENU, Winter 201 These notes summarize the main properties and uses of orthogonal and symmetric matrices. We covered quite a bit of material regarding these topics,
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
University of Lille I PC first year list of exercises n 7. Review
University of Lille I PC first year list of exercises n 7 Review Exercise Solve the following systems in 4 different ways (by substitution, by the Gauss method, by inverting the matrix of coefficients
1 0 5 3 3 A = 0 0 0 1 3 0 0 0 0 0 0 0 0 0 0
Solutions: Assignment 4.. Find the redundant column vectors of the given matrix A by inspection. Then find a basis of the image of A and a basis of the kernel of A. 5 A The second and third columns are
7.4. The Inverse of a Matrix. Introduction. Prerequisites. Learning Style. Learning Outcomes
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 =. Similarly a square matrix A may have an inverse B = A where AB =
7 Gaussian Elimination and LU Factorization
7 Gaussian Elimination and LU Factorization In this final section on matrix factorization methods for solving Ax = b we want to take a closer look at Gaussian elimination (probably the best known method
Lecture 3: Finding integer solutions to systems of linear equations
Lecture 3: Finding integer solutions to systems of linear equations Algorithmic Number Theory (Fall 2014) Rutgers University Swastik Kopparty Scribe: Abhishek Bhrushundi 1 Overview The goal of this lecture
Typical Linear Equation Set and Corresponding Matrices
EWE: Engineering With Excel Larsen Page 1 4. Matrix Operations in Excel. Matrix Manipulations: Vectors, Matrices, and Arrays. How Excel Handles Matrix Math. Basic Matrix Operations. Solving Systems of
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
Linear Algebra Notes
Linear Algebra Notes Chapter 19 KERNEL AND IMAGE OF A MATRIX Take an n m matrix a 11 a 12 a 1m a 21 a 22 a 2m a n1 a n2 a nm and think of it as a function A : R m R n The kernel of A is defined as Note
Abstract: We describe the beautiful LU factorization of a square matrix (or how to write Gaussian elimination in terms of matrix multiplication).
MAT 2 (Badger, Spring 202) LU Factorization Selected Notes September 2, 202 Abstract: We describe the beautiful LU factorization of a square matrix (or how to write Gaussian elimination in terms of matrix
Examination paper for TMA4115 Matematikk 3
Department of Mathematical Sciences Examination paper for TMA45 Matematikk 3 Academic contact during examination: Antoine Julien a, Alexander Schmeding b, Gereon Quick c Phone: a 73 59 77 82, b 40 53 99
Matrix Representations of Linear Transformations and Changes of Coordinates
Matrix Representations of Linear Transformations and Changes of Coordinates 01 Subspaces and Bases 011 Definitions A subspace V of R n is a subset of R n that contains the zero element and is closed under
Lecture Notes 2: Matrices as Systems of Linear Equations
2: Matrices as Systems of Linear Equations 33A Linear Algebra, Puck Rombach Last updated: April 13, 2016 Systems of Linear Equations Systems of linear equations can represent many things You have probably
MATH 304 Linear Algebra Lecture 18: Rank and nullity of a matrix.
MATH 304 Linear Algebra Lecture 18: Rank and nullity of a matrix. Nullspace Let A = (a ij ) be an m n matrix. Definition. The nullspace of the matrix A, denoted N(A), is the set of all n-dimensional column
1 VECTOR SPACES AND SUBSPACES
1 VECTOR SPACES AND SUBSPACES What is a vector? Many are familiar with the concept of a vector as: Something which has magnitude and direction. an ordered pair or triple. a description for quantities such
Solution to Homework 2
Solution to Homework 2 Olena Bormashenko September 23, 2011 Section 1.4: 1(a)(b)(i)(k), 4, 5, 14; Section 1.5: 1(a)(b)(c)(d)(e)(n), 2(a)(c), 13, 16, 17, 18, 27 Section 1.4 1. Compute the following, if
T ( a i x i ) = a i T (x i ).
Chapter 2 Defn 1. (p. 65) Let V and W be vector spaces (over F ). We call a function T : V W a linear transformation form V to W if, for all x, y V and c F, we have (a) T (x + y) = T (x) + T (y) and (b)
Question 2: How do you solve a matrix equation using the matrix inverse?
Question : How do you solve a matrix equation using the matrix inverse? In the previous question, we wrote systems of equations as a matrix equation AX B. In this format, the matrix A contains the coefficients
Properties of Real Numbers
16 Chapter P Prerequisites P.2 Properties of Real Numbers What you should learn: Identify and use the basic properties of real numbers Develop and use additional properties of real numbers Why you should
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,
Systems of Linear Equations
Chapter 1 Systems of Linear Equations 1.1 Intro. to systems of linear equations Homework: [Textbook, Ex. 13, 15, 41, 47, 49, 51, 65, 73; page 11-]. Main points in this section: 1. Definition of Linear
MAT 242 Test 2 SOLUTIONS, FORM T
MAT 242 Test 2 SOLUTIONS, FORM T 5 3 5 3 3 3 3. Let v =, v 5 2 =, v 3 =, and v 5 4 =. 3 3 7 3 a. [ points] The set { v, v 2, v 3, v 4 } is linearly dependent. Find a nontrivial linear combination of these
Name: Section Registered In:
Name: Section Registered In: Math 125 Exam 3 Version 1 April 24, 2006 60 total points possible 1. (5pts) Use Cramer s Rule to solve 3x + 4y = 30 x 2y = 8. Be sure to show enough detail that shows you are
NOTES ON LINEAR TRANSFORMATIONS
NOTES ON LINEAR TRANSFORMATIONS Definition 1. Let V and W be vector spaces. A function T : V W is a linear transformation from V to W if the following two properties hold. i T v + v = T v + T v for all
5 Homogeneous systems
5 Homogeneous systems Definition: A homogeneous (ho-mo-jeen -i-us) system of linear algebraic equations is one in which all the numbers on the right hand side are equal to : a x +... + a n x n =.. a m
Lecture notes on linear algebra
Lecture notes on linear algebra David Lerner Department of Mathematics University of Kansas These are notes of a course given in Fall, 2007 and 2008 to the Honors sections of our elementary linear algebra
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
Arkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan
Arkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan 3 Binary Operations We are used to addition and multiplication of real numbers. These operations combine two real numbers
Lecture 4: Partitioned Matrices and Determinants
Lecture 4: Partitioned Matrices and Determinants 1 Elementary row operations Recall the elementary operations on the rows of a matrix, equivalent to premultiplying by an elementary matrix E: (1) multiplying
7. LU factorization. factor-solve method. LU factorization. solving Ax = b with A nonsingular. the inverse of a nonsingular matrix
7. LU factorization EE103 (Fall 2011-12) factor-solve method LU factorization solving Ax = b with A nonsingular the inverse of a nonsingular matrix LU factorization algorithm effect of rounding error sparse
ISOMETRIES OF R n KEITH CONRAD
ISOMETRIES OF R n KEITH CONRAD 1. Introduction An isometry of R n is a function h: R n R n that preserves the distance between vectors: h(v) h(w) = v w for all v and w in R n, where (x 1,..., x n ) = x
Recall that two vectors in are perpendicular or orthogonal provided that their dot
Orthogonal Complements and Projections Recall that two vectors in are perpendicular or orthogonal provided that their dot product vanishes That is, if and only if Example 1 The vectors in are orthogonal
Linear Equations ! 25 30 35$ & " 350 150% & " 11,750 12,750 13,750% MATHEMATICS LEARNING SERVICE Centre for Learning and Professional Development
MathsTrack (NOTE Feb 2013: This is the old version of MathsTrack. New books will be created during 2013 and 2014) Topic 4 Module 9 Introduction Systems of to Matrices Linear Equations Income = Tickets!
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
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
6. Cholesky factorization
6. Cholesky factorization EE103 (Fall 2011-12) triangular matrices forward and backward substitution the Cholesky factorization solving Ax = b with A positive definite inverse of a positive definite matrix
The last three chapters introduced three major proof techniques: direct,
CHAPTER 7 Proving Non-Conditional Statements The last three chapters introduced three major proof techniques: direct, contrapositive and contradiction. These three techniques are used to prove statements
Section 1.7 22 Continued
Section 1.5 23 A homogeneous equation is always consistent. TRUE - The trivial solution is always a solution. The equation Ax = 0 gives an explicit descriptions of its solution set. FALSE - The equation
LINEAR ALGEBRA. September 23, 2010
LINEAR ALGEBRA September 3, 00 Contents 0. LU-decomposition.................................... 0. Inverses and Transposes................................. 0.3 Column Spaces and NullSpaces.............................
Linear Maps. Isaiah Lankham, Bruno Nachtergaele, Anne Schilling (February 5, 2007)
MAT067 University of California, Davis Winter 2007 Linear Maps Isaiah Lankham, Bruno Nachtergaele, Anne Schilling (February 5, 2007) As we have discussed in the lecture on What is Linear Algebra? one of
CS3220 Lecture Notes: QR factorization and orthogonal transformations
CS3220 Lecture Notes: QR factorization and orthogonal transformations Steve Marschner Cornell University 11 March 2009 In this lecture I ll talk about orthogonal matrices and their properties, discuss
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
9 MATRICES AND TRANSFORMATIONS
9 MATRICES AND TRANSFORMATIONS Chapter 9 Matrices and Transformations Objectives After studying this chapter you should be able to handle matrix (and vector) algebra with confidence, and understand the
1.5 SOLUTION SETS OF LINEAR SYSTEMS
1-2 CHAPTER 1 Linear Equations in Linear Algebra 1.5 SOLUTION SETS OF LINEAR SYSTEMS Many of the concepts and computations in linear algebra involve sets of vectors which are visualized geometrically as
Introduction to Matrices for Engineers
Introduction to Matrices for Engineers C.T.J. Dodson, School of Mathematics, Manchester Universit 1 What is a Matrix? A matrix is a rectangular arra of elements, usuall numbers, e.g. 1 0-8 4 0-1 1 0 11
Cryptography and Network Security. Prof. D. Mukhopadhyay. Department of Computer Science and Engineering. Indian Institute of Technology, Kharagpur
Cryptography and Network Security Prof. D. Mukhopadhyay Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur Module No. # 01 Lecture No. # 12 Block Cipher Standards
2x + y = 3. Since the second equation is precisely the same as the first equation, it is enough to find x and y satisfying the system
1. Systems of linear equations We are interested in the solutions to systems of linear equations. A linear equation is of the form 3x 5y + 2z + w = 3. The key thing is that we don t multiply the variables
Elementary Matrices and The LU Factorization
lementary Matrices and The LU Factorization Definition: ny matrix obtained by performing a single elementary row operation (RO) on the identity (unit) matrix is called an elementary matrix. There are three
1 Solving LPs: The Simplex Algorithm of George Dantzig
Solving LPs: The Simplex Algorithm of George Dantzig. Simplex Pivoting: Dictionary Format We illustrate a general solution procedure, called the simplex algorithm, by implementing it on a very simple example.
Vector Spaces 4.4 Spanning and Independence
Vector Spaces 4.4 and Independence October 18 Goals Discuss two important basic concepts: Define linear combination of vectors. Define Span(S) of a set S of vectors. Define linear Independence of a set
I. GROUPS: BASIC DEFINITIONS AND EXAMPLES
I GROUPS: BASIC DEFINITIONS AND EXAMPLES Definition 1: An operation on a set G is a function : G G G Definition 2: A group is a set G which is equipped with an operation and a special element e G, called
MATH10040 Chapter 2: Prime and relatively prime numbers
MATH10040 Chapter 2: Prime and relatively prime numbers Recall the basic definition: 1. Prime numbers Definition 1.1. Recall that a positive integer is said to be prime if it has precisely two positive
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
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
Applications of Fermat s Little Theorem and Congruences
Applications of Fermat s Little Theorem and Congruences Definition: Let m be a positive integer. Then integers a and b are congruent modulo m, denoted by a b mod m, if m (a b). Example: 3 1 mod 2, 6 4
Here are some examples of combining elements and the operations used:
MATRIX OPERATIONS Summary of article: What is an operation? Addition of two matrices. Multiplication of a Matrix by a scalar. Subtraction of two matrices: two ways to do it. Combinations of Addition, Subtraction,
Chapter 6. Orthogonality
6.3 Orthogonal Matrices 1 Chapter 6. Orthogonality 6.3 Orthogonal Matrices Definition 6.4. An n n matrix A is orthogonal if A T A = I. Note. We will see that the columns of an orthogonal matrix must be
1 Review of Least Squares Solutions to Overdetermined Systems
cs4: introduction to numerical analysis /9/0 Lecture 7: Rectangular Systems and Numerical Integration Instructor: Professor Amos Ron Scribes: Mark Cowlishaw, Nathanael Fillmore Review of Least Squares
Vector and Matrix Norms
Chapter 1 Vector and Matrix Norms 11 Vector Spaces Let F be a field (such as the real numbers, R, or complex numbers, C) with elements called scalars A Vector Space, V, over the field F is a non-empty