Scribd
Upload
9 views

Tutorial 2 Sol

Uploaded by

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

Tutorial 2 Sol

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 2 solution

1. We get the reduced row-echelon form of A as follows:


⎡1 2 3⎤⎥ −4r1 +r2 →r2 ⎡⎢1 2 3 ⎤⎥ − 1 r →r ⎡⎢1 2 3 ⎤⎥
⎢
⎢ ⎥ −7r1 +r3 →r3 ⎢ ⎥ 3 2 2 ⎢ ⎥
⎢4 5 6⎥ ÐÐÐÐÐÐÐ→ ⎢0 −3 −6 ⎥ ÐÐÐÐÐ→ ⎢0 1 2 ⎥
⎢ ⎥ ⎢ ⎥ ⎢ ⎥
⎢7 8 9⎥⎦ ⎢0 −6 −12⎥ ⎢0 −6 −12⎥⎦
⎣ ⎣ ⎦ ⎣
⎡1 2 3⎤ ⎡1 0 −1⎤
6r2 +r3 →r3 ⎢
⎢ ⎥ −2r +r →r ⎢ ⎥
⎥ 2 1 1 ⎢ ⎥
ÐÐÐÐÐÐ→ ⎢0 1 2⎥ ÐÐÐÐÐÐÐ→ ⎢0 1 2 ⎥ .
⎢ ⎥ ⎢ ⎥
⎢0 0 0⎥ ⎢0 0 0 ⎥
⎣ ⎦ ⎣ ⎦
There are 2 non-zero rows. Hence, rank A = 2. Note that solving Ax = 0 is the same as solving
⎡1 0 −1⎤⎥
⎢
⎢ ⎥
⎢0 1 2 ⎥ x = 0,
⎢ ⎥
⎢0 0 0 ⎥⎦
⎣
since the last column of the augmented matrix is always zero when elementary row operations
are applied. One easily gets x1 = x3 and x2 = −2x3 where x3 is a free variable. The general
T
solution is x = [x3 −2x3 x3 ] .
2. For a = 0, we have

0 4 0 21 r1 +r2 →r2 0 4 0 41 r1 →r1 0 1 0


[ ] ÐÐÐÐÐÐ→ [ ] ÐÐÐÐ→ [ ].
0 −2 0 0 0 0 0 0 0

0 1 0
So the reduced row echelon form is [ ].
0 0 0
For a ≠ 0, we have

2a a + 4 a 2r2 +r1 →r1 0 a 3a r1 ↔r2 −a −2 a


[ ] ÐÐÐÐÐÐ→ [ ] ÐÐÐ→ [ ]
−a −2 a −a −2 a 0 a 3a
1
a r3 →r3 −a −2 a 2r2 +r1 →r1 −a 0 a + 6 − a1 r1 →r1 1 0 − a+6
a ].
ÐÐÐÐ→ [ ] ÐÐÐÐÐÐ→ [ ] ÐÐÐÐÐ→ [
0 1 3 0 1 3 0 1 3

1 0 − a+6
a ].
So the reduced row echelon form is [
0 1 3
3. Consider the equation
au + bv + cw = 0
for some scalars a, b and c. This can be rewritten as
a+b a−b
(u + v) + (u − v) + cw = 0.
2 2
Since {u + v, u − v, w} is linearly independent, we have
a+b a−b
= = c = 0.
2 2
We easily find that a = b = c = 0. This implies {u, v, w} is linearly independent.

1
4. (a) u = v = 0. Any linear combination of u and v is 0.
1 0 1
(b) One example is [ ].
0 1 1
(c) No example exists. Recall that rank A ≤ 3. Hence, nullity A = 5 − rank A ≥ 2.
5. (a) True. Suppose w = au + bv and z = cu + dv. Then

w + z = au + bv + cu + dv = (a + c)u + (b + d)v

is also a linear combination of u and v.


1 0
(b) False. Consider v = w = [ ] and u = [ ]. The conditions are satisfied since w = 0u + 1v
0 1
and v = 0u + 1w. But u is not a linear combination of v because for all a, b ∈ R,

0 a+b
u=[ ]≠[ ] = av + bw.
1 0

(c) False. For example, in R2 , consider

S = Span{e1 , −e1 }, T = Span{e2 , −e2 }.

Note that

a 0
S∪T = Span{e1 }∪Span{e2 } = {x ∈ R2 ∶ x = [ ] for some a ∈ R or x = [ ] for some b ∈ R},
0 b

T
and Span{e1 , −e1 , e2 , −e2 } = R2 . But [1 1] ∈ R2 does not belong to S ∪ T .
Remark: Indeed, we have S + T = Span{u, v, w, z} where

S + T ∶= {s + t ∶ s ∈ S, t ∈ T }.

You might also like