8.3 Inverse Linear Transformations

Slides:



Advertisements
Similar presentations
5.4 Basis And Dimension.
Advertisements

5.1 Real Vector Spaces.
Chapter 4 Euclidean Vector Spaces
6.4 Best Approximation; Least Squares
8.3 Inverse Linear Transformations
8.2 Kernel And Range.
Chapter 3: Linear transformations
1.5 Elementary Matrices and a Method for Finding
Dimension of a Vector Space (11/9/05) Theorem. If the vector space V has a basis consisting of n vectors, then any set of more than n vectors in V must.
Matrices and Systems of Equations
Ch 7.3: Systems of Linear Equations, Linear Independence, Eigenvalues
Coordinate Systems (11/4/05) It turns out that every vector space V which has a finite basis can be “realized” as one of the spaces R n as soon as we pick.
Elementary Linear Algebra Anton & Rorres, 9 th Edition Lecture Set – 08 Chapter 8: Linear Transformations.
Subspaces, Basis, Dimension, Rank
Boyce/DiPrima 9th ed, Ch 7.3: Systems of Linear Equations, Linear Independence, Eigenvalues Elementary Differential Equations and Boundary Value Problems,
Sullivan PreCalculus Section 4.2 Inverse Functions
Linear Algebra Lecture 25.
Elementary Linear Algebra Anton & Rorres, 9th Edition
Sections 1.8/1.9: Linear Transformations
4 4.4 © 2012 Pearson Education, Inc. Vector Spaces COORDINATE SYSTEMS.
Section 4.1 Vectors in ℝ n. ℝ n Vectors Vector addition Scalar multiplication.
A matrix equation has the same solution set as the vector equation which has the same solution set as the linear system whose augmented matrix is Therefore:
Chapter 8 With Question/Answer Animations 1. Chapter Summary Applications of Recurrence Relations Solving Linear Recurrence Relations Homogeneous Recurrence.
Chapter Content Real Vector Spaces Subspaces Linear Independence
Section 1.5 Elementary Matrices and a Method for Finding A −1.
Chap. 6 Linear Transformations
Elementary Linear Algebra Anton & Rorres, 9th Edition
1 MAC 2103 Module 7 Euclidean Vector Spaces II. 2 Rev.F09 Learning Objectives Upon completing this module, you should be able to: 1. Determine if a linear.
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
4 © 2012 Pearson Education, Inc. Vector Spaces 4.4 COORDINATE SYSTEMS.
Chap. 4 Vector Spaces 4.1 Vectors in Rn 4.2 Vector Spaces
Chapter 4 Euclidean n-Space Linear Transformations from to Properties of Linear Transformations to Linear Transformations and Polynomials.
Properties of Inverse Matrices King Saud University.
Section 4.3 Polynomial Division; The Remainder and Factor Theorems Copyright ©2013, 2009, 2006, 2001 Pearson Education, Inc.
A function is a rule f that associates with each element in a set A one and only one element in a set B. If f associates the element b with the element.
Chapter 6- LINEAR MAPPINGS LECTURE 8 Prof. Dr. Zafer ASLAN.
Section 4.3 Properties of Linear Transformations from R n to R m.
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 …
8.1 General Linear Transformation
Dividing Polynomials A review of long division:
8.2 Kernel And Range.
Elementary Linear Algebra Anton & Rorres, 9th Edition
1.6 Further Results on Systems
Systems of First Order Linear Equations
Polynomial Division; The Remainder Theorem and Factor Theorem
MATH 1046 Introduction to Linear Transformations (Section 3.6)
Linear Transformations
Elementary Linear Algebra
4.6: Rank.
Boyce/DiPrima 10th ed, Ch 7.3: Systems of Linear Equations, Linear Independence, Eigenvalues Elementary Differential Equations and Boundary Value Problems,
Linear Algebra Lecture 37.
Sullivan Algebra and Trigonometry: Section 6.1
Determinants CHANGE OF BASIS © 2016 Pearson Education, Inc.
Linear Algebra Lecture 21.
Elementary Linear Algebra
Elementary Linear Algebra Anton & Rorres, 9th Edition
Elementary Linear Algebra Anton & Rorres, 9th Edition
Elementary Linear Algebra Anton & Rorres, 9th Edition
Vector Spaces 1 Vectors in Rn 2 Vector Spaces
Chapter 4 Linear Transformations
Eigenvalues and Eigenvectors
Vector Spaces RANK © 2012 Pearson Education, Inc..
THE DIMENSION OF A VECTOR SPACE
NULL SPACES, COLUMN SPACES, AND LINEAR TRANSFORMATIONS
Vector Spaces COORDINATE SYSTEMS © 2012 Pearson Education, Inc.
Presentation transcript:

