Scribd
Upload
109 views17 pages

Linear Algebra and Its Applications - 1-8 Introduction To Linear Transformations

Section 1.8: Introduction To Linear Transformations

Uploaded by

張Ichia
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
109 views17 pages

Linear Algebra and Its Applications - 1-8 Introduction To Linear Transformations

Section 1.8: Introduction To Linear Transformations

Uploaded by

張Ichia
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 17

Linear Algebra and Its Applications

Sixth Edition, Global Edition

Chapter 1
Linear Equations
in Linear Algebra

Copyright © 2022 Pearson Education Ltd. Slide - 1


Section 1.8: Introduction To Linear
Transformations

Copyright © 2022 Pearson Education Ltd. Slide - 2


Linear Transformations
• A transformation (or function or mapping) T from 𝑅𝑛 to 𝑅 𝑚
𝑚
is a rule that assigns to each vector x in 𝑅 𝑛 a vector T (x) in 𝑅
𝑛 𝑚
• The set 𝑅 is called domain of T, and 𝑅 is called the codomain of T.

• The notation 𝑇: 𝑅 𝑛 → 𝑅 𝑚 indicates that the domain of T is 𝑅 𝑛


and the codomain is 𝑅 𝑚

• For x in 𝑅 𝑛 the vector T (x) in 𝑅 𝑚 is called the image of x (under the


action of T ).

• The set of all images T(x) is called the range of T. See the figure on the
next slide.

Copyright © 2022 Pearson Education Ltd. Slide - 3


Matrix Transformations (1 of 7)

• For each x in 𝑅𝑛 T (x) is computed as Ax, where A is an m  n matrix.

• For simplicity, we denote such a matrix transformation by x Ax.

• The domain of T is 𝑅𝑛 when A has n columns and the codomain of T is


𝑅𝑚 when each column of A has m entries.

Copyright © 2022 Pearson Education Ltd. Slide - 4


Matrix Transformations (2 of 7)
• The range of T is the set of all linear combinations of the columns of A,
because each image T (x) is of the form Ax.

• Example 1: Let

 1 − 3  3  3
  2
A= 3 
5 , u =   , b =  2 , c = 2 ,
   −1    
 −1 7   −5  5

and define a transformation 𝑇: 𝑅2 → 𝑅3 by T (x) = Ax,


so that
 1 − 3  x1 − 3 x2 
 
T (x) = Ax =  3 5  1  =  3 x1 + 5 x2  .
x
   x2   
 −1 7   − x1 + 7 x2 

Copyright © 2022 Pearson Education Ltd. Slide - 5


Matrix Transformations (3 of 7)
a. Find T(u), the image of u under the transformation T.

b. Find an x in 𝑅2 whose image under T is b.


c. Is there more than one x whose image under T is b?

d. Determine if c is in the range of the transformation T.

Copyright © 2022 Pearson Education Ltd. Slide - 6


Matrix Transformations (4 of 7)
• Solution:

a. Compute
 1 −3  5
   2  
T (u) = Au = 3 5   = 1 .
   −1  
 −1 7   −9 

b. Solve T (x) = b for x. That is, solve Ax = b, or

 1 −3  3
 3 5  x1  =  2  . ----(1)
   x2   
 −1 7   −5

Copyright © 2022 Pearson Education Ltd. Slide - 7


Matrix Transformations (5 of 7)
• Row reduce the augmented matrix:

 1 −3 3  1 −3 3  1 −3 3  1 0 1.5
 3 5 2 0 14 −7  0 1 −.5 0 1 −.5
       
 −1 7 −5 0 4 −2  0 0 0  0 0 0 
----(2)

 1.5
• Hence x1 = 1.5, x2 = −.5, and x =   .
 −.5
• The image of this x under T is the given vector b.

Copyright © 2022 Pearson Education Ltd. Slide - 8


