Math 346 Notes on Linear Algebra
|
|
- Edwina Knight
- 5 years ago
- Views:
Transcription
1 Math 346 Notes on Linear Algebra Ethan Akin Mathematics Department Fall, Vector Spaces Anton Chapter 4, Section 4.1 You should recall the definition of a vector as an object with magnitude and direction (as opposed to a scalar with magnitude alone). This was devised as a means of representing forces and velocities which exhibit these vector characteristics. The behavior of these physical phenomena leads to a geometric notion of addition of vectors (the parallelogram law ) as well as multiplication by scalars - real numbers. By using coordinates one discovers important properties of these operations. Addition Properties (v + w) + z = v + ( w + z). v + w = w + v. v + 0 = v. v + v = 0. (1.1) The first two of these, the Associative and Commutative Laws, allow us to rearrange the order of addition and to be sloppy about parentheses just as 1
2 we are with numbers. We use them without thinking about them. The third says that the zero vector behaves the way the zero number does: adding it leaves the vector unchanged. The last says that every vector has an additive inverse which cancels it. Scalar Multiplication Properties a(bv) = (ab)v. 1v = v. (1.2) The first of these looks like the Associative Law but it isn t. It relates multiplication between numbers and scalar multiplication. The second says that multiplication by 1 leaves the vector unchanged the way the addition with 0 does. Distributive Properties a(v + w) = av + aw. (a + b)v = av + bv. (1.3) These link addition and scalar multiplication. In Linear Algebra we abstract from the original physical examples. Now a vector is just something in a vector space. A vector space is a set V of objects which are called vectors. What is special about a vector space is that it carries a definition of addition between vectors and a definition of multiplication of a vector by a scalar. For us a scalar is a real number, or possibly a complex number. We discard the original geometric picture and keep just the properties given about. These become the axioms of a vector space. Just from them it is possible to derive various other simple, but important properties (Anton Theorem 4.1.1) av = 0 a = 0 or v = 0. ( 1)v = v. (1.4) Fundamental Principle of Linear Algebra A = B A B = 0. (1.5) 2
3 2 Subspaces and Linear Combinations Anton Chapter 4, Section 4.2 Example 2.1. Which of the following are subspaces? Justify your answers. (a) The set of real-valued functions f such that f(17) = 0. (b) The set of real-valued functions f such that f(0) = 17. (c) The set of all linear combinations of the vectors v 1, v 2, v 3. A subset W of a vector space V is a nonempty subset which is closed under vector addition and scalar multiplication. So a subspace is a vector space in its own right. The intersection of any collection of subspaces is a subspace [Anton, Theorem 4.2.2] Let S be the list, or set, of vectors {v 1,..., v n } A linear combination on S is a vector v = Σ n i=1 C i v i. Exercise 1 (a) If S is contained in a subspace W then every linear combination on S is a vector in W. (b) The set of all linear combinations on S, obtained by varying the coefficients C 1,..., C n, is a subspace of V. That is, the sum of two linear combinations is a linear combination and any scalar multiple of a linear combination is a linear combination. (c) Which of the following are subspaces? Justify your answers. (a) The set of real-valued functions f such that f(17) = 0. (b) The set of real-valued functions f such that f(0) = 17. The span of a subset S, denoted span(s), is the span(s) = {A : S A&A is a subspace}. That is, it is the smallest subspace which contains S. From Exercise 1, it follows that span(s) is exactly the set of all linear combinations on S. Exercise 2 (a) If S T then span(s) span(t ). (b) If A is a subspace and S A then span(s) A. 3
4 (c) If T span(s) then [S] = span(s T ). S spans when span(s) is the whole space, V. That is, every vector in V is a linear combination on S. 3 Linear Independence Anton Chapter 4, Section 4.3 A list S = {v 1,..., v n } is (not are) linearly independent (= li) if c 1 v c n v n = 0 only if c 1 = c 2... = c n = 0. That is, the only way to get 0 as a linear combination is by using the zero coefficients. By the Fundamental Principle: S is li if and only if we can equate coefficients. That is: c 1 v c n v n = a 1 v a n v n = c 1 = a 1,..., c n = a n. (3.1) Example: A set consisting of a single vector {w} is ld if and only if w = 0. Exercise 3 Assume that S T. If S spans then T spans. If T is li then S is li. When S is not linearly independent it is called linearly dependent (= ld). Thus, S is ld when a non-trivial linear combination equals zero. Using the Fundamental Principle show that S is ld if and only if one vector of S is linear combination of the others. We can sharpen this to get: Exercise 4 (a)if S = {v 1,..., v n } is li and T = {v 1,..., v n, v n+1,...v m } is ld then some vector among {v n+1,...v m } is a linear combination of the remaining vectors of T. (b) If S = {v 1,..., v n } is an li list of vectors and T = {v 1,..., v n, v n+1 } then the following are equivalent: (i) T is ld. 4
5 (ii) v n+1 [S]. (iii) [S] = [T ]. (Hint: Show (i) (ii) (iii) (ii) (i).) (c) Prove the Plus/Minus Theorem of Anton Theorem S is a basis if it spans and is li. The following includes Anton Theorem Theorem 3.1. ( Between Theorem) Let S = {v 1,..., v n } T = {w 1,..., w m } be lists of vectors in V. If S is li and S T = {v 1,..., v n, w 1,..., w m } spans. There exists a basis B with S B S T. That is, the basis consists of all of the vectors of S together with some (maybe none, maybe all) of the vectors of T. Proof: Look first, at two extreme cases. If S spans then since it is li, it is a basis. Use B = S, using none of the vectors of T. For example, if m = 0 so that there are no vectors in T, then S = S T spans and B = S is a basis. If S T is li then since it spans, it is a basis. Use B = S T, using all of the vectors of T. Now if S T is not li, then by Exercise 4 (a) one of the vectors of T can be written as a linear combination of the remaining vectors of S T. By renumbering we can suppose this is true of the last vector w m. Call T = = {w 1,..., w m 1 }. So that last vector w m span(s T ). Then Exercise 2(c) says that span(s T ) = span(s T ). But S T spans V and so S T spans V. We continue, doing a loop. If S T is li then we are done with B = S T. If S T is ld we can remove some vector from T and still have a spanning set. Eventually, we get to a situation where together the set remaining vectors is li and so we have the basis B. If not before this will happen when we have removed all of the vectors in T. Technically, we are using mathematical induction on m. Remember that for the initial case m = 0 is easy, B = S was a basis. Assume the result for m = k and suppose that m = k + 1. We saw that if S T was li, then B = S T was a basis, and if S T was ld, we could remove a vector and still have the spanning set S T but 5
6 now with m for T being k. The induction hypothesis implies that there is a basis B with S B S T S T. Result then follows from the Principle of Mathematical Induction. Exercise 5 If v 0 and T = {w 1,..., w m } is a list of vectors in V which spans and v is a nonzero vector in V, then there is a basis B with v B and B {v} T and #B m (Hint: {v} T is ld. ) Corollary 3.2. If S is li and T spans, then #S #T. Proof: Use Exercise 5. Adjoin the vectors of S one at a time to the vectors of T and eliminate vectors from T to get a basis. The vectors of S will run out before those of T do. In particular, if a vector space has a basis of size n then any basis has size n and we call n the dimension of the space. Exercise 6 The dimension of R n is n. Theorem 3.3. Let S be a set of vectors in a vector space of dimension n. (a) If S is li then #S n with equality if and only if S is a basis. (b) If S spans then #S n with equality if and only if S is a basis. (b)any two of the following conditions implies the third. (i) #S = n. (ii) S is li. (iii) S spans. Proof: (a) If S is li then there exists a basis T with S T and so #S #T = n. (b) If S spans then there exists a basis T with T S and so #S #T = n. In either case, if #S = n = #T then S = T and so S is a basis. 6
7 (c) If S is li and spans then it is a basis and so has size n. For the other directions apply (a) and (b). 4 Linear Transformations Anton Chapter 8, Section 8.1 A linear operator or linear transformation is just a function L between vector spaces, that is, the inputs and outputs are vectors, which satisfies linearity, which is also called the superposition property: L(v + w) = L(v) + L(w) and L(av) = al(v). (4.1) It follows that L relates linear combinations: L(C 1 v 1 + C 2 v 2 + C 3 v 3 ) = C 1 L(v 1 ) + C 2 L(v 2 ) + C 3 L(v 3 ). (4.2) This property of linearity is very special. It is a standard algebra mistake to apply it to functions like the square root function and sin and cos etc. for which it does not hold. On the other hand, these should be familiar properties from calculus. The operator D associating to a differentiable function f its derivative Df is our most important example of a linear operator. From a linear operator we get an important example of a subspace. The set of vectors v such that L(v) = 0, the solution space of the homogeneous equation, is a subspace when L is a linear operator but usually not otherwise. If r is not 0 then the solution space of L(v) = r is not a subspace. But if any particular solution v p has been found, so that L(v p ) = r, then all of the solutions are of the form v p + w where w is a solution of the homogeneous equation. This is often written v g = v p + v h. That is, the general solution is the sum of a particular solution and the general solution of the homogeneous equation. A subspace is called invariant for a linear operator L mapping the vector space to itself when L maps the subspace into itself. The most important example occurs when the subspace consists of multiples of a single nonzero vector v. This subspace is invariant when L(v) = rv for some scalar r. In that case, v is called an eigenvector for L with eigenvalue r. Exercise 7 Let D be the linear operator of differentiation on C. 7
8 (a) Show that the set of linear combinations C 1 cos +C 2 sin is an invariant subspace for D. (b) Show that the set of polynomials of degree at most 3 is a subspace and that it is invariant for D. (c) Given a real number r compute an eigenvector for D with eigenvalue r. 5 Matrices Anton Chapter 1, Sections 1.3, 1.4 An m n matrix is a rectangular array of numbers with m rows and n columns. That is, it is just a list of m n numbers but listed in rectangular form instead of all in a line. However, this shape is irrelevant as far as vector addition and scalar multiplication are concerned. The zero m n matrix 0 has a zero in each place. A matrix is called a square matrix if m = n. However, there is a multiplication between matrices which seems a bit odd until you get used to it by seeing its applications. If A is an m p matrix and B is a p q matrix then the product C = AB is defined and is an m q matrix. Think of A as cut up into m rows, each of length p, and B as cut up into q columns, each of length p. C is constructed using the following pattern (in this picture A is 3 4, and B is 4 2 so that C is 3 2). = B (5.1) A = = C. In particular, the product of two n n matrices is defined and yields an n n matrix. The associative law (AB)C = A(BC) and the distributive laws A(B + C) = AB + AC and (A + B)C = AC + BC both hold and so we 8
9 use them rather automatically. However, the commutative law AB = BC is not true except in certain special cases and so you have to be careful about the side on which you multiply. Rows and Columns of Zeroes: If Row i = 0 in matrix A then Row i = 0 in matrix AB. If Column j = 0 in matrix B then Column j = 0 in matrix AB. The n n identity matrix I n is I n = (5.2) That is, it has 1 s on the diagonal and zeroes off the diagonal. For any n n matrix A, we have I n A = A = AI n. That is, I n behaves like the number 1 with respect to matrix multiplication. In general, (ri)a = ra = A(rI) for any scalar r. The inverse of a n n matrix A, denoted A 1 when it exists, is a matrix which cancels A by multiplication. That is( A 1 A ) = I = AA 1. a b The determinant of a 2 2 matrix A = is ad bc and is denoted c d det(a). For example, det(i 2 ) = 1. It turns out that det(ab) = det(a)det(b). This property implies that if A has an inverse matrix then det(a)det(a 1 ) = det(i) = 1. So det(a) is not zero. ( In ) fact, its reciprocal ( is det(a ) 1 ). a b d b For a 2 2 matrix A = define c d  =. That is, you c a interchange the diagonal elements and leave the other two elements in place but with the sign reversed. You should memorize this pattern as it is the reason that 2 2 matrices are much easier to deal with than larger ones. We will repeatedly use the following important identity: A  = det(a)i = ÂA. (5.3) Thus, if det(a) is not zero, then A has an inverse and its inverse is A 1 = 1 Â. (5.4) det(a) If det(a) = 0 then A does not have an inverse and A = 0 = ÂA. 9
10 The system of two linear equations in two unknowns ax + by = r, cx + dy = s. (5.5) ( ) a b Can be written as a matrix equation L A (X) = AX = S with A = ( ) c ( d ) x r the coefficient matrix, and with column vectors X = and S =. y s When the determinant is not zero then the unique solution is X = A 1 S. Exercise 8 By using the formula for the inverse, derive Cramer s Rule ( ) ( ) 1 r b x = det(a) det 1 a r, y = s d det(a) det (5.6) c s If det(a) = 0 and S = 0, then the homogeneous system AX = 0 has infinitely many solutions. X = 0 is always a solution for the homogeneous system, ( but ) (5.3) implies ( that ) AÂ = 0. This means that the columns of Â, d b X = and X = are solutions as well. At least one of these is c a not zero, unless A itself is 0 and in that case every vector X is a solution. 6 Row Operations and Elementary Matrices Anton Chapter 1, Sections 1.5, 1.6 The three elementary row operations on n p matrices are given by: 1. Multiply row R i by a nonzero constant c (i n). 2. Interchange rows R i and R j (i, j n) 3. To row R i add c times a copy of row R j ( i, j n, j i). [Note row R j is left unchanged]. 10
11 We associate to a row operation Op the n n elementary matrix E = Op(I n ). Theorem 6.1. If A an n p matrix and B is a p q matrix then Op(AB) = Op(A)B. So if I is the n n identity matrix, Op(A) = Op(IA) = Op(I)A. Corollary 6.2. Reverse row operations have inverse elementary matrices. Proof: The the row operation Op and its reverse Ōp to the identity matrix. I = Ōp(Op(I)) = Ōp(IOp(I))Ōp(I)Op(I). (6.1) Start with an n n matrix A and do row operations to reach a matrix B in reduced echelon form. Either B = I or the last row of B is a row of zeroes. Case 1 (B = I): I = B = Op k (...(Op 1 (A)...) = E k...e 1 A, where E 1 is the elementary matrix Op 1 (I), and so on to E k = Op k (I). E k...e 1 is an invertible matrix and A cancels it. So A is invertible with inverse E k...e 1. If you perform the same row operations on the identity matrix you get Op k (...(Op 1 (I)...) = E k...e 1 = A 1. Thus, we fine the inverse by putting (A : I) in reduced echelon form, obtaining (I : A 1 ). Case 2 (B has a row of zeroes): A is not invertible for if it were then the product E k...e 1 A would be, but this is B and BC has a row of zeroes for any n n matrix C and so B cannot be canceled. 7 Determinants Anton Chapter 2, Sections 2.1, 2.2, 2.3 The determinant is a function which associates to each n n matrix a number labeled det(a). We will need the following properties (which we won t prove). 11
12 1. det(i) = det(a ) = det(a). 3. det(ab) = det(a)det(b). 4. With all but one row fixed, the determinant is a linear function as we vary the remaining row. 5. Interchanging two rows multiplies the determinant by 1. It follows from 4. that det(op(a)) = cdet(a) if Op multiplies a row by c. If there is a row of zeroes, the determinant is zero. It follows from 5. that det(op(a)) = det(a) if Op interchanges two rows. If two rows are the same, the determinant is zero. The third type of row operation leaves the determinant unchanged. That is, det(op(a)) = det(a) if Op adds to a row c times a copy of another row. For computation, block triangular form will be convenient. Syllabus and Homework In the syllabus below we write Anton for the Linear Algebra book and EA for these notes. 1. Vector Spaces: EA Section 1 and Anton Section 4.1, General Vector Spaces, HW: Anton p. 179/ 19, 20, Subspaces and Linear Combinations: EA Section 2 and Anton Section 4.2, Subspaces, HW: EA ex. 1, 2 Anton p / 1, 3, 4, 14, Linear Independence and Bases: EA Section 3 and Anton Section 4.3, Linear Independence, Section 4.4, Coordinates and Basis HW: EA ex. 3, 4, 5, 6 Anton p. 199/ 11, 13, Dimension: Anton Section 4.4, Dimension, HW: Anton p. 217/ Linear Mappings: EA Section 4 and Anton Section 8.1, General Linear Transformations, HW: EA ex. 7 Anton p. 444/ 36, 37, 40,
13 6. Systems of Equations and Echelon Form: Anton Sections 1.1, Introduction to Systems of Linear Equations, and, 1.2, Gaussian Elimination, HW: Anton p. 10/ 12 abc, 13 abc, p. 23/ 4-8, and p. 199/ 4 ab, 7,8, pp /9a, 15, 216/1,3,5. 7. Matrix Algebra: EA Section 5 and Anton Sections 1.3, Matrices and Matrix Operations, and, 1.4 Inverses; Algebraic Properties of Matrices, HW: EA ex. 8 Anton pp /1-5abcde, 23, 24 and 8. Row Operations and Elementary Matrices: EA Section 6 and Anton Section 1.5, Elementary Matrices and a Method for Finding A 1, and, 1.6, More on Linear Systems and Invertible Matrices, HW: Anton pp. 58,59/ 4, 9-24 [For odd ones obtain the inverse, for the evens just put the matrix in reduced echelon form] and p. 65/ 1,3,5,8. 9. Determinants: EA Section 7 and Anton Sections 2.1, 2.2 [Skim these], HW: Anton p. 105/ 11, 13, Row Space, Column Space and Rank: Anton Section 4.7, Row Space, Column Space, and Null Space, and, Section 4.8, Rank, Nullity and the Fundamental Matrix Spaces, HW: Anton p. 236/ 6 abcd [find a basis for the column space and for the row space as will as the null space, for each matrix]. 11. Eigenvalues, Eigenvectors and Diagonalization: Anton Section 5.1, Eigenvalues and Eigenvectors, and, Section 5.2, Diagonalization, HW: Anton pp /6-13, 18,19, and pp /
14 8 Class Information Notes MATH 346E (52873) Linear Algebra Fall, 2014 Monday, Wednesday 2:00-3:15 pm NAC 4/108 Book and Notes: Elementary Linear Algebra, 10 th Edition, by Howard Anton. In addition, there will be the supplementary notes attached above, a pdf of which will be posted on my home page. Grading: There will be three in class tests [if time permits, otherwise, just two] and a final exam. The final counts 40 % of the grade. You should be warned that there are no makeups. Instead the remaining work will simply be counted more heavily. Please attend regularly and be on time. Office Hours: Monday 12:00-12:50 pm and Wednesday 9:00-9:50 am. Other times by appointment. Ethan Akin Office: R6/287A Phone: ethanakin@earthlink.net 14
2. 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 informationMATH 213 Linear Algebra and ODEs Spring 2015 Study Sheet for Midterm Exam. Topics
MATH 213 Linear Algebra and ODEs Spring 2015 Study Sheet for Midterm Exam This study sheet will not be allowed during the test Books and notes will not be allowed during the test Calculators and cell phones
More informationCalculating determinants for larger matrices
Day 26 Calculating determinants for larger matrices We now proceed to define det A for n n matrices A As before, we are looking for a function of A that satisfies the product formula det(ab) = det A det
More informationLinear Algebra. Matrices Operations. Consider, for example, a system of equations such as x + 2y z + 4w = 0, 3x 4y + 2z 6w = 0, x 3y 2z + w = 0.
Matrices Operations Linear Algebra Consider, for example, a system of equations such as x + 2y z + 4w = 0, 3x 4y + 2z 6w = 0, x 3y 2z + w = 0 The rectangular array 1 2 1 4 3 4 2 6 1 3 2 1 in which the
More 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 informationChapter 5. Linear Algebra. A linear (algebraic) equation in. unknowns, x 1, x 2,..., x n, is. an equation of the form
Chapter 5. Linear Algebra A linear (algebraic) equation in n unknowns, x 1, x 2,..., x n, is an equation of the form a 1 x 1 + a 2 x 2 + + a n x n = b where a 1, a 2,..., a n and b are real numbers. 1
More informationMAC Module 3 Determinants. Learning Objectives. Upon completing this module, you should be able to:
MAC 2 Module Determinants Learning Objectives Upon completing this module, you should be able to:. Determine the minor, cofactor, and adjoint of a matrix. 2. Evaluate the determinant of a matrix by cofactor
More 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 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 informationMath Notes on Differential Equations and Linear Algebra
Math 39104 - Notes on Differential Equations and Linear Algebra Ethan Akin Mathematics Department The City College August, 2014 These notes are a supplement for Math 39104 to the book Elementary Differential
More informationThe value of a problem is not so much coming up with the answer as in the ideas and attempted ideas it forces on the would be solver I.N.
Math 410 Homework Problems In the following pages you will find all of the homework problems for the semester. Homework should be written out neatly and stapled and turned in at the beginning of class
More information(b) If a multiple of one row of A is added to another row to produce B then det(b) =det(a).
.(5pts) Let B = 5 5. Compute det(b). (a) (b) (c) 6 (d) (e) 6.(5pts) Determine which statement is not always true for n n matrices A and B. (a) If two rows of A are interchanged to produce B, then det(b)
More informationand let s calculate the image of some vectors under the transformation T.
Chapter 5 Eigenvalues and Eigenvectors 5. Eigenvalues and Eigenvectors Let T : R n R n be a linear transformation. Then T can be represented by a matrix (the standard matrix), and we can write T ( v) =
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 informationOHSx XM511 Linear Algebra: Solutions to Online True/False Exercises
This document gives the solutions to all of the online exercises for OHSx XM511. The section ( ) numbers refer to the textbook. TYPE I are True/False. Answers are in square brackets [. Lecture 02 ( 1.1)
More informationThe definition of a vector space (V, +, )
The definition of a vector space (V, +, ) 1. For any u and v in V, u + v is also in V. 2. For any u and v in V, u + v = v + u. 3. For any u, v, w in V, u + ( v + w) = ( u + v) + w. 4. There is an element
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 informationProperties of Linear Transformations from R n to R m
Properties of Linear Transformations from R n to R m MATH 322, Linear Algebra I J. Robert Buchanan Department of Mathematics Spring 2015 Topic Overview Relationship between the properties of a matrix transformation
More informationA matrix is a rectangular array of. objects arranged in rows and columns. The objects are called the entries. is called the size of the matrix, and
Section 5.5. Matrices and Vectors A matrix is a rectangular array of objects arranged in rows and columns. The objects are called the entries. A matrix with m rows and n columns is called an m n matrix.
More information3 Matrix Algebra. 3.1 Operations on matrices
3 Matrix Algebra A matrix is a rectangular array of numbers; it is of size m n if it has m rows and n columns. A 1 n matrix is a row vector; an m 1 matrix is a column vector. For example: 1 5 3 5 3 5 8
More 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 informationMATH 221: SOLUTIONS TO SELECTED HOMEWORK PROBLEMS
MATH 221: SOLUTIONS TO SELECTED HOMEWORK PROBLEMS 1. HW 1: Due September 4 1.1.21. Suppose v, w R n and c is a scalar. Prove that Span(v + cw, w) = Span(v, w). We must prove two things: that every element
More informationA matrix is a rectangular array of. objects arranged in rows and columns. The objects are called the entries. is called the size of the matrix, and
Section 5.5. Matrices and Vectors A matrix is a rectangular array of objects arranged in rows and columns. The objects are called the entries. A matrix with m rows and n columns is called an m n matrix.
More 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 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 informationLecture Summaries for Linear Algebra M51A
These lecture summaries may also be viewed online by clicking the L icon at the top right of any lecture screen. Lecture Summaries for Linear Algebra M51A refers to the section in the textbook. Lecture
More informationMATH 315 Linear Algebra Homework #1 Assigned: August 20, 2018
Homework #1 Assigned: August 20, 2018 Review the following subjects involving systems of equations and matrices from Calculus II. Linear systems of equations Converting systems to matrix form Pivot entry
More informationChapter 7. Linear Algebra: Matrices, Vectors,
Chapter 7. Linear Algebra: Matrices, Vectors, Determinants. Linear Systems Linear algebra includes the theory and application of linear systems of equations, linear transformations, and eigenvalue problems.
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 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 informationFinal Review Sheet. B = (1, 1 + 3x, 1 + x 2 ) then 2 + 3x + 6x 2
Final Review Sheet The final will cover Sections Chapters 1,2,3 and 4, as well as sections 5.1-5.4, 6.1-6.2 and 7.1-7.3 from chapters 5,6 and 7. This is essentially all material covered this term. Watch
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 informationLinear Algebra review Powers of a diagonalizable matrix Spectral decomposition
Linear Algebra review Powers of a diagonalizable matrix Spectral decomposition Prof. Tesler Math 283 Fall 2018 Also see the separate version of this with Matlab and R commands. Prof. Tesler Diagonalizing
More informationLinear Algebra (Math-324) Lecture Notes
Linear Algebra (Math-324) Lecture Notes Dr. Ali Koam and Dr. Azeem Haider September 24, 2017 c 2017,, Jazan All Rights Reserved 1 Contents 1 Real Vector Spaces 6 2 Subspaces 11 3 Linear Combination and
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 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 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 informationDaily Update. Math 290: Elementary Linear Algebra Fall 2018
Daily Update Math 90: Elementary Linear Algebra Fall 08 Lecture 7: Tuesday, December 4 After reviewing the definitions of a linear transformation, and the kernel and range of a linear transformation, we
More informationLinear Algebra review Powers of a diagonalizable matrix Spectral decomposition
Linear Algebra review Powers of a diagonalizable matrix Spectral decomposition Prof. Tesler Math 283 Fall 2016 Also see the separate version of this with Matlab and R commands. Prof. Tesler Diagonalizing
More information1 9/5 Matrices, vectors, and their applications
1 9/5 Matrices, vectors, and their applications Algebra: study of objects and operations on them. Linear algebra: object: matrices and vectors. operations: addition, multiplication etc. Algorithms/Geometric
More informationMAC Module 2 Systems of Linear Equations and Matrices II. Learning Objectives. Upon completing this module, you should be able to :
MAC 0 Module Systems of Linear Equations and Matrices II Learning Objectives Upon completing this module, you should be able to :. Find the inverse of a square matrix.. Determine whether a matrix is invertible..
More informationLinear Algebra: Lecture notes from Kolman and Hill 9th edition.
Linear Algebra: Lecture notes from Kolman and Hill 9th edition Taylan Şengül March 20, 2019 Please let me know of any mistakes in these notes Contents Week 1 1 11 Systems of Linear Equations 1 12 Matrices
More 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 informationIntroduction to Matrices
POLS 704 Introduction to Matrices Introduction to Matrices. The Cast of Characters A matrix is a rectangular array (i.e., a table) of numbers. For example, 2 3 X 4 5 6 (4 3) 7 8 9 0 0 0 Thismatrix,with4rowsand3columns,isoforder
More information[Disclaimer: This is not a complete list of everything you need to know, just some of the topics that gave people difficulty.]
Math 43 Review Notes [Disclaimer: This is not a complete list of everything you need to know, just some of the topics that gave people difficulty Dot Product If v (v, v, v 3 and w (w, w, w 3, then the
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 informationOnline Exercises for Linear Algebra XM511
This document lists the online exercises for XM511. The section ( ) numbers refer to the textbook. TYPE I are True/False. Lecture 02 ( 1.1) Online Exercises for Linear Algebra XM511 1) The matrix [3 2
More informationGraduate Mathematical Economics Lecture 1
Graduate Mathematical Economics Lecture 1 Yu Ren WISE, Xiamen University September 23, 2012 Outline 1 2 Course Outline ematical techniques used in graduate level economics courses Mathematics for Economists
More informationYORK UNIVERSITY. Faculty of Science Department of Mathematics and Statistics MATH M Test #1. July 11, 2013 Solutions
YORK UNIVERSITY Faculty of Science Department of Mathematics and Statistics MATH 222 3. M Test # July, 23 Solutions. For each statement indicate whether it is always TRUE or sometimes FALSE. Note: For
More informationft-uiowa-math2550 Assignment OptionalFinalExamReviewMultChoiceMEDIUMlengthForm due 12/31/2014 at 10:36pm CST
me me ft-uiowa-math255 Assignment OptionalFinalExamReviewMultChoiceMEDIUMlengthForm due 2/3/2 at :3pm CST. ( pt) Library/TCNJ/TCNJ LinearSystems/problem3.pg Give a geometric description of the following
More informationReview problems for MA 54, Fall 2004.
Review problems for MA 54, Fall 2004. Below are the review problems for the final. They are mostly homework problems, or very similar. If you are comfortable doing these problems, you should be fine on
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 informationAnnouncements Wednesday, November 01
Announcements Wednesday, November 01 WeBWorK 3.1, 3.2 are due today at 11:59pm. The quiz on Friday covers 3.1, 3.2. My office is Skiles 244. Rabinoffice hours are Monday, 1 3pm and Tuesday, 9 11am. Section
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 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 informationMAT188H1S LINEAR ALGEBRA: Course Information as of February 2, Calendar Description:
MAT188H1S LINEAR ALGEBRA: Course Information as of February 2, 2019 2018-2019 Calendar Description: This course covers systems of linear equations and Gaussian elimination, applications; vectors in R n,
More information1. What is the determinant of the following matrix? a 1 a 2 4a 3 2a 2 b 1 b 2 4b 3 2b c 1. = 4, then det
What is the determinant of the following matrix? 3 4 3 4 3 4 4 3 A 0 B 8 C 55 D 0 E 60 If det a a a 3 b b b 3 c c c 3 = 4, then det a a 4a 3 a b b 4b 3 b c c c 3 c = A 8 B 6 C 4 D E 3 Let A be an n n matrix
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 informationMATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 1 x 2. x n 8 (4) 3 4 2
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS SYSTEMS OF EQUATIONS AND MATRICES Representation of a linear system The general system of m equations in n unknowns can be written a x + a 2 x 2 + + a n x n b a
More informationAnnouncements Wednesday, November 01
Announcements Wednesday, November 01 WeBWorK 3.1, 3.2 are due today at 11:59pm. The quiz on Friday covers 3.1, 3.2. My office is Skiles 244. Rabinoffice hours are Monday, 1 3pm and Tuesday, 9 11am. Section
More informationExtra Problems for Math 2050 Linear Algebra I
Extra Problems for Math 5 Linear Algebra I Find the vector AB and illustrate with a picture if A = (,) and B = (,4) Find B, given A = (,4) and [ AB = A = (,4) and [ AB = 8 If possible, express x = 7 as
More informationNOTES FOR LINEAR ALGEBRA 133
NOTES FOR LINEAR ALGEBRA 33 William J Anderson McGill University These are not official notes for Math 33 identical to the notes projected in class They are intended for Anderson s section 4, and are 2
More informationReview for Exam Find all a for which the following linear system has no solutions, one solution, and infinitely many solutions.
Review for Exam. Find all a for which the following linear system has no solutions, one solution, and infinitely many solutions. x + y z = 2 x + 2y + z = 3 x + y + (a 2 5)z = a 2 The augmented matrix for
More informationMath 313 Chapter 1 Review
Math 313 Chapter 1 Review Howard Anton, 9th Edition May 2010 Do NOT write on me! Contents 1 1.1 Introduction to Systems of Linear Equations 2 2 1.2 Gaussian Elimination 3 3 1.3 Matrices and Matrix Operations
More informationMath 102, Winter Final Exam Review. Chapter 1. Matrices and Gaussian Elimination
Math 0, Winter 07 Final Exam Review Chapter. Matrices and Gaussian Elimination { x + x =,. Different forms of a system of linear equations. Example: The x + 4x = 4. [ ] [ ] [ ] vector form (or the column
More informationThis MUST hold matrix multiplication satisfies the distributive property.
The columns of AB are combinations of the columns of A. The reason is that each column of AB equals A times the corresponding column of B. But that is a linear combination of the columns of A with coefficients
More informationLinear Algebra: Lecture Notes. Dr Rachel Quinlan School of Mathematics, Statistics and Applied Mathematics NUI Galway
Linear Algebra: Lecture Notes Dr Rachel Quinlan School of Mathematics, Statistics and Applied Mathematics NUI Galway November 6, 23 Contents Systems of Linear Equations 2 Introduction 2 2 Elementary Row
More informationMAT 242 CHAPTER 4: SUBSPACES OF R n
MAT 242 CHAPTER 4: SUBSPACES OF R n JOHN QUIGG 1. Subspaces Recall that R n is the set of n 1 matrices, also called vectors, and satisfies the following properties: x + y = y + x x + (y + z) = (x + y)
More informationM. Matrices and Linear Algebra
M. Matrices and Linear Algebra. Matrix algebra. In section D we calculated the determinants of square arrays of numbers. Such arrays are important in mathematics and its applications; they are called matrices.
More informationLS.1 Review of Linear Algebra
LS. LINEAR SYSTEMS LS.1 Review of Linear Algebra In these notes, we will investigate a way of handling a linear system of ODE s directly, instead of using elimination to reduce it to a single higher-order
More informationLinear Algebra M1 - FIB. Contents: 5. Matrices, systems of linear equations and determinants 6. Vector space 7. Linear maps 8.
Linear Algebra M1 - FIB Contents: 5 Matrices, systems of linear equations and determinants 6 Vector space 7 Linear maps 8 Diagonalization Anna de Mier Montserrat Maureso Dept Matemàtica Aplicada II Translation:
More 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 informationLinear Algebra Practice Problems
Linear Algebra Practice Problems Math 24 Calculus III Summer 25, Session II. Determine whether the given set is a vector space. If not, give at least one axiom that is not satisfied. Unless otherwise stated,
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 1060 Linear Algebra Homework Exercises 1 1. Find the complete solutions (if any!) to each of the following systems of simultaneous equations:
Homework Exercises 1 1 Find the complete solutions (if any!) to each of the following systems of simultaneous equations: (i) x 4y + 3z = 2 3x 11y + 13z = 3 2x 9y + 2z = 7 x 2y + 6z = 2 (ii) x 4y + 3z =
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 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 informationMATH 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 informationLinear Systems and Matrices
Department of Mathematics The Chinese University of Hong Kong 1 System of m linear equations in n unknowns (linear system) a 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2.......
More information4. Linear transformations as a vector space 17
4 Linear transformations as a vector space 17 d) 1 2 0 0 1 2 0 0 1 0 0 0 1 2 3 4 32 Let a linear transformation in R 2 be the reflection in the line = x 2 Find its matrix 33 For each linear transformation
More informationa s 1.3 Matrix Multiplication. Know how to multiply two matrices and be able to write down the formula
Syllabus for Math 308, Paul Smith Book: Kolman-Hill Chapter 1. Linear Equations and Matrices 1.1 Systems of Linear Equations Definition of a linear equation and a solution to a linear equations. Meaning
More informationMATH 304 Linear Algebra Lecture 20: Review for Test 1.
MATH 304 Linear Algebra Lecture 20: Review for Test 1. Topics for Test 1 Part I: Elementary linear algebra (Leon 1.1 1.4, 2.1 2.2) Systems of linear equations: elementary operations, Gaussian elimination,
More informationComputationally, diagonal matrices are the easiest to work with. With this idea in mind, we introduce similarity:
Diagonalization We have seen that diagonal and triangular matrices are much easier to work with than are most matrices For example, determinants and eigenvalues are easy to compute, and multiplication
More informationCity Suburbs. : population distribution after m years
Section 5.3 Diagonalization of Matrices Definition Example: stochastic matrix To City Suburbs From City Suburbs.85.03 = A.15.97 City.15.85 Suburbs.97.03 probability matrix of a sample person s residence
More informationDIAGONALIZATION. In order to see the implications of this definition, let us consider the following example Example 1. Consider the matrix
DIAGONALIZATION Definition We say that a matrix A of size n n is diagonalizable if there is a basis of R n consisting of eigenvectors of A ie if there are n linearly independent vectors v v n such that
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 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 informationColumbus State Community College Mathematics Department Public Syllabus
Columbus State Community College Mathematics Department Public Syllabus Course and Number: MATH 2568 Elementary Linear Algebra Credits: 4 Class Hours Per Week: 4 Prerequisites: MATH 2153 with a C or higher
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 information4. Determinants.
4. Determinants 4.1. Determinants; Cofactor Expansion Determinants of 2 2 and 3 3 Matrices 2 2 determinant 4.1. Determinants; Cofactor Expansion Determinants of 2 2 and 3 3 Matrices 3 3 determinant 4.1.
More informationElementary Linear Algebra
Matrices J MUSCAT Elementary Linear Algebra Matrices Definition Dr J Muscat 2002 A matrix is a rectangular array of numbers, arranged in rows and columns a a 2 a 3 a n a 2 a 22 a 23 a 2n A = a m a mn We
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 informationSection Instructors: by now you should be scheduled into one of the following Sections:
MAT188H1F LINEAR ALGEBRA: Syllabus for Fall 2018 as of October 26, 2018 2018-2019 Calendar Description: This course covers systems of linear equations and Gaussian elimination, applications; vectors in
More informationDigital Workbook for GRA 6035 Mathematics
Eivind Eriksen Digital Workbook for GRA 6035 Mathematics November 10, 2014 BI Norwegian Business School Contents Part I Lectures in GRA6035 Mathematics 1 Linear Systems and Gaussian Elimination........................
More informationChapter 3. Vector spaces
Chapter 3. Vector spaces Lecture notes for MA1111 P. Karageorgis pete@maths.tcd.ie 1/22 Linear combinations Suppose that v 1,v 2,...,v n and v are vectors in R m. Definition 3.1 Linear combination We say
More informationMath 21b. Review for Final Exam
Math 21b. Review for Final Exam Thomas W. Judson Spring 2003 General Information The exam is on Thursday, May 15 from 2:15 am to 5:15 pm in Jefferson 250. Please check with the registrar if you have a
More informationMath 313 (Linear Algebra) Exam 2 - Practice Exam
Name: Student ID: Section: Instructor: Math 313 (Linear Algebra) Exam 2 - Practice Exam Instructions: For questions which require a written answer, show all your work. Full credit will be given only if
More information2.3. VECTOR SPACES 25
2.3. VECTOR SPACES 25 2.3 Vector Spaces MATH 294 FALL 982 PRELIM # 3a 2.3. Let C[, ] denote the space of continuous functions defined on the interval [,] (i.e. f(x) is a member of C[, ] if f(x) is continuous
More informationMath 110 Linear Algebra Midterm 2 Review October 28, 2017
Math 11 Linear Algebra Midterm Review October 8, 17 Material Material covered on the midterm includes: All lectures from Thursday, Sept. 1st to Tuesday, Oct. 4th Homeworks 9 to 17 Quizzes 5 to 9 Sections
More informationMath 220 F11 Lecture Notes
Math 22 F Lecture Notes William Chen November 4, 2. Lecture. Firstly, lets just get some notation out of the way. Notation. R, Q, C, Z, N,,,, {},, A B. Everyone in high school should have studied equations
More information