Sec 4.1 Vector Spaces and Subspaces


 Horatio Paul
 1 years ago
 Views:
Transcription
1 Sec 4. Vector Spaces and Subspaces Motivation Let S be the set of all solutions to the differential equation y + y =. Let T be the set of all 2 3 matrices with real entries. These two sets share many common properties: S = the set of all solutions to y + y = T = the set of all 2 3 matrices The sum of two solutions y (x) = sin x and y 2 (x) = cos x to the differential equation, say y 3 (x) = sin x + cos x, is also a solution to the equation. [ [ and [ so is their sum. 6 2 are in T and The zero function is a solution to the equation. y (x) = sin x is a solution to the equation and so is any constant multiple y c (x) = c sin x. In particular y (x) = sin x is also a solution. The zero matrix [ is in T. [ 2 3 is in T and so is [ [ 2 3 c 2c 3c c = for every c 3c 4c constant [ c. In particular [ = is in T It is be Even though the sets S and T are totally different objects, they resemble each other. cause they are both vector spaces. We give the definition below. Abstract Definition of the Vector Space A vector space (V, +, ) is a nonempty set V of elements, called vectors, together with two operations + and, called addition and scalar multiplication, subject to the following conditions. For all u, v, w V and α, β R,. The sum u + v is in V. 2. u + v = v + u. 3. u + (v + w) = (u + v) + w. 4. There is a special element in V such that u + = + u = u for all u in V. 5. For each u in V, there is a vector u in V such that u + ( u) = ( u) + u =. 6. The scalar multiple of u by α, denoted by α u or simply αu, is again in V. 7. α(u + v) = αu + αv. 8. (α + β)u = αu + βu. 9. α(βu) = (αβ)u.. u = u.
2 2 Remark One can show that the special element in 4 above is actually unique. From now on that element will be called the zero vector. Similarly, for each u in V, u mentioned in 5 above is uniquely determined and is called the additive inverse of u. Remark 2 Instead of writing (V, +, ) all the time, many people simply call V a vector space when the operations + and are obvious from the context. Ex. Consider (R n, +, ). This triple is a vector space. What is the meaning of + in this setting? Ex.2 Show that, for any c R, c =. Ex.3 Is (Z, +, ) a vector space, where + and are usual addition and multiplication of real numbers? Here Z denotes the set of integers. Ex.4 How about (I, +, ), where I is the set of all irrational numbers? Ex.5 Let P n denote the set of all polynomials in t of degree at most n (A typical element in P n looks like p(t) = a + a t + a 2 t a n t n, where a, a, a 2,, a n are in R). Let s define + on P n as follows: for two elements p(t) = a + a t + a 2 t a n t n and q(t) = b + b t + b 2 t b n t n in P n, we define p(t) + q(t) to be p(t) + q(t) = (a + b ) + (a + b )t + (a 2 + b 2 )t (a n + b n )t n. Let s consider scalar multiplication on P n. For α R and p(t) = a + a t + a 2 t a n t n in P n, we define α p(t) by α p(t) = αa + αa t + αa 2 t αa n t n.
3 3 Then it is easy to show that (P n, +, ) is a vector space. If p(t) P n is of the form p(t) a (i.e., this polynomial is constantly a as a function, without depending on t), then p(t) is said to be a constant polynomial. In particular, if z(t), then z(t) is called the zero polynomial. What is the role of the zero polynomial in P n? What is the additive inverse of p(t) = 3 + 2t 4t 2 in P 2? Other Examples of Vector Spaces. C[a, b, the set of all continuous functions on the closed interval [a, b. 2. Diff[a, b, the set of all differentiable functions on [a, b. 3. M m,n, the set of all m n matrices. M n is used to denote M n,n. 4. the set of all solutions to a homogeneous differential equation. Suppose we have a subset H of a vector space (V, +, ). H, combined with + and which were already defined on V, may be a vector space, satisfying all conditions described above. However, to show that H is a vector space itself, it suffices to show that H satisfies three key properties. Definition A subspace of a vector space V is a subset H of V that has three properties: a. The zero vector of V is in H. b. H is closed under vector addition. That is, for each u and v in H, the sum u + v is in H. c. H is closed under multiplication by scalars. That is, for each u in H and each scalar α, the vector αu is in H. Remark 3 Properties a,b, and c above guarantee that a subspace H of V is itself a vector space, under the vector space operations +, already defined in V. In short, a subspace of a vector space is a smaller vector space sitting inside the original one. Ex.6 For a given vector space (V, +, ), consider H = { }, the set consisting only of the zero vector. Then this satisfies the conditions a,b, and c above, so H is a (rather uninteresting) subspace of V, called the zero subspace or trivial subspace. {[ } x Ex.7 Consider (R 2, +, ). Let H = : x R. Clearly H is a subset of R 2. Let s check whether H satisfies the conditions to be a subspace of R 2. Note that R 2 can be identified with the plane. To what in the plane does H correspond?
4 4 Ex.8 Again consider (R 2, +, ). Let K = {[ x x 2 } : x R. Is K a subspace of R 2? Ex.9 Let L = {[ x y } : x and y. Is this a subspace of R 2? Recall that we defined the terminologies like linear dependence/independence, linear combination and span for column vectors. We can now extend these definitions for general vectors (i.e., elements) of a vector space. That is to say, when S = {u, u 2,, u p } is a subset of a vector space V, then a vector v of the form v = α u + α 2 u α p u p, where α, α 2,, α p are scalars, is called a linear combination of u, u 2,, u p with weights (or coefficients) α, α 2,, α p. the span of u, u 2,, u p, denoted by Span{u, u 2,, u p } or simply SpanS, is the set of all linear combinations of u, u 2,, u p. the set S is said to be linearly dependent if there are weights c, c 2,, c p, not all zero, such that c u +c 2 u 2 + +c p u p =. Otherwise, S is said to be linearly independent (i.e., u +u 2 + +u p is the only linear combination of u, u 2,, u p that becomes ). Digression To show that X Y (X is a subset of Y, the notation X Y is also used), we need to show that every element x of X belongs to Y. To show that two sets A = B (A and B coincide), we need to show that A B and B A. Problem Let A be the set of all odd integers. Let B be the set of all integers which can be written as the difference of the squares of two successive numbers. Show that A = B. A B B A
5 5 Ex. What is the span of T = 2 in R3? To justify this claim, we need two inclu We claim that SpanT = sion relations: Note that SpanT in Ex. is a subspace R 3. This is true in more general setting. In fact, we have the following Theorem If u, u 2,, u p are vectors in a vector space V, then Span{u, u 2,, u p } is a subspace of V. Remark 4 This subspace is called the subspace (of V ) generated (or spanned) by u, u 2,, u p. Proof
6 6 Sec 4.2 Null Spaces and Column Spaces Definition The null space of an m n matrix A, written as NulA, is the set of all solutions to the homogeneous equation A x =. In set notations, [ Ex. Let A = NulA = { x R n : A x = }. 5. Is u = 3 in NulA? 2 Theorem The null space of an m n matrix is a subspace of R n. Proof Ex.2 Let A = Find NulA. Describe NulA as the span of a set of vectors. Definition For an m n matrix A, the column space of A, written as ColA, is Span{ v, v 2,, v n }, where v, v 2,, v n are columns of A. 5 4 Ex.3 Let A =. What is ColA? Is in ColA?
7 7 Theorem 2 The column space of an m n matrix is a subspace of R m. Proof It follows immediately from the theorem stated right before Remark 4 in Sec 4.. Ex.4 Suppose that A is an invertible n n matrix. What is NulA? What is ColA? Summary Let A be an m n matrix. Then u R n is in NulA if and only if A u =. u R m is in ColA if and only if the system A x = u is consistent. Note The table in p.232 of the textbook might help you understand the contrast between NulA and ColA. Ignore statement 8 in both columns of the table. Remark For a matrix A, the row space of A, denoted by Row A, is defined as Row A = Col(A T ). Ex.5 Find Row A, where A is the matrix in Ex.3 above.
8 8 Sec 4.3 Linearly Independent Sets: Bases Review Linear dependence/independence. Let V be a vector space and S = {v,, v p } be a subset of V. Let s consider a linear combination c v + + c p v p of v,, v p. We can ask ourselves the following question: for which values of c,, c p does the linear combination c v + + c p v p become, the zero vector in V? Of course, if we take c = c 2 = = c p =, then clearly c v + + c p v p =. So we have two possibilities. Case : Taking c = c 2 = = c p = is the ONLY way to make c v + + c p v p =. Case 2: There are other choices of c, c 2,, c p, NOT ALL ZERO, such that c v + + c p v p =. When Case happens, the set S = {v,, v p } is said to be linearly independent. When Case 2 happens, the set S = {v,, v p } is said to be linearly dependent. Remark If S = {v,, v p } is linearly dependent, then we can find a vector v i such that v i can be expressed as a linear combination of remaining p vectors. This is why we have the terminology linearly dependent set. If S = {v,, v p } is linearly independent, no vector in S can be written as a linear combination of remaining p vectors. Definition Let H be a subspace of a vector space V (H could be the whole V ). A set B = {u,, u p } in V is said to be a basis for H if (i) B is linearly independent, and (ii) SpanB = H. Ex. Let B = {[ [, Claim : the set B is linearly independent. }. We will show that this is a basis for the vector space R 2. Claim 2: SpanB = R 2. Ex.2 Let B = {[ [, }. Show that B is another basis for R 2.
9 9 Note Ex. and Ex.2 show that a vector space can have more than one basis. 2 Ex.3 Is the set S = a basis for R3? Ex.4 Is the set T = {[ [, [, } a basis for R 2? Ex.5 Find a basis for P 3. Do the same for P n. Ex.6 Is S always a basis for SpanS? Remark 2 The trivial subspace { } in V does NOT have a basis at all. The Spanning Set Theorem Let S = {v,, v p } be a set in a vector space V, and let H = Span{v,, v p }. If one of vectors in S, say v k, is a linear combination of the remaining vectors in S, then the set formed from S by removing v k still spans H. That is, H = SpanS = Span(S \ {v k }) = Span{v, v 2,, v k, v k+,, v p }. Remark 3 If v k in S is a linear combination of the remaining vectors in S, then S must be linearly dependent. So S cannot be a basis for H = SpanS. However, S \ {v k } still spans H. Keep removing vectors in S which are unnecessary to span H until no element can be written as a linear combination of others. This procedure produces a basis for H = SpanS. Ex.7 Let s consider a set S = 3 in R3. Find a basis for SpanS.
10 For an m n matrix A, we learned that ColA is a subspace of R m. How can we find a basis for ColA? Theorem The pivot columns of a matrix A form a basis for ColA. 4 2 Ex.8 Let A = then it rowreduces to SpanS = ColA is a basis for ColA Therefore S = In other words, S is linearly independent and Ex.9 How to find a basis for NulA? First of all, to find a basis for NulA, one need to find NulA first. For example, for the matrix in Ex.8 above, we see that the general solution is given by x = 4x 2 2x 4 x 2 is free x 3 = x 4. x 4 is free x 5 = That is, NulA = x 2 show that the set basis for NulA x : x 2, x 4 are free = Span 4 is linearly independent and hence 2. We can 4 2 is a Summary Let A be an m n matrix. To get a basis for ColA, find the rref of A and collect all pivot columns. To get a basis for NulA, find the general solution of the system A x = (To do this, you will probably also need to use the rref of A) and express the general solution as the span of as many vectors as free variables. Those vectors form a basis for NulA.
11 Sec 4.5 The Dimension of a Vector Space Let H be a subspace of a vector space V. In general, H has more than one basis. For example, look at Ex. and Ex.2 in Sec 4.3. However, we have the following Theorem If a vector space V has a basis of n vectors, then every basis of V must consist of exactly n vectors. Ex. We observed that R 2 has a basis consisting of 2 vectors. Thus every basis of R 2 must have exactly vectors. Definition If a vector space V is spanned by a finite set, then V is said to be finitedimensional, and the dimension of V, written as dim V, is the number of vectors in a (so every) basis for V. Remark Some vector spaces are not finitedimensional. In this case, the vector spaces are said to be infinitedimensional. Examples are Diff[a, b, C[a, b, etc. Remark 2 The dimension of the trivial vector space (=zero vector space) { } is defined to be zero. Ex.2 dim R n = and dim P n =. Ex.3 Let H = Span. What is the dimension of H? Ex.4 Let K = Span 2. What is the dimension of K? In general, dim Span{v, v 2,, v p } is at most p. Moreover, dim Span{v, v 2,, v p } = p if and only if
12 2 Theorem 2 Let H be a subspace of a finitedimensional vector space V. Then dim H dim V and the equality holds if and only if H = V. Ex.5 Suppose that V is an ndimensional vector space and S is a subset of V containing m vectors with m > n. Then S must be linearly. Ex.6 (Theorem 2 in Sec.7 revisited) Let S = { v, v 2,, v p } R n with p > n, then S is linearly dependent. The Basis Theorem Let V be a pdimensional vector space. (i) If S = {v, v 2,, v p } is a linearly independent subset of V, then SpanS = V, i.e., S is a basis for V. (ii) If T = {w, w 2,, w p } spans V, then T is linearly independent, i.e., T is a basis for V. Ex.7 Show that S = is a basis for R3. Ex.8 Show that T = is a basis for R 4.
13 3 Sec 4.6 Rank Definition Let A be an m n matrix. The rank of A, denoted by ranka, is the dimension of the column space of A. The nullity of A, denoted by nullitya, is the dimension of the null space of A Ex. Let A = then it rowreduces to. The null space of A is given by NulA = Span. Therefore ranka = dim ColA = and nullitya = dim NulA = Remark Recall that pivot columns of A form a basis for ColA, so the rank of A is the number of pivots of A. Since the dimension of NulA equals the number of free variables in the solutions to the homogeneous system A x =, we obtain the following The Rank Theorem Let A be an m n matrix. Then ranka + nullitya = n. The Invertible Matrix Theorem, continued Let A be an n n square matrix. Then the following statements are each equivalent to the statement that A is an invertible matrix. (k) det A. (l) The columns of A form a basis for R n. (m) ColA = R n. (n) dim ColA = n. (o) ranka = n. (p) NulA = { }. (q) nullitya =.
Lecture Note on Linear Algebra 15. Dimension and Rank
Lecture Note on Linear Algebra 15. Dimension and Rank WeiShi Zheng, wszheng@ieee.org, 211 November 1, 211 1 What Do You Learn from This Note We still observe the unit vectors we have introduced in Chapter
More informationNOTES ON LINEAR TRANSFORMATIONS
NOTES ON LINEAR TRANSFORMATIONS Definition 1. Let V and W be vector spaces. A function T : V W is a linear transformation from V to W if the following two properties hold. i T v + v = T v + T v for all
More informationName: Section Registered In:
Name: Section Registered In: Math 125 Exam 3 Version 1 April 24, 2006 60 total points possible 1. (5pts) Use Cramer s Rule to solve 3x + 4y = 30 x 2y = 8. Be sure to show enough detail that shows you are
More informationMA 242 LINEAR ALGEBRA C1, Solutions to Second Midterm Exam
MA 4 LINEAR ALGEBRA C, Solutions to Second Midterm Exam Prof. Nikola Popovic, November 9, 6, 9:3am  :5am Problem (5 points). Let the matrix A be given by 5 6 5 4 5 (a) Find the inverse A of A, if it exists.
More information2.1: MATRIX OPERATIONS
.: MATRIX OPERATIONS What are diagonal entries and the main diagonal of a matrix? What is a diagonal matrix? When are matrices equal? Scalar Multiplication 45 Matrix Addition Theorem (pg 0) Let A, B, and
More information4.1 VECTOR SPACES AND SUBSPACES
4.1 VECTOR SPACES AND SUBSPACES What is a vector space? (pg 229) A vector space is a nonempty set, V, of vectors together with two operations; addition and scalar multiplication which satisfies the following
More informationMATH 304 Linear Algebra Lecture 18: Rank and nullity of a matrix.
MATH 304 Linear Algebra Lecture 18: Rank and nullity of a matrix. Nullspace Let A = (a ij ) be an m n matrix. Definition. The nullspace of the matrix A, denoted N(A), is the set of all ndimensional column
More informationNOTES on LINEAR ALGEBRA 1
School of Economics, Management and Statistics University of Bologna Academic Year 205/6 NOTES on LINEAR ALGEBRA for the students of Stats and Maths This is a modified version of the notes by Prof Laura
More informationT ( a i x i ) = a i T (x i ).
Chapter 2 Defn 1. (p. 65) Let V and W be vector spaces (over F ). We call a function T : V W a linear transformation form V to W if, for all x, y V and c F, we have (a) T (x + y) = T (x) + T (y) and (b)
More informationMethods for Finding Bases
Methods for Finding Bases Bases for the subspaces of a matrix Rowreduction methods can be used to find bases. Let us now look at an example illustrating how to obtain bases for the row space, null space,
More information4.5 Linear Dependence and Linear Independence
4.5 Linear Dependence and Linear Independence 267 32. {v 1, v 2 }, where v 1, v 2 are collinear vectors in R 3. 33. Prove that if S and S are subsets of a vector space V such that S is a subset of S, then
More informationMATH 304 Linear Algebra Lecture 9: Subspaces of vector spaces (continued). Span. Spanning set.
MATH 304 Linear Algebra Lecture 9: Subspaces of vector spaces (continued). Span. Spanning set. Vector space A vector space is a set V equipped with two operations, addition V V (x,y) x + y V and scalar
More informationLinear Transformations
a Calculus III Summer 2013, Session II Tuesday, July 23, 2013 Agenda a 1. Linear transformations 2. 3. a linear transformation linear transformations a In the m n linear system Ax = 0, Motivation we can
More informationMATH10212 Linear Algebra. Systems of Linear Equations. Definition. An ndimensional vector is a row or a column of n numbers (or letters): a 1.
MATH10212 Linear Algebra Textbook: D. Poole, Linear Algebra: A Modern Introduction. Thompson, 2006. ISBN 0534405967. Systems of Linear Equations Definition. An ndimensional vector is a row or a column
More informationLinearly Independent Sets and Linearly Dependent Sets
These notes closely follow the presentation of the material given in David C. Lay s textbook Linear Algebra and its Applications (3rd edition). These notes are intended primarily for inclass presentation
More information160 CHAPTER 4. VECTOR SPACES
160 CHAPTER 4. VECTOR SPACES 4. Rank and Nullity In this section, we look at relationships between the row space, column space, null space of a matrix and its transpose. We will derive fundamental results
More informationLinear Dependence Tests
Linear Dependence Tests The book omits a few key tests for checking the linear dependence of vectors. These short notes discuss these tests, as well as the reasoning behind them. Our first test checks
More informationThese axioms must hold for all vectors ū, v, and w in V and all scalars c and d.
DEFINITION: A vector space is a nonempty set V of objects, called vectors, on which are defined two operations, called addition and multiplication by scalars (real numbers), subject to the following axioms
More informationMathematics Course 111: Algebra I Part IV: Vector Spaces
Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 19967 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are
More informationOrthogonal Diagonalization of Symmetric Matrices
MATH10212 Linear Algebra Brief lecture notes 57 Gram Schmidt Process enables us to find an orthogonal basis of a subspace. Let u 1,..., u k be a basis of a subspace V of R n. We begin the process of finding
More informationSimilarity and Diagonalization. Similar Matrices
MATH022 Linear Algebra Brief lecture notes 48 Similarity and Diagonalization Similar Matrices Let A and B be n n matrices. We say that A is similar to B if there is an invertible n n matrix P such that
More informationRecall that two vectors in are perpendicular or orthogonal provided that their dot
Orthogonal Complements and Projections Recall that two vectors in are perpendicular or orthogonal provided that their dot product vanishes That is, if and only if Example 1 The vectors in are orthogonal
More information1 VECTOR SPACES AND SUBSPACES
1 VECTOR SPACES AND SUBSPACES What is a vector? Many are familiar with the concept of a vector as: Something which has magnitude and direction. an ordered pair or triple. a description for quantities such
More information4.6 Null Space, Column Space, Row Space
NULL SPACE, COLUMN SPACE, ROW SPACE Null Space, Column Space, Row Space In applications of linear algebra, subspaces of R n typically arise in one of two situations: ) as the set of solutions of a linear
More informationMAT 200, Midterm Exam Solution. a. (5 points) Compute the determinant of the matrix A =
MAT 200, Midterm Exam Solution. (0 points total) a. (5 points) Compute the determinant of the matrix 2 2 0 A = 0 3 0 3 0 Answer: det A = 3. The most efficient way is to develop the determinant along the
More informationMath 312 Homework 1 Solutions
Math 31 Homework 1 Solutions Last modified: July 15, 01 This homework is due on Thursday, July 1th, 01 at 1:10pm Please turn it in during class, or in my mailbox in the main math office (next to 4W1) Please
More informationSection 4.4 Inner Product Spaces
Section 4.4 Inner Product Spaces In our discussion of vector spaces the specific nature of F as a field, other than the fact that it is a field, has played virtually no role. In this section we no longer
More informationMATH 240 Fall, Chapter 1: Linear Equations and Matrices
MATH 240 Fall, 2007 Chapter Summaries for Kolman / Hill, Elementary Linear Algebra, 9th Ed. written by Prof. J. Beachy Sections 1.1 1.5, 2.1 2.3, 4.2 4.9, 3.1 3.5, 5.3 5.5, 6.1 6.3, 6.5, 7.1 7.3 DEFINITIONS
More information( ) which must be a vector
MATH 37 Linear Transformations from Rn to Rm Dr. Neal, WKU Let T : R n R m be a function which maps vectors from R n to R m. Then T is called a linear transformation if the following two properties are
More information4. Matrix inverses. left and right inverse. linear independence. nonsingular matrices. matrices with linearly independent columns
L. Vandenberghe EE133A (Spring 2016) 4. Matrix inverses left and right inverse linear independence nonsingular matrices matrices with linearly independent columns matrices with linearly independent rows
More informationMATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 2. x n. a 11 a 12 a 1n b 1 a 21 a 22 a 2n b 2 a 31 a 32 a 3n b 3. a m1 a m2 a mn b m
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS 1. SYSTEMS OF EQUATIONS AND MATRICES 1.1. Representation of a linear system. The general system of m equations in n unknowns can be written a 11 x 1 + a 12 x 2 +
More informationInner Product Spaces
Math 571 Inner Product Spaces 1. Preliminaries An inner product space is a vector space V along with a function, called an inner product which associates each pair of vectors u, v with a scalar u, v, and
More informationSolutions to Math 51 First Exam January 29, 2015
Solutions to Math 5 First Exam January 29, 25. ( points) (a) Complete the following sentence: A set of vectors {v,..., v k } is defined to be linearly dependent if (2 points) there exist c,... c k R, not
More informationVector Spaces 4.4 Spanning and Independence
Vector Spaces 4.4 and Independence October 18 Goals Discuss two important basic concepts: Define linear combination of vectors. Define Span(S) of a set S of vectors. Define linear Independence of a set
More information1 Sets and Set Notation.
LINEAR ALGEBRA MATH 27.6 SPRING 23 (COHEN) LECTURE NOTES Sets and Set Notation. Definition (Naive Definition of a Set). A set is any collection of objects, called the elements of that set. We will most
More informationSolving Linear Systems, Continued and The Inverse of a Matrix
, Continued and The of a Matrix Calculus III Summer 2013, Session II Monday, July 15, 2013 Agenda 1. The rank of a matrix 2. The inverse of a square matrix Gaussian Gaussian solves a linear system by reducing
More informationa 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2.
Chapter 1 LINEAR EQUATIONS 1.1 Introduction to linear equations A linear equation in n unknowns x 1, x,, x n is an equation of the form a 1 x 1 + a x + + a n x n = b, where a 1, a,..., a n, b are given
More informationLinear Maps. Isaiah Lankham, Bruno Nachtergaele, Anne Schilling (February 5, 2007)
MAT067 University of California, Davis Winter 2007 Linear Maps Isaiah Lankham, Bruno Nachtergaele, Anne Schilling (February 5, 2007) As we have discussed in the lecture on What is Linear Algebra? one of
More informationMA106 Linear Algebra lecture notes
MA106 Linear Algebra lecture notes Lecturers: Martin Bright and Daan Krammer Warwick, January 2011 Contents 1 Number systems and fields 3 1.1 Axioms for number systems......................... 3 2 Vector
More informationB such that AB = I and BA = I. (We say B is an inverse of A.) Definition A square matrix A is invertible (or nonsingular) if matrix
Matrix inverses Recall... Definition A square matrix A is invertible (or nonsingular) if matrix B such that AB = and BA =. (We say B is an inverse of A.) Remark Not all square matrices are invertible.
More informationMATRIX ALGEBRA AND SYSTEMS OF EQUATIONS
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS Systems of Equations and Matrices Representation of a linear system The general system of m equations in n unknowns can be written a x + a 2 x 2 + + a n x n b a
More informationSystems of Linear Equations
Systems of Linear Equations Beifang Chen Systems of linear equations Linear systems A linear equation in variables x, x,, x n is an equation of the form a x + a x + + a n x n = b, where a, a,, a n and
More informationLinear Algebra Test 2 Review by JC McNamara
Linear Algebra Test 2 Review by JC McNamara 2.3 Properties of determinants: det(a T ) = det(a) det(ka) = k n det(a) det(a + B) det(a) + det(b) (In some cases this is true but not always) A is invertible
More informationUNIT 2 MATRICES  I 2.0 INTRODUCTION. Structure
UNIT 2 MATRICES  I Matrices  I Structure 2.0 Introduction 2.1 Objectives 2.2 Matrices 2.3 Operation on Matrices 2.4 Invertible Matrices 2.5 Systems of Linear Equations 2.6 Answers to Check Your Progress
More informationMath 333  Practice Exam 2 with Some Solutions
Math 333  Practice Exam 2 with Some Solutions (Note that the exam will NOT be this long) Definitions (0 points) Let T : V W be a transformation Let A be a square matrix (a) Define T is linear (b) Define
More information1 Eigenvalues and Eigenvectors
Math 20 Chapter 5 Eigenvalues and Eigenvectors Eigenvalues and Eigenvectors. Definition: A scalar λ is called an eigenvalue of the n n matrix A is there is a nontrivial solution x of Ax = λx. Such an x
More informationMath Practice Problems for Test 1
Math 290  Practice Problems for Test 1 UNSUBSTANTIATED ANSWERS MAY NOT RECEIVE CREDIT. 3 4 5 1. Let c 1 and c 2 be the columns of A 5 2 and b 1. Show that b Span{c 1, c 2 } by 6 6 6 writing b as a linear
More informationLecture 6. Inverse of Matrix
Lecture 6 Inverse of Matrix Recall that any linear system can be written as a matrix equation In one dimension case, ie, A is 1 1, then can be easily solved as A x b Ax b x b A 1 A b A 1 b provided that
More informationMATH10212 Linear Algebra B Homework 7
MATH22 Linear Algebra B Homework 7 Students are strongly advised to acquire a copy of the Textbook: D C Lay, Linear Algebra and its Applications Pearson, 26 (or other editions) Normally, homework assignments
More informationUniversity of Ottawa
University of Ottawa Department of Mathematics and Statistics MAT 1302A: Mathematical Methods II Instructor: Alistair Savage Final Exam April 2013 Surname First Name Student # Seat # Instructions: (a)
More informationLINEAR ALGEBRA W W L CHEN
LINEAR ALGEBRA W W L CHEN c W W L Chen, 1997, 2008 This chapter is available free to all individuals, on understanding that it is not to be used for financial gain, and may be downloaded and/or photocopied,
More informationMatrix Algebra 2.3 CHARACTERIZATIONS OF INVERTIBLE MATRICES Pearson Education, Inc.
2 Matrix Algebra 2.3 CHARACTERIZATIONS OF INVERTIBLE MATRICES Theorem 8: Let A be a square matrix. Then the following statements are equivalent. That is, for a given A, the statements are either all true
More informationMath 54. Selected Solutions for Week Is u in the plane in R 3 spanned by the columns
Math 5. Selected Solutions for Week 2 Section. (Page 2). Let u = and A = 5 2 6. Is u in the plane in R spanned by the columns of A? (See the figure omitted].) Why or why not? First of all, the plane in
More information1 0 5 3 3 A = 0 0 0 1 3 0 0 0 0 0 0 0 0 0 0
Solutions: Assignment 4.. Find the redundant column vectors of the given matrix A by inspection. Then find a basis of the image of A and a basis of the kernel of A. 5 A The second and third columns are
More informationLEARNING OBJECTIVES FOR THIS CHAPTER
CHAPTER 2 American mathematician Paul Halmos (1916 2006), who in 1942 published the first modern linear algebra book. The title of Halmos s book was the same as the title of this chapter. FiniteDimensional
More information1. LINEAR EQUATIONS. A linear equation in n unknowns x 1, x 2,, x n is an equation of the form
1. LINEAR EQUATIONS A linear 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, b are given real numbers. For example, with x and
More informationMatrix Representations of Linear Transformations and Changes of Coordinates
Matrix Representations of Linear Transformations and Changes of Coordinates 01 Subspaces and Bases 011 Definitions A subspace V of R n is a subset of R n that contains the zero element and is closed under
More informationSubspaces of R n LECTURE 7. 1. Subspaces
LECTURE 7 Subspaces of R n Subspaces Definition 7 A subset W of R n is said to be closed under vector addition if for all u, v W, u + v is also in W If rv is in W for all vectors v W and all scalars r
More informationAu = = = 3u. Aw = = = 2w. so the action of A on u and w is very easy to picture: it simply amounts to a stretching by 3 and 2, respectively.
Chapter 7 Eigenvalues and Eigenvectors In this last chapter of our exploration of Linear Algebra we will revisit eigenvalues and eigenvectors of matrices, concepts that were already introduced in Geometry
More information1 Orthogonal projections and the approximation
Math 1512 Fall 2010 Notes on least squares approximation Given n data points (x 1, y 1 ),..., (x n, y n ), we would like to find the line L, with an equation of the form y = mx + b, which is the best fit
More informationMATH 304 Linear Algebra Lecture 4: Matrix multiplication. Diagonal matrices. Inverse matrix.
MATH 304 Linear Algebra Lecture 4: Matrix multiplication. Diagonal matrices. Inverse matrix. Matrices Definition. An mbyn matrix is a rectangular array of numbers that has m rows and n columns: a 11
More informationTHE DIMENSION OF A VECTOR SPACE
THE DIMENSION OF A VECTOR SPACE KEITH CONRAD This handout is a supplementary discussion leading up to the definition of dimension and some of its basic properties. Let V be a vector space over a field
More informationMATH1231 Algebra, 2015 Chapter 7: Linear maps
MATH1231 Algebra, 2015 Chapter 7: Linear maps A/Prof. Daniel Chan School of Mathematics and Statistics University of New South Wales danielc@unsw.edu.au Daniel Chan (UNSW) MATH1231 Algebra 1 / 43 Chapter
More informationRow Echelon Form and Reduced Row Echelon Form
These notes closely follow the presentation of the material given in David C Lay s textbook Linear Algebra and its Applications (3rd edition) These notes are intended primarily for inclass presentation
More informationα = u v. In other words, Orthogonal Projection
Orthogonal Projection Given any nonzero vector v, it is possible to decompose an arbitrary vector u into a component that points in the direction of v and one that points in a direction orthogonal to v
More informationVector Spaces II: Finite Dimensional Linear Algebra 1
John Nachbar September 2, 2014 Vector Spaces II: Finite Dimensional Linear Algebra 1 1 Definitions and Basic Theorems. For basic properties and notation for R N, see the notes Vector Spaces I. Definition
More informationMAT 242 Test 2 SOLUTIONS, FORM T
MAT 242 Test 2 SOLUTIONS, FORM T 5 3 5 3 3 3 3. Let v =, v 5 2 =, v 3 =, and v 5 4 =. 3 3 7 3 a. [ points] The set { v, v 2, v 3, v 4 } is linearly dependent. Find a nontrivial linear combination of these
More informationMATH 423 Linear Algebra II Lecture 38: Generalized eigenvectors. Jordan canonical form (continued).
MATH 423 Linear Algebra II Lecture 38: Generalized eigenvectors Jordan canonical form (continued) Jordan canonical form A Jordan block is a square matrix of the form λ 1 0 0 0 0 λ 1 0 0 0 0 λ 0 0 J = 0
More informationLecture Notes 2: Matrices as Systems of Linear Equations
2: Matrices as Systems of Linear Equations 33A Linear Algebra, Puck Rombach Last updated: April 13, 2016 Systems of Linear Equations Systems of linear equations can represent many things You have probably
More informationDeterminants. Dr. Doreen De Leon Math 152, Fall 2015
Determinants Dr. Doreen De Leon Math 52, Fall 205 Determinant of a Matrix Elementary Matrices We will first discuss matrices that can be used to produce an elementary row operation on a given matrix A.
More informationMATH 2030: SYSTEMS OF LINEAR EQUATIONS. ax + by + cz = d. )z = e. while these equations are not linear: xy z = 2, x x = 0,
MATH 23: SYSTEMS OF LINEAR EQUATIONS Systems of Linear Equations In the plane R 2 the general form of the equation of a line is ax + by = c and that the general equation of a plane in R 3 will be we call
More informationLinear Algebra Notes for Marsden and Tromba Vector Calculus
Linear Algebra Notes for Marsden and Tromba Vector Calculus ndimensional Euclidean Space and Matrices Definition of n space As was learned in Math b, a point in Euclidean three space can be thought of
More informationSection 6.1  Inner Products and Norms
Section 6.1  Inner Products and Norms Definition. Let V be a vector space over F {R, C}. An inner product on V is a function that assigns, to every ordered pair of vectors x and y in V, a scalar in F,
More informationNotes on Determinant
ENGG2012B Advanced Engineering Mathematics Notes on Determinant Lecturer: Kenneth Shum Lecture 918/02/2013 The determinant of a system of linear equations determines whether the solution is unique, without
More information4: EIGENVALUES, EIGENVECTORS, DIAGONALIZATION
4: EIGENVALUES, EIGENVECTORS, DIAGONALIZATION STEVEN HEILMAN Contents 1. Review 1 2. Diagonal Matrices 1 3. Eigenvectors and Eigenvalues 2 4. Characteristic Polynomial 4 5. Diagonalizability 6 6. Appendix:
More informationMatrices, Determinants and Linear Systems
September 21, 2014 Matrices A matrix A m n is an array of numbers in rows and columns a 11 a 12 a 1n r 1 a 21 a 22 a 2n r 2....... a m1 a m2 a mn r m c 1 c 2 c n We say that the dimension of A is m n (we
More informationTopic 1: Matrices and Systems of Linear Equations.
Topic 1: Matrices and Systems of Linear Equations Let us start with a review of some linear algebra concepts we have already learned, such as matrices, determinants, etc Also, we shall review the method
More informationINTRODUCTORY LINEAR ALGEBRA WITH APPLICATIONS B. KOLMAN, D. R. HILL
SOLUTIONS OF THEORETICAL EXERCISES selected from INTRODUCTORY LINEAR ALGEBRA WITH APPLICATIONS B. KOLMAN, D. R. HILL Eighth Edition, Prentice Hall, 2005. Dr. Grigore CĂLUGĂREANU Department of Mathematics
More informationSergei Silvestrov, Christopher Engström, Karl Lundengård, Johan Richter, Jonas Österberg. November 13, 2014
Sergei Silvestrov,, Karl Lundengård, Johan Richter, Jonas Österberg November 13, 2014 Analysis Todays lecture: Course overview. Repetition of matrices elementary operations. Repetition of solvability of
More informationSection 2.1. Section 2.2. Exercise 6: We have to compute the product AB in two ways, where , B =. 2 1 3 5 A =
Section 2.1 Exercise 6: We have to compute the product AB in two ways, where 4 2 A = 3 0 1 3, B =. 2 1 3 5 Solution 1. Let b 1 = (1, 2) and b 2 = (3, 1) be the columns of B. Then Ab 1 = (0, 3, 13) and
More informationVector and Matrix Norms
Chapter 1 Vector and Matrix Norms 11 Vector Spaces Let F be a field (such as the real numbers, R, or complex numbers, C) with elements called scalars A Vector Space, V, over the field F is a nonempty
More informationMATH 304 Linear Algebra Lecture 20: Inner product spaces. Orthogonal sets.
MATH 304 Linear Algebra Lecture 20: Inner product spaces. Orthogonal sets. Norm The notion of norm generalizes the notion of length of a vector in R n. Definition. Let V be a vector space. A function α
More informationMATH2210 Notebook 1 Fall Semester 2016/2017. 1 MATH2210 Notebook 1 3. 1.1 Solving Systems of Linear Equations... 3
MATH0 Notebook Fall Semester 06/07 prepared by Professor Jenny Baglivo c Copyright 009 07 by Jenny A. Baglivo. All Rights Reserved. Contents MATH0 Notebook 3. Solving Systems of Linear Equations........................
More information1 Introduction to Matrices
1 Introduction to Matrices In this section, important definitions and results from matrix algebra that are useful in regression analysis are introduced. While all statements below regarding the columns
More informationUsing determinants, it is possible to express the solution to a system of equations whose coefficient matrix is invertible:
Cramer s Rule and the Adjugate Using determinants, it is possible to express the solution to a system of equations whose coefficient matrix is invertible: Theorem [Cramer s Rule] If A is an invertible
More informationProblems for Advanced Linear Algebra Fall 2012
Problems for Advanced Linear Algebra Fall 2012 Class will be structured around students presenting complete solutions to the problems in this handout. Please only agree to come to the board when you are
More information(a) The transpose of a lower triangular matrix is upper triangular, and the transpose of an upper triangular matrix is lower triangular.
Theorem.7.: (Properties of Triangular Matrices) (a) The transpose of a lower triangular matrix is upper triangular, and the transpose of an upper triangular matrix is lower triangular. (b) The product
More informationby the matrix A results in a vector which is a reflection of the given
Eigenvalues & Eigenvectors Example Suppose Then So, geometrically, multiplying a vector in by the matrix A results in a vector which is a reflection of the given vector about the yaxis We observe that
More informationMatrices: 2.3 The Inverse of Matrices
September 4 Goals Define inverse of a matrix. Point out that not every matrix A has an inverse. Discuss uniqueness of inverse of a matrix A. Discuss methods of computing inverses, particularly by row operations.
More informationDefinition A square matrix M is invertible (or nonsingular) if there exists a matrix M 1 such that
0. Inverse Matrix Definition A square matrix M is invertible (or nonsingular) if there exists a matrix M such that M M = I = M M. Inverse of a 2 2 Matrix Let M and N be the matrices: a b d b M =, N = c
More informationLinear Algebra Notes
Linear Algebra Notes Chapter 19 KERNEL AND IMAGE OF A MATRIX Take an n m matrix a 11 a 12 a 1m a 21 a 22 a 2m a n1 a n2 a nm and think of it as a function A : R m R n The kernel of A is defined as Note
More information18.06 Problem Set 4 Solution Due Wednesday, 11 March 2009 at 4 pm in 2106. Total: 175 points.
806 Problem Set 4 Solution Due Wednesday, March 2009 at 4 pm in 206 Total: 75 points Problem : A is an m n matrix of rank r Suppose there are righthandsides b for which A x = b has no solution (a) What
More informationMath 4310 Handout  Quotient Vector Spaces
Math 4310 Handout  Quotient Vector Spaces Dan Collins The textbook defines a subspace of a vector space in Chapter 4, but it avoids ever discussing the notion of a quotient space. This is understandable
More informationI. GROUPS: BASIC DEFINITIONS AND EXAMPLES
I GROUPS: BASIC DEFINITIONS AND EXAMPLES Definition 1: An operation on a set G is a function : G G G Definition 2: A group is a set G which is equipped with an operation and a special element e G, called
More informationInner Product Spaces and Orthogonality
Inner Product Spaces and Orthogonality week 34 Fall 2006 Dot product of R n The inner product or dot product of R n is a function, defined by u, v a b + a 2 b 2 + + a n b n for u a, a 2,, a n T, v b,
More information1 Gaussian Elimination
Contents 1 Gaussian Elimination 1.1 Elementary Row Operations 1.2 Some matrices whose associated system of equations are easy to solve 1.3 Gaussian Elimination 1.4 GaussJordan reduction and the Reduced
More informationBasic Terminology for Systems of Equations in a Nutshell. E. L. Lady. 3x 1 7x 2 +4x 3 =0 5x 1 +8x 2 12x 3 =0.
Basic Terminology for Systems of Equations in a Nutshell E L Lady A system of linear equations is something like the following: x 7x +4x =0 5x +8x x = Note that the number of equations is not required
More informationLinear Algebra Done Wrong. Sergei Treil. Department of Mathematics, Brown University
Linear Algebra Done Wrong Sergei Treil Department of Mathematics, Brown University Copyright c Sergei Treil, 2004, 2009, 2011, 2014 Preface The title of the book sounds a bit mysterious. Why should anyone
More informationMath 115A HW4 Solutions University of California, Los Angeles. 5 2i 6 + 4i. (5 2i)7i (6 + 4i)( 3 + i) = 35i + 14 ( 22 6i) = 36 + 41i.
Math 5A HW4 Solutions September 5, 202 University of California, Los Angeles Problem 4..3b Calculate the determinant, 5 2i 6 + 4i 3 + i 7i Solution: The textbook s instructions give us, (5 2i)7i (6 + 4i)(
More informationMATH 551  APPLIED MATRIX THEORY
MATH 55  APPLIED MATRIX THEORY FINAL TEST: SAMPLE with SOLUTIONS (25 points NAME: PROBLEM (3 points A web of 5 pages is described by a directed graph whose matrix is given by A Do the following ( points
More information