MATH321 HOMEWORK SOLUTIONS

HOMEWORK #7
Section 3.3: 1, 2(c), 3(b), 4(a), 5, 6, 7(b), 10
Section 3.4: 1, 2(f), 3, 4(b), 5, 9, 10, 12
Krzysztof Galicki

Problem 3.3.1 (See Answers to Selected Exercises).

Problem 3.3.2(c) We have


1 2
2 1

  
1  0
1 2
'
1  0
0 3

  
1  0
1 2
'
3  0
0 1

  
1  0
1
'
1  0
0

 
0 1  0
.
1 1  0

Hence, any solution of the homogeneous system can be written as (x1 , x2 , x3 ) = (t, t, t) =
t(1, 1, 1). The space of solutions is one dimensional (a line in R3 ) and a basis for this line
is {(1, 1, 1)}.
Problem 3.3.3(b) We have


1 1
4 1

  
1 1
1  1
'
0 3
2  3
'

1 0
0 1


 
1
1  1
'
0
2  1


1/3  2/3
.
2/3  1/3



1 1  1
'
1 2/3  1/3

Hence, any solution of the homogeneous system can be written as

(x1 , x2 , x3 ) = (2/3 + t/3, 1/3 + 2t/3, t) = t(1/3, 2/3, 1) + (2/3, 1/3, 0).
The space of solutions is one dimensional (a line in R3 ) but it is not a line through the origin
(not a vector subspace). Note that t(1/3, 2/3, 1) is a general solution of the associated
homogeneous system and (2/3, 1/3, 0) is a solution of the inhomogeneous system.
Problem 3.3.4(a) We have
A=

1
2

3
5

One can easily compute the inverse using any method

A

5
2

3
1

Hence, the solution is given by



x1
x2

=A

  
5
4
=
2
3

3
1


  
11
4
.
=
5
3

Problem 3.3.5 Take any homogeneous n n linear system with the last equation the
same as first equation, for example.
Problem 3.3.6 Since T (a, b, c) = (a+b, 2ac) the pre-image of the point (1, 11) consists
of all vectors in R3 such that
a + b = 1,

2a c = 11.

We solve these equations as


Hence,


 
2 0 1  11
1
'

1 1 0
1
1


 
1 0
0 1/2  11/2
'

0 1
1
1
0



1/2  11/2
.
1/2  9/2

(a, b, c) = (t/2 + 11/2, t/2 9/2, t) = t(1/2, 1/2, 1) + (11/2, 9/2, 0).

Problem 3.3.7(b) We have



1 1
2 1

  
1
1  1
'

3 2
0

1
1

The solution is (x1 , x2 , x3 ) = (1 4t, 5t, t).

 
  
1  1
1 0 4  1
.
'
0 1 5  0
5  0

Problem 3.3.10 Recall that the rank of a matrix is the dimension of the row space. If
A Mmn and rank(A) = m then rank(A|B) = m for any matrix B Mmk . Hence,
any linear system with this property must be consistent.

Problem 3.4.1 (See Answers to Selected Exercises).

Problem 3.4.2(f ) We have

1 2
2 4
0 1


1
1 3  2


1 6  5 ' 0
0
0 2 3

1
0
0

0 0
0 1
1 0

2 1
0 1
1 0


1
3  2


0 1 ' 0
0
2 3



1  3
1 0


0  1
' 0 1
2  3
0 0

0 1
0 1
1 0

0 1  3
0 2  3 .
1 0  1

1  4
0  1 '
2  3

Hence,
(x1 , x2 , x3 , x4 ) = (3 + t, 3 2t, 1, t) = t(1, 2, 0, 1) + (3, 3, 1, 0).

Problem 3.4.3
(a) Let (A0 |b0 ) be in the RREF. Then the rank of this matrix is equal to the number
of leading 1s (let us call them pivots). All pivots could lie in A0 in which case
the ranks rank(A0 ) = rank(A0 |b0 ) are equal. The only time the ranks are not equal
is when one of the pivots is in the last column. But then, by definition, A0 has a
corresponding row identically equal to zero.
(b) This part follows from (a) and Theorem 3.11 in your textbook.
Problem 3.4.2(f ) We have

1 1
1 1
1 1

3
1
1



1 1
1  2


' 0 0
1  2
0 0
0  0



1
3 1  2


' 0
4 2  4
0
2 1  2

1 1 0
0 0 1
0 0 0


1/2  1
1/2  1 .
0  0

1 3
0 1
0 0

1  2
1/2  1 '
0  0

Hence,
(x1 , x2 , x3 , x4 ) = (s + t/2 + 1, s, t/2 + 1, t) = s(1, 1, 0, 0) + t(1/2, 0, 1/2, 1) + (1, 0, 1, 0).
A basis for the space of solutions of the corresponding homogeneous equation is, for example, {(1, 1, 0, 0), (1, 0, 1, 2)}.

