Scribd
Upload
18 views

Tutorial 9 Soln

This document contains solutions to tutorial problems for a linear algebra course. It includes worked examples solving problems about matrix transformations, matrix similarity, eigenvalues, and invertible matrices. Various properties of matrices and matrix operations are explored through these examples.

Uploaded by

stayhungry0105
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
18 views

Tutorial 9 Soln

This document contains solutions to tutorial problems for a linear algebra course. It includes worked examples solving problems about matrix transformations, matrix similarity, eigenvalues, and invertible matrices. Various properties of matrices and matrix operations are explored through these examples.

Uploaded by

stayhungry0105
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

THE UNIVERSITY OF HONG KONG

DEPARTMENT OF MATHEMATICS

MATH2101 Linear Algebra I


Tutorial 9 solution

1. (a) Note that


⎧
⎪ ⎧
⎪
⎪T (b1 ) = b1 ⎪[T (b1 )]B = e1
⎨ and hence ⎨ .
⎪
⎪T (b2 ) = −b2 ⎪
⎪[T (b2 )]B = −e2
⎩ ⎩
1 0
Thus [T ]B = [[T (b1 )]B [T (b2 )]B ] = [ ].
0 −1
(b) Let B = [b1 b2 ]. The standard matrix of T is

cos θ − sin θ 1 0 cos(−θ) − sin(−θ)


B[T ]B B −1 = [ ][ ][ ]
sin θ cos θ 0 −1 sin(−θ) cos(−θ)
cos θ sin θ cos θ sin θ
= [ ][ ]
sin θ − cos θ − sin θ cos θ
cos2 θ − sin2 θ 2 sin θ cos θ
= [ ]
2 sin θ cos θ −(cos2 θ − sin2 θ)
cos 2θ sin 2θ
= [ ].
sin 2θ − cos 2θ

2. (a) (i) Show that Sv1 , . . . , Svk are linear independent: consider the equation
c1 Sv1 + c2 Sv2 + . . . + ck Svk = 0
for some scalars cj (j = 1, . . . , k), it follows from the invertibility of S that
c1 v1 + c2 v2 + . . . + ck vk = 0.
As v1 , . . . , vk are linear independent, we have c1 = c2 = . . . = ck = 0.
(ii) Show that Span{Sv1 , . . . , Svk } =Null A: note that for all j = 1, . . . , k,
ASvj = SBvj = 0,
because vj ∈Null B. Thus Span{Sv1 , . . . , Svk } ⊆Null A. For all u ∈Null A,
SBS −1 u = Au = 0 and hence BS −1 u = 0,
that is, S −1 u ∈Null B =Span{v1 , . . . , vk }. Thus u ∈ Span{Sv1 , . . . , Svk } and hence
Null A ⊆Span{Sv1 , . . . , Svk }.

(b) (i) If B is invertible, then A is invertible. We have Null A =Null B = {0}. Thus, both A
and B have nullity 0. Moreover, rank A = n =rank B.
(ii) If B is not invertible, there exists a basis {v1 , . . . , vk } for Null B. It follows from (a)
that {Sv1 , . . . , Svk } is a basis for Null A. Thus, both A and B have nullity k. Moreover,
rank A = n − k = rank B.

1
3. The correct answer: (b).
(a) Assume that 2A = S −1 AS for some invertible n × n matrix S. Then

2n det A = det(2A) = det(S −1 AS) = det(S −1 ) det A det S = det A.

So (2n − 1) det A = 0 and hence det A = 0, which contradicts the invertiblity of A.


(b) For example, B = O. Then B and −B are similar because −B = O = S −1 BS for S = I.
(c) If A is invertible, then det(A − 0 ⋅ I) = det A ≠ 0 and hence 0 cannot be a zero of the
characteristic polynomial of A.
(d) It follows from the definition that 0 is not an eigenvector.

⎡0 0 1⎤
⎢ ⎥
⎢ ⎥
4. (a) For example, A = ⎢0 0 0⎥ and B = O.
⎢ ⎥
⎢0 0 0⎥
⎣ ⎦
Then A2 = B 2 = O and hence A2 is similar to B 2 . But A and B are not similar, otherwise,
there exists an invertible matrix S such that

A = S −1 BS = S −1 OS = O,

which gives a contradiction.


⎡ 0 1 0 0⎤
⎢ ⎥
⎢ 0 0 1 0⎥
⎢ ⎥
(b) For example, let A = ⎢ ⎥. Then the characteristic polynomial of A is
⎢ 0 0 0 1⎥
⎢ ⎥
⎢−1 0 0 0⎥
⎣ ⎦

det(A − tI) = t4 + 1 > 0 for all t ∈ R.

So the characteristic polynomial does not have real roots and hence A does not have real
eigenvalues.
Remark: However, complex eigenvalues always exist by the Fundamental Theorem of
Algebra.

5. (a) False. Let T ∶ R2 → R2 be the identity map defined by T (v) = v for all v ∈ R2 . Clearly,
T is invertible. Then for any basis B = {b1 , b2 } for R2 ,
⎧
⎪ ⎧
⎪
⎪T (b1 ) = b1 ⎪[T (b1 )]B = e1
⎨ and hence ⎨ .
⎪
⎪T (b2 ) = b2 ⎪
⎪[T (b2 )]B = e2
⎩ ⎩

Thus [T ]B = [[T (b1 )]B [T (b2 )]B ] = I2 for any choice of base B for R2 .

0 1
(b) False. Note that A = [ ] and O has the same characteristic polynomial t2 . However,
0 0
for any invertible matrix P , P OP −1 = O. Thus, A and O cannot be similar to each other.

You might also like