MAPS BETWEEN

SPACES: CHANGE OF
BASIS.
Lecturer: Askarbekkyzy Aknur
 Composition of Linear Mapping
Definition 1. Suppose 𝑉, 𝑈 and 𝑊 be vector
spaces over 𝕂 and suppose that 𝐹 ∶ 𝑉 → 𝑈 and
𝐺∶ 𝑈 → 𝑊 are linear mappings. The
composition of linear mapping 𝐺 ∘ 𝐹 is the
mapping from 𝑉 to 𝑊 defined by (𝐺 ∘ 𝐹)(𝑣) =
𝐺(𝐹(𝑣)).
 Composition of Linear Mapping
Proposition 1. Let 𝑉, 𝑈 and 𝑊 be vector spaces
over 𝕂. If 𝐹 ∶ 𝑉 → 𝑈 and 𝐺 ∶ 𝑈 → 𝑊 are
linear mappings, then 𝐺 ∘ 𝐹 is a linear mapping.
 ! !
Example 1. Let 𝐹, 𝐺 ∶ ℝ → ℝ be linear
mappings defined by

𝑥 𝑥+𝑦 𝑥 2𝑥
𝐹 𝑦 = 𝑥 − 𝑦 and 𝐺 𝑦 = .
𝑥 − 3𝑦
Then
𝑥 𝑥+𝑦
𝐺∘𝐹 𝑣 =𝐺 𝐹 𝑣 =𝐺 𝐹 𝑦 =𝐺 𝑥−𝑦 =

2(𝑥 + 𝑦) 2𝑥 + 3𝑦
= = .
(𝑥 + 𝑦) − 3(𝑥 − 𝑦) −2𝑥 + 4𝑦
 𝑥
𝐹∘𝐺 𝑣 =𝐹 𝐺 𝑣 =𝐹 𝐺 𝑦 =
2𝑥 2𝑥 + 𝑥 − 3𝑦 3𝑥 − 3𝑦
=𝐹 = = .
𝑥 − 3𝑦 2𝑥 − 𝑥 − 3𝑦 𝑥 + 3𝑦

We note that 𝐹 ∘ 𝐺 ≠ 𝐺 ∘ 𝐹.
Proposition 2. The composition operation for any
linear mappings 𝐹, 𝐺, 𝐻 is associative, that is,

𝐻 ∘ 𝐺 ∘ 𝐹 = 𝐻 ∘ 𝐺 ∘ 𝐹.
 Matrix representation of a linear mapping