Problem 3.4.5 Note that A0 has the property that c3 = 2c1 5c2 and c5 = 2c1 3c2 +6c4 ,
where ci denotes the i-th column of A0 . The matrix A must have the same property. Hence,
we get

1
0
2

2 1 5 1 = 3
3
1
1
for the third column and

4
1
0
1
2 1 3 1 + 6 2 = 7
9
0
1
3

for the last column.

Problem 3.4.9 Notice that the first two matrices of W are linearly independent. Now,
the third is not as

 



2 1
1 2
0 1
.
=
+2
3
1 9
2 3
1 1
However,
a

0
1

1
1

+b

1 2
2 3

1
2

2
4

has no solutions for a, b as can easily be seen. Since W is 3-dimensional, we cant take


0
1

1
1

1
2

2
3

1 2
2 4

as a basis.
Problem 3.4.10
(a) The vector (0, 1, 1, 1, 0) satisfies the equation defining V . Hence, the set S is linearly
independent by definition as it is non-zero vector.
(b) Let us first consider a basis for V . Call (x2 , x3 , x4 , x5 ) = (t1 , t2 , t3 , t4 ). Then
(x1 , x2 , x3 , x4 , x5 ) = (2t1 3t2 + t3 2t4 , t1 , t2 , t3 , t4 ),
which means that we can choose
(2, 1, 0, 0, 0), (3, 0, 1, 0, 0), (1, 0, 0, 1, 0), (2, 0, 0, 0, 1)
for the basis of V . However, this basis does not contain (0, 1, 1, 1, 0). Now, the set

a1 = (0, 1, 1, 1, 0), a2 = (2, 1, 0, 0, 0), a3 = (3, 0, 1, 0, 0),

a4 = (1, 0, 0, 1, 0), a5 = (2, 0, 0, 0, 1)
is no longer a basis. The first two vectors a1 , a2 are linearly independent. Similarly,
the third vector cannot be written as a linear combination of the first two
a(0, 1, 1, 1, 0) + b(2, 1, 0, 0, 0) 6= a3 = (3, 0, 1, 0, 0).
Lastly, note that the last vector a5 is not a linear combination of the first three

a(0, 1, 1, 1, 0) + b(2, 1, 0, 0, 0) + c(3, 0, 1, 0, 0) 6= a5 = (2, 0, 0, 0, 1).

Hence, we can remove the fourth vector a4 (which must be a linear combination of the
remaining four) to get a basis
B = {(0, 1, 1, 1, 0), (2, 1, 0, 0, 0), (3, 0, 1, 0, 0), (2, 0, 0, 0, 1)}.

Problem 3.4.12
(a) Clearly both (0, 1, 0, 1, 1, 0) and (1, 0, 1, 1, 1, 0) are linearly independent and they
also satisfy both equations defining V .
(b) To extend it to a basis first let us find some basis of V by solving the equations:


1
2

1
1

0 2
1 3
'

3
4


1
4

1 0
0 1

'

1
1

1
0

1
1

1
1
1
2

0
1
3
2

2
1

3
2

1
2

'

Call (x3 , x4 , x5 , x6 ) = (t1 , t2 , t3 , t4 ). Then

(x1 , x2 , x3 , x4 , x5 , x6 ) = (t1 t2 + t3 3t4 , t1 + t2 2t3 2t4 , t1 , t2 , t3 , t4 ),
which means that we can choose
v1 = (1, 1, 1, 0, 0, 0), v2 = (1, 1, 0, 1, 0, 0), v3 = (1, 2, 0, 0, 1, 0), v4 = (3, 2, 0, 0, 0, 1)
for the basis of V . However, this basis does not contain (0, 1, 0, 1, 1, 0) and (1, 0, 1, 1, 1, 0).
Now

(0, 1, 0, 1, 1, 0), (1, 0, 1, 1, 1, 0), v1, v2 , v3 , v4

is no longer a basis. Clearly,
(0, 1, 0, 1, 1, 0) + (1, 0, 1, 1, 1, 0) = v1 = (1, 1, 1, 0, 0, 0)
so that we throw out v1 . Next,
a(0, 1, 0, 1, 1, 0) + b(1, 0, 1, 1, 1, 0) 6= v2 = (1, 1, 0, 1, 0, 0),
hence, we keep v2 . Finally,
a(0, 1, 0, 1, 1, 0) + b(1, 0, 1, 1, 1, 0) + c(1, 1, 0, 1, 0, 0) 6= v4 = (3, 2, 0, 0, 0, 1),
so that
B = {(0, 1, 0, 1, 1, 0), (1, 0, 1, 1, 1, 0), v2, v4 }
is a basis.