Scribd
Upload
17 views4 pages

HW3 Solutionn

Uploaded by

raosahab0140
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
17 views4 pages

HW3 Solutionn

Uploaded by

raosahab0140
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/ 4

HW3 solution

1. (c). NO, do not exist a, b satisfy a(1, 0, 1, −1) + b(0, 1, 1, 1) = (−1, 1, 1, 2)


(g) YES. Write
       
1 2 1 0 0 1 1 1
=a +b +c .
−3 4 −1 0 0 1 0 0

We find a, b, c, we solve (by comparing the entries)

1 = a + c, 2 = b + c, −3 = −a, 4 = b.

Hence a = 3, b = 4, c = −2

2. To show that {(1, 1, 0), (1, 0, 1), (0, 1, 1)} generates F3 , we need to show
that for every (a, b, c) ∈ F3 , we can find s1 , s2 , s3 ∈ F such that

(a, b, c) = s1 (1, 1, 0) + s2 (1, 0, 1) + s3 (0, 1, 1).

That is we can solve the system of linear equations (with unknowns s1 , s2 , s3 )

s1 + s2 = a, s1 + s3 = b, s2 + s3 = c.

Solving above, we get


1 1 1
s1 = (a + b − c), s2 = (a − b + c), s3 = (b − a + c).
2 2 2
Hence {(1, 1, 0), (1, 0, 1), (0, 1, 1)} generates F3 .

3. For ∀P = an xn + · · · + a0 , take s0 = a0 , s1 = a1 , . . . , sn = xn , then

P = s1 · 1 + · · · + sn xn .

This proves that {1, x, ..., xn } generates Pn (F ).

4. Proof: any vector x ∈ span(S1 ∩ S2 ) can be written as x = a1 v1 + · · · +


an vn , where v1 , ..., vn ∈ S1 ∩ S2 , therefore v1 , ..., vn ∈ S1 thus x = a1 v1 + · · · +
an vn ∈ span(S1 ), similarly x = a1 v1 +· · ·+an vn ∈ span(S2 ). So span(S1 ∩S2 ) ⊆
span(S1 ) ∩ span(S2 ).

However, span(S1 ∩ S2 ) and span(S1 ) ∩ span(S2 ) are not always equal.


