What is on this week. 1 Vector spaces (continued) 1.1 Null space and Column Space of a matrix

Similar documents
Announcements Monday, October 29

Review Notes for Linear Algebra True or False Last Updated: February 22, 2010

(a) only (ii) and (iv) (b) only (ii) and (iii) (c) only (i) and (ii) (d) only (iv) (e) only (i) and (iii)

Study Guide for Linear Algebra Exam 2

Math Final December 2006 C. Robinson

(b) If a multiple of one row of A is added to another row to produce B then det(b) =det(a).

LINEAR ALGEBRA REVIEW

Math 102, Winter 2009, Homework 7

Dimension. Eigenvalue and eigenvector

Review Notes for Midterm #2

Practice Final Exam. Solutions.

IMPORTANT DEFINITIONS AND THEOREMS REFERENCE SHEET

DIAGONALIZATION. In order to see the implications of this definition, let us consider the following example Example 1. Consider the matrix

2. Every linear system with the same number of equations as unknowns has a unique solution.

Math 4A Notes. Written by Victoria Kala Last updated June 11, 2017

IMPORTANT DEFINITIONS AND THEOREMS REFERENCE SHEET

(a) II and III (b) I (c) I and III (d) I and II and III (e) None are true.

1. Let A = (a) 2 (b) 3 (c) 0 (d) 4 (e) 1

Glossary of Linear Algebra Terms. Prepared by Vince Zaccone For Campus Learning Assistance Services at UCSB

Solutions to Section 2.9 Homework Problems Problems 1 5, 7, 9, 10 15, (odd), and 38. S. F. Ellermeyer June 21, 2002

Summer Session Practice Final Exam

2 Eigenvectors and Eigenvalues in abstract spaces.

Quizzes for Math 304

235 Final exam review questions

Final Examination 201-NYC-05 December and b =

Solving a system by back-substitution, checking consistency of a system (no rows of the form

Remark By definition, an eigenvector must be a nonzero vector, but eigenvalue could be zero.

Remark 1 By definition, an eigenvector must be a nonzero vector, but eigenvalue could be zero.

Solutions to Final Practice Problems Written by Victoria Kala Last updated 12/5/2015

Chapter 5. Eigenvalues and Eigenvectors

MATH 221, Spring Homework 10 Solutions

PRACTICE PROBLEMS FOR THE FINAL

1. In this problem, if the statement is always true, circle T; otherwise, circle F.

MATH 2331 Linear Algebra. Section 2.1 Matrix Operations. Definition: A : m n, B : n p. Example: Compute AB, if possible.

2018 Fall 2210Q Section 013 Midterm Exam II Solution

MTH 464: Computational Linear Algebra

Eigenvalues, Eigenvectors, and Diagonalization

Math 323 Exam 2 Sample Problems Solution Guide October 31, 2013

DEPARTMENT OF MATHEMATICS

Recall : Eigenvalues and Eigenvectors

Math 1553, Introduction to Linear Algebra

EK102 Linear Algebra PRACTICE PROBLEMS for Final Exam Spring 2016

Calculating determinants for larger matrices

spring, math 204 (mitchell) list of theorems 1 Linear Systems Linear Transformations Matrix Algebra

Chapter 3. Directions: For questions 1-11 mark each statement True or False. Justify each answer.

1. Determine by inspection which of the following sets of vectors is linearly independent. 3 3.

LINEAR ALGEBRA SUMMARY SHEET.

Math 20F Practice Final Solutions. Jor-el Briones

LINEAR ALGEBRA QUESTION BANK

MATH 20F: LINEAR ALGEBRA LECTURE B00 (T. KEMP)

Elementary Linear Algebra Review for Exam 2 Exam is Monday, November 16th.

MATH 240 Spring, Chapter 1: Linear Equations and Matrices

Math 369 Exam #2 Practice Problem Solutions

Worksheet for Lecture 15 (due October 23) Section 4.3 Linearly Independent Sets; Bases

Definitions for Quizzes

Math 308 Final, Autumn 2017

Warm-up. True or false? Baby proof. 2. The system of normal equations for A x = y has solutions iff A x = y has solutions

Travis Schedler. Thurs, Oct 27, 2011 (version: Thurs, Oct 27, 1:00 PM)

W2 ) = dim(w 1 )+ dim(w 2 ) for any two finite dimensional subspaces W 1, W 2 of V.

