Scribd
Upload
130 views7 pages

MAT1341 Linear Algebra Midterm 3

This document provides solutions to 8 multiple choice questions from a midterm exam on linear algebra concepts. The questions cover topics such as matrix inverses, matrix multiplication, linear transformations represented by matrices, and properties of invertible matrices. For each question, the solution provides the reasoning and/or calculations to arrive at the correct multiple choice answer.

Uploaded by

WeideSha
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
130 views7 pages

MAT1341 Linear Algebra Midterm 3

This document provides solutions to 8 multiple choice questions from a midterm exam on linear algebra concepts. The questions cover topics such as matrix inverses, matrix multiplication, linear transformations represented by matrices, and properties of invertible matrices. For each question, the solution provides the reasoning and/or calculations to arrive at the correct multiple choice answer.

Uploaded by

WeideSha
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/ 7

MAT 1341 Midterm Test #3 Solutions (Version 1)

October 20, 2014

1 2 2

(1) Let B = 1 3 1 . Then the second row of B 1 is:


1 3 2
A. [1 0 1]
B. [1 0 1]
C. [0 1 1]
D. [2 0 1]
E. [1 1 0]
F. None of the above.

Solution: You can find the inverse of B using row reduction; B 1

3
2 4

= 1 0
1 .
0 1 1

Thus the correct answer is B.

(2) [1 point] If three n n matrices A, B, C satisfy AB BA = C then ABA is:


A. A2 B C
D. A2 B

B. A2 B AC
E. A2 B + AC

C. BA2 + CA
F. A2 B + BC

Solution: If AB BA = C, then BA = AB C, and so


ABA = A(BA) = A(AB C) = A2 B AC
Hence the correct answer is B.

(3) [1 point] Let A be an n n matrix. One of the following conditions is not


equivalent to the others. Which one?
A. A is invertible.
B. The row-reduced echelon form AR of A is the identity In .
C. The homogeneous system A~x = ~0 has an infinite number of solutions.
D. The system A~x = ~b is consistent for every choice of column vector ~b.
E. There exists an n n matrix C such that AC = In .
F. The rank of A is n.
Solution: This is literally a theorem stated in class; the correct answer is C,
because if A~x = 0 has infinitely many solutions, then there must be at least one
free variable, hence A must have less than n leading 1s, so its echelon form has a
row of zeros.

(4) [1 point] Consider the following directed graph:


1O ^>
>>

/ 2

>>
>>


3o

What is the adjacency matrix for this graph?

1
A.
0

1
D.
1

0
0
1
1

1
0
0
0

1
0
1
0

1
1
0
1

0
B.
1

1
E.
1

1
0
0
0

0
0
1
1

1
0
0
1

0
0
0
1

1
C.
1

1
0
0
1

1
0
0
0

F. None of the above.

Solution: Recall that you have to put a 1 in row i, column j if there is an edge
from j to i. This gives A as the correct answer.

(5) Suppose that a linear transformation T : R3 R2 satisfies





" #
" #
1
1
1
1
0



T 2 =
and T 1 =
. What is T 7 ?
0
1
0
1
3
A. This cant be determined from the given information.
" #
" #
" #
" #
" #
1
3
2
2
1
B.
C.
D.
E.
F.
3
3
3
3
3
Solution: Write (1, 7, 3) as a linear combination of (1, 2, 0) and (1, 1, 1):



1
1
1



7 = 2 2 + (3) 1 .
3

Then

1

T 7 = 2T
3



" #
" # " #
1
1
1
0
2


+ (3)
=
.
2 + (3)T 1 = 2
0
1
3
0
1

1 0 2

(6) Consider the matrix M = 2 1 0 .


0 0 2
(a) [4 points] Use row reduction to find the inverse of M .
Solution:

1 0 0
1 0 0
R1 := R1 R3
0 1 0
2 1 0

0 0 2
0 0 1

0 | 1 0 0
1
R2 := R2 + 2R1
0 | 0 1 0
0

1
1 | 0 0 2
0

1 0 1

1
Hence M = 2 1 2.

1 0 2 |

2 1 0 |
0 0 2 |

1 0

2 1
0 0

0 0

