Properties of Linear Transformations from R n to R m

Similar documents
Row Space, Column Space, and Nullspace

Elementary Matrices. MATH 322, Linear Algebra I. J. Robert Buchanan. Spring Department of Mathematics

Evaluating Determinants by Row Reduction

Numerical Linear Algebra Homework Assignment - Week 2

4. Determinants.

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

Math 315: Linear Algebra Solutions to Assignment 7

Properties of the Determinant Function

Family Feud Review. Linear Algebra. October 22, 2013

MATH 2331 Linear Algebra. Section 1.1 Systems of Linear Equations. Finding the solution to a set of two equations in two variables: Example 1: Solve:

Math 3C Lecture 20. John Douglas Moore

Linear vector spaces and subspaces.

Study Guide for Linear Algebra Exam 2

We could express the left side as a sum of vectors and obtain the Vector Form of a Linear System: a 12 a x n. a m2

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

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

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

Span and Linear Independence

Recall : Eigenvalues and Eigenvectors

Linear Independence. MATH 322, Linear Algebra I. J. Robert Buchanan. Spring Department of Mathematics

and let s calculate the image of some vectors under the transformation T.

MATH 240 Spring, Chapter 1: Linear Equations and Matrices

Span & Linear Independence (Pop Quiz)

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. Determinants and Eigenvalues

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

MATH 423 Linear Algebra II Lecture 33: Diagonalization of normal operators.

Math Linear Algebra Final Exam Review Sheet

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

Sept. 3, 2013 Math 3312 sec 003 Fall 2013

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

Diagonalization of Matrix

City Suburbs. : population distribution after m years

Linear Algebra Practice Problems

Chapter 2:Determinants. Section 2.1: Determinants by cofactor expansion

Question: Given an n x n matrix A, how do we find its eigenvalues? Idea: Suppose c is an eigenvalue of A, then what is the determinant of A-cI?

Announcements Wednesday, November 01

Vectors in the Plane

Linear Systems. Class 27. c 2008 Ron Buckmire. TITLE Projection Matrices and Orthogonal Diagonalization CURRENT READING Poole 5.4

MTH 464: Computational Linear Algebra

Math 215 HW #9 Solutions

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

Diagonalization. MATH 322, Linear Algebra I. J. Robert Buchanan. Spring Department of Mathematics

4. Linear transformations as a vector space 17

1. Linear systems of equations. Chapters 7-8: Linear Algebra. Solution(s) of a linear system of equations (continued)

Section 1.1 System of Linear Equations. Dr. Abdulla Eid. College of Science. MATHS 211: Linear Algebra

3 Matrix Algebra. 3.1 Operations on matrices

Homework sheet 4: EIGENVALUES AND EIGENVECTORS. DIAGONALIZATION (with solutions) Year ? Why or why not? 6 9

Symmetric and anti symmetric matrices

Determinants and Scalar Multiplication

Math 520 Exam 2 Topic Outline Sections 1 3 (Xiao/Dumas/Liaw) Spring 2008

Determinants by Cofactor Expansion (III)

Lecture 6 & 7. Shuanglin Shao. September 16th and 18th, 2013

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

Linear Algebra- Final Exam Review

Math 205, Summer I, Week 4b:

The Cross Product. MATH 311, Calculus III. J. Robert Buchanan. Fall Department of Mathematics. J. Robert Buchanan The Cross Product

Kevin James. MTHSC 3110 Section 2.2 Inverses of Matrices

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

February 20 Math 3260 sec. 56 Spring 2018

MAT 1302B Mathematical Methods II

MAC Module 12 Eigenvalues and Eigenvectors. Learning Objectives. Upon completing this module, you should be able to:

MAC Module 12 Eigenvalues and Eigenvectors

Lecture Notes: Eigenvalues and Eigenvectors. 1 Definitions. 2 Finding All Eigenvalues

Econ Slides from Lecture 7

Math 2331 Linear Algebra

1. Select the unique answer (choice) for each problem. Write only the answer.

Math 54 HW 4 solutions

CS 143 Linear Algebra Review

Chapter 5. Eigenvalues and Eigenvectors

From Lay, 5.4. If we always treat a matrix as defining a linear transformation, what role does diagonalisation play?

