Linear Algebra. Grinshpan

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

Answers in blue. If you have questions or spot an error, let me know. 1. Find all matrices that commute with A =. 4 3

MATH 33A LECTURE 2 SOLUTIONS 1ST MIDTERM

MODULE 8 Topics: Null space, range, column space, row space and rank of a matrix

Chapter 2 Subspaces of R n and Their Dimensions

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

2018 Fall 2210Q Section 013 Midterm Exam II Solution

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

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

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

1 Last time: inverses

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

Math 240, 4.3 Linear Independence; Bases A. DeCelles. 1. definitions of linear independence, linear dependence, dependence relation, basis

Linear Algebra FALL 2013 MIDTERM EXAMINATION Solutions October 11, 2013

Assignment 1 Math 5341 Linear Algebra Review. Give complete answers to each of the following questions. Show all of your work.

CSL361 Problem set 4: Basic linear algebra

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

PRACTICE FINAL EXAM. why. If they are dependent, exhibit a linear dependence relation among them.

S09 MTH 371 Linear Algebra NEW PRACTICE QUIZ 4, SOLUTIONS Prof. G.Todorov February 15, 2009 Please, justify your answers.

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

MATH 304 Linear Algebra Lecture 34: Review for Test 2.

Lecture 22: Section 4.7

This MUST hold matrix multiplication satisfies the distributive property.

MATH 54 QUIZ I, KYLE MILLER MARCH 1, 2016, 40 MINUTES (5 PAGES) Problem Number Total

Math 21b: Linear Algebra Spring 2018

SSEA Math 51 Track Final Exam August 30, Problem Total Points Score

Math 313 Chapter 5 Review

Rank & nullity. Defn. Let T : V W be linear. We define the rank of T to be rank T = dim im T & the nullity of T to be nullt = dim ker T.

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

Abstract Vector Spaces and Concrete Examples

MTH 362: Advanced Engineering Mathematics

Math 18, Linear Algebra, Lecture C00, Spring 2017 Review and Practice Problems for Final Exam

Math 3C Lecture 25. John Douglas Moore

Midterm 1 Solutions, MATH 54, Linear Algebra and Differential Equations, Fall Problem Maximum Score Your Score

MATH 323 Linear Algebra Lecture 12: Basis of a vector space (continued). Rank and nullity of a matrix.

MAT 242 CHAPTER 4: SUBSPACES OF R n

Problem # Max points possible Actual score Total 120

Row Space, Column Space, and Nullspace

Math 301 Test I. M. Randall Holmes. September 8, 2008

4.3 - Linear Combinations and Independence of Vectors

x y + z = 3 2y z = 1 4x + y = 0

Solutions to Final Exam

Recall the convention that, for us, all vectors are column vectors.

Definitions for Quizzes

Matrix invertibility. Rank-Nullity Theorem: For any n-column matrix A, nullity A +ranka = n

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

Instructions Please answer the five problems on your own paper. These are essay questions: you should write in complete sentences.

Proofs for Quizzes. Proof. Suppose T is a linear transformation, and let A be a matrix such that T (x) = Ax for all x R m. Then

Math 369 Exam #2 Practice Problem Solutions

Introduction to Mathematical Programming IE406. Lecture 3. Dr. Ted Ralphs

Study Guide for Linear Algebra Exam 2

EE263: Introduction to Linear Dynamical Systems Review Session 2

Econ Slides from Lecture 7

Problem Set (T) If A is an m n matrix, B is an n p matrix and D is a p s matrix, then show

Test 3, Linear Algebra

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

Family Feud Review. Linear Algebra. October 22, 2013

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

Dot Products, Transposes, and Orthogonal Projections

Chapter Two Elements of Linear Algebra

LINEAR ALGEBRA BOOT CAMP WEEK 1: THE BASICS

14: Hunting the Nullspace. Lecture

MA 511, Session 10. The Four Fundamental Subspaces of a Matrix

MATH10212 Linear Algebra B Homework Week 4

Math 250B Midterm II Information Spring 2019 SOLUTIONS TO PRACTICE PROBLEMS

Linear Algebra Final Exam Study Guide Solutions Fall 2012

Chapter SSM: Linear Algebra. 5. Find all x such that A x = , so that x 1 = x 2 = 0.

