MAT 1341D – Test 2

Professor: Xinhou Hua

February 9, 2023

Last name :

First name :

Student Number:

DGD Section (or TA):

Instructions:

• You have 70 minutes to complete this exam.

• This is a closed book exam. Calculators are not allowed.

• Question 1 is a multiple choice question, no partial points.

• Questions 2-4 are long answer questions. To obtain all the points for these questions,
your answers must be justified and written clearly, logically and legibly.

• Question 5 is a bonus question. To obtain all the points to this question, your solution must
be completely correct.

• The use of any electronic device is prohibited. You must turn all devices off and store them
in your bag: you cannot keep them on your person. Otherwise, you may be asked to leave the
exam room, and fraud allegations could be brought against you, resulting in a 0 for the exam.

• Good Luck!

By signing below, you agree to follow to rules stated above.

Signature:

1
 Do not write anything in this table.

Question 1 Question 2 Question 3 Question 4 Question 5 (Bonus) Total on 50+5

1. [16 points] (True/False) Recall that Pn is the set of polynomials of degree at most
n and M2,2 is the set of 2 × 2 matrices. Which statements below are correct?

C1. {p ∈ P | p(1)p(2) = 0} is closed under addition.

C2. {A|A ∈ M2,2 and A = AT } is not a subspace of M2,2 .

C3. {(x, y, z) ∈ R3 | xy = z} is closed under scalar multiplication.

C4. R2 is a subspace of R3 .

C5. {(x, y) ∈ R2 |xy = 0} is not a subspace of R2 .

C6. For any two 3 × 3 matrices A and B, we have (AT B T )T = AB.

C7. If A is any 3 × 2-matrix and B is any 2 × 4-matrix, then AB is a 3 × 4-matrix.

C8. For any two 3 × 3 matrices A and B, and any scalar k ∈ R, we have k(AB) = (kA)(kB).

Put either T (for true) or F (for false) in each box below.

C1 C2 C3 C4 C5 C6 C7 C8

Solution:
FFFFTFTF

2
2. [12 points]
 
1 1 −2 1
−2 −1 6 −1
(a) Row reduce the matrix 
1
 until you obtain RREF. [8]
2 0 3
−6 −5 14 −4
Solution:
     
1 1 −2 1 1 1 −2 1 1 0 −4 0
−2 −1 6 −1 0 1 2 1 0 1 2 1
 ∼ ∼ 
1 2 0 3  0 1 2 2 0 0 0 1
−6 −5 14 −4 0 1 2 2 0 0 0 1
 
1 0 −4 0
0 1 2 0
∼0 0 0

1
0 0 0 0

3
(b) Consider the augmented matrix
 
1 2 0 1 3
[A| b ]= 0 0 1 −1 4 .
0 0 0 0 0

(i) What is rank(A)? [2]

Solution:
rank(A)=2

(ii) Write the solution set for the system Ax = b. [2]

Solution:
x1 =3 − 2x2 − x4
x2 =f ree
x3 =4 + x4
x4 =f ree .
or
x1 =3 − 2t − s
x2 =t
x3 =4 + s
x4 =s .

4
  
0 0 1 0
0 0 0 −1
3. [10 points] Let A = 
1

0 0 0
0 1 0 0

(a) Calculate A2 , A3 and A4 . [6]

Solution:
 
1 0 0 0
0 −1 0 0 
A2 = 
0 0 1 0 


0 0 0 −1
 
0 0 1 0
0 0 0 1
A3 = 
1 0 0 0


0 −1 0 0
 
1 0 0 0
0 1 0 0
A4 = 
0 0 1 0 = I4


0 0 0 1

(b) Calculate A83 . [4]

Solution:
A83 = A4(20) A3
=I4 A3 
0 0 1 0
0 0 0 1
=1 0 0 0


0 −1 0 0

5
4. [12 points] Consider the network of streets with intersections A, B, C, D and E below.
The arrows indicate the direction of traffic flow along the one-way streets, and the numbers
refer to the exact number of cars observed to enter or leave A, B, C, D and E during one
minute. Each xi denotes the unknown number of cars which passes along the indicated streets
during the same period. O
40

B`
x1 x5

~
90 / A / C 60 /
x6 O
x2 x4

D / E_
x3
20 30


(a) Find the system corresponding to the previous diagram. [4]
Solution:
90 + x1 =x2 + x6
x5 =x1 + 40
x4 + x6 =x5 + 60
x2 =x3 + 20
30 + x3 =x4 .

(b) The reduced row-echelon form of the augmented matrix of the system in part (a) is
 
1 0 0 0 −1 0 | −40
0 1
 0 0 −1 1 | 50  
0 0
 1 0 −1 1 | 30  
0 0 0 1 −1 1 | 60 
0 0 0 0 0 0 | 0

Find the possible flows along each street by assigning parameter(s) to free variable(s).
(It is not necessary to specify the maximum and the minimum of your parameters in this
sub-question.) [4]
Solution: Set x5 = s and x6 = t to be parameters. Then

x1 = −40 + s
x2 = 50 + s − t
x3 = 30 + s − t
x4 = 60 + s − t
x5 =s
x6 =t

6
 (c) Find the minimum flow along the road CB using your results from (b)
(you must justify all your answers: correct answer without justification is 1pt only) [2]
Solution: By the 1st equation,

x1 = −40 + s ≥ 0 ⇐⇒ s ≥ 40.

Thus minimum=40.

(d) If the road DE was closed in the middle due to roadwork, find the minimum flow
along the road AC using your results from (b)
(you must justify all your answers: correct answer without justification is 1pt only) [2]

Solution: ED is closed ⇐⇒ x3 = 0 ⇐⇒ t = s + 30. Then assuming the constrains

xi ≥ 0 we obtain
x1 = −40 + s ≥ 0 ⇐⇒ s ≥ 40.
The flow along AC is x6 = t = s + 30 so that x6 ≥ 70. The minimum flow along x6 is 70.

7
5. Bonus [5 points] Let V be a vector space. Let U and W be two subspaces of V . We
define U ∪ W = {x | x ∈ U or x ∈ W }. Show that if U ∪ W is a subspace of V , then either
U ⊆ W or W ⊆ U . [5]
Solution:
Proof: If U ⊆ W , done. If U 6⊆ W , there exists x ∈ U such that x 6∈ W .
Now for any y ∈ W , since U ∪W is a subspace, it is closed under ”+”. Thus x+y ∈ U ∪W .
If x + y ∈ W , since W is a subspace, −y ∈ W , therefore (x + y) + (−y) = x ∈ W , a
contradiction. Hence x + y ∈ U . Since U is a subspace, (x + y) + (−x) = y ∈ U .
We showed that for any y ∈ W , y ∈ U . Thus W ⊆ U .