Linear Algebra - Part II

Announcements Monday, October 29

Components and change of basis

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

Linear Independence x

CHAPTER 3. Matrix Eigenvalue Problems

Solutions to Exam I MATH 304, section 6

MATH10212 Linear Algebra B Homework Week 4

MATH 423 Linear Algebra II Lecture 20: Geometry of linear transformations. Eigenvalues and eigenvectors. Characteristic polynomial.

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

Definition (T -invariant subspace) Example. Example

IMPORTANT DEFINITIONS AND THEOREMS REFERENCE SHEET

0.1 Eigenvalues and Eigenvectors

EK102 Linear Algebra PRACTICE PROBLEMS for Final Exam Spring 2016

Math 102, Winter Final Exam Review. Chapter 1. Matrices and Gaussian Elimination

Linear Algebra: Matrix Eigenvalue Problems

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.

Linear Algebra Primer

3.4 Elementary Matrices and Matrix Inverse

Announcements Wednesday, November 01

Additional Homework Problems

Chapter 5 Eigenvalues and Eigenvectors

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

MATH 1553 PRACTICE MIDTERM 3 (VERSION B)

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

Section 2.2: The Inverse of a Matrix

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

Eigenvalues and Eigenvectors

LU Factorization. A m x n matrix A admits an LU factorization if it can be written in the form of A = LU

Transcription:

Properties of Linear Transformations from R n to R m MATH 322, Linear Algebra I J. Robert Buchanan Department of Mathematics Spring 2015

Topic Overview Relationship between the properties of a matrix transformation and the invertibility of the matrix Properties of linear transformations Geometric properties of eigenvectors

One-to-One Linear Transformations Definition A linear transformation T : R n R m is one-to-one if for a, b R n with a b, then T (a) T (b). [ ] cos θ sin θ Rotation operator R = is one-to-one. sin θ cos θ [ ] 1 0 Projection operator P = is not one-to-one. 0 0

One-to-One Linear Transformations Definition A linear transformation T : R n R m is one-to-one if for a, b R n with a b, then T (a) T (b). [ ] cos θ sin θ Rotation operator R = is one-to-one. sin θ cos θ [ ] 1 0 Projection operator P = is not one-to-one. 0 0

Equivalent Statements Recall: the following statements have been shown to be equivalent: A is invertible. Ax = b is consistent for every b. Ax = b has exactly one solution for every b. Think of T A as multiplication by matrix A, then the following statements are equivalent. A is invertible. For every b R n, there is some vector x R n such that T A (x) = b, i.e., the range of T A is all of R n. For every b R n, there is exactly one vector x R n such that T A (x) = b, i.e., T A is one-to-one.

Equivalent Statements Recall: the following statements have been shown to be equivalent: A is invertible. Ax = b is consistent for every b. Ax = b has exactly one solution for every b. Think of T A as multiplication by matrix A, then the following statements are equivalent. A is invertible. For every b R n, there is some vector x R n such that T A (x) = b, i.e., the range of T A is all of R n. For every b R n, there is exactly one vector x R n such that T A (x) = b, i.e., T A is one-to-one.

Summary Theorem If A is an n n matrix and T A : R n R n is multiplication by A, then the following statements are equivalent. 1. A is invertible. 2. The range of T A is R n. 3. T A is one-to-one.

s Show the rotation operator is invertible and hence it is one-to-one and onto R 2. Show the projection operator is not invertible.

s Show the rotation operator is invertible and hence it is one-to-one and onto R 2. Show the projection operator is not invertible.

Inverse of a One-to-One Operator If T A : R n R n is a one-to-one operator then matrix A is invertible. The operator T A 1 : R n R n is a linear operator called the inverse of T A. T A (T A 1(x)) = AA 1 x = I n x = x T A 1(T A (x)) = A 1 Ax = I n x = x If we use the symbol [T ] to denote the standard matrix of linear transformation T then when T is invertible, [ T 1] = [T ] 1.

Inverse of a One-to-One Operator If T A : R n R n is a one-to-one operator then matrix A is invertible. The operator T A 1 : R n R n is a linear operator called the inverse of T A. T A (T A 1(x)) = AA 1 x = I n x = x T A 1(T A (x)) = A 1 Ax = I n x = x If we use the symbol [T ] to denote the standard matrix of linear transformation T then when T is invertible, [ T 1] = [T ] 1.

