MATH 304 Linear Algebra Matrix Transformations (Continued) - Matrix of A Linear Transformation

MATH 304
Linear Algebra
Lecture 16:
Matrix transformations (continued).
Matrix of a linear transformation.
Linear transformation
Definition. Given vector spaces V1 and V2 , a
mapping L : V1 → V2 is linear if
L(x + y) = L(x) + L(y),
L(r x) = rL(x)
for any x, y ∈ V1 and r ∈ R.
Basic properties of linear mappings:
• L(r1 v1 + · · · + rk vk ) = r1 L(v1 ) + · · · + rk L(vk )
for all k ≥ 1, v1 , . . . , vk ∈ V1 , and r1 , . . . , rk ∈ R.
• L(01 ) = 02 , where 01 and 02 are zero vectors in
V1 and V2 , respectively.
• L(−v) = −L(v) for any v ∈ V1 .
Matrix transformations
Any m×n matrix A gives rise to a transformation

L : Rn → Rm given by L(x) = Ax, where x ∈ Rn
and L(x) ∈ Rm are regarded as column vectors.
This transformation is linear.
    
x 1 0 2 x
Example. L y  = 3 4 7y .
z 0 5 8 z
Let e1 = (1, 0, 0), e2 = (0, 1, 0), e3 = (0, 0, 1) be the
standard basis for R3 . We have that L(e1 ) = (1, 3, 0),
L(e2 ) = (0, 4, 5), L(e3 ) = (2, 7, 8). Thus L(e1 ), L(e2 ), L(e3 )
are columns of the matrix.
Problem. Find a linear mapping L : R3 → R2
such that L(e1 ) = (1, 1), L(e2 ) = (0, −2),
L(e3 ) = (3, 0), where e1 , e2 , e3 is the standard
basis for R3 .
L(x, y , z) = L(xe1 + y e2 + ze3 )
= xL(e1 ) + yL(e2 ) + zL(e3 )
= x(1, 1) + y (0, −2) + z(3, 0) = (x + 3z, x − 2y )
 
x
x + 3z 1 0 3  
L(x, y , z) = = y
x − 2y 1 −2 0
z
Columns of the matrix are vectors L(e1 ), L(e2 ), L(e3 ).
Theorem Suppose L : Rn → Rm is a linear map. Then
there exists an m×n matrix A such that L(x) = Ax for all
x ∈ Rn . Columns of A are vectors L(e1 ), L(e2 ), . . . , L(en ),
where e1 , e2 , . . . , en is the standard basis for Rn .
y1 a11 a12 . . . a1n x1
    
 y2   a21 a22 . . . a2n  x2 
y = Ax ⇐⇒   ...  =  ... .. ... .. .
.  .. 
 
.
ym am1 am2 . . . amn xn
y1 a11 a12 a1n
       
 y2  a   a22   a2n 
⇐⇒  .  = x1  21
 ..   ...  + x2  ...  + · · · + xn  ... 
    
ym am1 am2 amn

Basis and coordinates
If {v1 , v2 , . . . , vn } is a basis for a vector space V ,

then any vector v ∈ V has a unique representation
v = x1 v1 + x2 v2 + · · · + xn vn ,
where xi ∈ R. The coefficients x1 , x2 , . . . , xn are
called the coordinates of v with respect to the
ordered basis v1 , v2 , . . . , vn .
The mapping
vector v 7→ its coordinates (x1 , x2 , . . . , xn )
provides a one-to-one correspondence between V
and Rn . Besides, this mapping is linear.
Matrix of a linear transformation
Let V , W be vector spaces and f : V → W be a linear map.
Let v1 , v2 , . . . , vn be a basis for V and g1 : V → Rn be the
coordinate mapping corresponding to this basis.
Let w1 , w2 , . . . , wm be a basis for W and g2 : W → Rm
be the coordinate mapping corresponding to this basis.
f
V −→ W

g1 y yg2
 
Rn −→ Rm
The composition g2 ◦f ◦g1−1 is a linear mapping of Rn to Rm .
It is represented as x 7→ Ax, where A is an m×n matrix.
A is called the matrix of f with respect to bases v1 , . . . , vn
and w1 , . . . , wm . Columns of A are coordinates of vectors
f (v1 ), . . . , f (vn ) with respect to the basis w1 , . . . , wm .
Examples. • D : P3 → P2 , (Dp)(x) = p ′ (x).
Let AD be the matrix of D with respect to the bases
1, x, x 2 and 1, x. Columns of AD are coordinates
of polynomials D1, Dx, Dx 2 w.r.t. the basis 1, x.

0 1 0
D1 = 0, Dx = 1, Dx 2 = 2x =⇒ AD =
0 0 2
• L : P3 → P3 , (Lp)(x) = p(x + 1).

Let AL be the matrix of L w.r.t. the basis 1, x, x 2 .
L1 = 1, Lx = 1 + x, Lx 2 = (x + 1)2 = 1 + 2x + x 2 .
 
1 1 1
=⇒ AL = 0 1 2
0 0 1
Problem. Consider a linear operator L on the
vector space of 2×2 matrices given by

x y 1 2 x y
L = .
z w 3 4 z w
Find the matrix of L with respect to the basis

1 0 0 1 0 0 0 0
E1 = , E2 = , E3 = , E4 = .
0 0 0 0 1 0 0 1
Let ML denote the desired matrix.

By definition, ML is a 4×4 matrix whose columns are
coordinates of the matrices L(E1 ), L(E2 ), L(E3 ), L(E4 )
with respect to the basis E1 , E2 , E3 , E4 .