Here are examples that they are equal and not equal: Example 1: S1 =
{a}, S2 = {a, b}, where a, b are linearly independent, then span(S1 ∩ S2 ) =
span(S1 ) ∩ span(S2 ); Example2: S1 = {a}, S2 = {b}, where a 6= b are linearly
depedent (for example taking b = 2a, then span(S1 ∩S2 ) 6= span(S1 )∩span(S2 ).

5. (e) Write

a1 ((1, −1, 2) + a2 (1, −2, 1) + a3 (1, 1, 4) = (0, 0, 0).

1
By solving the system of equations

a1 + a2 + a3 = 0, −a1 − 2a2 = 0, 2a1 + a2 + 4a3 = 0

we get a1 = −3, a2 = 2, a3 = 1. So they are linearly dependent.

(f) Write

a1 ((1, −1, 2) + a2 (2, 0, 1) + a3 (−1, 2, −1) = (0, 0, 0).

By solving the system of equations, we get a1 = a2 = a3 = 0. So it is linearly


independent.

(i) Write

a1 (x4 − x3 + 5x2 − 8x + 6) + a2 (−x4 + x3 − 5x2 + 5x − 3) + a3 (x4 + 3x2 − 3x + 5)

+a4 (2x4 + 3x3 + 4x2 − x + 1) + a5 (x3 − x + 2) = 0.


So we get system of equations

a1 − a2 + a3 + 2a4 = 0, ...., 6a1 − 3a2 + 5a3 + a4 + 2a5 = 0.

By solving this, we get a1 = · · · = a5 = 0. Hence it is linearly independent.

6. (a) This is a ”two-way” statement. We first prove ”=⇒”, i.e. assume


that {u, v} is linearly independent, we prove that {u + v, u − v} is also linearly
independent. To do so, Write a1 (u + v) + a2 (u − v) = 0. We need to show that
a1 = a2 = 0. In fact, from a1 (u + v) + a2 (u − v) = 0, we get (a1 + a2 )u + (a1 −
a2 )v = 0. Since {u, v} is linearly independent, we get a1 + a2 = 0, a1 − a2 = 0
which implies that a1 = a2 = 0, This proves that {u + v, u − v} is linearly
independent.
We now prove ”⇐=”. Let a1 u + a2 v = 0, We need to show that a1 = a2 = 0.
Notice that
1 1
u= ((u + v) + (u − v)), v= ((u + v) − (u − v)).
2 2
Then a1 u + a2 v = 0 becomes
a1 a2
((u + v) + (u − v)) + ((u + v) − (u − v)) = 0.
2 2
i.e.
a1 + a2 a1 − a2
(u + v) + (u − v) = 0.
2 2
Since {u + v, u − v} is linearly independent, we get a1 +a
2
2
= 0, a1 −a
2
2
= 0 which
implies that a1 = a2 = 0. This proves that {u, v} is linearly independent.

(b) can be proves in a similar way.

2
7. (b) Not a basis because they are linearly dependent. (d) It is a ba-
sis: We first check it is linearly independent (omitted), and then we check
span{(−1, 3, 1), (2, −4, −3), (−2, −10, −2)} = R3 (omitted).
8. (a1 , a2 , a3 , a4 ) = a1 u1 + (a2 − a1 )u2 + (a3 − a2 )u3 + (a4 − a3 )u4 .

9. To show that {u + v, au} is a basis, we need to show that (1) It is


linearly independent, (2) it spans V . We first show that {u + v, au} is linearly
independent (the method is the same as we did above in #6). Assume that
a1 (u + v) + a2 (au) = 0, i.e. (a1 + aa2 )u + a1 v = 0. Since {u, v} is linearly
independent, we have a1 + aa2 = 0, a1 = 0. Using a 6= 0, we get a1 = a2 = 0.
So {u + v, au} is linearly independent.
We now show it spans. Since {u, v} is a basis, span{u, v} = V . On the other
hand, since
1 1
u = (au), v = (u + v) − (au),
a a
we have
V = span{u, v} ⊆ span{u + v, au} ⊆ V.
So span{u + v, au} = V .
Therefore, {u + v, au} is a basis. Similarly, we can prove tht {au, bv} is also
a basis.

10. By solving the given system, we get x2 = x3 , x1 = x3 . So the subspace


(the solution space) is

W = {(x3 , x3 , x3 ) = x3 (1, 1, 1) | x3 ∈ R}.

Hence {(1, 1, 1)} is a basis.

11. (3) Verify the linearity by definition. Bases for N(T) and R(T) are ∅
and {(1, 0, 2), (1, 0, −1)}, nullity and rank of T are 0 and 2. T is one-to-one but
not onto. (5) Verify the linearity by definition. Bases for N(T) and R(T) are
∅ and {x, x2 + 1, x3 + 2x}, nullity and rank of T are 0 and 3. T is one-to-one
but not onto. (6) Verify the linearity by definition. Bases for N(T) and R(T)
are (when n = 2)
     
1 0 0 1 0 0
, ,
0 −1 0 0 1 0

and {1}, nullity and rank of T are n2 − 1 and 1. T is not one-to-one but onto.

12. We first calculate T (2, 3). Since (2, 3) = −(1, 0) + 3(1, 1), T (2, 3) =
T (−(1, 0) + 3(1, 1)) = −T (1, 0) + 3T (1, 1) = −(1, 4) + 3(2, 5) = (5, 11). Similar
for ∀v ∈ R2 , write v = x(1, 0) + y(1, 1), then

T (v) = xT (1, 0) + yT (1, 1) = x(1, 4) + y(2, 5).

3
To see whether T is one-to-one. To see whether T is one-to-one, we only
need to find N (T ). For ∀v ∈ N (T ), i.e. T (v) = (0, 0), so x(1, 4) + y(2, 5) = 0.
Now since (1, 4), (2, 5) are linearly independent, we have x = y = 0. Hence
x = 0. So N (T ) = {(0, 0)}. Thus T is one-to-one (by Theorem 2.4 on P. 71.

You might also like