Section 6.2: THE KERNEL AND RANGE OF A LINEAR TRANSFORMATIONS

Similar documents
MTH 362: Advanced Engineering Mathematics

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.

235 Final exam review questions

Linear Transformations: Kernel, Range, 1-1, Onto

(b) The nonzero rows of R form a basis of the row space. Thus, a basis is [ ], [ ], [ ]

Criteria for Determining If A Subset is a Subspace

Carleton College, winter 2013 Math 232, Solutions to review problems and practice midterm 2 Prof. Jones 15. T 17. F 38. T 21. F 26. T 22. T 27.

YORK UNIVERSITY. Faculty of Science Department of Mathematics and Statistics MATH M Test #2 Solutions

Section 7.3: SYMMETRIC MATRICES AND ORTHOGONAL DIAGONALIZATION

Notes on singular value decomposition for Math 54. Recall that if A is a symmetric n n matrix, then A has real eigenvalues A = P DP 1 A = P DP T.

Final EXAM Preparation Sheet

Solutions to Final Exam

MTH5102 Spring 2017 HW Assignment 4: Sec. 2.2, #3, 5; Sec. 2.3, #17; Sec. 2.4, #14, 17 The due date for this assignment is 2/22/

Math 115A: Homework 4

(a). W contains the zero vector in R n. (b). W is closed under addition. (c). W is closed under scalar multiplication.

Linear Algebra Practice Problems

Chapter 2 Subspaces of R n and Their Dimensions

Definitions for Quizzes

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

Lecture 29: Free modules, finite generation, and bases for vector spaces

APPENDIX: MATHEMATICAL INDUCTION AND OTHER FORMS OF PROOF

10. Rank-nullity Definition Let A M m,n (F ). The row space of A is the span of the rows. The column space of A is the span of the columns.

T ((x 1, x 2,..., x n )) = + x x 3. , x 1. x 3. Each of the four coordinates in the range is a linear combination of the three variables x 1

MATH 33A LECTURE 2 SOLUTIONS 1ST MIDTERM

MATH2210 Notebook 3 Spring 2018

Linear Algebra Practice Problems

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

Math 115A: Homework 5

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

MODEL ANSWERS TO THE FIRST QUIZ. 1. (18pts) (i) Give the definition of a m n matrix. A m n matrix with entries in a field F is a function

Lecture 13: Orthogonal projections and least squares (Section ) Thang Huynh, UC San Diego 2/9/2018

Kernel and range. Definition: A homogeneous linear equation is an equation of the form A v = 0

Advanced Linear Algebra Math 4377 / 6308 (Spring 2015) March 5, 2015

This last statement about dimension is only one part of a more fundamental fact.

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

Linear Algebra Final Exam Study Guide Solutions Fall 2012

MATH PRACTICE EXAM 1 SOLUTIONS

Test 1 Review Problems Spring 2015

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

Lecture Summaries for Linear Algebra M51A

Lecture 9: Vector Algebra

Math 24 Winter 2010 Sample Solutions to the Midterm

Eigenspaces. (c) Find the algebraic multiplicity and the geometric multiplicity for the eigenvaules of A.

LINEAR ALGEBRA BOOT CAMP WEEK 1: THE BASICS

15B. Isometries and Functionals 1

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

MATH 31 - ADDITIONAL PRACTICE PROBLEMS FOR FINAL

Regn. No. North Delhi : 33-35, Mall Road, G.T.B. Nagar (Opp. Metro Gate No. 3), Delhi-09, Ph: ,

Orthogonal Projection. Hung-yi Lee

Chapter 2 Linear Transformations

Linear Maps and Matrices

The Fundamental Theorem of Linear Algebra

MATH 23a, FALL 2002 THEORETICAL LINEAR ALGEBRA AND MULTIVARIABLE CALCULUS Solutions to Final Exam (in-class portion) January 22, 2003

SECTION 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. =

Miderm II Solutions To find the inverse we row-reduce the augumented matrix [I A]. In our case, we row reduce

Midterm solutions. (50 points) 2 (10 points) 3 (10 points) 4 (10 points) 5 (10 points)

Analysis Preliminary Exam Workshop: Hilbert Spaces

Linear Vector Spaces

1.4 Gaussian Elimination Gaussian elimination: an algorithm for finding a (actually the ) reduced row echelon form of a matrix. A row echelon form

Math 217 Midterm 1. Winter Solutions. Question Points Score Total: 100

A = 1 6 (y 1 8y 2 5y 3 ) Therefore, a general solution to this system is given by

Lecture 18: The Rank of a Matrix and Consistency of Linear Systems

Chapter 3. Abstract Vector Spaces. 3.1 The Definition

Math 353, Practice Midterm 1

Math 113 Winter 2013 Prof. Church Midterm Solutions

Understand the vocabulary used to describe polynomials Add polynomials Subtract polynomials Graph equations defined by polynomials of degree 2

Math 314 Lecture Notes Section 006 Fall 2006

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

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

MAT Linear Algebra Collection of sample exams

Math 24 Spring 2012 Sample Homework Solutions Week 8

Math 344 Lecture # Linear Systems

Solutions for Math 225 Assignment #5 1

MATH 315 Linear Algebra Homework #1 Assigned: August 20, 2018

LECTURE 7: LINEAR TRANSFORMATION (CHAPTER 4 IN THE BOOK)

Abstract Vector Spaces and Concrete Examples

Math 118, Fall 2014 Final Exam

Math 224, Fall 2007 Exam 3 Thursday, December 6, 2007

MATH 33A LECTURE 3 PRACTICE MIDTERM I

Homework Solutions Week of November = 1(1) + 0(x 1) + 0(x 1) 2 x = 1(1) + 1(x 1) + 0(x 1) 2 x 2 = 1(1) + 2(x 1) + 1(x 1) 2