1 2 1 0 1 0
L(E1 ) = = = 1E1 +0E2 +3E3 +0E4 ,
3 4 0 0 3 0

1 2 0 1 0 1
L(E2 ) = = = 0E1 +1E2 +0E3 +3E4 ,
3 4 0 0 0 3

1 2 0 0 2 0
L(E3 ) = = = 2E1 +0E2 +4E3 +0E4 ,
3 4 1 0 4 0

1 2 0 0 0 2
L(E4 ) = = = 0E1 +2E2 +0E3 +4E4 .
3 4 0 1 0 4
It follows that  
1 0 2 0
0 1 0 2
ML = 
3
.
0 4 0
0 3 0 4
Thus the relation

x1 y1 1 2 x y
=
z1 w1 3 4 z w
is equivalent to the relation
    
x1 1 0 2 0 x
 y1  0 1 0 2  y .
 
 =
 z1  3 0 4 0  z 
w1 0 3 0 4 w
Problem. Consider a linear operator L : R2 → R2 ,

x 1 1 x
L = .
y 0 1 y
v1 = (3, 1), v2 = (2, 1).
Let N be the desired matrix. Columns of N are coordinates of
the vectors L(v1 ) and L(v2 ) w.r.t. the basis v1 , v2 .

1 1 3 4 1 1 2 3
L(v1 ) = = , L(v2 ) = = .
0 1 1 1 0 1 1 1
Clearly, L(v2 ) = v1 = 1v1 + 0v2 .

3α + 2β = 4 α=2
L(v1 ) = αv1 + βv2 ⇐⇒ ⇐⇒
α+β =1 β = −1

2 1
Thus N = .
−1 0
Change of basis for a linear operator
Let L : V → V be a linear operator on a vector space V .
Let A be the matrix of L relative to a basis a1 , a2 , . . . , an
for V . Let B be the matrix of L relative to another basis
b1 , b2 , . . . , bn for V .
Let U be the transition matrix from the basis a1 , a2 , . . . , an
to b1 , b2 , . . . , bn .
A
a-coordinates of v −→ a-coordinates of L(v)
 
Uy yU
 
B
b-coordinates of v −→ b-coordinates of L(v)
It follows that UAx = BUx for all x ∈ Rn =⇒ UA = BU.

Then A = U −1 BU and B = UAU −1 .
Problem. Consider a linear operator L : R2 → R2 ,

x 1 1 x
L = .
y 0 1 y
v1 = (3, 1), v2 = (2, 1).
Let S be the matrix of L with respect to the standard basis,
N be the matrix of L with respect to the basis v1 , v2 , and U be
the transition matrix from v1 , v2 to e1 , e2 . Then N = U −1 SU.

1 1 3 2
S= , U= ,
0 1 1 1

1 −2 1 1 3 2
N = U SU =
−1
−1 3 0 1 1 1

1 −1 3 2 2 1
= = .
−1 2 1 1 −1 0
Similarity
Definition. An n×n matrix B is said to be similar

to an n×n matrix A if B = S −1 AS for some
nonsingular n×n matrix S.
Remark. Two n×n matrices are similar if and only

if they represent the same linear operator on Rn
with respect to different bases.
Theorem If A and B are similar matrices then they

have the same (i) determinant, (ii) trace = the
sum of diagonal entries, (iii) rank, and (iv) nullity.
Linear transformations of R2
Any linear mapping f : R2 → R2 is represented as

multiplication of a 2-dimensional column vector by a
2×2 matrix: f (x) = Ax or

x a b x
f = .
y c d y
Linear transformations corresponding to particular

matrices can have various geometric properties.
Texture

0 −1
A=
1 0
Texture Rotation by 90o

Texture
√1 − √12
!
2
A=
√1 √1
2 2
Te
xt
ur
Rotation by 45o
e
Texture

−1 0
A=
0 1
erutxeT
Reflection about
the vertical axis
Texture

0 1
A=
1 0
erutxeT Reflection about

the line x − y = 0
Texture

1 1/2
A=
0 1
Te
x ture
Horizontal shear
Texture

1/2 0
A=
Texture 0 1/2
Scaling
Texture

3 0
A=
0 1/3
Squeeze
Texture
Texture

1 0
A=
0 0
Vertical projection on
the horizontal axis
Texture

0 −1
A=
0 1
Horizontal projection
on the line x + y = 0
Texture

1 0
A=
0 1
Texture
Identity

MATH 304 Linear Algebra Matrix Transformations (Continued) - Matrix of A Linear Transformation

Uploaded by

Copyright:

Available Formats

MATH 304 Linear Algebra Matrix Transformations (Continued) - Matrix of A Linear Transformation

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

MATH 304 Linear Algebra Matrix Transformations (Continued) - Matrix of A Linear Transformation

Uploaded by

Copyright:

Available Formats

MATH 304

Any m×n matrix A gives rise to a transformation

ym am1 am2 amn

If {v1 , v2 , . . . , vn } is a basis for a vector space V ,

• L : P3 → P3 , (Lp)(x) = p(x + 1).

Let ML denote the desired matrix.

It follows that UAx = BUx for all x ∈ Rn =⇒ UA = BU.

Definition. An n×n matrix B is said to be similar

Remark. Two n×n matrices are similar if and only

Theorem If A and B are similar matrices then they

Any linear mapping f : R2 → R2 is represented as

Linear transformations corresponding to particular

Texture Rotation by 90o

erutxeT Reflection about

You might also like