Solutions to Midterm 2 Practice Problems Written by Victoria Kala Last updated 11/10/2015

ft-uiowa-math2550 Assignment OptionalFinalExamReviewMultChoiceMEDIUMlengthForm due 12/31/2014 at 10:36pm CST

Math 1553 Introduction to Linear Algebra

MA 265 FINAL EXAM Fall 2012

The definition of a vector space (V, +, )

NATIONAL UNIVERSITY OF SINGAPORE MA1101R

1 Last time: inverses

Chapters 5 & 6: Theory Review: Solutions Math 308 F Spring 2015

Worksheet for Lecture 15 (due October 23) Section 4.3 Linearly Independent Sets; Bases

Eigenvalues and Eigenvectors 7.1 Eigenvalues and Eigenvecto

YORK UNIVERSITY. Faculty of Science Department of Mathematics and Statistics MATH M Test #1. July 11, 2013 Solutions

Final Review Written by Victoria Kala SH 6432u Office Hours R 12:30 1:30pm Last Updated 11/30/2015

1. 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

(i) [7 points] Compute the determinant of the following matrix using cofactor expansion.

Matrices related to linear transformations

CHAPTER 5 REVIEW. c 1. c 2 can be considered as the coordinates of v

MATH 2210Q MIDTERM EXAM I PRACTICE PROBLEMS

Math 308 Practice Test for Final Exam Winter 2015

MATH 1120 (LINEAR ALGEBRA 1), FINAL EXAM FALL 2011 SOLUTIONS TO PRACTICE VERSION

Third Midterm Exam Name: Practice Problems November 11, Find a basis for the subspace spanned by the following vectors.

A 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

(Practice)Exam in Linear Algebra

Online Exercises for Linear Algebra XM511

Lecture 11: Finish Gaussian elimination and applications; intro to eigenvalues and eigenvectors (1)

Fall 2016 MATH*1160 Final Exam

A 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

Lecture Summaries for Linear Algebra M51A

Kevin James. MTHSC 3110 Section 4.3 Linear Independence in Vector Sp

Linear algebra II Tutorial solutions #1 A = x 1

Definition (T -invariant subspace) Example. Example

Linear Algebra: Sample Questions for Exam 2

Equality: 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.

GENERAL VECTOR SPACES AND SUBSPACES [4.1]

Vector Spaces and Linear Transformations

Linear Algebra Practice Problems

Announcements Monday, November 13

TMA Calculus 3. Lecture 21, April 3. Toke Meier Carlsen Norwegian University of Science and Technology Spring 2013

MATH 1553 SAMPLE FINAL EXAM, SPRING 2018

Review for Chapter 1. Selected Topics

1. Let m 1 and n 1 be two natural numbers such that m > n. Which of the following is/are true?

4. Linear transformations as a vector space 17

Transcription:

Professor Joana Amorim, jamorim@bu.edu What is on this week Vector spaces (continued). Null space and Column Space of a matrix............................. Null Space...........................................2 Column Space....................................... 3..3 Kernel and Range of Linear Transformations...................... 3.2 Basis, dimension and Rank.................................... 4.2. Definition of basis and dimension............................ 4.2.2 Basis for the spanning set of a set of vectors...................... 6.2.3 Basis for NulA...................................... 7.2.4 Basis for ColA...................................... 7.2.5 The rank Theorem.................................... 8 2 Eigenvalues and Eigenvectors 0 2. Definitions............................................. 2.2 How to find eigenvalues?..................................... 3 3 Complex eigenvalues 6 Vector spaces (continued). Null space and Column Space of a matrix In the book: Section 4.2 pages 98 207 (only R n examples). Exercises section 4.2: all with R n examples but specially the ones similar to the homework... Null Space Definition Let A be a m n matrix. NulA = {x in R n such that Ax = 0} = set of all solutions of the homogeneous equation Ax = 0. Theorem 2 Let A be a m n matrix. Then NulA is a subspace of R n. Proof : Page 200.

3 5 3 Example 3 (Ex., section 4.2) Determine if w = 3 is in NulA where A = 6 2 0. 4 8 4 Example 4 (Ex. 3 and 5, section 4.2) Find an explicit description of NulA by listing vectors that span the Null space. [ ] 2 4 0 a. 0 3 2 b. 4 0 2 0 0 0 5 0 0 0 0 0 2 2

