8.2 Kernel And Range.

Slides:



Advertisements
Similar presentations
Vector Spaces A set V is called a vector space over a set K denoted V(K) if is an Abelian group, is a field, and For every element vV and K there exists.
Advertisements

5.4 Basis And Dimension.
8.4 Matrices of General Linear Transformations
Chapter 4 Euclidean Vector Spaces
6.4 Best Approximation; Least Squares
8.3 Inverse Linear Transformations
Chapter 3: Linear transformations
5.3 Linear Independence.
Elementary Linear Algebra Anton & Rorres, 9th Edition
Eigenvalues and Eigenvectors
THE DIMENSION OF A VECTOR SPACE
3.II. Homomorphisms 3.II.1. Definition 3.II.2. Range Space and Nullspace.
3.V.1. Changing Representations of Vectors 3.V.2. Changing Map Representations 3.V. Change of Basis.
Class 25: Question 1 Which of the following vectors is orthogonal to the row space of A?
Elementary Linear Algebra Anton & Rorres, 9 th Edition Lecture Set – 08 Chapter 8: Linear Transformations.
Subspaces, Basis, Dimension, Rank
Chapter 6 Linear Transformations
Functions of several variables. Function, Domain and Range.
6.1 Introduction to Linear Transformations
4 4.2 © 2012 Pearson Education, Inc. Vector Spaces NULL SPACES, COLUMN SPACES, AND LINEAR TRANSFORMATIONS.
Sections 1.8/1.9: Linear Transformations
4 4.4 © 2012 Pearson Education, Inc. Vector Spaces COORDINATE SYSTEMS.
Vectors in R n a sequence of n real number An ordered n-tuple: the set of all ordered n-tuple  n-space: R n Notes: (1) An n-tuple can be viewed.
Section 4.1 Vectors in ℝ n. ℝ n Vectors Vector addition Scalar multiplication.
Chapter 3 Vector Spaces. The operations of addition and scalar multiplication are used in many contexts in mathematics. Regardless of the context, however,
Chapter Content Real Vector Spaces Subspaces Linear Independence
Page 146 Chapter 3 True False Questions. 1. The image of a 3x4 matrix is a subspace of R 4 ? False. It is a subspace of R 3.
Chap. 6 Linear Transformations
Chapter 5 Eigenvalues and Eigenvectors 大葉大學 資訊工程系 黃鈴玲 Linear Algebra.
Elementary Linear Algebra Anton & Rorres, 9th Edition
Introductions to Linear Transformations Function T that maps a vector space V into a vector space W: V: the domain of T W: the codomain of T Chapter.
1 Chapter 3 – Subspaces of R n and Their Dimension Outline 3.1 Image and Kernel of a Linear Transformation 3.2 Subspaces of R n ; Bases and Linear Independence.
Chapter 4 Linear Transformations 4.1 Introduction to Linear Transformations 4.2 The Kernel and Range of a Linear Transformation 4.3 Matrices for Linear.
5.5 Row Space, Column Space, and Nullspace
Chapter 4 – Linear Spaces
Chap. 5 Inner Product Spaces 5.1 Length and Dot Product in R n 5.2 Inner Product Spaces 5.3 Orthonormal Bases: Gram-Schmidt Process 5.4 Mathematical Models.
4 © 2012 Pearson Education, Inc. Vector Spaces 4.4 COORDINATE SYSTEMS.
2 2.9 © 2016 Pearson Education, Inc. Matrix Algebra DIMENSION AND RANK.
Elementary Linear Algebra Anton & Rorres, 9 th Edition Lecture Set – 07 Chapter 7: Eigenvalues, Eigenvectors.
Class 24: Question 1 Which of the following set of vectors is not an orthogonal set?
click to start Example: A LINEAR TRANSFORMATION.
4.3 Linearly Independent Sets; Bases
Ch 6 Vector Spaces. Vector Space Axioms X,Y,Z elements of  and α, β elements of  Def of vector addition Def of multiplication of scalar and vector These.
4.8 Rank Rank enables one to relate matrices to vectors, and vice versa. Definition Let A be an m  n matrix. The rows of A may be viewed as row vectors.
Chapter 4 Chapter Content 1. Real Vector Spaces 2. Subspaces 3. Linear Independence 4. Basis 5.Dimension 6. Row Space, Column Space, and Nullspace 8.Rank.
Chapter 6- LINEAR MAPPINGS LECTURE 8 Prof. Dr. Zafer ASLAN.
4 4.5 © 2016 Pearson Education, Inc. Vector Spaces THE DIMENSION OF A VECTOR SPACE.
Chapter 5 Chapter Content 1. Real Vector Spaces 2. Subspaces 3. Linear Independence 4. Basis and Dimension 5. Row Space, Column Space, and Nullspace 6.
Chapter 4 Linear Transformations 4.1 Introduction to Linear Transformations 4.2 The Kernel and Range of a Linear Transformation 4.3 Matrices for Linear.
 Matrix Operations  Inverse of a Matrix  Characteristics of Invertible Matrices …
