Math 123, Week 5: Linear Independence, Basis, and Matrix Spaces. Section 1: Linear Independence
|
|
- Clinton Owen
- 6 years ago
- Views:
Transcription
1 Math 123, Week 5: Linear Independence, Basis, and Matrix Spaces Section 1: Linear Independence Recall that every row on the left-hand side of the coefficient matrix of a linear system A x = b which could be obtained by elementary row operations could be written as a = c 1 a c m a m where a 1,..., a m are the original row vectors of the matrix A. When performing Gaussian elimination, we often encountered rows of all zeroes, e.g. (0, 0,..., 0). This is a very important row since it tells us that, depending on vector b, the corresponding equation contains no information ( 0 = 0 ) or is inconsistent ( 0 = something ). Notice that, in order to have a row like this arise, we need to have c 1 a c m a m = 0 for some nontrivial (i.e. not all zero) choices of c 1,..., c m. This condition turns out to be very important in the study of vector spaces, and has the following succinct definition. Definition 1 A set of vectors {v 1, v 2,..., v m } where v i R n is said to be linearly independent if c 1 v 1 + c 2 v c m v m = 0 implies c 1 = c 2 = = c m = 0. Otherwise, the vectors are said to be linearly dependent. 1
2 Note: There are some very important geometric consequences of a set of vectors {v 1,..., v m } being linearly dependent. 1. If the set if linearly dependent, then at least one vector in the set can be written as a linear combination of the remaining vectors. Without loss of generality, suppose that c m 0 so that v m is such a vector. Then we have c 1 v c m 1 v m 1 + c m v m = 0 = v m = c 1 c m v 1 c m 1 c m v m 1. (1) Note that we have at least one c m 0 by linear dependence. 2. If the set is linearly dependent then there is a vector (which we will be denote v m ) such that span{v 1,..., v m 1, v m } = span{v 1,..., v m 1 }. This follows immediately because (1) implies v m span{v 1,..., v m 1 }. 3. Geometrically, linearly dependent vectors must lie on a common hyperplane which is lower dimension than the number of vectors. This is easiest to visualize in R 2 and R 3, where three linearly dependent vectors R 3 can only span a plane (or line), but not the whole space, e.g.: 2
3 Example 1 Determine whether the vectors v 1 = (3, 1, 4), v 2 = (1, 1, 0), and v 3 = (1, 2, 2) are linearly independent or dependent. If they are linearly dependent, find non-trivial coefficients c 1, c 2, and c 3 which demonstrate this relationship. Solution: We need to see if there is a non-trivial solution to the following equation: c 1 v 1 + c 2 v 2 + c 3 v 3 = 0. With a little effort, it can be seen that what we need to do is solve the following the linear system: c c 2 = c 3 0 where the vector v 1, v 2, and v 3 are the columns. We can perform Gaussian elimination to get: We can easily see that this has a non-trivial solution, so that the set of vectors is linearly dependent. We should have expected this, since we know that a row of zeroes was obtained through the process of row reduction for the transpose matrix. In fact, the solution set can be parametrized by c 3 = t so that c 1 = 1 2 t and c 2 = 5 2t. For a specific non-trivial solution, we can select t = 2 to get {c 1 = 1, c 2 = 5, c 3 = 2}. In other words, we have that (1)v 1 + ( 5)v 2 + (2)v 3 = v 1 5v 2 + 2v 3 = 0. We now have a prescription for determine whether a set of n vectors with n coordinates are linearly independent or dependent. Specifically, we 3
4 have the following result. Theorem 1 A set of vectors {v 1, v 2,..., v n } where v i R n is linearly independent if and only if det(a) 0 where the matrix A is defined as A = [ v 1 v 2 v n ]. (2) Proof The linear independence condition can be stated as A c = 0 where A is defined as in (2) and c = (c 1, c 2,..., c n ). Notice that c = 0 is always a solution of this system, so that, if A is invertible (i.e. det(a) 0), then c = 0 is the only solution. This, however, is the trivial solution. It follows that, if det(a) 0, then the vectors are linearly independent. On the other hand, if det(a) = 0, we have that there is a row of zeroes in the Gaussian row-reduction on the left-hand side. Since the system is homogeneous, however, there is also a zero on the row-reduced righthand side. It follows that A c = 0 has at least one non-trivial solution so that the set of vectors are linearly dependent, and we are done. Example 2 Show that the set of vectors {v 1, v 2 } = {(1, 2), ( 1, 2)} is linearly dependent. Solution: The set of vectors is linearly dependent if c 1 v 1 + c 2 v 2 = 0 for some c 1, c 2 R not all zero. This is equivalent to the linear system [ ] [ ] [ ] 1 1 c1 0 = c 2 4
5 Our determinant test for linear independence gives = (1)(2) ( 1)( 2) = 0. Since det(a) = 0, we have that the vectors are linearly dependent. This is clear geometrically, since the two vectors are scalar multiples of one another. Explicitly, we have v 1 + v 2 = 0. Example 3 Show that the set of vectors {v 1, v 2, v 3 } = {(1, 0, 1), (0, 1, 0), (0, 1, 1)} are linearly independent. Solution: The linear independence condition corresponds to: c c 2 = c 3 0 We have det = (1) = (1)[(1)( 1) (0)(1)] = 1. Since det(a) 0, we have that the vectors are linearly independent. This result works well for sets of vectors where the number of vectors is the same as the dimension of the vectors themselves. The linear independence condition, however, can be defined for sets of vectors not satisfying this condition. For instance, consider being asked to determine the whether the vectors v 1 = (3, 1, 2) and v 2 = (1, 1, 2) are linearly independent or dependent. We need to check whether c 1 v 1 + c 2 v 2 = 0 5
6 has a nontrivial solution. This corresponds to the linear system 3 1 [ ] [ ] 1 1 c1 0 =. c We cannot apply the previous result because the coefficient matrix on the left is not a square matrix. We can either solve the system directly, or apply the following result. (We will omit the proof for time.) Theorem 2 The set of vectors {v 1,..., v m } where v i R n and m < n is linearly independent if and only if the matrix A = [ v 1 v 2 v m ] has some m m submatrix for which the determinant is nonzero. Conversely, the set {v 1,..., v m } is linearly dependent if every m m submatrix of A has a zero determinant. Example 4 Show that the set of vectors {(3, 1, 2), (1, 1, 2)} is linearly independent. Solution: We have the matrix A = Rather than attempt to determine the determinant of this matrix (which does not exist), we consider the determinants of square submatrices of maximal size. In this case, that is 2 2. We notice that we have [ ] A 3 1 = = det(a ) = (3)(1) ( 1)(1) = Since det(a ) 0, we have that the set of vectors is linearly independent.. 6
7 Notice that this is true even though [ ] A 1 2 = = det(a ) = ( 1)( 2) (1)(2) = That is, it is sufficient to find a single maximal submatrix with a nonzero determinant to conclude the set is linearly independent. They do not need to all be nonzero. Example 5 Show that the set of vectors {(1, 2, 1), ( 2, 4, 2)} is linearly dependent. Solution: We need to consider submatrices of the following: 1 2 A = We have and A = A = A = [ [ [ ] ] ] = det(a ) = (1)(4) ( 2)( 2) = 0, = det(a ) = (1)(2) ( 2)( 1) = 0, = det(a ) = ( 2)(2) (4)( 1) = 0. Since all maximum submatrices has a zero determinant, we may conclude the vectors are linearly dependent. Notice that, for this example, it is probably easier to show linearly dependence directly. We can probably recognize this directly by noting that the second vector is negative two times the first vector. It follows that we have (2) v 1 + (1) v 2 = 0. This result could also be obtained by row-reduction. 7
8 Section 2: Basis and Dimension We have seen that every subspace W R n may be represented as the span of a finite set of vectors {v 1,..., v m } where m n. Furthermore, we have seen that if the set is linearly dependent then we can reduce the size of the set required to span W. We might naturally ask the following questions: (Q1) Is there a minimal set of vectors {v 1,..., v m } required to span a subspace W R n? (Q2) Is the set of spanning vectors {v 1,..., v m } unique? It turns out that we have all of the tools we need to answer these questions. We have the following definition which is foundational to the study of vector spaces. Definition 2 A set of vector S = {v 1,..., v m } is said to be a basis of W R n if span(s) = W and the set of vectors in S is linearly independent. A basis allows a vector space to be represented by a finite set of generators. We will see that this is an incredibly powerful computational simplification. Reconsider the following example. Example 6 Determine a basis for the subspace W = span(s) R 3 where S = {(3, 1, 4), (1, 1, 0), (1, 2, 2)}. Solution: The general trick will be to check for linear independence, and if this fails, to remove one of the vectors (carefully!) from the set. We will continue this until the remaining set is linearly independent. We have already found that (3, 1, 4), (1, 1, 0), and (1, 2, 2) are linearly dependent, and in particular, that (3, 1, 4) 5 (1, 1, 0) + 2 (1, 2, 2) = (0, 0, 0) 8
9 This can be rewritten as (3, 1, 4) = 5 (1, 1, 0) 2 (1, 2, 2). (3) so that (3, 1, 4) span{(1, 1, 0), (1, 2, 2)}. It follows that span{(3, 1, 4), (1, 1, 0), (1, 2, 2)} = span{(1, 1, 0), (1, 2, 2)}. It only remains to check whether this reduced set is linearly dependent since, if it were, we would be able to remove on the vectors from the spanning set. By our earlier result, we check = 1 0 so that the set is linearly independent. It follows that B = {(1, 1, 0), (1, 2, 2)} is a basis of the subspace W = span(s). Note: Before moving on, we should give at least passing consideration to question number two above. That is, we should give consideration to whether this is the only possible choice of basis. In fact, we should be able to easily convince ourselves that this is not that case. Notice that (3, 1, 4) 5 (1, 1, 0) + 2 (1, 2, 2) = (0, 0, 0) = (1, 2, 2) = 1 2 (3, 1, 4) 5 (1, 1, 0). 2 It follows that span{(3, 1, 4), (1, 1, 0)} = span{(3, 1, 4), (1, 1, 0), (1, 2, 2)}. Since the set B = {(3, 1, 4), (1, 1, 0)} is linearly independent, we have that B is also a basis of the subspace W = span(s). That is, we have found two bases of W : B and B. We might be discouraged that a subspace W R n can be represented by multiple bases; however, this turns out to be quite useful in practice. It is often beneficial to represent vector spaces by different bases in one application than another. First, however, we should consider how the bases of a space are related to one another. Theorem 3 Suppose a subspace W R n has bases B 1 and B 2. Then the num- 9
10 ber of elements in B 1 and B 2 is the same. This number is called the dimension of W and is denoted dim(w ). This result allows us to relax a little bit. We may not be able to find a unique basis, but at the very least we know that the number of elements needs to minimally generate a space is always the same. Note (standard basis): For R n we denote the standard basis B = {e 1, e 2,..., e n } where e i R n is the vector with a one in the ith component and zeroes elsewhere. For example, in R 3 we have the standard basis B = {e 1, e 2, e 3 } where e 1 = (1, 0, 0), e 2 = (0, 1, 0), and e 3 = (0, 0, 1). Note (coordinates): A key feature of having a basis B = {v 1,..., v m } for a subspace W R n is that each element v W can be written as a linear combination of elements in the basis, i.e. v = c 1 v c m v m in exactly one way. That is to say, once the basis has been chosen, the representation of each vector v W in terms of that basis is fixed. The values c i, i = 1,..., m, are said to be the coordinates of the vector v relative to the basis B. For example, in the standard basis of R 3, we have that the vector (2, 3, 1) is given uniquely by coordinates c 1 = 2, c 2 = 3, c 3 = 1. This uniqueness of coordinates, however, is true in any basis. Example 7 Show that the set B = {(2, 0, 1), (1, 1, 0), (0, 1, 1)} is a basis of R 3 and then determine the coordinates of (2, 3, 1) with respect to this basis. Solution: For three vectors in R 3, the linear independent condition 10
11 coincides with our ability to span R 3. We have = (2) (1) = (2)(1) (1) = 1 0. It follows that B is linearly independent and therefore is a basis of R 3. To determine the coordinates of (2, 3, 1) with respect to the basis B, we solve c c c 3 1 = This gives It follows that the coordinates of (2, 3, 1) with respect to the basis B are c 1 = 2, c 2 = 6, and c 3 = 3. Section 3: Row, Column, and Nullspace We now return to the consideration of matrices. We introduce the following matrix-related vector spaces. Definition 3 Consider an m n matrix A. We define: 1. the row space of A (denoted row(a)) to be the span of the row vectors of A; 2. the column space of A (denoted col(a)) to be the span of the 11
12 column vectors of A; and 3. the null space of A (denoted null(a)) to be the set of vectors v such that A v = 0. Example 8 Describe the row space, column space, and null space of the following matrix in terms of the span of vectors: [ ] A = Solution: We can easily see that row(a) = span{(2, 3, 1), ( 1, 1, 0)} and that col(a) = span{(2, 1), ( 3, 1), (1, 0)}. It is worth noting here that, although row(a) and col(a) are derived from the same matrix, they do not need to be subspaces of the same vector space. In this case, row(a) R 3 and col(a) R 2. In general, for an m n matrix A we have row(a) R n and col(a) R m We now consider null(a). As at the beginning of class, we solve A v = 0 by Gaussian elimination. This gives [ ] [ ] Set v 3 = t, we have v 1 = t, v 2 = t. It follows that v 1 1 v 2 v 3 = t 1. 1 It follows that null(a) = span{(1, 1, 1)}. Note: The null space of matrix also goes by the name of the kernel (denoted ker(a)) while the column space is often called the range of image (denoted range(a) and im(a), respective). In this class, we will always refer to the null space and column space. 12
13 Defining a vector space by the span of an arbitrary set of vectors is not, in general, the best way to describe the space. More commonly, we are interested a basis for the space. We have the following result. Theorem 4 Consider the row-reduced echelon form of an m n matrix A. Then: 1. A basis for row(a) is given by the rows of the row-reduced echelon matrix which have leading ones; 2. A basis for col(a) is given by the columns of the original matrix which have leadings ones in the row-reduced echelon form; and 3. A basis for null(a) is given by the the vectors found by placing the solution A v = 0 in vector form. Example 9 Determine a basis of the row space, column space, and null space of the following matrix: [ ] A = Solution: We had the row-reduced echelon matrix [ ] It follows that the set {(1, 0, 1), (0, 1, 1)} is a basis of the row(a), the set {(2, 1), ( 3, 1)} is a basis of col(a) (since the third column is not assigned a leading one in the row reduction), and {(1, 1, 1)} is a basis of null(a) (as before). We now want to say something about how these three spaces relate to one another. We introduce the following. Definition 4 Consider an m n matrix A with row space row(a) and null space 13
14 null(a). Then the rank of A is given by rank(a) = dim(row(a)) and the nullity of A is given by nullity(a) = dim(null(a)). The following result, which is known as the Rank-Nullity Theorem, demonstrates how the row, column, and null spaces relate. Theorem 5 Consider an m n matrix A with row space row(a), column space col(a), and null space null(a). Then: (1) rank(a) = dim(row(a)) = dim(col(a)); (2) rank(a) + nullity(a) = n; and (3) If B row is a basis of row(a) and B null is a basis of null(a) then B = {B row, B null } is a basis of R n. Example 10 Verify the Rank-Nullity Theorem for the matrix [ ] A = Solution: We can easily see that rank(a) = dim(row(a)) = dim(col(a))= 2 and nullity(a) = 1. It also follows that rank(a)+nullity(a) = = 3 = n so that the second point is satisfied, and it can be easily checked that the set B = {(1, 0, 1), (0, 1, 1), (1, 1, 1)} is a basis of R 3 since det = (1) = (2) + (1) = (1)
15 Example 11 Determine a basis for the row space, column space, and null space of A = Determine the rank and nullity of A and verify that the Rank-Nullity Theorem is satisfied. Solution: The matrix A can be row reduced to give A basis for the row space is given by the rows of the row reduced matrix with leading ones, so that we have. row(a) = span {(1, 1, 0, 0, 1), (0, 0, 1, 0, 2), (0, 0, 0, 1, 1)}. A basis for the column space is given by the columns of the original matrix corresponding to leading ones in the row reduced echelon form, so that we have col(a) = span {(1, 1, 1, 1), (0, 1, 3, 2), (1, 1, 4, 2)}. A basis for the nullspace can be given by the vector form of the solution of the homogeneous system so that we have A v = 0 null(a) = span {(1, 1, 0, 0, 0), (1, 0, 2, 1, 1)}. 15
16 We have that rank(a) = dim(row(a))= 3 and nullity(a) = dim(null(a))= 2. It follows that rank(a) + nullity(a) = (3) + (2) = 5 which corresponds to the number of columns of A. This is exactly what we expect from the rank-nullity theorem. To verify the remaining condition, it can be checked that det(a) = = so that the union of the basis of the row space and the null space is a basis of R 5. Suggested Problems: 1. Determine whether the following set of vectors is linearly independent of linearly dependent. If they are linearly dependent, determine a nontrivial set of constants c 1,..., c m such that c 1 v c m v m = 0. (a) v 1 = ( 1, 2, 2), v 2 = ( 1, 3, 2) (b) v 1 = (1, 0, 3, 1), v 2 = ( 3, 0, 9, 3) (c) v 1 = ( 2, 1, 1), v 2 = ( 1, 2, 1), v 3 = (0, 1, 1) (d) v 1 = ( 1, 1, 1, 1), v 2 = (1, 1, 0, 2), v 3 = ( 2, 0, 1, 1) 2. Determine a basis for the following spaces: (a) W = span{v 1, v 2, v 3 } where v 1 = (1, 2), v 2 = ( 2, 4), and v 3 = (3, 6). (b) W = span{v 1, v 2, v 3 } where v 1 = (1, 1, 2), v 2 = ( 2, 1, 1), and v 3 = ( 3, 0, 1). (c) W = span{v 1, v 2, v 3, v 4 } where v 1 = (1, 1, 1, 3), v 2 = (1, 1, 3, 5), v 3 = (1, 1, 1, 1), and v 4 = (1, 1, 0, 2). 16
17 3. Determine a basis for the row space, column space, and null space of the following matrices. Also determine the rank and nullity. [ ] 2 5 (a) A = 2 5 (b) A = (c) A = (d) A = Prove that, if v m+1 span{v 1,..., v m }, then span{v 1,..., v m } = span{v 1,..., v m, v m+1 }. 5. Show that the linear system A x = b has a solution if and only if b col(a). 6. Show that, for an n n matrix A, the following are equivalent: (a) det(a) = 0 (b) A is noninvertible (singular) (c) null(a) {0} (note that 0 null(a) for any matrix A.) (d) A x = b has a unique solution (e) rank(a) = n. 7. Prove that, for any m n matrix A, row(a) and null(a) are subspaces of R n, and col(a) is a subspace of R m. 17
Math 2174: Practice Midterm 1
Math 74: Practice Midterm Show your work and explain your reasoning as appropriate. No calculators. One page of handwritten notes is allowed for the exam, as well as one blank page of scratch paper.. Consider
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 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 informationLecture 13: Row and column spaces
Spring 2018 UW-Madison Lecture 13: Row and column spaces 1 The column space of a matrix 1.1 Definition The column space of matrix A denoted as Col(A) is the space consisting of all linear combinations
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 102, Winter 2009, Homework 7
Math 2, Winter 29, Homework 7 () Find the standard matrix of the linear transformation T : R 3 R 3 obtained by reflection through the plane x + z = followed by a rotation about the positive x-axes by 6
More informationMath 313 Chapter 5 Review
Math 313 Chapter 5 Review Howard Anton, 9th Edition May 2010 Do NOT write on me! Contents 1 5.1 Real Vector Spaces 2 2 5.2 Subspaces 3 3 5.3 Linear Independence 4 4 5.4 Basis and Dimension 5 5 5.5 Row
More informationChapter 2 Subspaces of R n and Their Dimensions
Chapter 2 Subspaces of R n and Their Dimensions Vector Space R n. R n Definition.. The vector space R n is a set of all n-tuples (called vectors) x x 2 x =., where x, x 2,, x n are real numbers, together
More information7. Dimension and Structure.
7. Dimension and Structure 7.1. Basis and Dimension Bases for Subspaces Example 2 The standard unit vectors e 1, e 2,, e n are linearly independent, for if we write (2) in component form, then we obtain
More informationSUMMARY OF MATH 1600
SUMMARY OF MATH 1600 Note: The following list is intended as a study guide for the final exam. It is a continuation of the study guide for the midterm. It does not claim to be a comprehensive list. You
More informationRank and Nullity. MATH 322, Linear Algebra I. J. Robert Buchanan. Spring Department of Mathematics
Rank and Nullity MATH 322, Linear Algebra I J. Robert Buchanan Department of Mathematics Spring 2015 Objectives We have defined and studied the important vector spaces associated with matrices (row space,
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 informationLecture 3q Bases for Row(A), Col(A), and Null(A) (pages )
Lecture 3q Bases for Row(A), Col(A), and Null(A) (pages 57-6) Recall that the basis for a subspace S is a set of vectors that both spans S and is linearly independent. Moreover, we saw in section 2.3 that
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 informationDimension and Structure
96 Chapter 7 Dimension and Structure 7.1 Basis and Dimensions Bases for Subspaces Definition 7.1.1. A set of vectors in a subspace V of R n is said to be a basis for V if it is linearly independent and
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 informationMidterm #2 Solutions
Naneh Apkarian Math F Winter Midterm # Solutions Here is a solution key for the second midterm. The solutions presented here are more complete and thorough than your responses needed to be - in order to
More informationMath 308 Practice Test for Final Exam Winter 2015
Math 38 Practice Test for Final Exam Winter 25 No books are allowed during the exam. But you are allowed one sheet ( x 8) of handwritten notes (back and front). You may use a calculator. For TRUE/FALSE
More informationMTH 362: Advanced Engineering Mathematics
MTH 362: Advanced Engineering Mathematics Lecture 5 Jonathan A. Chávez Casillas 1 1 University of Rhode Island Department of Mathematics September 26, 2017 1 Linear Independence and Dependence of Vectors
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 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 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 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 informationWe see that this is a linear system with 3 equations in 3 unknowns. equation is A x = b, where
Practice Problems Math 35 Spring 7: Solutions. Write the system of equations as a matrix equation and find all solutions using Gauss elimination: x + y + 4z =, x + 3y + z = 5, x + y + 5z = 3. We see that
More informationMATH2210 Notebook 3 Spring 2018
MATH2210 Notebook 3 Spring 2018 prepared by Professor Jenny Baglivo c Copyright 2009 2018 by Jenny A. Baglivo. All Rights Reserved. 3 MATH2210 Notebook 3 3 3.1 Vector Spaces and Subspaces.................................
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 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 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 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 informationChapter 3. Directions: For questions 1-11 mark each statement True or False. Justify each answer.
Chapter 3 Directions: For questions 1-11 mark each statement True or False. Justify each answer. 1. (True False) Asking whether the linear system corresponding to an augmented matrix [ a 1 a 2 a 3 b ]
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. General Vector Spaces
1.1. Vector space axioms. 1. General Vector Spaces Definition 1.1. Let V be a nonempty set of objects on which the operations of addition and scalar multiplication are defined. By addition we mean a rule
More informationChapter 1. Vectors, Matrices, and Linear Spaces
1.6 Homogeneous Systems, Subspaces and Bases 1 Chapter 1. Vectors, Matrices, and Linear Spaces 1.6. Homogeneous Systems, Subspaces and Bases Note. In this section we explore the structure of the solution
More informationLecture 14: Orthogonality and general vector spaces. 2 Orthogonal vectors, spaces and matrices
Lecture 14: Orthogonality and general vector spaces 1 Symmetric matrices Recall the definition of transpose A T in Lecture note 9. Definition 1.1. If a square matrix S satisfies then we say S is a symmetric
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 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 informationLecture 21: 5.6 Rank and Nullity
Lecture 21: 5.6 Rank and Nullity Wei-Ta Chu 2008/12/5 Rank and Nullity Definition The common dimension of the row and column space of a matrix A is called the rank ( 秩 ) of A and is denoted by rank(a);
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 informationAnswers in blue. If you have questions or spot an error, let me know. 1. Find all matrices that commute with A =. 4 3
Answers in blue. If you have questions or spot an error, let me know. 3 4. Find all matrices that commute with A =. 4 3 a b If we set B = and set AB = BA, we see that 3a + 4b = 3a 4c, 4a + 3b = 3b 4d,
More informationx y + z = 3 2y z = 1 4x + y = 0
MA 253: Practice Exam Solutions You may not use a graphing calculator, computer, textbook, notes, or refer to other people (except the instructor). Show all of your work; your work is your answer. Problem
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 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 information1 Systems of equations
Highlights from linear algebra David Milovich, Math 2 TA for sections -6 November, 28 Systems of equations A leading entry in a matrix is the first (leftmost) nonzero entry of a row. For example, the leading
More information3.3 Linear Independence
Prepared by Dr. Archara Pacheenburawana (MA3 Sec 75) 84 3.3 Linear Independence In this section we look more closely at the structure of vector spaces. To begin with, we restrict ourselves to vector spaces
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 informationMATH 300, Second Exam REVIEW SOLUTIONS. NOTE: You may use a calculator for this exam- You only need something that will perform basic arithmetic.
MATH 300, Second Exam REVIEW SOLUTIONS NOTE: You may use a calculator for this exam- You only need something that will perform basic arithmetic. [ ] [ ] 2 2. Let u = and v =, Let S be the parallelegram
More informationELE/MCE 503 Linear Algebra Facts Fall 2018
ELE/MCE 503 Linear Algebra Facts Fall 2018 Fact N.1 A set of vectors is linearly independent if and only if none of the vectors in the set can be written as a linear combination of the others. Fact N.2
More informationElementary Linear Algebra Review for Exam 2 Exam is Monday, November 16th.
Elementary Linear Algebra Review for Exam Exam is Monday, November 6th. The exam will cover sections:.4,..4, 5. 5., 7., the class notes on Markov Models. You must be able to do each of the following. Section.4
More information2. (10 pts) How many vectors are in the null space of the matrix A = 0 1 1? (i). Zero. (iv). Three. (ii). One. (v).
Exam 3 MAS 3105 Applied Linear Algebra, Spring 2018 (Clearly!) Print Name: Apr 10, 2018 Read all of what follows carefully before starting! 1. This test has 7 problems and is worth 110 points. Please be
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 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 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 informationPractice Problems for the Final Exam
Practice Problems for the Final Exam Linear Algebra. Matrix multiplication: (a) Problem 3 in Midterm One. (b) Problem 2 in Quiz. 2. Solve the linear system: (a) Problem 4 in Midterm One. (b) Problem in
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 informationThe Fundamental Theorem of Linear Algebra
The Fundamental Theorem of Linear Algebra Nicholas Hoell Contents 1 Prelude: Orthogonal Complements 1 2 The Fundamental Theorem of Linear Algebra 2 2.1 The Diagram........................................
More information5.4 Basis And Dimension
5.4 Basis And Dimension 1 Nonrectangular Coordinate Systems We describe this by saying that the coordinate system establishes a one-to-one correspondence between points in the plane and ordered pairs of
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 informationMath 415 Exam I. Name: Student ID: Calculators, books and notes are not allowed!
Math 415 Exam I Calculators, books and notes are not allowed! Name: Student ID: Score: Math 415 Exam I (20pts) 1. Let A be a square matrix satisfying A 2 = 2A. Find the determinant of A. Sol. From A 2
More informationMath 544, Exam 2 Information.
Math 544, Exam 2 Information. 10/12/10, LC 115, 2:00-3:15. Exam 2 will be based on: Sections 1.7, 1.9, 3.2, 3.3, 3.4; The corresponding assigned homework problems (see http://www.math.sc.edu/ boylan/sccourses/544fa10/544.html)
More informationChapters 5 & 6: Theory Review: Solutions Math 308 F Spring 2015
Chapters 5 & 6: Theory Review: Solutions Math 308 F Spring 205. If A is a 3 3 triangular matrix, explain why det(a) is equal to the product of entries on the diagonal. If A is a lower triangular or diagonal
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 informationLecture 22: Section 4.7
Lecture 22: Section 47 Shuanglin Shao December 2, 213 Row Space, Column Space, and Null Space Definition For an m n, a 11 a 12 a 1n a 21 a 22 a 2n A = a m1 a m2 a mn, the vectors r 1 = [ a 11 a 12 a 1n
More informationSection 2.2: The Inverse of a Matrix
Section 22: The Inverse of a Matrix Recall that a linear equation ax b, where a and b are scalars and a 0, has the unique solution x a 1 b, where a 1 is the reciprocal of a From this result, it is natural
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 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 informationVector space and subspace
Vector space and subspace Math 112, week 8 Goals: Vector space, subspace, span. Null space, column space. Linearly independent, bases. Suggested Textbook Readings: Sections 4.1, 4.2, 4.3 Week 8: Vector
More informationMATH 320, WEEK 11: Eigenvalues and Eigenvectors
MATH 30, WEEK : Eigenvalues and Eigenvectors Eigenvalues and Eigenvectors We have learned about several vector spaces which naturally arise from matrix operations In particular, we have learned about the
More informationDefinitions for Quizzes
Definitions for Quizzes Italicized text (or something close to it) will be given to you. Plain text is (an example of) what you should write as a definition. [Bracketed text will not be given, nor does
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 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 informationNAME MATH 304 Examination 2 Page 1
NAME MATH 4 Examination 2 Page. [8 points (a) Find the following determinant. However, use only properties of determinants, without calculating directly (that is without expanding along a column or row
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 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 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 informationDEPARTMENT OF MATHEMATICS
DEPARTMENT OF MATHEMATICS. Points: 4+7+4 Ma 322 Solved First Exam February 7, 207 With supplements You are given an augmented matrix of a linear system of equations. Here t is a parameter: 0 4 4 t 0 3
More informationMath 314H EXAM I. 1. (28 points) The row reduced echelon form of the augmented matrix for the system. is the matrix
Math 34H EXAM I Do all of the problems below. Point values for each of the problems are adjacent to the problem number. Calculators may be used to check your answer but not to arrive at your answer. That
More information4.9 The Rank-Nullity Theorem
For Problems 7 10, use the ideas in this section to determine a basis for the subspace of R n spanned by the given set of vectors. 7. {(1, 1, 2), (5, 4, 1), (7, 5, 4)}. 8. {(1, 3, 3), (1, 5, 1), (2, 7,
More informationICS 6N Computational Linear Algebra Vector Space
ICS 6N Computational Linear Algebra Vector Space Xiaohui Xie University of California, Irvine xhx@uci.edu Xiaohui Xie (UCI) ICS 6N 1 / 24 Vector Space Definition: A vector space is a non empty set V of
More informationx 1 + 2x 2 + 3x 3 = 0 x 1 + 2x 2 + 3x 3 = 0, x 2 + x 3 = 0 x 3 3 x 3 1
. Orthogonal Complements and Projections In this section we discuss orthogonal complements and orthogonal projections. The orthogonal complement of a subspace S is the complement that is orthogonal to
More informationSolutions: We leave the conversione between relation form and span form for the reader to verify. x 1 + 2x 2 + 3x 3 = 0
6.2. Orthogonal Complements and Projections In this section we discuss orthogonal complements and orthogonal projections. The orthogonal complement of a subspace S is the set of all vectors orthgonal to
More informationMatrices and Matrix Algebra.
Matrices and Matrix Algebra 3.1. Operations on Matrices Matrix Notation and Terminology Matrix: a rectangular array of numbers, called entries. A matrix with m rows and n columns m n A n n matrix : a square
More informationChapter 2. General Vector Spaces. 2.1 Real Vector Spaces
Chapter 2 General Vector Spaces Outline : Real vector spaces Subspaces Linear independence Basis and dimension Row Space, Column Space, and Nullspace 2 Real Vector Spaces 2 Example () Let u and v be vectors
More information1. Let m 1 and n 1 be two natural numbers such that m > n. Which of the following is/are true?
. Let m and n be two natural numbers such that m > n. Which of the following is/are true? (i) A linear system of m equations in n variables is always consistent. (ii) A linear system of n equations in
More informationSolutions to Math 51 First Exam April 21, 2011
Solutions to Math 5 First Exam April,. ( points) (a) Give the precise definition of a (linear) subspace V of R n. (4 points) A linear subspace V of R n is a subset V R n which satisfies V. If x, y V then
More informationKevin James. MTHSC 3110 Section 4.3 Linear Independence in Vector Sp
MTHSC 3 Section 4.3 Linear Independence in Vector Spaces; Bases Definition Let V be a vector space and let { v. v 2,..., v p } V. If the only solution to the equation x v + x 2 v 2 + + x p v p = is the
More informationMidterm 1 Review. Written by Victoria Kala SH 6432u Office Hours: R 12:30 1:30 pm Last updated 10/10/2015
Midterm 1 Review Written by Victoria Kala vtkala@math.ucsb.edu SH 6432u Office Hours: R 12:30 1:30 pm Last updated 10/10/2015 Summary This Midterm Review contains notes on sections 1.1 1.5 and 1.7 in your
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 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 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 informationMatrix invertibility. Rank-Nullity Theorem: For any n-column matrix A, nullity A +ranka = n
Matrix invertibility Rank-Nullity Theorem: For any n-column matrix A, nullity A +ranka = n Corollary: Let A be an R C matrix. Then A is invertible if and only if R = C and the columns of A are linearly
More informationChapter SSM: Linear Algebra. 5. Find all x such that A x = , so that x 1 = x 2 = 0.
Chapter Find all x such that A x : Chapter, so that x x ker(a) { } Find all x such that A x ; note that all x in R satisfy the equation, so that ker(a) R span( e, e ) 5 Find all x such that A x 5 ; x x
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 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 informationSECTION 3.3. PROBLEM 22. The null space of a matrix A is: N(A) = {X : AX = 0}. Here are the calculations of AX for X = a,b,c,d, and e. =
SECTION 3.3. PROBLEM. The null space of a matrix A is: N(A) {X : AX }. Here are the calculations of AX for X a,b,c,d, and e. Aa [ ][ ] 3 3 [ ][ ] Ac 3 3 [ ] 3 3 [ ] 4+4 6+6 Ae [ ], Ab [ ][ ] 3 3 3 [ ]
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 information(c)
1. Find the reduced echelon form of the matrix 1 1 5 1 8 5. 1 1 1 (a) 3 1 3 0 1 3 1 (b) 0 0 1 (c) 3 0 0 1 0 (d) 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 (e) 1 0 5 0 0 1 3 0 0 0 0 Solution. 1 1 1 1 1 1 1 1
More informationIn Class Peer Review Assignment 2
Name: Due Date: Tues. Dec. 5th In Class Peer Review Assignment 2 D.M. 1 : 7 (7pts) Short Answer 8 : 14 (32pts) T/F and Multiple Choice 15 : 30 (15pts) Total out of (54pts) Directions: Put only your answers
More informationMath 308 Spring Midterm Answers May 6, 2013
Math 38 Spring Midterm Answers May 6, 23 Instructions. Part A consists of questions that require a short answer. There is no partial credit and no need to show your work. In Part A you get 2 points per
More informationMath 54. Selected Solutions for Week 5
Math 54. Selected Solutions for Week 5 Section 4. (Page 94) 8. Consider the following two systems of equations: 5x + x 3x 3 = 5x + x 3x 3 = 9x + x + 5x 3 = 4x + x 6x 3 = 9 9x + x + 5x 3 = 5 4x + x 6x 3
More informationSemicontinuity of rank and nullity and some consequences
Semicontinuity of rank and nullity and some consequences Andrew D Lewis 2009/01/19 Upper and lower semicontinuity Let us first define what we mean by the two versions of semicontinuity 1 Definition: (Upper
More information