8.3 Inverse Linear Transformations

Definition one-to-one A linear transformation T:V→W is said to be one-to-one if T maps distinct vectors in V into distinct vectors in W .

Example 1 A One-to-One Linear Transformation Recall from Theorem 4.3.1 that if A is an n×n matrix and TA :Rn→Rn is multiplication by A , then TA is one-to-one if and only if A is an invertible matrix.

Example 2 A One-to-One Linear Transformation Let T: Pn → Pn+1 be the linear transformation T (p) = T(p(x)) = xp(x) Discussed in Example 8 of Section 8.1. If p = p(x) = c0 + c1 x +…+ cn xn and q = q(x) = d0 + d1 x +…+ dn xn are distinct polynomials, then they differ in at least one coefficient. Thus, T(p) = c0 x + c1 x2 +…+ cn xn+1 and T(q) = d0 x + d1 x2 +…+ dn xn+1 Also differ in at least one coefficient. Thus, since it maps distinct polynomials p and q into distinct polynomials T (p) and T (q).

Example 3 A Transformation That Is Not One-to-One Let D: C1(-∞,∞) → F (-∞,∞) be the differentiation transformation discussed in Example 11 of Section 8.1. This linear transformation is not one-to-one because it maps functions that differ by a constant into the same function. For example, D(x2) = D(xn +1) = 2x

Equivalent Statements Theorem 8.3.1 If T:V→W is a linear transformation, then the following are equivalent. T is one-to-one The kernel of T contains only zero vector; that is , ker(T) = {0} Nullity (T) = 0

Theorem 8.3.2 If V is a finite-dimensional vector space and T:V ->V is a linear operator then the following are equivalent. (a)T is one to one (b) ker(T) = {0} (c)nullity(T) = 0 (d)The range of T is V;that is ,R(T) =V

Example 5 Let T A:R 4 -> R 4 be multiplication by A= Determine whether T A is one to one.

Example 5(Cont.) Solution: det(A)=0,since the first two rows of A are proportional and consequently A I is not invertible.Thus, T A is not one to one.

Inverse Linear Transformations If T :V -> W is a linear transformation, denoted by R (T ),is the subspace of W consisting of all images under T of vector in V. If T is one to one,then each vector w in R(T ) is the image of a unique vector v in V.

Inverse Linear Transformations This uniqueness allows us to define a new function,call the inverse of T. denoted by T –1.which maps w back into v(Fig 8.3.1).

Inverse Linear Transformations T –1:R (T ) -> V is a linear transformation. Moreover,it follows from the defined of T –1 that T –1(T (v)) = T –1(w) = v (2a) T –1(T (w)) = T –1(v) = w (2b) so that T and T –1,when applied in succession in either the effect of one another.

Example 7 Let T :R 3 ->R 3 be the linear operator defined by the formula T (x1,x2,x3)=(3x1+x2,-2x1-4x2+3x3,5x1+4 x2-2x3) Solution: [T ]= ,then[T ]-1=

Example 7(Cont.) T –1 =[T –1] = = Expressing this result in horizontal notation yields T –1(X1,X2,X3)=(4X1-2X2-3X3,-11X1+6X2+9X3,-12X1+7X2+10X3)

Theorem 8.3.3 If T1:U->V and T2:V->W are one to one linear transformation then: (a)T2 0 T1 is one to one (b) (T2 0 T1)-1 = T1-1 0 T2-1

Exercise Set 8.3 Question 1

Exercise Set 83 Question 3

Exercise Set 8.3 Question 7

Exercise Set 8.3 Question 12

Exercise Set 8.3 Question 19

Exercise Set 8.3 Question 25