NORMS ON SPACE OF MATRICES

Linear Algebra (MATH ) Spring 2011 Final Exam Practice Problem Solutions

CSL361 Problem set 4: Basic linear algebra

We showed that adding a vector to a basis produces a linearly dependent set of vectors; more is true.

MAT224 Practice Exercises - Week 7.5 Fall Comments

Math 110 Answers for Homework 6

A = u + V. u + (0) = u

1. General Vector Spaces

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

1.1 Limits and Continuity. Precise definition of a limit and limit laws. Squeeze Theorem. Intermediate Value Theorem. Extreme Value Theorem.

Rank, Nullity, Dimension and Elimination

Review (11.1) 1. A sequence is an infinite list of numbers {a n } n=1 = a 1, a 2, a 3, The sequence is said to converge if lim

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

The Four Fundamental Subspaces

Linear Algebra. Session 8

MA441: Algebraic Structures I. Lecture 26

MAT 242 CHAPTER 4: SUBSPACES OF R n

New concepts: rank-nullity theorem Inverse matrix Gauss-Jordan algorithm to nd inverse

Math 4310 Solutions to homework 7 Due 10/27/16

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

Transcription:

Section 6.2: THE KERNEL AND RANGE OF A LINEAR TRANSFORMATIONS When you are done with your homework you should be able to Find the kernel of a linear transformation Find a basis for the range, the rank, and the nullity of a linear transformation Determine whether a linear transformation is one-to-one or onto Determine whether vector spaces are isomorphic THE KERNEL OF A LINEAR TRANSFORMATION We know from Theorem 6.1 that for any linear transformation, the zero vector in maps to the vector in. That is,. In this section, we will consider whether there are other vectors such that. The collection of all such is called the of. Note that the zero vector is denoted by the symbol in both and, even though these two zero vectors are often different. DEFINITION OF KERNEL OF A LINEAR TRANSFORMATION W be a linear transformation. Then the set of all vectors v in V that satisfy is called the of T and is denoted by. CREATED BY SHANNON MARTIN GRACEY 166

Example 1: Find the kernel of the linear transformation. a. T : R 3 R 3, T x, y, z x, 0, z T : P P, T a a x a x a x a 2a x 3a x 2 3 2 3 2 0 1 2 3 1 2 3 b. c. T : P R, 2 1 T p p x dx 0 CREATED BY SHANNON MARTIN GRACEY 167

THEOREM 6.3: THE KERNEL IS A SUBSPACE OF V The kernel of a linear transformation T : V Proof: W is a subspace of the domain V. THEOREM 6.3: COROLLARY n Let T : R R m be the linear transformation given by T x Ax. Then the kernel of T is equal to the solution space of. THEOREM 6.4: THE RANGE OF T IS A SUBSPACE OF W The range of a linear transformation T : V W is a subspace of W. CREATED BY SHANNON MARTIN GRACEY 168

THEOREM 6.4: COROLLARY n Let T : R R m be the linear transformation given by T x Ax. Then the Column space of is equal to the of. Example 2: Let T v for the kernel of T and the range of T. Av represent the linear transformation T. Find a basis A 1 1 1 2 0 1 CREATED BY SHANNON MARTIN GRACEY 169

DEFINITION OF RANK AND NULLITY OF A LINEAR TRANSFORMATION W be a linear transformation. The dimension of the kernel of T is called the of T and is denoted by. The dimension of the range of T is called the of T and is denoted by. THEOREM 6.5: SUM OF RANK AND NULLITY W be a linear transformation from an n-dimensional vector space V into a vector space W. Then the of the of the and is equal to the dimension of the. That is, Proof: CREATED BY SHANNON MARTIN GRACEY 170

Example 3: Define the linear transformation T by nullity T, range T, and rank T. T x Ax. Find ker T, A 3 2 6 1 15 4 3 8 10 14 2 3 4 4 20 CREATED BY SHANNON MARTIN GRACEY 171

3 3 Example 4: Let T : R R be a linear transformation. Use the given information to find the nullity of T and give a geometric description of the kernel and range of T. T is the reflection through the yz-coordinate plane:,,,, T x y z x y z ONE-TO-ONE AND ONTO LINEAR TRANSFORMATIONS If the vector is the only vector such that, then is. A function is called one-to-one when the of every in the range consists of a vector. This is equivalent to saying that is one-to-one if and only if, for all and in, implies that. CREATED BY SHANNON MARTIN GRACEY 172

THEOREM 6.6: ONE-TO-ONE LINEAR TRANSFORMATIONS W be a linear transformation. Then T is one-to-one if and only if. Proof: THEOREM 6.7: LINEAR TRANSFORMATIONS W be a linear transformation, where W is finite dimensional. Then T is onto if and only if the of T is equal to the of W. Proof: CREATED BY SHANNON MARTIN GRACEY 173

THEOREM 6.8: ONE-TO-ONE AND ONTO LINEAR TRANSFORMATIONS W be a linear transformation with vector spaces V and W, of dimension n. Then T is one-to-one if and only if it is. Example 5: Determine whether the linear transformation is one-to-one, onto, or neither. 2 2 T : R R, T x, y T x y, y x CREATED BY SHANNON MARTIN GRACEY 174

DEFINITION: ISOMORPHISM A linear transformation T : V W that is and is called an. Moreover, if V and W are vector spaces such that there exists an isomorphism from V to W, then V and W are said to be to each other. THEOREM 6.9: ISOMORPHIC SPACES AND DIMENSION Two finite dimensional vector spaces V and W are if and only if they are of the same. Example 6: Determine a relationship among m, n, j, and k such that M m, n is isomorphic to M j, k. CREATED BY SHANNON MARTIN GRACEY 175