Math 544, Exam 2 Information.

Lecture 13: Row and column spaces

Quizzes for Math 304

This lecture is a review for the exam. The majority of the exam is on what we ve learned about rectangular matrices.

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

Choose three of: Choose three of: Choose three of:

Fall 2016 MATH*1160 Final Exam

SOLUTIONS TO EXERCISES FOR MATHEMATICS 133 Part 1. I. Topics from linear algebra

MATH 240 Spring, Chapter 1: Linear Equations and Matrices

Math 265 Linear Algebra Sample Spring 2002., rref (A) =

Linear independence, span, basis, dimension - and their connection with linear systems

Math 344 Lecture # Linear Systems

First of all, the notion of linearity does not depend on which coordinates are used. Recall that a map T : R n R m is linear if

Math Linear algebra, Spring Semester Dan Abramovich

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

Chapter 3. Vector spaces

Math 308 Practice Final Exam Page and vector y =

Topic 1: Matrix diagonalization

Linear Systems. Carlo Tomasi

Final Review Sheet. B = (1, 1 + 3x, 1 + x 2 ) then 2 + 3x + 6x 2

DEF 1 Let V be a vector space and W be a nonempty subset of V. If W is a vector space w.r.t. the operations, in V, then W is called a subspace of V.

MATH 15a: Linear Algebra Practice Exam 2

Definition Suppose S R n, V R m are subspaces. A map U : S V is linear if

6.4 BASIS AND DIMENSION (Review) DEF 1 Vectors v 1, v 2,, v k in a vector space V are said to form a basis for V if. (a) v 1,, v k span V and

LINEAR ALGEBRA QUESTION BANK

Math 242 fall 2008 notes on problem session for week of This is a short overview of problems that we covered.

Math 308 Discussion Problems #4 Chapter 4 (after 4.3)

Rank and Nullity. MATH 322, Linear Algebra I. J. Robert Buchanan. Spring Department of Mathematics

Section 2.2: The Inverse of a Matrix

Solutions: We leave the conversione between relation form and span form for the reader to verify. x 1 + 2x 2 + 3x 3 = 0

Chapter 2: Matrix Algebra

Working with Block Structured Matrices

Final Exam Practice Problems Answers Math 24 Winter 2012

Transcription:

Linear Algebra Grinshpan Saturday class, 2/23/9 This lecture involves topics from Sections 3-34 Subspaces associated to a matrix Given an n m matrix A, we have three subspaces associated to it The column space (image, range) of A is the span of its columns The column space is a subspace of R n, it is spanned by the non-redundant columns From the reduced row-echelon form, we see that the dimension of the column space is ranka The row space of A is the span of its rows The row space is a subspace of R m (row version), it is spanned by the non-redundant rows From the reduced row-echelon form, we see that the dimension of the row space is ranka The row space and column space dimensions are equal Any matrix has as many linearly independent rows as it has linearly independent columns Note: the number of redundant columns of a matrix is not necessarily the same as the number of its redundant rows The kernel of A is also known as its null space The null space is a subspace of R m The null space has dimension m ranka Every nontrivial relation between columns gives rise to a kernel vector, and vice versa Note that the kernel vectors and the row space vectors are mutually orthogonal Thus the kernel and the row space are orthogonal subspaces of R m of complementary dimension Proposition Let V be a subspace of R n and let v,, v k be vectors in V Then any two of the following conditions imply the third: v,, v k span V v,, v k are linearly independent V has dimension k For instance, if V has dimension 3 and we know three linearly independent vectors in V, then these vectors must form a basis for V Similarly, if we know four linearly independent vectors in V, then the dimension of V must be at least 4 Proof of proposition Let V be spanned by k linearly independent vectors These vectors then form a basis for V So dim V = k, by definition Let V have dimension k and let it be spanned by k vectors If any of the vectors were redundant, we could remove them from the list and obtain a list of less than k vectors which are linearly independent and still span V But this would mean that dim V < k Let V have dimension k and let v,, v k be linearly independent vectors in V If v,, v k failed to span V, there would be a vector w in V which is not their linear combination This would give k+ linearly independent vectors in V : v,, v k, w But this would mean that dim V > k