Let 𝑉 be a vector space over 𝕂 and 𝑆 = {𝑢" , . . . , 𝑢# }
be a basis of 𝑉. Then for any 𝑣 = 𝜆" 𝑢" + . . . + 𝜆# 𝑢#
we can find its coordinates with respect to 𝑆 and have
𝜆"
𝑣$= ⋮ .
𝜆#
Recall that by the correspondence 𝑣 ⟼ 𝑣 $ we
can construct isomorphism between the spaces 𝑉
and ℝ# . Below we see that if 𝑑𝑖𝑚𝑉 = 𝑛, then
there is an isomorphism between 𝐻𝑜𝑚(𝑉, 𝑉 ) and
𝑀#,# with respect to the basis 𝑆.
Definition 2. Let 𝑇 ∈ 𝐻𝑜𝑚(𝑉, 𝑉) over 𝕂. Let 𝑆 =
{𝑢" , . . . , 𝑢# } is a basis of 𝑉. Suppose

𝑇(𝑢" ) = 𝑎"" 𝑢" + 𝑎!" 𝑢! +. . . +𝑎#" 𝑢# ,

𝑇(𝑢! ) = 𝑎"! 𝑢" + 𝑎!! 𝑢! +. . . +𝑎#! 𝑢# ,
…
𝑇(𝑢# ) = 𝑎"# 𝑢" + 𝑎!# 𝑢! +. . . +𝑎## 𝑢# ,
Then
𝑎"" 𝑎"! … 𝑎"#
𝑎!" 𝑎!! … 𝑎!#
𝑇$=
… … … …
𝑎#" 𝑎#! … 𝑎##
is said to be the matrix representation of 𝑇 relative
to the basis 𝑆.
Example 2. a) Let 𝑇 ∶ ℝ! → ℝ! be linear
mappings defined by
𝑥 𝑥+𝑦
𝑇 𝑦 = 𝑥−𝑦
and 𝑆 = {𝑒" , 𝑒! } be the standard basis.
Then
1 1 1 0
𝑇 𝑒" = 𝑇 = = + = 𝑒" + 𝑒! =
0 1 0 1
= 1 ⋅ 𝑒" + 1 ⋅ 𝑒! ,

0 1 1 0
𝑇 𝑒! = 𝑇 = = − = 𝑒" − 𝑒! =
1 −1 0 1
= 1 ⋅ 𝑒" + −1 ⋅ 𝑒! .
The matrix representation of 𝑇 in the basis 𝑆 is

1 1
𝑇 $ = .
1 −1
b) Again consider the linear mapping 𝑇 in the
𝑥 𝑥+𝑦
preceding example 𝑇 𝑦 = 𝑥 − 𝑦 and with
& 1
new basis 𝑆 = {𝑓" , 𝑓! } where 𝑓" = and
1
1
𝑓! = .
0
Then
1 2 1 1 𝜆! + 𝜆"
𝑇 𝑓! = 𝑇 = = 𝜆! + 𝜆" = .
1 0 1 0 𝜆!

We obtain 𝜆! + 𝜆" = 2 and 𝜆! = 0. It implies 𝜆! = 0

and 𝜆" = 2. Thus,

1 1
𝑇 𝑓! = 0 * +2* = 0 * 𝑓! + 2 * 𝑓" = 0 ⋅ 𝑓! + 2 ⋅ 𝑓" .
1 0
 1 1 1 1 𝜇" + 𝜇!
𝑇 𝑓! = 𝑇 = = 𝜇" + 𝜇! = 𝜇" .
0 1 1 0
We obtain 𝜇! + 𝜇" = 1 and 𝜇! = 1. It implies 𝜇! = 1
and 𝜇" = 0. Thus,

1 1
𝑇 𝑓! = 1 +0 = 1𝑓" + 0𝑓! = 1 ⋅ 𝑓" + 0 ⋅ 𝑓! .
1 0
The matrix representation of 𝑇 in the basis 𝑆′ is

0 1
𝑇 $& = .
2 0
 Properties of Matrix Representations
Theorem 1. Let 𝑇 ∶ 𝑉 → 𝑉 be a linear mapping
and 𝑆 be a basis of 𝑉. Then for any 𝑣 ∈ 𝑉, we
have 𝑇 $ 𝑣 $ = 𝑇 𝑣 $ .
 𝑥 2𝑥 + 𝑦
Let 𝑇 𝑦 = and 𝑆 = {𝑔" , 𝑔! } be a
3𝑥 − 4𝑦
basis, where

1 1
𝑔" = and 𝑔! = .
−2 −1
 2
Let 𝑣 = . Then
3

2 1 1
𝑣= = −5 +7 = −5𝑔" + 7𝑔! .
3 −2 −1

So
−5
𝑣 ' = .
7
 1 0 1 1
𝑇 𝑔! = 𝑇 = = −11 + 11 =
−2 11 −2 −1
= −11𝑔! + 11𝑔" .
1 1 1 1
𝑇 𝑔" = 𝑇 = = −8 +9 =
−1 7 −2 −1
= −8𝑔! + 9𝑔" .

Then
−11 −8
𝑇 # = .
11 9
 2 7 1 1
𝑇 𝑣 =𝑇 = =− +8 = −𝑔! + 8𝑔"
3 −6 −2 −1
−1
and so 𝑇 𝑣 # = .
8

−11 −8 −5 −1
𝑇 # 𝑣 # = = = 𝑇 𝑣 #.
11 9 7 8
Theorem 2. Let 𝑉 be an 𝑛 −dimensional vector
space over 𝕂, let 𝑆 be a basis of 𝑉. Let 𝑀#,# be a
vector space of 𝑛 × 𝑛 matrices. Then the
mapping

𝜑 ∶ 𝐻𝑜𝑚 𝑉, 𝑉 → 𝑀#,#

defined by 𝜑(𝑇 ) = 𝑇 $ is a vector space

isomorphism.
That is, for any 𝐹, 𝐺 ∈ 𝐻𝑜𝑚(𝑉, 𝑉 ) and any 𝜆 ∈ 𝕂,
Let 𝑉 be a vector space over 𝕂. Then we select two
different bases, say 𝑆 and 𝑆′ of 𝑉 . Then there
arises a question:
According to these bases how do our
representations change?
 Change of basis matrix
Definition 3. Let 𝑉 be a vector space over 𝕂 and
𝑆 = {𝑢! , 𝑢" , . . . , 𝑢$ } and 𝑆′ = {𝑣! , 𝑣" , . . . , 𝑣$ } be
bases of 𝑉. Write basis vectors in 𝑆′ as a linear
combination of basis vectors in 𝑆. Suppose
𝑣! = 𝑎!! 𝑢! + 𝑎"! 𝑢" +. . . +𝑎$! 𝑢$ ,
𝑣" = 𝑎!" 𝑢! + 𝑎"" 𝑢" +. . . +𝑎$" 𝑢$ ,
…
𝑣$ = 𝑎!$ 𝑢! + 𝑎"$ 𝑢" +. . . +𝑎$$ 𝑢$ ,
and
𝑎"" 𝑎"! … 𝑎"#
𝑎!" 𝑎!! … 𝑎!#
𝑃=
… … … …
𝑎#" 𝑎#! … 𝑎##

Then 𝑃 is called the change-of-basis matrix or

transformation matrix from the “old” basis 𝑆 to
the “new” basis 𝑆′.
 !
Example 3. Consider 𝑉 = ℝ .
1 1
Let 𝑆 = {𝑢" , 𝑢! } = { , } and
1 0
1 2
𝑆′ = {𝑣" , 𝑣! } = { , }.
2 5
We write the vectors 𝑣" and 𝑣! as linear
combinations of 𝑢" and 𝑢! .
 1 1 1 𝜆" + 𝜆!
= 𝜆" + 𝜆! = .
2 1 0 𝜆"
Then 𝜆" = 2, 𝜆! = −1.

2 1 1 𝜇" + 𝜇!
= 𝜇" + 𝜇! = 𝜇" .
5 1 0
Then 𝜇" = 5, 𝜇! = −3.
Thus,
𝑣" = 2𝑢" − 𝑢!
𝑣! = 5𝑢" − 3𝑢!
and hence,

2 5
𝑃= .
−1 −3
Proposition 3. Let 𝑃 be a change-of-basis matrix
from a basis 𝑆 to a basis 𝑆′ and 𝑄 be a change-of-
basis matrix from a basis 𝑆′ to a basis 𝑆. Then
("
𝑄 = 𝑃 .
 !
Consider 𝑉 = ℝ .
1 1
Let 𝑆 = {𝑢" , 𝑢! } = { , } and
1 0
1 2
𝑆′ = {𝑣" , 𝑣! } = { , }. We have just seen
2 5
that the change-of-basis matrix from 𝑆 to 𝑆′ is
2 5
𝑃= .
−1 −3
We will see below that the change-of-basis matrix 𝑄
("
from 𝑆′ to 𝑆 is 𝑃 .
1 1 2 𝜆" + 2𝜆!
= 𝜆" + 𝜆! = .
1 2 5 2𝜆" + 5𝜆!
Then 𝜆" = 3, 𝜆! = −1.

1 1 2 𝜇" + 2𝜇!
= 𝜇" + 𝜇! = .
0 2 5 2𝜇" + 5𝜇!
Then 𝜇" = 5, 𝜇! = −2.
Thus,
𝑢" = 3𝑣" − 𝑣!
𝑢! = 5𝑣" − 2𝑣!
and hence,

3 5
𝑄= .
−1 −2
Let us find the inverse of 𝑃 by the formula given
in Lecture 6 and have

("
1 −3 −5
𝑃 = =
2 ⋅ −3 − 5 ⋅ −1 1 2
−3 −5 3 5
=− = = 𝑄.
1 2 −1 −2
 Change of coordinates
Theorem 3. Let 𝑃 be the change-of-basis matrix
from a basis 𝑆 to a basis 𝑆′ in a vector space 𝑉.
Then
𝑃 𝑣 $& = 𝑣 $
or
("
𝑃 𝑣 $ = 𝑣 $& .
 1 0 0
Let 𝑆 = {𝑒" , 𝑒! , 𝑒) } = 0 , 1 , 0 and
0 0 1
1 1 1
&
𝑆 = 𝑓" , 𝑓! , 𝑓) = 1 , 1 , 0 .
1 0 0
)
We know that they are bases of ℝ .
 1
Let 𝑣 = −2 .
3
Since 𝑓" = 𝑒" + 𝑒! + 𝑒) , 𝑓! = 𝑒" + 𝑒! , and
𝑓) = 𝑒" we have
1 1 1
𝑃= 1 1 0 .
1 0 0
Then it is clear that 𝑣 = 𝑒" − 2𝑒! + 3𝑒) and
1
have 𝑣 $ = −2 . One can write
3
𝑣 = 3𝑓" − 5𝑓! + 3𝑓) . Consequently,
3
𝑣 $& = −5 .
3
Then
1 1 1 3
𝑃𝑣 $& = 1 1 0 −5 =
1 0 0 3
1 ⋅ 3 + 1 ⋅ −5 + 1 ⋅ 3 1
= 1 ⋅ 3 + 1 ⋅ −5 + 0 ⋅ 3 = −2 = 𝑣 $ .
1 ⋅ 3 + 0 ⋅ −5 + 0 ⋅ 3 3
 Two matrix representations
Theorem 4. Let 𝑃 be he change-of-basis matrix
from a basis 𝑆 to a basis 𝑆′ vector space 𝑉. Then
for any linear mapping 𝑇 on 𝑉 (𝑇 ∶ 𝑉 → 𝑉)

𝑇 $& = 𝑃(" 𝑇 $ 𝑃.
 ! !
Example 4. Let 𝑇 ∶ ℝ → ℝ be linear
𝑥 𝑥+𝑦
mappings defined by 𝑇 𝑦 = 𝑥 − 𝑦 and
𝑆 = {𝑒" , 𝑒! } be the standard basis. The matrix
representation of T in the basis 𝑆 is
1 1
𝑇 $ = .
1 −1
 1 1
If 𝑆 = {𝑓" , 𝑓! } where 𝑓" = and 𝑓! = ,
1 0
then
0 1
𝑇 $& = .
2 0
One can easily obtain that
1 1 (" 0 1
𝑃= and 𝑃 = .
1 0 1 −1
Then
(" 0 1 1 1 1 1
𝑃 a 𝑇 $a 𝑃 = =
1 −1 1 −1 1 0

1 −1 1 1 0 1
= = = 𝑇 $&
0 2 1 0 2 0
 Similarity
Definition 4. Suppose matrices 𝐴 and 𝐵 be
matrices for which there exists an invertible
("
matrix 𝑃 such that 𝐵 = 𝑃 𝐴𝑃. Then 𝐵 is said
to be similar to 𝐴.
 1 1 0 1
Example 5. If 𝐴 = and 𝐵 = ,
1 −1 2 0
then 𝐵 is similar to 𝐴, because there exists matrix
1 1
𝑃= such that
1 0

0 1 1 1 1 1 0 1
= .
1 −1 1 −1 1 0 2 0
Theorem 5. Two matrices represent the same
linear mapping if and only if the matrices are
similar.