8.4 Matrices of General Linear Transformations

Slides:



Advertisements
Similar presentations
10.4 Complex Vector Spaces.
Advertisements

5.4 Basis And Dimension.
Rules of Matrix Arithmetic
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.
Applied Informatics Štefan BEREŽNÝ
Chapter 6 Eigenvalues and Eigenvectors
6.1 Eigenvalues and Diagonalization. Definitions A is n x n. is an eigenvalue of A if AX = X has non zero solutions X (called eigenvectors) If is an eigenvalue.
Eigenvalues and Eigenvectors
Eigenvalues and Eigenvectors
Symmetric Matrices and Quadratic Forms
Chapter 5 Orthogonality
Chapter 6 Eigenvalues.
Elementary Linear Algebra Anton & Rorres, 9 th Edition Lecture Set – 08 Chapter 8: Linear Transformations.
Matrix Algebra THE INVERSE OF A MATRIX © 2012 Pearson Education, Inc.
5 5.1 © 2012 Pearson Education, Inc. Eigenvalues and Eigenvectors EIGENVECTORS AND EIGENVALUES.
Boot Camp in Linear Algebra Joel Barajas Karla L Caballero University of California Silicon Valley Center October 8th, 2008.
5.1 Orthogonality.
Linear Algebra Review 1 CS479/679 Pattern Recognition Dr. George Bebis.
1 February 24 Matrices 3.2 Matrices; Row reduction Standard form of a set of linear equations: Chapter 3 Linear Algebra Matrix of coefficients: Augmented.
Chapter 4 Chapter Content
Elementary Linear Algebra Anton & Rorres, 9th Edition
Eigenvalues and Eigenvectors
Digital Image Processing, 3rd ed. © 1992–2008 R. C. Gonzalez & R. E. Woods Gonzalez & Woods Matrices and Vectors Objective.
Chapter Content Real Vector Spaces Subspaces Linear Independence
Matrices CHAPTER 8.1 ~ 8.8. Ch _2 Contents  8.1 Matrix Algebra 8.1 Matrix Algebra  8.2 Systems of Linear Algebra Equations 8.2 Systems of Linear.
Matrices. Definitions  A matrix is an m x n array of scalars, arranged conceptually as m rows and n columns.  m is referred to as the row dimension.
Chap. 6 Linear Transformations
Linear algebra: matrix Eigen-value Problems
Domain Range definition: T is a linear transformation, EIGENVECTOR EIGENVALUE.
Computing Eigen Information for Small Matrices The eigen equation can be rearranged as follows: Ax = x  Ax = I n x  Ax - I n x = 0  (A - I n )x = 0.
5 5.2 © 2012 Pearson Education, Inc. Eigenvalues and Eigenvectors THE CHARACTERISTIC EQUATION.
Chapter 5 Eigenvalues and Eigenvectors 大葉大學 資訊工程系 黃鈴玲 Linear Algebra.
Elementary Linear Algebra Anton & Rorres, 9th Edition
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.
Elementary Linear Algebra Anton & Rorres, 9 th Edition Lecture Set – 02 Chapter 2: Determinants.
Eigenvectors and Linear Transformations Recall the definition of similar matrices: Let A and C be n  n matrices. We say that A is similar to C in case.
Diagonalization and Similar Matrices In Section 4.2 we showed how to compute eigenpairs (,p) of a matrix A by determining the roots of the characteristic.
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.
8.5 Similarity. SIMILARITY The matrix of a linear operator T:V V depends on the basis selected for V that makes the matrix for T as simple as possible.
Chap. 4 Vector Spaces 4.1 Vectors in Rn 4.2 Vector Spaces
Elementary Linear Algebra Anton & Rorres, 9 th Edition Lecture Set – 07 Chapter 7: Eigenvalues, Eigenvectors.
8.4 Matrices of General Linear Transformations. V and W are n and m dimensional vector space and B and B ’ are bases for V and W. then for x in V, the.
5.1 Eigenvectors and Eigenvalues 5. Eigenvalues and Eigenvectors.
Elementary Linear Algebra Anton & Rorres, 9th Edition
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.
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.
1 Chapter 8 – Symmetric Matrices and Quadratic Forms Outline 8.1 Symmetric Matrices 8.2Quardratic Forms 8.3Singular ValuesSymmetric MatricesQuardratic.
5 5.1 © 2016 Pearson Education, Ltd. Eigenvalues and Eigenvectors EIGENVECTORS AND EIGENVALUES.
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.
Section 4.3 Properties of Linear Transformations from R n to R m.
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.
Boot Camp in Linear Algebra TIM 209 Prof. Ram Akella.
1 Objective To provide background material in support of topics in Digital Image Processing that are based on matrices and/or vectors. Review Matrices.
Graphics Graphics Korea University kucg.korea.ac.kr Mathematics for Computer Graphics 고려대학교 컴퓨터 그래픽스 연구실.
Elementary Linear Algebra Anton & Rorres, 9th Edition
Eigenvalues and Eigenvectors
Symmetric Matrices and Quadratic Forms
Elementary Linear Algebra Anton & Rorres, 9th Edition
EIGENVECTORS AND EIGENVALUES
Elementary Linear Algebra Anton & Rorres, 9th Edition
Eigenvalues and Eigenvectors
Eigenvectors and Eigenvalues
Chapter 2 Determinants.
Linear Algebra Lecture 28.
Eigenvalues and Eigenvectors
Symmetric Matrices and Quadratic Forms
Presentation transcript:

8.4 Matrices of General Linear Transformations

V and W are n and m dimensional vector space and B and B’ are bases for V and W . then for x in V , the coordinate matrix [x]B will be a vector in Rn, and Coordinate matrix [T(x)] B’ will be a vector in Rm

Matrices of Linear Transformations If we let A be the standard matrix for this transformation then A[x]B=[T (x)]B ‘ (1) The matrix A in (1) is called the matrix for T with respect to the bases B and B’

Matrices of Linear Transformations Let B ={u1,u2,…un} be a basis space W. A= , so that (1) holds for all vector x in V. A[u1]B=[T (u1)]B’ ,A [u2]B=[T (u2)]B’… A[un]B=[T (un)]B’ (2)

Matrices of Linear Transformations =[T (u1)]B’, =[T (u2)]B’,… =[T (un)]B’ which shows that the successive columns of A are the Coordinate matrices of T (u1),T (u2),…. ,T (un) with Respect to the basis B ’ . A=[[T (u1)]B’| [T (u2)]B’|……. [T (un)]B’] (3)

Matrices of Linear Transformations This matrix is commonly denoted by the symbol [T ]B’.B,so that the preceding formula can also be written as [T ]B’.B = [[T (u1)]B’| [T (u2)]B’|……. [T (un)]B’] (4) and from (1) this matrix has the property [T ]B’.B[x]B=[T (x)]B’ (4a)

Matrices of Linear Operators In the special case where V = W , it is usual to take B = B’ when constructing a matrix for T. In this case The resulting matrix is called the matrix for T with respect to the basis B. [T ]B’.B = [[T (u1)]B| [T (u2)]B|……. [T (un)]B] (5) [T ]B [x]B= [T (x)]B (5a)

Example 1 Let T :P1 -> P2 be the transformations defined by T (p(x)) = xp(x).Find the matrix for T with respect to the standard bases,B={u1,u2} and B’={v1,v2,v3} where u1=1 , u2=x ; v1=1 , v2=x ,v3=x2 Solution: T (u1)=T (1)=(x)(1)=x T (u2)=T (x)=(x)(x)=x2

Example 1(Cont.) [T (u1)]B’= [T (u2)]B’= Thus,the matrix for T with respect to B and B’ is [T ]B’.B = [[T (u1)]B’| [T (u2)]B] =

Example 3 Let T :R2 -> R3 be the linear transformation defined by Find the matrix for the transformation T with respect to the base B = {u1,u2} for R2 and B’ ={v1,v2,v3} for R3,where

Example 3(Cont) u1= u2= v1= v2= v3= Solution: From the formula for T T (u1) = T (u2) =

Example 3(Cont) Expressing these vector as linear combination of v1,v2 and v3 we obtain T (u1)=v1-2v3 T (u2)=3v1+v2- v3 Thus [T (u1)]B’= [T (u2)]B’= [T ]B’.B = [[T (u1)]B’| [T (u2)]B] =

Theorem 8.4.1 If T:Rn -> Rm is a linear transformation and if B and B’ are the standard bases for Rn and Rm respecively then [T]B’,B = [T]

Example 6 Let T :P2 -> P2 be linear operator defined by T (p (x))=p (3x-5),that is, T (co+c1x+c2x2)= co+c1(3x-5)+c2(3x-5)2 (a)Find [T ]B with respect to the basis B ={1,x,x2} (b)Use the indirect procedure to compute T (1+2x+3x2) (c)Check the result in (b) by computing T (1+2x+3x2)

Example 6(Cont.) Solution(a): Form the formula for T then T (1)=1,T (x)=3x-5,T (x2)=(3x-5)2=9x2-30x+25 Thus, [T ]B=

Example 6(Cont.) Solution(b): The coordinate matrix relative to B for vector p =1+2x+3x2 is [p]B = .Thus from(5a) [T (1+2x+3x2 )]B =[T (p)]B = [T ]B [p]B = = T (1+2x+3x2 )=66-84x+27x2

Example 6(Cont.) Solution(c): By direct computation T (1+2x+3x2 )=1+2(3x-5)+3(3x-5)2 =1+6x-10+27x2-90x+75 =66-84x+27x2

Theorem 8.4.2 If T1:U -> V and T2:V -> W are linear transformation and if B, Bn and B’ are bases for U,V and W respectively then [T2 0 T1]B,B’ = [T2 ]B’,B’’[T1 ]B’’,B

Theorem 8.4.3 If T:V -> V is a linear operator and if B is a basis for V then the following are equivalent (a)T is one to one (b)[T]B is invertible conditions hold [T-1]B = [T]B-1

8.5 Similarity

SIMILARITY The matrix of a linear operator T:V V depends on the basis selected for V that makes the matrix for T as simple as possible a diagonal or triangular or triangular matrix.