Matrix Transformations (6 of 7)
c. Any x whose image under T is b must satisfy equation (1).
– From (2), it is clear that equation (1) has a unique solution.
– So there is exactly one x whose image is b.
d. The vector c is in the range of T if c is the image of some x in 𝑅2
that is, if c = T (x) for some x.
– This is another way of asking if the system Ax = c
is consistent.

Copyright © 2022 Pearson Education Ltd. Slide - 9


Matrix Transformations (7 of 7)
– To find the answer, row reduce the augmented matrix.

 1 −3 3  1 −3 3  1 −3 3  1 −3 3
 3 5 2 0 14 −7  0 1 2 0 1 2
       
 −1 7 5 0 4 8 0 14 −7  0 0 −35

– The third equation, 0 = −35, shows that the system is inconsistent.


– So c is not in the range of T.

Copyright © 2022 Pearson Education Ltd. Slide - 10


Shear Transformation (1 of 2)
 1 3
• Example 2: Let A =   . The transformation
0 1
𝑇: 𝑅2 → 𝑅2 defined by T (x) = Ax is called a shear
transformation.

• It can be shown that if T acts on each point in the 2  2


square shown in the figure on the next slide, then the set
of images forms the shaded parallelogram.

Copyright © 2022 Pearson Education Ltd. Slide - 11


Shear Transformation (2 of 2)

• The key idea is to show that T maps line segments onto


line segments and then to check that the corners of the
square map onto the vertices of the parallelogram.
0
• For instance, the image of the point u =   is
2
 1 3  0   6 
T (u) =     =  ,
0 1  2   2 
Copyright © 2022 Pearson Education Ltd. Slide - 12
Linear Transformations (1 of 5)
2  1 3  2   8 
and the image of   is     =  .
2 0 1  2   2 

• T deforms the square as if the top of the square were pushed to the
right while the base is held fixed.

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

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

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

Copyright © 2022 Pearson Education Ltd. Slide - 13


Linear Transformations (2 of 5)
• Linear transformations preserve the operations of vector addition
and scalar multiplication.
• Property (i) says that the result T (u + v ) of first adding u and v in
𝑅𝑛 and then applying T is the same as first applying T to u and v and
then adding T (u) and T (v) in 𝑅𝑚

• These two properties lead to the following useful facts.


• If T is a linear transformation, then

T ( 0) = 0 ----(3)

Copyright © 2022 Pearson Education Ltd. Slide - 14


Linear Transformations (3 of 5)
and T (cu + dv ) = cT (u) + dT ( v) ----(4)
for all vectors u, v in the domain of T and all scalars c, d.
• Property (3) follows from condition (ii) in the definition, because
T (0) = T (0u) = 0T (u) = 0

• Property (4) requires both (i) and (ii):


T (cu + dv ) = T (cu) + T (dv) = cT (u) + dT ( v)

• If a transformation satisfies (4) for all u, v and c, d, it must be linear.

• (Set c = d = 1 for preservation of addition, and set d = 0 for


preservation of scalar multiplication.)

Copyright © 2022 Pearson Education Ltd. Slide - 15


Linear Transformations (4 of 5)
• Repeated application of (4) produces a useful generalization:
T (c1 v1 + ... + c p v p ) = c1T ( v1 ) + ... + c pT ( v p ) ----(5)

• In engineering and physics, (5) is referred to as a


superposition principle.

• Think of v1 , , v p as signals that go into a system and T


T ( v1 ) , , T ( v p ) as the responses of that system to the signals.

Copyright © 2022 Pearson Education Ltd. Slide - 16


Linear Transformations (5 of 5)
• The system satisfies the superposition principle if
whenever an input is expressed as a linear combination of
such signals, the system’s response is the same linear
combination of the responses to the individual signals.
• Given a scalar r, define 𝑇: 𝑅2 → 𝑅2 by T (x) = rx.
• T is called a contraction when 0  r  1
and a dilation when r  1.

Copyright © 2022 Pearson Education Ltd. Slide - 17

You might also like