Find the standard matrix for the inverse of the rotation operator.

Linearity Properties Theorem A transformation T : R n R m is linear if and only if the following relationships hold for all vectors u and v in R n and every scalar c. 1. T (u + v) = T (u) + T (v). 2. T (cu) = ct (u). Proof.

Linearity Properties Theorem A transformation T : R n R m is linear if and only if the following relationships hold for all vectors u and v in R n and every scalar c. 1. T (u + v) = T (u) + T (v). 2. T (cu) = ct (u). Proof.

Standard Basis Vectors Consider the standard basis vectors for R n. 1 0 0 e 1 =, e 1 2 =,, e n =. 0 Recall that if x R n then. 0 x = x 1 e 1 + x 2 e 2 + + x n e n, and T (x) = x 1 T (e 1 ) + x 2 T (e 2 ) + + x n T (e n ). 0 0. 1

Finding the Standard Matrix for a Transformation Theorem If T : R n R m is a linear transformation and e 1, e 2,..., e n are the standard basis vectors for R n then [T ] = [ T (e 1 ) T (e 2 ) T (e n ) ]. Find the standard matrix for the linear operator which reflects vectors about the line y = x in R 2.

Finding the Standard Matrix for a Transformation Theorem If T : R n R m is a linear transformation and e 1, e 2,..., e n are the standard basis vectors for R n then [T ] = [ T (e 1 ) T (e 2 ) T (e n ) ]. Find the standard matrix for the linear operator which reflects vectors about the line y = x in R 2.

Geometric Interpretation of Eigenvectors Recall: λ is an eigenvalue of the n n matrix A provided there exits a nontrivial solution to the linear system Ax = λx (λi A)x = 0. Definition If T : R n R n is a linear operator, then λ is an eigenvalue of T if there is a nontrivial x R n such that T (x) = λx. The nonzero vectors x that satisfy this equation are called the eigenvectors of T corresponding to λ. Remark: the eigenvalues and eigenvectors of T are precisely those of [T ].

Geometric Interpretation of Eigenvectors Recall: λ is an eigenvalue of the n n matrix A provided there exits a nontrivial solution to the linear system Ax = λx (λi A)x = 0. Definition If T : R n R n is a linear operator, then λ is an eigenvalue of T if there is a nontrivial x R n such that T (x) = λx. The nonzero vectors x that satisfy this equation are called the eigenvectors of T corresponding to λ. Remark: the eigenvalues and eigenvectors of T are precisely those of [T ].

Geometric Interpretation of Eigenvectors Recall: λ is an eigenvalue of the n n matrix A provided there exits a nontrivial solution to the linear system Ax = λx (λi A)x = 0. Definition If T : R n R n is a linear operator, then λ is an eigenvalue of T if there is a nontrivial x R n such that T (x) = λx. The nonzero vectors x that satisfy this equation are called the eigenvectors of T corresponding to λ. Remark: the eigenvalues and eigenvectors of T are precisely those of [T ].

s Find the eigenvalues and corresponding eigenvectors of the linear operator which reflects vectors about the line y = x in R 2. Find the eigenvalues and corresponding eigenvectors of the linear operator which projects vectors into the xy-plane in R 3.

s Find the eigenvalues and corresponding eigenvectors of the linear operator which reflects vectors about the line y = x in R 2. Find the eigenvalues and corresponding eigenvectors of the linear operator which projects vectors into the xy-plane in R 3.

Summary Theorem If A is an n n matrix and if T A : R n R n is multiplication by A, then the following are equivalent. 1. A is invertible. 2. Ax = 0 has only the trivial solution. 3. The reduced row echelon form of A is I n. 4. A is expressible as the product of elementary matrices. 5. Ax = b is consistent for every n 1 matrix b. 6. Ax = b has exactly one solution for every n 1 matrix b. 7. det(a) 0. 8. The range of T A is R n. 9. T A is one-to-one.

Homework Read Section 4.3 and work exercises 1 3, 5 15 odd, 21.