Math 1553 Introduction to Linear Algebra
|
|
- Steven McLaughlin
- 5 years ago
- Views:
Transcription
1 Math 1553 Introduction to Linear Algebra Lecture Notes Chapter 2 Matrix Algebra School of Mathematics The Georgia Institute of Technology Math 1553 Lecture Notes for Chapter 2 Introduction, Slide 1
2 Section 2.1: Matrix Operations Terminology Suppose A is an m n matrix. Then a ij or A ij is the ij th entry a ii are diagonal entries diagonal matrix: all non-diagonal entries are 0 zero matrix: all entries are 0 Sums and Scalar Multiples Same as for vectors: component-wise, so matrices must be same size to add. Basic rules: A + B = B + A (A + B) + C = A + (B + C) r(a + B)rA + rb (r + s)a = ra + sa (rs)a = r(sa) A + 0 = A Math 1553 Lecture Notes for Chapter 2 Section 2.1: Matrix Operations, Slide 2
3 Matrix Multiplication If A = m n and B = n p, then AB is m p and (AB) ij = k a ik b kj = r i b j where r i is the i th row of A, and b j is the j th column of B. Clicker Question Are there A, B 0 such that AB = 0? 1. Yes 2. No Math 1553 Lecture Notes for Chapter 2 Section 2.1: Matrix Operations, Slide 3
4 Matrix Multiplication and Linear Transforms Fact. T AB = T A T B. So: matrix multiplication composition of linear transforms Why? It is enough to check that T AB(e i) = T A T B(e i). T AB(e i) = AB(e i) = i th col of AB r 1ci r 2c i =. r mc i = Ac i = A(Be i) = A(T B(e i)) = T A T B(e i) Another view: AB = A(c 1 c p) = (Ac 1 Ac p). Math 1553 Lecture Notes for Chapter 2 Section 2.1: Matrix Operations, Slide 4
5 Properties of Matrix Multiplication A(BC) = (AB)C A(B + C) = AB + AC (B + C)A = BA + CA r(ab) = (ra)b = A(rB) I ma = A = AI n, where I m is the m n identity matrix. Associativity Multiplication is associative because function composition is (just check with the formula). Communativity In general, AB BA AB = AC does not mean that B = C AB = 0 does not mean that A or B is 0 Math 1553 Lecture Notes for Chapter 2 Section 2.1: Matrix Operations, Slide 5
6 Section 2.2 The Inverse of a Matrix A = n n matrix. A is invertible (or non-singular) if there is a matrix A 1 with AA 1 = A 1 A = I n Where A 1 is the inverse of A. For example, ( ) 1 ( = Q. Can you guess the inverse of ( )? ) Q. Find a matrix that is not invertible. Math 1553 Lecture Notes for Chapter 2 Section 2.2: The Inverse of a Matrix, Slide 6
7 Transforms and Inverses Clicker Question Which of the followiong linear transforms of R 3 correspond to invertible matrices? projection to xy-plane rotation about z-axis by π reflection through origin reflection through xy-plane Math 1553 Lecture Notes for Chapter 2 Section 2.2: The Inverse of a Matrix, Slide 7
8 The 2 2 Case ( a b Fact. Let A = c d ). Then det(a) = ad bc is the determinant of A. ( d b If det(a) 0 then A is invertible and A 1 = 1 ad bc c a If det(a) = 0 then A is not invertible. Why? If A 0 we can verify this by calculating A 1 A or AA 1. If deta = 0, then 1/(ad bc) is undefined, and so A 1 is also undefined. ). Example. ( ) 1 ( 4 2 = ). Math 1553 Lecture Notes for Chapter 2 Section 2.2: The Inverse of a Matrix, Slide 8
9 Solving Linear Systems via Inverses Fact. If A is invertible, then Ax = b has exactly one solution, namely x = A 1 b. Why? Example. Solve 2x + 3y + 2z = 1 x + 3z = 1 2x + 2y + 3z = 1 Using = Math 1553 Lecture Notes for Chapter 2 Section 2.2: The Inverse of a Matrix, Slide 9
10 Some Facts If A, B are invertible matrices. A 1 is inveritble and (A 1 ) 1 = A AB is invertible and (AB) 1 = B 1 A 1 A T is invertible and (A T ) 1 = (A 1 ) T Q. What is (ABC) 1? A. (ABC) 1 = ((AB)C) 1 = C 1 (AB) 1 = C 1 B 1 A 1. Math 1553 Lecture Notes for Chapter 2 Section 2.2: The Inverse of a Matrix, Slide 10
11 An Algorithm for Finding A 1 Suppose A = n n matrix. Row reduce (A I n) If reduction has form (I n B) then A is invertible and B = A 1. Otherwise, A is not invertible Example. Find A Thus, the inverse is /2 1/ /2 1/2 Math 1553 Lecture Notes for Chapter 2 Section 2.2: The Inverse of a Matrix, Slide 11
12 Why Does This Work? First answer: we can think of the algorithm as simultanenously solving Ax 1 = e 1 Ax 2 = e 2 and so on. But the columns of A 1 are A 1 e i, which is x i. There is another explanation, which uses elementary matrices. Math 1553 Lecture Notes for Chapter 2 Section 2.2: The Inverse of a Matrix, Slide 12
13 Elementary Matrices Definition. operation. An elementary matrix, E, is one that differs by I n by one row Fact. If E is an elementary matrix for some row operation, then EA differs from A by some row operation. Why? To verify, check each row operation. Fact. Elementary matricies are invertible. Observation. An n n matrix A is invertible iff it is row equivalent to I n. In this case, the sequence of row operations taking A to I n also takes I n to A 1. This gives us a second explanation of the algorithm. Why is it true? E k E k 1 E 2E 1A = I n. If we multiply on right by A 1, then E k E k 1 E 2E 1I n = A 1. The above is an expression for the inverse of A. Math 1553 Lecture Notes for Chapter 2 Section 2.2: The Inverse of a Matrix, Slide 13
14 Cryptography Encode letters A,B,C,..., Z by 1, 2, 3,..., 26. Choose a matrix, A, say n n. Break messages into blocks of size n, which gives us (a set of) vectors. Apply A to each vector to get encrypted message Example. A = 2 0 1, and the encoded message is What is the encoded message? We can also ask: After decoding one message, can you use the same matrix to decode other messages? Can you decode (76, 37, 42) T? (81, 36, 72) T? Math 1553 Lecture Notes for Chapter 2 Section 2.2: The Inverse of a Matrix, Slide 14
15 Structural Engineering Suppose we put 3 downward forces on an elastic beam. By Hooke s law, the vertical displacements at those three points y 1, y 2, y 3 are given by a linear transformation. f 1 y 1 A f 2 f 3 = y 2 y 3 If we want to achieve a certain displacement, use A 1 to find the required forces. Math 1553 Lecture Notes for Chapter 2 Section 2.2: The Inverse of a Matrix, Slide 15
16 Section 2.3 Characteristics of Invertible Matrices The Invertible Matrix Theorem Suppose A = n n matrix, and T A : R n R n the associated linear transform. The following are equivalent. a) A is invertible b) A is row equivalent to I n c) A has n pivots d) Ax = 0 has only 0 solution e) columns of A are linearly independent f) T I is one-to-one g) Ax = b is consistent for all b in R n h) columns of A span R n i) T A is onto j) A has a left inverse k) A has a right inverse l) A T is invertible Math 1553 Lecture Notes for Chapter 2 Section 2.3: Characteristics of Invertible Matrices, Slide 16
17 The Invertible Matrix Theorem One possible road map. Math 1553 Lecture Notes for Chapter 2 Section 2.3: Characteristics of Invertible Matrices, Slide 17
18 The Invertible Matrix Theorem (IMT) There are two kinds of square matricies, invertible (or non-singular), and non-intertible (or singluar) matricies. For invertible matrices, all of the conditions in the IMT hold. And for a non-invertible matrix, the negations of the statements hold. Q. State the negations of statements (a) to (l). Clicker Question Are the following equivalent? m) rows of A span R n n) rows of A are linearly independent o) Ax = b has exactly one solution for all b in R n p) det(a) 0, where det(a) is the volume of the parallelepiped formed by the columns of A q) A 2 is invertible Math 1553 Lecture Notes for Chapter 2 Section 2.3: Characteristics of Invertible Matrices, Slide 18
19 Invertible Functions A function f : X Y is invertible if there is a function g : Y X, so f g = g g. That is, g f(x) = x for all x X and g f(x) = x for all x X Fact 1. If a function has an inverse, it is unique. Call it f 1. Fact 2. Invertible functions are one-to-one and onto. Fact 3. Suppose A = n n matrix, and T A the associated linear transform. Then T A is invertible as a function if and only if A is invertible. And in this case, (T A) 1 = T A 1. Why? T A invertible implies (by Fact 2) T A is onto, which implies (by the IMT) that A is invertible. And A invertible implies that T A T A 1 = T AA 1 = T I = id., and T A 1 T A = id. Math 1553 Lecture Notes for Chapter 2 Section 2.3: Characteristics of Invertible Matrices, Slide 19
20 An Additional Example Q. Determine whether matrix A is invertible. A = A. It isn t necessary to find the inverse. Instead, we may use the Invertible Matrix Theorem by checking whether we can row reduce to obtain three pivot columns, or three pivot positions. A = By inspection, there are three pivot positions, so A is invertible by the IMT (statement c). Math 1553 Lecture Notes for Chapter 2 Section 2.3: Characteristics of Invertible Matrices, Slide 20
21 Section 2.5 Matrix Decompositions Recall. If we want to solve Ax = b, we can find A 1 and obtain x by A 1 b. Calculating A 1 with row reduction is not efficient, especially for large matrices. The LU decomposition is an efficient method for solving Ax = b. An LU factorization of A = m n is the product A = LU, where L = m m lower triangular matrix U = m n echelon form of A To solve Ax = b, we write Ax = LUx = b, and then 1. solve Ly = b, to obtain y, 2. solve Ux = y to obtain x. This approach only uses back substitution, not elimination. Also note that L is a unit lower triangular matrix, meaning that all the elements on its diagonal are equal to 1. U is an upper triangular matrix Historical note: the LU Decomposition was introduced by Alan Turing. Math 1553 Lecture Notes for Chapter 2 Section 2.5: Matrix Decompositions, Slide 21
22 Composition and Transformations The LU decomposition provides another example where we can view a matrix multiplication as a composition. Math 1553 Lecture Notes for Chapter 2 Section 2.5: Matrix Decompositions, Slide 22
23 Example Calculation of a LU Factorization A = = = LU Matrix L records negatives of the row operations. Be careful to go in order, and do not make any row swaps. Math 1553 Lecture Notes for Chapter 2 Section 2.5: Matrix Decompositions, Slide 23
24 Why Does This Method Work? Row operations are elementary matrices, so E 4E 3E 2E 1A = U A = (E 4E 3E 2E 1) 1 U = E 1 1 E 1 2 E 1 3 E 1 4 U = LU All the elementary matrices are lower triangular. It can be shown that the inverse of each E exists and is lower triangular, the product of lower triangular matrices is lower triangular, and so L exists and is lower triangular. Math 1553 Lecture Notes for Chapter 2 Section 2.5: Matrix Decompositions, Slide 24
25 Clicker Question Clicker Question Which of the following statements are true? 1. Every matrix has an LU factorization 2. LU factorizations are unique 3. Computing the LU is faster than row reduction Math 1553 Lecture Notes for Chapter 2 Section 2.5: Matrix Decompositions, Slide 25
26 Using LU To Solve a Linear System Q. Solve Ax = , with the same A as in the previous example. A. Step 1: Solve Ly = b. Step 2: Solve Ux = y. Ly = Ux = y = x = Math 1553 Lecture Notes for Chapter 2 Section 2.5: Matrix Decompositions, Slide 26
27 Further Remarks Non-Square Matrices The LU factorization can be computed for non-square matrices. ( ) ( ) ( ) = Row Permutations The above procedure for LU factorization works when we don t need to swap rows in row reduction. If a row-permutation is needed, we introduce a permutation matrix, P, so that P A = LU, or A = P LU. Math 1553 Lecture Notes for Chapter 2 Section 2.5: Matrix Decompositions, Slide 27
28 Application: LU Factorization in Electrical Engineering In an electrical circuit, current i and voltage v often change by a linear transformation (by Ohm s law and Kirchoff s law). ( v1 So A i 1 ) = ( v2 i 2 ) for some transfer matrix A. Math 1553 Lecture Notes for Chapter 2 Section 2.5: Matrix Decompositions, Slide 28
29 Circuit Examples A = ( 1 R1 0 1 ) current unchanged, voltage decreases proportional to current ( A = 1 0 1/R 2 1 voltage unchanged, current decreases proportional to voltage If we string these together we get a ladder circuit. The transfer matrix for the ladder circuit is the product of the matrices for the components. Why does this make sense? Think about function composition. ) Math 1553 Lecture Notes for Chapter 2 Section 2.5: Matrix Decompositions, Slide 29
30 Example Consider the following circuit. The matrix for this circuit is ( 1 0 1/R 2 0 ) ( 1 R1 0 1 ) ( = 1 R 1 1/R R 1/R 2 Can ( you reverse) engineer a ladder circuit whose transfer matrix is 1 8? Use the LU decomposition. ) Math 1553 Lecture Notes for Chapter 2 Section 2.5: Matrix Decompositions, Slide 30
31 Section 2.8: Subspaces of R n A subspace of R n is a subset V with three properties. 1. The zero vector is in V. 2. If u, v are vectors in V, then u + v is also in V. 3. If u is a vector in V and c is in R, then cu V. Note the following. We say that a subspace is closed under addition and scalar multiplication. We can represent (or visualize) spans as lines or planes that pass through the origin. If V = span{v 1, v 2,..., v k }, then we say V is the subspace generated by vectors v 1, v 2,..., v k. Example. If v 1, v 2 are vectors in R n, then H = span{v 1, v 2} is a subspace. Why? We can verify the three properties above for vectors v 1, v 2. A Non-Example A line that does not pass through the origin is not a span. Why not? Math 1553 Lecture Notes for Chapter 2 Section 2.8: Subspaces of R n, Slide 31
32 Clicker Question Clicker Question Consider V = { a b c d Is V a subspace of R 4? 1. Yes 2. No R4 : ad bc = 0}. Math 1553 Lecture Notes for Chapter 2 Section 2.8: Subspaces of R n, Slide 32
33 Column Space and Null Space Suppose A is an m n matrix. We define the following subspaces. The column space of A, Col(A), is the span of the columns, in R m. The null space of A, Nul(A), is the set of solutions to Ax = 0, in R n. Example. A = Then Col(A) = span{ Nul(A) is x + y = 0, a line in R 2. } = line in R 3. Math 1553 Lecture Notes for Chapter 2 Section 2.8: Subspaces of R n, Slide 33
34 Bases Let V be a subspace in R n. A basis for V is a set of vectors {v 1, v 2,..., v k } such that 1. V = span{v 1,..., v k } 2. the vectors v i are linearly independent We refer to k as the dimension of subspace V, and k = dim(v ). Example. The standard basis for R n is the set e 1, e 2,..., e n. Q. What is a basis for the set of Fibonacci sequences in R? Math 1553 Lecture Notes for Chapter 2 Section 2.8: Subspaces of R n, Slide 34
35 Example Q. Find a basis for the null space and a basis for the column space of A = A. Nul(A) is the span of solutions to Ax = 0, which for this matrix we can show is given by 1 1 y z 0 1 So the basis for nullspace of A is { 1 1 0, }. Math 1553 Lecture Notes for Chapter 2 Section 2.8: Subspaces of R n, Slide 35
36 Further Remarks Note that In general, the pivot columns of A form a basis for Col(A). Be careful to not use the reduced pivot columns in constructing the basis for Col(A). If A is a square matrix with dimensions n n, then A is invertible iff the columns of A form a basis for R n. Math 1553 Lecture Notes for Chapter 2 Section 2.8: Subspaces of R n, Slide 36
37 Section 2.9 Dimension and Rank Bases as Coordinate Systems Suppose V is a subspace of R n, B = {b 1, b 2,..., b k } is a basis for V, and x is a vector in V. Then we can write x uniquely as c 1b 1 + c 2b c k b k We write [x] B = c 1 c 2.. c k The vector [x] B is called the coordinate vector of x relative to B, or the B coordinate vector of x. Math 1553 Lecture Notes for Chapter 2 Section 2.9 Dimension and Rank, Slide 37
38 Example Q. Suppose b 1 = 1 0 1, b 2 = 1 1 1, x = 5 3 5, and V = span{b 1, b 2}. What is a basis for V, and what is the coordinate vector of x relative to B? A. The set B = {b 1, b 2} is a basis for the subspace V. The coordinate vector, [x] B, is found by solving c 1b 1 + c 2b 2 = x We find the values of c 1 and c 2 by solving a system. 1 1 ( ) c1 = 3 c This leads to [x] B = ( 2 3 ). Math 1553 Lecture Notes for Chapter 2 Section 2.9 Dimension and Rank, Slide 38
39 Dimension Definition. Let V be a subspace of R n. We define dim V to be the number of vectors in a basis for V. Note: the basis for {0} is {}. That is, dim{0} = 0. Clicker Question If U, V are 2 dimensional subspaces of R 4, what are the possible dimensions for U V? a) 0 b) 1 c) 2 d) 3 e) 4 Math 1553 Lecture Notes for Chapter 2 Section 2.9 Dimension and Rank, Slide 39
40 Rank Theorem We define the following. rank(a) = dim Col(A) = # pivot columns dim Nul(A) = # non pivot columns = # free variables Now recall that for an m n matrix A, (# pivot columns) + (# free variables) = n. By substituting the above definitions into this expression, we obtain the Rank Theorem. Rank Theorem If A is an m n matrix, then rank(a) + dim Nul(A) = n. Example. If A = , then rank(a) = 1, and dim Nul(A) = 2. Math 1553 Lecture Notes for Chapter 2 Section 2.9 Dimension and Rank, Slide 40
41 Clicker Question Clicker Question If A and B are 3 3 matrices, and rank(a) = rank(b) = 2 then what are the possible values of rank(ab) a) 0 b) 1 c) 2 d) 3 e) 4 Math 1553 Lecture Notes for Chapter 2 Section 2.9 Dimension and Rank, Slide 41
42 Two More Theorems Basis Theorem If V is a k dimensional subspace of R n, then any k linearly independent vectors of V form a basis for V any k vectors that span V form a basis for V Invertible Matrix Theorem (m) cols of A form a basis for R n (n) Col(A) = R n (o) dim Col(A) = n (p) rank(a) = n (q) Nul(A) = {0} (r) dim Nul(A) = 0 Why? Math 1553 Lecture Notes for Chapter 2 Section 2.9 Dimension and Rank, Slide 42
43 Chapter 2 in a Nutshell Products AB BA T AB = T A T B Inverses if AB = BA = I, then B = A 1 T 1 A = T A 1 Ax = b implies x = A 1 b application is flexibility matrix, D forces=displacement Find A 1 by row reducing (A I) to get (I A 1 ) Another perspective: E k E k 1 E 2E 1A = I, where each E i is an elementary matrix. This implies that E k E k 1 E 2E 1 = A 1. Math 1553 Lecture Notes for Chapter 2 Chapter 2 in a Nutshell, Slide 43
44 Chapter 2 in a Nutshell Invertible Matrix Theorem The following are equivalent A is invertible A can be reduced to I A has n pivots NulA = {0} T A is one-to-one T A is onto Ax = b is consistent for all b ranka = n etc... Math 1553 Lecture Notes for Chapter 2 Chapter 2 in a Nutshell, Slide 44
45 Chapter 2 in a Nutshell LU Decompositions Let A = LU, where L is lower triangular, U is in echelon form. Easy to solve for many b. Algorithm Step 1. Solve Ly = b Step 2. Solve Ux = y To find L, U, we row reduce A to echelon form to obtain U, then use negative of row operations to obtain L. Be careful to not row swap and only use lower row replacement. Application: circuits A = ( 1 R1 0 1 ) ( A = 1 0 1/R 2 1 ) Math 1553 Lecture Notes for Chapter 2 Chapter 2 in a Nutshell, Slide 45
46 Chapter 2 in a Nutshell Subspaces A subspace is a non-empty subset closed under taking linear combinations. Two important subspaces are Col(A), which is the span of the columns of matrix A. Nul(A), which is the span of the solutions to Ax = 0. A basis for a subspace, W, is the set of linearly independent vectors that spans W. The dimension of a subspace is the number of elements in the basis. Use row reduction to find a basis for Col(A) or Nul(A). Pivot columns are used to identify the basis for Col(A). Parametric form is used to identify the basis for Nul(A). Coordinate Vector If B = {b 1,..., b k } is a basis for a subspace, then we find the B-coordinates for vector x, are found by solving (b 1, b 2,..., b k )c = x for vector c. Math 1553 Lecture Notes for Chapter 2 Chapter 2 in a Nutshell, Slide 46
47 Chapter 2 in a Nutshell Rank Theorem Let A be an m n matrix, then rank(a) + dim(nul(a)) = n. Basis Theorem Suppose V is a k-dimensional subspace of R n. Then Any k linearly independent vectors form a basis. Any k spanning vectors form a basis. Math 1553 Lecture Notes for Chapter 2 Chapter 2 in a Nutshell, Slide 47
MATH 2331 Linear Algebra. Section 2.1 Matrix Operations. Definition: A : m n, B : n p. Example: Compute AB, if possible.
MATH 2331 Linear Algebra Section 2.1 Matrix Operations Definition: A : m n, B : n p ( 1 2 p ) ( 1 2 p ) AB = A b b b = Ab Ab Ab Example: Compute AB, if possible. 1 Row-column rule: i-j-th entry of AB:
More informationMath 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 informationMTH 464: Computational Linear Algebra
MTH 464: Computational Linear Algebra Lecture Outlines Exam 2 Material Prof. M. Beauregard Department of Mathematics & Statistics Stephen F. Austin State University March 2, 2018 Linear Algebra (MTH 464)
More informationEK102 Linear Algebra PRACTICE PROBLEMS for Final Exam Spring 2016
EK102 Linear Algebra PRACTICE PROBLEMS for Final Exam Spring 2016 Answer the questions in the spaces provided on the question sheets. You must show your work to get credit for your answers. There will
More informationFinal Examination 201-NYC-05 December and b =
. (5 points) Given A [ 6 5 8 [ and b (a) Express the general solution of Ax b in parametric vector form. (b) Given that is a particular solution to Ax d, express the general solution to Ax d in parametric
More informationMTH 464: Computational Linear Algebra
MTH 464: Computational Linear Algebra Lecture Outlines Exam 2 Material Prof. M. Beauregard Department of Mathematics & Statistics Stephen F. Austin State University February 6, 2018 Linear Algebra (MTH
More informationChapter 2 Notes, Linear Algebra 5e Lay
Contents.1 Operations with Matrices..................................1.1 Addition and Subtraction.............................1. Multiplication by a scalar............................ 3.1.3 Multiplication
More informationLECTURES 14/15: LINEAR INDEPENDENCE AND BASES
LECTURES 14/15: LINEAR INDEPENDENCE AND BASES MA1111: LINEAR ALGEBRA I, MICHAELMAS 2016 1. Linear Independence We have seen in examples of span sets of vectors that sometimes adding additional vectors
More informationMatrix operations Linear Algebra with Computer Science Application
Linear Algebra with Computer Science Application February 14, 2018 1 Matrix operations 11 Matrix operations If A is an m n matrix that is, a matrix with m rows and n columns then the scalar entry in the
More informationFall 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 informationReview Notes for Linear Algebra True or False Last Updated: February 22, 2010
Review Notes for Linear Algebra True or False Last Updated: February 22, 2010 Chapter 4 [ Vector Spaces 4.1 If {v 1,v 2,,v n } and {w 1,w 2,,w n } are linearly independent, then {v 1 +w 1,v 2 +w 2,,v n
More informationIMPORTANT 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 informationMATH 2210Q MIDTERM EXAM I PRACTICE PROBLEMS
MATH Q MIDTERM EXAM I PRACTICE PROBLEMS Date and place: Thursday, November, 8, in-class exam Section : : :5pm at MONT Section : 9: :5pm at MONT 5 Material: Sections,, 7 Lecture 9 8, Quiz, Worksheet 9 8,
More informationChapter 2: Matrix Algebra
Chapter 2: Matrix Algebra (Last Updated: October 12, 2016) These notes are derived primarily from Linear Algebra and its applications by David Lay (4ed). Write A = 1. Matrix operations [a 1 a n. Then entry
More informationWhat is on this week. 1 Vector spaces (continued) 1.1 Null space and Column Space of a matrix
Professor Joana Amorim, jamorim@bu.edu What is on this week Vector spaces (continued). Null space and Column Space of a matrix............................. Null Space...........................................2
More informationMath 4A Notes. Written by Victoria Kala Last updated June 11, 2017
Math 4A Notes Written by Victoria Kala vtkala@math.ucsb.edu Last updated June 11, 2017 Systems of Linear Equations A linear equation is an equation that can be written in the form a 1 x 1 + a 2 x 2 +...
More informationMath 18, Linear Algebra, Lecture C00, Spring 2017 Review and Practice Problems for Final Exam
Math 8, Linear Algebra, Lecture C, Spring 7 Review and Practice Problems for Final Exam. The augmentedmatrix of a linear system has been transformed by row operations into 5 4 8. Determine if the system
More informationIMPORTANT 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 information2. Every linear system with the same number of equations as unknowns has a unique solution.
1. For matrices A, B, C, A + B = A + C if and only if A = B. 2. Every linear system with the same number of equations as unknowns has a unique solution. 3. Every linear system with the same number of equations
More informationSection 4.5. Matrix Inverses
Section 4.5 Matrix Inverses The Definition of Inverse Recall: The multiplicative inverse (or reciprocal) of a nonzero number a is the number b such that ab = 1. We define the inverse of a matrix in almost
More informationMATH 2030: ASSIGNMENT 4 SOLUTIONS
MATH 23: ASSIGNMENT 4 SOLUTIONS More on the LU factorization Q.: pg 96, q 24. Find the P t LU factorization of the matrix 2 A = 3 2 2 A.. By interchanging row and row 4 we get a matrix that may be easily
More information1. Determine by inspection which of the following sets of vectors is linearly independent. 3 3.
1. Determine by inspection which of the following sets of vectors is linearly independent. (a) (d) 1, 3 4, 1 { [ [,, 1 1] 3]} (b) 1, 4 5, (c) 3 6 (e) 1, 3, 4 4 3 1 4 Solution. The answer is (a): v 1 is
More informationMATH 167: APPLIED LINEAR ALGEBRA Chapter 2
MATH 167: APPLIED LINEAR ALGEBRA Chapter 2 Jesús De Loera, UC Davis February 1, 2012 General Linear Systems of Equations (2.2). Given a system of m equations and n unknowns. Now m n is OK! Apply elementary
More informationNOTES on LINEAR ALGEBRA 1
School of Economics, Management and Statistics University of Bologna Academic Year 207/8 NOTES on LINEAR ALGEBRA for the students of Stats and Maths This is a modified version of the notes by Prof Laura
More informationKevin James. MTHSC 3110 Section 2.1 Matrix Operations
MTHSC 3110 Section 2.1 Matrix Operations Notation Let A be an m n matrix, that is, m rows and n columns. We ll refer to the entries of A by their row and column indices. The entry in the i th row and j
More informationMATH 2360 REVIEW PROBLEMS
MATH 2360 REVIEW PROBLEMS Problem 1: In (a) (d) below, either compute the matrix product or indicate why it does not exist: ( )( ) 1 2 2 1 (a) 0 1 1 2 ( ) 0 1 2 (b) 0 3 1 4 3 4 5 2 5 (c) 0 3 ) 1 4 ( 1
More information1 Last time: inverses
MATH Linear algebra (Fall 8) Lecture 8 Last time: inverses The following all mean the same thing for a function f : X Y : f is invertible f is one-to-one and onto 3 For each b Y there is exactly one a
More information1 Last time: determinants
1 Last time: determinants Let n be a positive integer If A is an n n matrix, then its determinant is the number det A = Π(X, A)( 1) inv(x) X S n where S n is the set of n n permutation matrices Π(X, A)
More informationLINEAR ALGEBRA REVIEW
LINEAR ALGEBRA REVIEW SPENCER BECKER-KAHN Basic Definitions Domain and Codomain. Let f : X Y be any function. This notation means that X is the domain of f and Y is the codomain of f. This means that for
More informationMath Computation Test 1 September 26 th, 2016 Debate: Computation vs. Theory Whatever wins, it ll be Huuuge!
Math 5- Computation Test September 6 th, 6 Debate: Computation vs. Theory Whatever wins, it ll be Huuuge! Name: Answer Key: Making Math Great Again Be sure to show your work!. (8 points) Consider the following
More informationMath 369 Exam #2 Practice Problem Solutions
Math 369 Exam #2 Practice Problem Solutions 2 5. Is { 2, 3, 8 } a basis for R 3? Answer: No, it is not. To show that it is not a basis, it suffices to show that this is not a linearly independent set.
More informationMATH 323 Linear Algebra Lecture 12: Basis of a vector space (continued). Rank and nullity of a matrix.
MATH 323 Linear Algebra Lecture 12: Basis of a vector space (continued). Rank and nullity of a matrix. Basis Definition. Let V be a vector space. A linearly independent spanning set for V is called a basis.
More informationMH1200 Final 2014/2015
MH200 Final 204/205 November 22, 204 QUESTION. (20 marks) Let where a R. A = 2 3 4, B = 2 3 4, 3 6 a 3 6 0. For what values of a is A singular? 2. What is the minimum value of the rank of A over all a
More informationMath 344 Lecture # Linear Systems
Math 344 Lecture #12 2.7 Linear Systems Through a choice of bases S and T for finite dimensional vector spaces V (with dimension n) and W (with dimension m), a linear equation L(v) = w becomes the linear
More informationLINEAR ALGEBRA QUESTION BANK
LINEAR ALGEBRA QUESTION BANK () ( points total) Circle True or False: TRUE / FALSE: If A is any n n matrix, and I n is the n n identity matrix, then I n A = AI n = A. TRUE / FALSE: If A, B are n n matrices,
More informationINVERSE OF A MATRIX [2.2] 8-1
INVERSE OF A MATRIX [2.2] 8-1 The inverse of a matrix: Introduction We have a mapping from R n to R n represented by a matrix A. Can we invert this mapping? i.e. can we find a matrix (call it B for now)
More informationMath 242 fall 2008 notes on problem session for week of This is a short overview of problems that we covered.
Math 242 fall 28 notes on problem session for week of 9-3-8 This is a short overview of problems that we covered.. For each of the following sets ask the following: Does it span R 3? Is it linearly independent?
More informationSYMBOL EXPLANATION EXAMPLE
MATH 4310 PRELIM I REVIEW Notation These are the symbols we have used in class, leading up to Prelim I, and which I will use on the exam SYMBOL EXPLANATION EXAMPLE {a, b, c, } The is the way to write the
More informationGlossary of Linear Algebra Terms. Prepared by Vince Zaccone For Campus Learning Assistance Services at UCSB
Glossary of Linear Algebra Terms Basis (for a subspace) A linearly independent set of vectors that spans the space Basic Variable A variable in a linear system that corresponds to a pivot column in the
More informationRow Space and Column Space of a Matrix
Row Space and Column Space of a Matrix 1/18 Summary: To a m n matrix A = (a ij ), we can naturally associate subspaces of K n and of K m, called the row space of A and the column space of A, respectively.
More informationLinear Algebra Summary. Based on Linear Algebra and its applications by David C. Lay
Linear Algebra Summary Based on Linear Algebra and its applications by David C. Lay Preface The goal of this summary is to offer a complete overview of all theorems and definitions introduced in the chapters
More informationApplied Matrix Algebra Lecture Notes Section 2.2. Gerald Höhn Department of Mathematics, Kansas State University
Applied Matrix Algebra Lecture Notes Section 22 Gerald Höhn Department of Mathematics, Kansas State University September, 216 Chapter 2 Matrices 22 Inverses Let (S) a 11 x 1 + a 12 x 2 + +a 1n x n = b
More informationPractice Final Exam. Solutions.
MATH Applied Linear Algebra December 6, 8 Practice Final Exam Solutions Find the standard matrix f the linear transfmation T : R R such that T, T, T Solution: Easy to see that the transfmation T can be
More informationProblem Set (T) If A is an m n matrix, B is an n p matrix and D is a p s matrix, then show
MTH 0: Linear Algebra Department of Mathematics and Statistics Indian Institute of Technology - Kanpur Problem Set Problems marked (T) are for discussions in Tutorial sessions (T) If A is an m n matrix,
More informationMATH 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 information2018 Fall 2210Q Section 013 Midterm Exam II Solution
08 Fall 0Q Section 0 Midterm Exam II Solution True or False questions points 0 0 points) ) Let A be an n n matrix. If the equation Ax b has at least one solution for each b R n, then the solution is unique
More informationEXERCISE 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 informationLinear Algebra Section 2.6 : LU Decomposition Section 2.7 : Permutations and transposes Wednesday, February 13th Math 301 Week #4
Linear Algebra Section. : LU Decomposition Section. : Permutations and transposes Wednesday, February 1th Math 01 Week # 1 The LU Decomposition We learned last time that we can factor a invertible matrix
More informationLecture: Linear algebra. 4. Solutions of linear equation systems The fundamental theorem of linear algebra
Lecture: Linear algebra. 1. Subspaces. 2. Orthogonal complement. 3. The four fundamental subspaces 4. Solutions of linear equation systems The fundamental theorem of linear algebra 5. Determining the fundamental
More informationMath 314/814 Topics for first exam
Chapter 2: Systems of linear equations Math 314/814 Topics for first exam Some examples Systems of linear equations: 2x 3y z = 6 3x + 2y + z = 7 Goal: find simultaneous solutions: all x, y, z satisfying
More informationLINEAR ALGEBRA SUMMARY SHEET.
LINEAR ALGEBRA SUMMARY SHEET RADON ROSBOROUGH https://intuitiveexplanationscom/linear-algebra-summary-sheet/ This document is a concise collection of many of the important theorems of linear algebra, organized
More informationThe Four Fundamental Subspaces
The Four Fundamental Subspaces Introduction Each m n matrix has, associated with it, four subspaces, two in R m and two in R n To understand their relationships is one of the most basic questions in linear
More informationThird Midterm Exam Name: Practice Problems November 11, Find a basis for the subspace spanned by the following vectors.
Math 7 Treibergs Third Midterm Exam Name: Practice Problems November, Find a basis for the subspace spanned by the following vectors,,, We put the vectors in as columns Then row reduce and choose the pivot
More informationWorksheet for Lecture 15 (due October 23) Section 4.3 Linearly Independent Sets; Bases
Worksheet for Lecture 5 (due October 23) Name: Section 4.3 Linearly Independent Sets; Bases Definition An indexed set {v,..., v n } in a vector space V is linearly dependent if there is a linear relation
More informationEquality: 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 informationINVERSE OF A MATRIX [2.2]
INVERSE OF A MATRIX [2.2] The inverse of a matrix: Introduction We have a mapping from R n to R n represented by a matrix A. Can we invert this mapping? i.e. can we find a matrix (call it B for now) such
More informationMath 54 First Midterm Exam, Prof. Srivastava September 23, 2016, 4:10pm 5:00pm, 155 Dwinelle Hall.
Math 54 First Midterm Exam, Prof Srivastava September 23, 26, 4:pm 5:pm, 55 Dwinelle Hall Name: SID: Instructions: Write all answers in the provided space This exam includes two pages of scratch paper,
More informationPRACTICE PROBLEMS FOR THE FINAL
PRACTICE PROBLEMS FOR THE FINAL Here are a slew of practice problems for the final culled from old exams:. Let P be the vector space of polynomials of degree at most. Let B = {, (t ), t + t }. (a) Show
More information(a) If A is a 3 by 4 matrix, what does this tell us about its nullspace? Solution: dim N(A) 1, since rank(a) 3. Ax =
. (5 points) (a) If A is a 3 by 4 matrix, what does this tell us about its nullspace? dim N(A), since rank(a) 3. (b) If we also know that Ax = has no solution, what do we know about the rank of A? C(A)
More informationMATH 1120 (LINEAR ALGEBRA 1), FINAL EXAM FALL 2011 SOLUTIONS TO PRACTICE VERSION
MATH (LINEAR ALGEBRA ) FINAL EXAM FALL SOLUTIONS TO PRACTICE VERSION Problem (a) For each matrix below (i) find a basis for its column space (ii) find a basis for its row space (iii) determine whether
More informationMath Final December 2006 C. Robinson
Math 285-1 Final December 2006 C. Robinson 2 5 8 5 1 2 0-1 0 1. (21 Points) The matrix A = 1 2 2 3 1 8 3 2 6 has the reduced echelon form U = 0 0 1 2 0 0 0 0 0 1. 2 6 1 0 0 0 0 0 a. Find a basis for the
More informationMODEL ANSWERS TO THE FIRST QUIZ. 1. (18pts) (i) Give the definition of a m n matrix. A m n matrix with entries in a field F is a function
MODEL ANSWERS TO THE FIRST QUIZ 1. (18pts) (i) Give the definition of a m n matrix. A m n matrix with entries in a field F is a function A: I J F, where I is the set of integers between 1 and m and J is
More informationMath 2331 Linear Algebra
4.3 Linearly Independent Sets; Bases Math 233 Linear Algebra 4.3 Linearly Independent Sets; Bases Jiwen He Department of Mathematics, University of Houston jiwenhe@math.uh.edu math.uh.edu/ jiwenhe/math233
More informationAnnouncements Monday, October 29
Announcements Monday, October 29 WeBWorK on determinents due on Wednesday at :59pm. The quiz on Friday covers 5., 5.2, 5.3. My office is Skiles 244 and Rabinoffice hours are: Mondays, 2 pm; Wednesdays,
More informationICS 6N Computational Linear Algebra Matrix Algebra
ICS 6N Computational Linear Algebra Matrix Algebra Xiaohui Xie University of California, Irvine xhx@uci.edu February 2, 2017 Xiaohui Xie (UCI) ICS 6N February 2, 2017 1 / 24 Matrix Consider an m n matrix
More informationMAT Linear Algebra Collection of sample exams
MAT 342 - Linear Algebra Collection of sample exams A-x. (0 pts Give the precise definition of the row echelon form. 2. ( 0 pts After performing row reductions on the augmented matrix for a certain system
More informationMATH 20F: LINEAR ALGEBRA LECTURE B00 (T. KEMP)
MATH 20F: LINEAR ALGEBRA LECTURE B00 (T KEMP) Definition 01 If T (x) = Ax is a linear transformation from R n to R m then Nul (T ) = {x R n : T (x) = 0} = Nul (A) Ran (T ) = {Ax R m : x R n } = {b R m
More informationMath 323 Exam 2 Sample Problems Solution Guide October 31, 2013
Math Exam Sample Problems Solution Guide October, Note that the following provides a guide to the solutions on the sample problems, but in some cases the complete solution would require more work or justification
More informationMTH501- 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 informationMATH 310, REVIEW SHEET 2
MATH 310, REVIEW SHEET 2 These notes are a very short summary of the key topics in the book (and follow the book pretty closely). You should be familiar with everything on here, but it s not comprehensive,
More informationMath 4377/6308 Advanced Linear Algebra
2.3 Composition Math 4377/6308 Advanced Linear Algebra 2.3 Composition of Linear Transformations Jiwen He Department of Mathematics, University of Houston jiwenhe@math.uh.edu math.uh.edu/ jiwenhe/math4377
More informationElementary 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 informationMath 54 HW 4 solutions
Math 54 HW 4 solutions 2.2. Section 2.2 (a) False: Recall that performing a series of elementary row operations A is equivalent to multiplying A by a series of elementary matrices. Suppose that E,...,
More informationSolutions to Section 2.9 Homework Problems Problems 1 5, 7, 9, 10 15, (odd), and 38. S. F. Ellermeyer June 21, 2002
Solutions to Section 9 Homework Problems Problems 9 (odd) and 8 S F Ellermeyer June The pictured set contains the vector u but not the vector u so this set is not a subspace of The pictured set contains
More informationMatrices 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 informationAlgorithms to Compute Bases and the Rank of a Matrix
Algorithms to Compute Bases and the Rank of a Matrix Subspaces associated to a matrix Suppose that A is an m n matrix The row space of A is the subspace of R n spanned by the rows of A The column space
More informationSolutions to Final Practice Problems Written by Victoria Kala Last updated 12/5/2015
Solutions to Final Practice Problems Written by Victoria Kala vtkala@math.ucsb.edu Last updated /5/05 Answers This page contains answers only. See the following pages for detailed solutions. (. (a x. See
More informationMath 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 informationLinear Equations and Matrix
1/60 Chia-Ping Chen Professor Department of Computer Science and Engineering National Sun Yat-sen University Linear Algebra Gaussian Elimination 2/60 Alpha Go Linear algebra begins with a system of linear
More informationANALYTICAL MATHEMATICS FOR APPLICATIONS 2018 LECTURE NOTES 3
ANALYTICAL MATHEMATICS FOR APPLICATIONS 2018 LECTURE NOTES 3 ISSUED 24 FEBRUARY 2018 1 Gaussian elimination Let A be an (m n)-matrix Consider the following row operations on A (1) Swap the positions any
More informationMath 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 informationCSL361 Problem set 4: Basic linear algebra
CSL361 Problem set 4: Basic linear algebra February 21, 2017 [Note:] If the numerical matrix computations turn out to be tedious, you may use the function rref in Matlab. 1 Row-reduced echelon matrices
More informationA Brief Outline of Math 355
A Brief Outline of Math 355 Lecture 1 The geometry of linear equations; elimination with matrices A system of m linear equations with n unknowns can be thought of geometrically as m hyperplanes intersecting
More informationMatrix Operations: Determinant
Matrix Operations: Determinant Determinants Determinants are only applicable for square matrices. Determinant of the square matrix A is denoted as: det(a) or A Recall that the absolute value of the determinant
More informationWorksheet for Lecture 15 (due October 23) Section 4.3 Linearly Independent Sets; Bases
Worksheet for Lecture 5 (due October 23) Name: Section 4.3 Linearly Independent Sets; Bases Definition An indexed set {v,..., v n } in a vector space V is linearly dependent if there is a linear relation
More informationLinear 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 informationAPPENDIX: 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 informationMath 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 informationSolutions to Exam I MATH 304, section 6
Solutions to Exam I MATH 304, section 6 YOU MUST SHOW ALL WORK TO GET CREDIT. Problem 1. Let A = 1 2 5 6 1 2 5 6 3 2 0 0 1 3 1 1 2 0 1 3, B =, C =, I = I 0 0 0 1 1 3 4 = 4 4 identity matrix. 3 1 2 6 0
More informationMATH2210 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 informationMath 20F Practice Final Solutions. Jor-el Briones
Math 2F Practice Final Solutions Jor-el Briones Jor-el Briones / Math 2F Practice Problems for Final Page 2 of 6 NOTE: For the solutions to these problems, I skip all the row reduction calculations. Please
More informationLINEAR 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 informationRow Space, Column Space, and Nullspace
Row Space, Column Space, and Nullspace MATH 322, Linear Algebra I J. Robert Buchanan Department of Mathematics Spring 2015 Introduction Every matrix has associated with it three vector spaces: row space
More informationMatrix & 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 informationChapter 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 informationStudy Guide for Linear Algebra Exam 2
Study Guide for Linear Algebra Exam 2 Term Vector Space Definition A Vector Space is a nonempty set V of objects, on which are defined two operations, called addition and multiplication by scalars (real
More informationDimension. Eigenvalue and eigenvector
Dimension. Eigenvalue and eigenvector Math 112, week 9 Goals: Bases, dimension, rank-nullity theorem. Eigenvalue and eigenvector. Suggested Textbook Readings: Sections 4.5, 4.6, 5.1, 5.2 Week 9: Dimension,
More informationReview Notes for Midterm #2
Review Notes for Midterm #2 Joris Vankerschaver This version: Nov. 2, 200 Abstract This is a summary of the basic definitions and results that we discussed during class. Whenever a proof is provided, I
More informationInverting Matrices. 1 Properties of Transpose. 2 Matrix Algebra. P. Danziger 3.2, 3.3
3., 3.3 Inverting Matrices P. Danziger 1 Properties of Transpose Transpose has higher precedence than multiplication and addition, so AB T A ( B T and A + B T A + ( B T As opposed to the bracketed expressions
More informationSpan & Linear Independence (Pop Quiz)
Span & Linear Independence (Pop Quiz). Consider the following vectors: v = 2, v 2 = 4 5, v 3 = 3 2, v 4 = Is the set of vectors S = {v, v 2, v 3, v 4 } linearly independent? Solution: Notice that the number
More information