..2 Column Space Definition 5 Let A be a m n matrix. ColA = {b such that b = Ax for some x in R n } = set of all linear combinations of columns of A. This is a subset of R m Theorem 6 Let A be a m n matrix. Then ColA is a subspace of R m. 6 4 Example 7 (Ex. 7, section 4.2) Let A = 3 2 9 6. Find k such that NulA is a subspace of Rk. 9 6 Find s such that ColA is a subspace of R s. Example 8 (Ex. 23, section 4.2) Let A = NulA. [ 2 ] 4 2 and w = [ ] 2. Determine if w is in ColA or in..3 Kernel and Range of Linear Transformations Definition 9 Let T : R n R m be a linear transformation. The kernel T (ker(t )) are the vectors x in R n such that T (x) = 0. The range of T (range(t )) are the vectors b in R m for which there is a x in R n such that T (x) = b. Proposition 0 Let T : R R m be a linear transformation and A its standard matrix. Then Remark Hence if T (x) = Ax T is one-to-one iff ker(t ) = NulA = {0} T is onto iff range(t ) = ColA = R m ker(t ) = NulA and range(t ) = ColA. Example 2 Let T : R 2 R 2 be the linear map that does a projection onto the x-axis followed by an expansion by a factor of 3. Find ker(t ) and range(t ). 3

.2 Basis, dimension and Rank In the book: Section 4.3 pages 208 23, Exercises 20. Section 4.5 pages 225 228, Exercises 8. Section 4.6 pages 230 236 (ignore row space), Exercises 6..2. Definition of basis and dimension The definition we saw for Linearly Independent set also applies in general: Let v,..., v p be a set of vectors in a vector space V. They are linearly independent iff the only solution of a v +... + a p v p = 0 is the trivial solution. Equivalently, the vectors are linearly dependent iff at least one of them can be written as a linear combination of the rest. Definition 3 Let V be a vector space. A set of vectors B = {v,..., v n } is called a basis for V if B is a linearly independent set; B spans V, ie, V = span B. Important remarks: All basis of a vector space have the same number of elements. The dimension of a vector space is the number of elements in a basis. If a vector space has dimension n there are at most n linear independent vectors in that space. If you have n LI vectors in a space of dimension n then they automatically span the set. Example 4 R n is a vector space of dimension n, dim(r n ) = n. The standard basis of R n is the set of coordinate vectors {e,..., e n }. 4

Example 5 (Section 4.3, Exercises, 3, 5 and 7) Determine whether the following sets are bases for R 3. Of the sets that are not basis determine which ones are LI and which ones span R 3.. 0,, 0 0 3 2 2. 0,, 3 4 3 3 0 0 3. 3, 7, 0, 3 0 0 0 5 2 6 4. 3, 0 5 5

Example 6 (Section 4.3, Ex. ) Find a basis for the plane in R 3 defined by x 3y + 2z = 0..2.2 Basis for the spanning set of a set of vectors Let s now see how do we find the basis for the spanning set of a set of vectors. Let V = span{v,..., v p }. If the vectors are LI then they are a basis. Otherwise we need to remove the vectors that are linear combination of others. How? Consider the matrix that has the vectors as columns [v,..., v p ] and do row operation to get it to echelon form. Look for the pivots. The original columns corresponding to pivot columns are LI (and hence a basis). Example 7 Find a basis for span 2, 4, 0 3 5 6

.2.3 Basis for N ula Let A be a m n matrix. Remember that To find a basis for NulA one NulA = {x in R n such that Ax = 0}. Solves the system Ax = 0 and gives the solution in vector parametric form (using reduced echelon form). The vectors in the solution are a basis. If Ax = 0 only has the zero solution, there is no basis, since the space is just {0}. Hence dim(nula) = number of free variables in the system Ax = 0. If there are none it means there is only one solution and the dimension is zero in that case..2.4 Basis for ColA Let A be a m n matrix. Remember that ColA = span{columns of A}. So to find a basis for ColA we use the method described above in section.2: see which columns have pivots in echelon form; the basis are the correspondind original columns. Definition 8 The rank of a matrix is the dimension of its column space (which is the number of pivots of the matrix in echelon form). Example 9 (Section 4.3, Ex. 9 and 0) Find bases for the Null and the column spaces of the following matrices. Give their dimension. 0 2 2. 0 4 3 7 3 7

