"

Section 2.6 Linear Transformations

 

Definition: A transformation (or mapping) T is linear if

(1) T(u+v)=T(u)+T(v) for all u,v in the domain of T.

 

(2) T(cu)=cT(u) for all scalars c and all u in the domain of T.

 

Fact: 1. Linear transformations preserve the operations of vector addition and scalar multiplication.

2. If T is a linear transformation, then T(0)=0 and T(cu+dv)=cT(u)+dT(v).

 

3. If a transformation satisfies T(cu+dv)=cT(u)+dT(v) for all u,v in the domain of T then it must be linear.

 

 

Theorem: If T is a linear transformation then T(c1v1++cpvp)=c1T(v1)++cpT(vp) for v1,,vp in the domain of T. We call this equality superposition principle.

 

Example 1: Let T:R2R2 be a linear transformation that maps u=[12] into [34] and maps v=[13] into [21]. Use the fact that T is linear to find the images under T of 2u,3v and 2u3v.

 

 

Exercise 1: Let T:R3R3 be a linear transformation that maps u=[121] into [354] and maps v=[143] into [112]. Use the fact that T is linear to find the images under T of (1/2)u,2v and (1/2)u+2v.

 

Fact: A matrix transformation is a linear transformation.

Definition: The standard basis of Rn is the columns set of In,e1,,en.

 

Fact: Every vector x=[x1x2xn] is a linear combination of the ei‘s and x=x1e1+x2e2++xnen.

 

Example 2: Let e1=[10],e2=[01],y1=[21] and y2=[11], and let T:R2R2 a linear transformation map e1 to y1 and e2 to y2. Find the image of u=[34] and x=[x1x2] under T.

 

 

Exercise 2: Let e1=[10],e2=[01],y1=[23] and y2=[41], and let T:R2R2 a linear transformation map e1 to y1 and e2 to y2. Find the image of u=[65] and x=[x1x2] under T.

 

Theorem: Let T:RnRm be a linear transformation. Then there exists a unique m×n matrix such that T(x)=Ax for all vectors x in Rn.

In fact, A=[T(e1en)] where ei is the i-th column of the n×n identity matrix. A is called the standard matrix of T.

 

Proof: For any vector x=[x1xn], we can write x=x1e1++xnen then by the fact that T is a linear transformation, we have T(x)=x1T(e1)++xnT(en)=Ax. The uniqueness is proved in the groupwork.

 

Theorem: Let T:RnRm be a transformation. T is linear if and only if it is a matrix transformation.

 

 

Theorem: Let RkTRnSRm be linear transformations, and let A and B be the standard matrices of S and T respectively. Then ST is linear with standard matrix AB.

 

Example 3: Let RkTRnSRm be linear transformation, and let A=[120130] and B=[01201201] be the standard matrices of S and T respectively. Find the standard matrix of ST.

 

 

Exercise 3: Let RkTRnSRm be linear transformation, and let A=[120011] and B=[011012] be the standard matrices of S and T respectively. Find the standard matrix of ST.

 

Example 4: Let T:R2R2 be a linear transformation map [21] to y1=[11] and [10] to y2=[21]. Find the image of u=[32] under T.

 

 

Exercise 4: Let T:R2R2 be a linear transformation map [13] to y1=[21] and [02] to y2=[01]. Find the image of u=[32] under T.

 

 

 

Example 5: Let T:R2R2 be the transformation that rotates each point in R2 about the origin through an angle φ, with counterclockwise rotation for a positive angle. This transformation is a linear transformation. Find the matrix A such that T(x)=Ax.

 

 

Exercise 5: Let T:R2R2 be the transformation that rotates each point in R2 about the origin through an angle φ, with clockwise rotation for a positive angle. This transformation is a linear transformation. Find the matrix A such that T(x)=Ax.

 

Definition: 1. A map T:RnRm is called onto if for all b in Rm there is at least one x in Rn such that T(x)=b.

2. A map T:RnRm is called one to one if T(x)=T(y) then x=y for all x,y in Rn.

 

Example 6: Is the map defined by the matrix A=[223103220004] one to one linear transformation?

 

 

Exercise 6: Is the map defined by the matrix A=[2251034100120000] one to one linear transformation?

 

Theorem: Let RnRm be a linear transformations. T is one to one if and only if T(x)=0 only has the trivial solution.

 

Theorem: Let RnRm with standard matrix A. Then

(1) T is onto if and only if A has pivot positions in every row.

 

(2) T is one to one if and only if A has pivot position in every column.

 

 

Example 7: Let T(x1,x2)=(x1x2,2x1+3x2,3x12x2). Show that T is a one to one linear transformation. Is T a onto transformation?

 

 

Exercise 7: Let T(x1,x2)=(x1+x2,2x1x2,3x1+2x2). Show that T is a one to one linear transformation. Is T a onto transformation?

 

 

 

GroupWork 1: Mark each statement True or False. Justify each answer.

a. A linear transformation is a special type of function.

 

b. If A is a 3×5 matrix and T is a transformation defined by T(x)=Ax then the domain of T is R5.

 

c. If A is an m×n matrix, then the range of the transformation xAx is Rm.

 

d. A transformation T is linear if and only if T(cu+dv)=cT(u)+dT(v) for all scalars c,d and u,v in the domain of T.

 

e. A linear transformation is completely determined by its effect on the
columns of the n×n matrix.

 

f. If T:R2R2 rotates vectors about the origin through an angle φ, then T is a linear transformation.

 

g.  When two linear transformations are performed one after another, the
the combined effect may not always be a linear transformation.

 

 

 

GroupWork 2: Show the transformation T defined by T(x1,x2,x3)=(x1,0,x3) is linear.

 

 

GroupWork3: Mark each statement True or False. Justify each answer.

a. The range of the transformation xAx is the set of all linear combinations of the columns of A.

 

b. Every matrix transformation is a linear transformation.

 

c. A linear transformation preserves the operations of vector addition and scalar multiplication.

 

d. A linear transformation, T:RnRm always map the origin of Rn to the origin of Rm.

 

e. Let T and S be linear transformations then TS=ST.

 

f. The columns of the standard matrix of a linear transformation T from Rn to Rm is the images of the the columns of the n×n identity matrix under T.

 

g. A linear transformation, T:RnRm is one to one if each vector in Rn maps to a unique vector in Rm.

 

 

License

Icon for the Creative Commons Attribution 4.0 International License

Matrices Copyright © 2019 by Kuei-Nuan Lin is licensed under a Creative Commons Attribution 4.0 International License, except where otherwise noted.