Eigenvalues and Eigenvectors
8.2 Kernel And Range.
Eigenvalues and Eigenvectors
8.3 Inverse Linear Transformations
MATH 1046 Introduction to Linear Transformations (Section 3.6)
Linear Transformations
Section 1.8: Introduction to Linear Transformations.
Elementary Linear Algebra
Linear Algebra Lecture 21.
Theorems about LINEAR MAPPINGS.
Elementary Linear Algebra
Elementary Linear Algebra
Linear Algebra Lecture 20.
Chapter 4 Linear Transformations
Eigenvalues and Eigenvectors
THE DIMENSION OF A VECTOR SPACE
Elementary Linear Algebra Anton & Rorres, 9th Edition
Null Spaces, Column Spaces, and Linear Transformations
NULL SPACES, COLUMN SPACES, AND LINEAR TRANSFORMATIONS
Eigenvalues and Eigenvectors
Presentation transcript:

8.2 Kernel And Range

Definition ker(T ): the kernel of T If T:V→W is a linear transformation, then the set of vectors in V that T maps into 0 R (T ): the range of T The set of all vectors in W that are images under T of at least one vector in V

Example 1 Kernel and Range of a Matrix Transformation If TA :Rn →Rm is multiplication by the m×n matrix A, then from the discussion preceding the definition above, the kernel of TA is the nullspace of A the range of TA is the column space of A

Example 2 Kernel and Range of the Zero Transformation Let T:V→W be the zero transformation. Since T maps every vector in V into 0, it follows that ker(T ) = V. Moreover, since 0 is the only image under T of vectors in V, we have R (T ) = {0}.

Example 3 Kernel and Range of the Identity Operator Let I:V→V be the identity operator. Since I (v) = v for all vectors in V, every vector in V is the image of some vector; thus, R(I ) = V. Since the only vector that I maps into 0 is 0, it follows that ker(I ) = {0}.

Example 6 Kernel of a Differentiation Transformation Let V= C1 (-∞,∞) be the vector space of functions with continuous first derivatives on (-∞,∞) , let W = F (-∞,∞) be the vector space of all real-valued functions defined on (-∞,∞) , and let D:V→W be the differentiation transformation D (f) = f’(x). The kernel of D is the set of functions in V with derivative zero. From calculus, this is the set of constant functions on (-∞,∞) .

Theorem 8.2.1 If T:V→W is linear transformation, then: The kernel of T is a subspace of V. The range of T is a subspace of W.

Proof (a). Let v1 and v2 be vectors in ker(T ), and let k be any scalar. Then T (v1 + v2) = T (v1) + T (v2) = 0+0 = 0 so that v1 + v2 is in ker(T ). Also, T (k v1) = kT (v1) = k 0 = 0 so that k v1 is in ker(T ).

Proof (b). Let w1 and w2 be vectors in the range of T , and let k be any scalar. There are vectors a1 and a2 in V such that T (a1) = w1 and T(a2) = w2 . Let a = a1 + a2 and b = k a1 . Then T (a) = T (a1 + a2) = T (a1) + T (a2) = w1 + w2 and T (b) = T (k a1) = kT (a1) = k w1

Definition rank (T): the rank of T If T:V→W is a linear transformation, then the dimension of tha range of T is the rank of T . nullity (T): the nullity of T the dimension of the kernel is the nullity of T.

Theorem 8.2.2 If A is an m×n matrix and TA :Rn →Rm is multiplication by A , then: nullity (TA ) = nullity (A ) rank (TA ) = rank (A )

Example 7 Finding Rank and Nullity Let TA :R6 →R4 be multiplication by A= Find the rank and nullity of TA

Solution. In Example 1 of Section 5.6 we showed that rank (A ) = 2 and nullity (A ) = 4. Thus, from Theorem 8.2.2 we have rank (TA ) = 2 and nullity (TA ) = 4.

Example 8 Finding Rank and Nullity Let T: R3 →R3 given by T(x,y,z)=(x,y,0) the kernel of T is the z-axis, That is ker(T)={(0,0,z):zϵR} which is one-dimensional; and the range of T is the xy-plane, which is two-dimensional. Thus, nullity (T ) = 1 and rank (T ) = 2

Dimension Theorem for Linear Transformations If T:V→W is a linear transformation from an n-dimensional vector space V to a vector space W, then rank (T ) + nullity (T ) = n In words, this theorem states that for linear transformations the rank plus the nullity is equal to the dimension of the domain.

Example 9 Using the Dimension Theorem Let T: R2 →R2 be the linear operator that rotates each vector in the xy-plane through an angle θ . We showed in Example 5 that ker(T ) = {0} and R (T ) = R2 .Thus, rank (T ) + nullity (T ) = 2 + 0 = 2 Which is consistent with the fact thar the domain of T is two-dimensional.