2. 2 5 0 0 2 0 0 8 0 6.2.5 The rank Theorem Theorem 20 (The rank Theorem) Let A be a m n matrix. Then ranka + dim NulA = n. Example 2 (Section 4.6, Ex. and 3) Assume that the matrix A is row equivalent to B. Without calculations list ranka and dim NulA. Then find bases for NulA and ColA. 8

9

2 Eigenvalues and Eigenvectors In the book: Section 5. pages 266 270, Exercises 20. Section 5.2 pages 273 276. Exercises 8 Goal: dissect the action of a linear map T (x) = Ax into elements that are easily visualized. Eigenvectors and eigenvalues are usefull in discrete dynamical systems, differential equations, etc... [ ] 3 2 Example 22 Let A =. Consider the transformation T (x) = Ax. Let s see how this matrix acts [ ] 0 [ ] 2 on two vectors: v =, v = 0

2. Definitions Definition 23 Let A be a n n matrix. An eigenvector is a non-zero vector v such that for some scalar λ. Av = λv The scalar λ is called an eigenvalue. So an eigenvalue is a scalar such that Av = λv has a solution v 0 Av λv = 0 has a solution v 0 (A λi)v = 0 has a non-trivial solution. The subspace Nul(A λi) is called the eigenspace corresponding to the eigenvalue λ. Example 24 ( 5., Ex., 2). Is λ = 2 and eigenvalue of A = [ ] 3 2? 3 8 2. Is λ = 3 an eigenvalue of A = [ ] 4? 6 9 Example 25 ( 5., Ex. 4) Is v = [ ] an eigenvector of A = [ ] 5 2? If so find eigenvalue. 3 6

Example 26 ( 5., Ex. 0, 5) Find a basis for the eigenspace (and state its dimension) corresponding to each given eigenvalue. [ ] 4 2. A =, λ = 5. 3 4 2. B = 2 3 2, λ = 5. 3 3 2 2

2.2 How to find eigenvalues? Proposition 27 The eigenvalues of a triangular matrix are the entries on its main diagonal. In general: Proposition 28 Let A be a n n matrix. A scalar λ is an eigenvalue iff det(a λi) = 0. This equation is the characteristic equation of the matrix A. The multiplicity of an eigenvalue is the number of times that eigenvalue is a zero of the characteristic equation. Example 29 ( 5.2, Ex. 2, 6, 2) Find the characteristic equation and the real eigenvalues of the matrices. [ ] [ ] 4 9 2 A =, B = 6 2 5 3

C = [ 4 ] 4 2 Example 30 Find the eigenvalues and a basis to the corresponding eigenspaces of 4 0 D = 0 4 0 2 4

Example 9 (cont.) 5

3 Complex eigenvalues In the book: Section 5.5 pages 295 300, Exercises 2. Important application on vibrations, periodic motions,... If a real matrix has a complex eigenvalue λ them its complex conjugate λ its also an eigenvalue for the matrix. If v is an eigenvector corresponding to λ then the complex conjugate of v is an eigenvector corresponding to λ. 6

Example 3 ( 5.5, Ex. 2, 4) Find the eigenvalues and a basis for each eigenspace in C 2. [ ] [ ] 3 3 2 A =, B = 3 3 3 7

When a real matrix A has complex eigenvalues it means the map T (x) = Ax contains a rotation. Let s look at a special case of this where it is easy to identify such a rotation. [ ] a b Example 32 Let C =, where a, b are non-zero real numbers. Then the eigenvalues of C are b a λ,2 = a ± bi and, if we call r = λ = a a + b 2 and ϕ = arg(λ ), we can write C as [ ] a/r b/r C = r = b/r a/r [ r 0 0 r ] [ cos ϕ sin ϕ sin ϕ cos ϕ ]. 8

Example 33 ( 5.5, Ex. 2) Use the example above to list the eigenvalues of the matrix write the map T (x) = Ax as a composition of a rotation and a scaling identify the angle ϕ of rotation (ϕ in ( π, π)) and the scaling factor r [ ] 3 3 A = 3 3 9