MATH321 HOMEWORK SOLUTIONS

HOMEWORK #6
Section 3.1: 1, 2, 3(c), 5
Section 3.2: 1, 2(a)(c)(g), 3, 4(b), 5(a)(f), 6(a)(f), 7, 11, 18
Krzysztof Galicki

Problem 3.1.1 (See Answers to Selected Exercises).

Problem 3.1.2 We

1
A = 1
1

have
2
0
1

3
1,
1

1
B = 1
1

3
1,
1

0
2
3

1
C = 0
1

0
2
3

3
2 .
1

Note that A and B differ only in the second column. In order to get B from A
we perform elementary column operation C2 C2 2C1 on A. That is the same as
multiplying by

1 2

E1 = 0 1
0 0

0
0
1

from the right, i.e., B = AE1 .

Note that B and C differ only in the second row. In order to get C from B we perform
elementary row operation R2 R2 R1 on B. That is the same as multiplying by

E2 = 1
0
from the left, i.e., E2 B = C.

0 0
1 0
0 1

We can transform C into I3 by the following sequence

1
R2 (1/2)R2
gives C = 0
1

R3 R3 R1

gives

R3 R3 + 3R2

R2 R2 R3

R1 R1 3R3

1
C = 0
0

of elementary row operations:

0 3
1 1,
3 1

0
3
1
1 ,
3 2

0 3
1 1,
0 1

gives

1
C = 0
0

gives

1 0 3
C = 0 1 0,
0 0 1

gives

C= 0
0

0 0
1 0.
0 1

Problem 3.1.3
(c)
E1

1 0
= 0 1
2 0

0
0.
1

Problem 3.1.5 Note that the rows of A are the columns of At and vice versa. Hence A
is elementary (obtained from In by an elementary row operation of some kind) if and only
if At is elementary (obtained by an elementary column operation of the same kind).
Another way of seeing this is:
(a) If E is of the first or second kind then simply E = Et .
(b) If E is of the third kind then it is obtained from In as Ri Ri + cRj . Then Et is
elementary obtained from In as Rj Rj + cRi .

Problem 3.2.1 (See Answers to Selected Exercises).

Problem 3.2.2
(a) First two rows of A are linearly independent but the third row is the same as the first.
The row space is 2-dimensional and rank(A) = 2.
Alternatively, second column is a sum of the first and third which are linearly independent. Hence, the column space is also 2-dimensional.
(c) The two rows of A are linearly independent so rank(A) = 2.
(g) Columns number 1,2,4 are the same. The third column is the zero vector. The column
space is one-dimensional. Hence, rank(A) = 1
Problem 3.2.3 If A is the zero matrix than LA is the zero transformation so the rank
of LA is zero. If A is a non-zero matrix than at least one column is non-zero so that
rank(A) 1.
Problem 3.2.4
(b) Let

1
2,
1

A = 1
2

R3 R3 R1

R1 R 2

R1 R1

R2 R2 2R1

2
1
0

gives

gives

1
2
0

gives

gives

1
2
0

1
0
0

1
2,
0

2
1,
0

2
1 ,
0

2
5 ,
0

1
R2 R1
5

gives

R1 R1 + 2R2

2
1 ,
0

1
0
0

gives

0
1.
0

D= 0
0

Hence, rank(A) = 2.
Problem 3.2.5
(a) Here the rank(A) = 2 as the two columns are linearly independent. We from the
augmented matrix (A|I2 ) and reduce

1
1


2  1
1 0

0
1

'

1
0


2  1
1  1

0
1

'


0  1
1  1

1
0

2
1

'


1 0  1
0 1 1

2
1

We check that


1 2
1 1



1
1

2
1

1
0

0
1