Simple Matrices for Linear Operators For example,consider the linear operator T: defined by (1) And the standard basis B= for ,where , The matrix for T with respect to this basis is the standard matrix for T :that is,

Simple Matrices for Linear Operators (cont.) Form (1), , so (2) In comparison, we showed in Example 4 of Section8.4 that if (3) Then the matrix for T with respect to the basis is the diagonal matrix (4) This matrix is “simpler”than (2)in the sense that diagonal matrices enjoy special properties that more general matrices do not.

Theorem 8.5.1 If B and B’ are bases for a finite-dimensional vector space V, and if I:V V is the identity operator,then is the transition matrix from B’ to B. Proof. Suppose that B= are bases for V. Using the fact that I(v)=v for all v in V , it follows from Formula(4) of Section 8.4 with B and B’ reversed that Thus, from(5),we have ,which shows that is the transition matrix from B’ to B.

Theorem 8.5.1 Proof(cont.) The result in this theorem is illustrated in Figure8.5.1 I V V v v Basis=B’ Basis=B Problem: If B and B’are two bases for a finite-dimensional vector space V,and if T:V V is a linear operator,what relationship,if any,exists between the matrices and I T I v v T(v) T(v) V V V V Basis=B’ Basis=B Basis=B Basis=B’

Theorem 8.5.2 Let T:V V be a linear operator on a finite-dimensional vector space V,and let B and B’ be bases for V. Then Where P is the transition matrix from B’ to B] Warning. The interior subscripts are the same The exterior subscripts are the same

EXAMPLE 1 Using Theorem 8.5.2 Let T: be defined by Find the matrix of T with respect to the standard basis B= for then use Theorem8.5.2 to find the matrix of T with respect to the basis where and

EXAMPLE 1 Using Theorem 8.5.2(cont.) Solution: By inspection so that and

Definition If A and B are square matrices,we say that B is similar to A if there is an invertible matrix P such that B= Similarity Invariants Similar matrices often have properties in common;for example,if A and B are similar matrices,then A and B have the same determinant.To see that this is so,suppose that B=

Definition A property of square matrices is said to be a similarity invariant or invariant under similarity if that property is shared by any two simlar matrices. Property Description Determinant A and have the same determinant. Invertibility A is invertible if and only if is invertible. Rank A and have the same rank. Nullity A and have the same nullity.

Definition(cont.) Trace A and have the same trace. Characteristic polynomial A and have the same characteristic polynomial. Eigenvalues A and have the same eigenvalues Eigenspcae dimension If is an eigenvalue of A and then the eigenspcae of A corresponding to and the eigenspcae of corresponding to have the same dimension.

EXAMPLE 2 Determinant of a Linear Operator Let T: be defined by Find det(T). Solution so det(T) Had we chosen the basis of example1,then we would have obtained

EXAMPLE3 Reflection About a Line Let l be the line in the xy-plane that through the origin and makes an angle with the positive x-axis, where .As illustrated in Figure 8.5.4,let T: be the linear operator that maps each vector into its reflection about the line l. (a)Find the standard matrix for T. (b)Find the reflection of the vector x =(1,2)about the line l through the origin that makes an angle of with the positive x-axis.

EXAMPLE3 Reflection About a Line(cont.) Solution(a) Instead of finding directly,we shall first find the matrix ,where so and Thus, ,

EXAMPLE3 Reflection About a Line(cont.) Solution(b).It follow from part(a)that the formula for T in matrix notation is Substituting in this formula yields So Thus,

Eigenvalues of a Linear Operator Eigenvectors and eigenvalues can be defined for linear operators as well as matrices.A scalar is called an eigenvalue of a linear operator T:V V if there is a nonzero vector x in V such that .The vector x is called an eigenvector of T corresponding to . Equivalently,the eigenvectors of T corresponding to are the nonzero vectors in the kernel of I-T.this kernel is called the eigenspcae of T corresponding to . 1.The eigenvalues of T are the same as the eigenvalues of . 2.A vector x is an eigenvector of T corresponding to if and only if its corrdinate matrix is an eigenvector of corresponding to .

EXAMPLE4 Eigenvalues and Bases for Eigenspaces Find the eigenvalues and bases for the eigenvalues of the linear operator defined by

EXAMPLE4 (cont.) Eigenvalues and Bases for Eigenspaces Solution The matrix for T with respect to the standard basis is T are and , corresponding to has the basis where

EXAMPLE5 Diagonal Matrix for a Linear Operator Let T= be the linear operator given by Find a basis for relative to which the matrix for T is diagonal.

EXAMPLE5 (cont.) Diagonal Matrix for a Linear Operator Solution(1/3) If denotes the standard basis for ,then So that the standard matrix for T is (13) Let P be the transition matrix from the unknown basis B’to the standard basis B, ,will be related by

EXAMPLE5 (cont.) Diagonal Matrix for a Linear Operator Solution (2/3) We found that the matrix in (13)is diagonalized by The basis to the standard basis the columns of P are and so that

EXAMPLE5 (cont.) Diagonal Matrix for a Linear Operator Solution (3/3) From the given formula for T we have So that Thus