Example Consider the matrix A = 3 2 3 2 2 3 2 3 We will determine its image and kernel by inspection The columns 2, 4, 5 are redundant: ( ) C 2 = 3C, 2C 4 = 3C + C 3, C 5 = 2C + C 3 The image of A is therefore spanned by the non-redundant columns, 3 ) ( ) We have im A = span(, 2 = span, Thus im A is a two-dimensional subspace of R 3 Note that im A is the plane x = x 3 and, form a basis for it Now ker A has dimension 5 2 = 3, it is spanned by three linearly independent vectors We may read them off the column relations ( ): 3 3 ker A = span,, 2 2 The arrangement of s confirms that the spanning vectors are linearly independent Thus ker A is a three-dimensional subspace of R 5 and we may take 3 3 2,, 2 as a basis for it 2

Coordinates with respect to a basis Let V be a subspace of R n and let B = (v,, v k ) be a basis for V Then, for each x in V, the linear system c v v k = x c k c has a unique solution So each x in V can be uniquely written the form c k x = c v + + c k v k The coefficients c,, c k are the coordinates of x with respect to the basis B Notation: x B = c c k Example Let V = R 2 and B = So x B = x x 2 Example Let V = R 2, B = So x = B 3 x = (, ) x = x x + x 2 2 (standard basis) Then are the standard coordinates of x (with respect to the standard basis) (, 3, and x = Then ) 2 x = + 3 3 are the coordinates of x = 2 with respect to B Example Let V be the plane x + x 2 + x 3 = in R 3 ( ) Then dim V = 2 and B =, is a basis for V The vector x = 2 3 So the coordinates of x = 2 3 belongs to V and can be written as x = 2 with respect to B are x 2 = B 3 3 + 3

Linearity of coordinates The operation of taking coordinates with respect to a given basis is a linear transformation: x + y = x + y B B B cx = c x B B Matrix of basis elements The n k matrix S = v v k with columns given by the vectors of B = (v,, v k ) transforms the coordinates of x with respect to B back to the standard coordinates of x S x B = x Honeycomb tiling Consider a tiling of R 2 with regular hexagons I have labeled some of the points with their coordinates relative to the basis B = (v, w) Each point with integer B-coordinates is either a corner or a center Is (3, 7) a corner or a center? How about (2, 52)? Find a good way to tell Matrix with respect to a given basis Let B = (v,, v n ) be a basis for R n and let T be a linear transformation of R n By the matrix of T with respect to B is meant the n n matrix B which transforms the B-coordinates of x into the B-coordinates of T (x), B x = T (x) B B Notation: T B = B 4

With respect to the standard basis of R n, the preceding relation takes the form Ax = T (x), where A = T (e ) T (e n ) is the standard matrix of T Example Let T (x, x 2 ) = (3x, 5x 2 ) be a change of scale in R 2 3, so that A = 5 ( ) Let B =, (this basis is not standard) Then T v = 5v and T v 2 = 3v 2 So x = c v + c 2 v 2 is transformed into T (x) = 5c v + 3c 2 v 2 c In B-coordinates then, 5c is transformed into So B = c 2 3c 2 5 3 Column-by-column formula We can write down the matrix B column by column Note that v = v + v 2 + + v n, v 2 = v + v 2 + + v n, v n = v + + v n + v n Therefore vj B = e j, j =,, n Consequently, Be j = B v j B = T (v j ) B is the jth column of B Our formula is ready: B = T (v ) B T (vn ) B Example Let T be the reflection about the line x 2 = 2x in R 2 ( ) 2 Let B =, (these vectors go well with the line of reflection) 2 Then T v = v and T v 2 = v 2 We have v = and v B 2 = B So B = T (v ) B T (v2 ) B = v B v2 5 B =

Similarity relation What is the relation between the matrices A and B? Observe that B x = Ax B B The n n matrix S = v v n is invertible and its inverse transforms the standard coordinates into the B-coordinates, S x = x B Therefore, BS x = S Ax for every x in R n This gives BS = S A or AS = SB This relation is known as similarity or intertwining We can also write B = S AS and A = SBS ( ) 2 Example Let T be the reflection about x 2 = 2x and B =, 2 2 Then S = and S 2 = 2 So 5 2 A = SBS = 2 2 5 = 2 2 3/5 4/5 4/5 3/5 This is indeed the standard matrix of reflection about the span of the unit vector as above 5 2