| 1 0 1
1
R3 := 2 R3
| 0 1 0

| 0 0 1

0 0 | 1 0 1

1 0 | 2 1 2
0 1 | 0 0 12

1
2

Marking: One point for augmenting M with the identity matrix; two points
for correct reduction (subtract 1/2 point for minor errors, subtract 1 point for
conceptual errors such as not applying the same steps on both sides of the
augmentation or ending up with a matrix which is obviously not invertible).
One point for the correct conclusion.
(b) [2 points] Use the inverse of M to solve the system:

x + 2z = 1
2x + y = 2

2z = 1
Solution: Calculate



1
0
x
1
1 0 1



1
y = M 2 = 2 1 2 2 = 2 .
1
1
z
1
0 0 12
2
Hence the (unique) solution is x = 0, y = 2, z = 12 .
Marking: One point for knowing that you must calculate M 1~b. One point
for execution. (In case the wrong matrix was obtained in part (a), mark as if
the answer given in (a) was correct.)

(7) Consider the following transformations T, S from R2 to R2 : T is projection on the


y-axis, and S is counterclockwise rotation by 3
4 around the origin.
(a) [3 points] Find the matrices for T and S. (You may assume that T, S are
indeed linear transformations.)
" # " #
" # " #
1
0
0
0
Solution: We have T
=
and T
=
. Hence the matrix for T
0
0
1
1
"
#
0 0
is A =
.
0 1
" # " #
" # " #
1
0
12 2
21 2
. Hence the matrix for S is
We have S
and S
= 1
=
1
2

0
1
2 2
#2
"
1 1
.
B = 12 2
1 1
Marking: 1/2 point for knowing that you must use the standard basis vectors.
1/2 point for knowing that the outcomes form the columns of the matrix. 1
point for correctly calculating A, 1 point for B. (Subtract 1/2 point for minor
errors.)
(b) [2 points] Is it true that T S = S T ? Explain why (not)?
" #
1
Solution: No. Take for example the vector
. First applying T and then
0
#
" #
"
0
0
S gives
. On the other hand, first applying S and then T gives 1 .
0
2 2
These are different, so T S 6= ST .
Marking: One point for the idea, one for a correct example.
(c) [1 points] Find the matrix for the transformation which first rotates by 3
4
(counterclockwise) and then projects on the y-axis.
"
#
"
#
0 0 1 1 1
2
=
Solution: This is simply the product AB, so calculate
1 1
0 1 2
"
#
0 0
1
.
2 2
1 1
Marking: 1/2 point for the idea, one for the calculation. (Subtract 1/2 point
if done in the wrong order.)

(8) For each of the following statements, say whether it is (always) true or (possibly)
false. If true, explain in a few sentences why (referring to facts learned in class or
from the book as needed). If false, give a counterexample (with numbers!).
Marking: In each part, give 1/2 point for the correct answer, 1/2 for the justification.
(a) [1 point] If A, B are invertible then so is A+B (Here A, B are square matrices
of the same size.)
"
#
"
#
1 0
1 0
Solution: False, let e.g. A =
and B =
. Then A and B
0 1
0 1
are invertible but A + B is the zero matrix, which is not invertible.
(b) [1 point] If AB = 0n , then A = 0n or B = 0n . (Here, A, B are nxn matrices
and 0n is the nxn zero matrix.)
"
#
"
#
0 0
1 0
Solution: False, e.g. let A =
and B =
. Then AB = 0, but
0 1
0 0
neither A = 0 nor B = 0.
(c) [1 point] If, in a 3x3 matrix, the third row is the sum of the first two, then
the matrix is not invertible.
Solution: True: if the third row is the sum of the first two, then using row
operations we can create a row of zeros. Hence the matrix doesnt have rank 3
and therefore is not invertible.
(d) [1 point] If B has a column of zeros and the product AB is defined, then AB
has a column of zeros.
Solution: True: if the j-th column of B is 0, then for each i, the (i, j)-entry
of AB is 0. Indeed, the (i, j)-entry is the dot product of the i-th row of A with
the j-th column of B, so will be 0. Hence the j-th column of AB is 0.

SPACE FOR ROUGH WORK

You might also like