(f) Here the first and the third column are the same. Hence, A is not invertible. The
first two columns are linearly independent so rank(A) = 2.
Problem 3.2.6
(a) Note that
T (ax2 + bx + c) = 2a + 2(2ax + b) (ax2 + bx + c) = ax2 + (4a b)x + (2a + 2b c).
We immediately get that T (f (x)) = 0 if and only if f (x) = 0. Hence, N (T ) is trivial
and the range R(T ) = P2 (R). Thus T is invertible. To compute the inverse we will
write T relative to the basis = {x2 , x, 1}. In this basis
T (x2 ) = x2 + 4x + 2, T (x) = x + 2, T (1) = 1

so that

[T ] =
4
2

0
0
1 0 .
2 1

One can compute the inverse of this matrix, using the method of Problem 5. We from
the augmented matrix ([T ] |I3 ) and reduce

1
4
2

0
1
2


0  1
0  0
1  0

0 0
1
1 0 ' 0
0 1
2

0
1
2


0  1
0  4
1  0

0
1
2


0  1
0  4
1  2

0 0
1

1 0 '
0
0 1
0

0
1
0

0  1 0 0
0  4 1 0 '
1  10 2 1

1
0
0

1
0
0

We get


0 0  1
1 0  4
0 1  10

[T 1 ] = [T ]1

0
1
2

=
4
10

0 0
1 0 '
0 1

0
0 .
1

0
1
2

0
0
1

Hence,
T 1 (ax2 + bx + c) = ax2 (4a + b)x (10a + 2b + c).
(f) Let A =

a
c

b
d

. Then

a b
c d

= (a + d, a + d, c + b, b + c).

Now, N (T ) consists of matrices which have a = d and b = c, i.e.,



a
b
= (0, 0, 0, 0).
T
b a
In particular, T is not one-to-one (or onto) and is not invertible.
Problem 3.2.7 Let

1 2

A= 1 0
1 1

1
1.
2

We get

0 0
1

1 0
1
0 1
1

E1 A = 1
0

1 0

E2 E1 A =
0 1
1 0

E3 E2 E1 A = 0
0

2 1
1

0 1 = 0
1 2
1

0
1 2

0
0 2
1 1
1

0
0
1

1/2 0
0
0
1
0

E4 E3 E2 E1 A = 0
0

1
E6 E5 E4 E3 E2 E1 A = 0
0

2
2
1

1 2
0 0

0 1
1 0
0 1
1 1

1 2
E5 E4 E3 E2 E1 A = 0 1
0 0

1
1

0 = 0
2
0

1
0,
2

1
0,
1

2
2
1

1
1 2

0 = 0 1
1
0 1

1
0,
1

1 2 1
1
0 = 0 1 0,
0 0 1
1

0
1 2
00 1
1
0 0

0 1
1 0
1 0 0 1
0 1
0 0

2
2
1

1
1
0 = 0
1
0

0 1
1 0,
0 1

1
1 0
0 = 0 1
1
0 0

0
0 = I3 .
1

1 1 1 1 1
Hence, A = E1
1 E2 E2 E4 E5 E6 . The inverses of Ei are easily found. For example

E1
6

1
1 0 1
1
= 0 1 0 = 0
0 0 1
0

0 1
1 0.
0 1

Problem 3.2.11 Consider the columns of B as n-vectors {c1 , c2 . . . , cn }. The first column
c1 is not a linear combination of any remaining columns. Hence,
dim(span{c1 , c2 , . . . , cn }) = 1 + dim(span{c2 , . . . , cn }).
However, dim(span{c2 , . . . , cn }) = rank(B0 ) because all first coordinates of {c2 . . . , cn } are
zero. Hence, rank(B) = 1 + rank(B0 ).

Problem 3.2.18 Let A Mmn (F ), B Mnp (F ). Consider

B = B 1 + B2 + + B n
where Bi is obtained from B by keeping the i-th row and setting all other entries equal
to zero. Note that rank(Bi ) 1 for each i and it actually equals 1, unless the i-th row
vanishes. We have

AB = A(B1 + B2 + + Bn ) = AB1 + AB2 + + ABn

is the sum of n matrices with rank(ABi ) rank(Bi ) 1. This is by Theorem 3.7.