ENGG 1120 S ECTIONS A, B, C, D, E, F S TUDENT ’ S NAME :

L INEAR A LGEBRA FOR E NGINEERS S TUDENT ’ S I D :

M IDTERM E XAMINATION
11 March 2021, 20:00–21:30 HKT
Sign-in time: 19:30 HKT

Question Points Score

Matrix Calculations 20
Solving Systems of Linear Equations 20
Determinants 15
Matrix Inverses 20
Rank of a Matrix 15
Total: 90

Exam Duration: 90 minutes.

This is a closed-book, closed-notes examination.

Your solutions have to be written by hand.

One A4 handwritten, double-sided cheat-sheet is allowed.

You are allowed to use a calculator from the university-approved list of calculators.

Even if you are unable to prove the answer of one part,

you may use that answer in other parts.
Always justify your answers.

Please write your name and student ID at the top of the first page of your solutions.

Make sure that you have signed the

“Declaration of Academic Honesty for Undergraduate Courses”,
which is available at

http://www.cuhk.edu.hk/policy/academichonesty/Eng_htm_files_(2013-14)/declaration_en.doc

You have to submit the declaration to Blackboard when the exam ends.

PAGE 1 OF 9
 M IDTERM E XAMINATION
ENGG 1120 S ECTIONS A, B, C, D, E, F 11 M ARCH 2021, 20:00–21:30 HKT
L INEAR A LGEBRA FOR E NGINEERS S IGN - IN TIME : 19:30 HKT

1. Define
         
−3 1 4 −1 1 3 0 1 3 0 0 1 0 1 0
A= 2 0 5 , B =  4 2 6 , C = −5 2 6  , X = 0 1 0 , Y = 0 0 1 .
6 4 2 7 −5 0 4 9 −2 1 0 0 0 0 0

(a) [4 points] Compute A · C and B · C.

Solution:
   
11 35 −11 7 28 −3
A · C =  20 47 −4  , B · C = 14 62 12  .
−12 32 38 25 −3 −9

(b) [4 points] Compute CT · (A − 2B)T .

Hint: Try to use the results that you obtained in Part (a).

Solution:

CT · (A − 2B)T = (A − 2B) · C)T

= (AC − 2BC)T
   T
11 35 −11 7 28 −3
=  20 47 −4  − 2 · 14 62 12 
−12 32 38 25 −3 −9
 T
−3 −21 −5
=  −8 −77 −28
−62 38 56
 
−3 −8 −62
= −21 −77 38  .
−5 −28 56

(c) [2 points] Compute X · B.

Solution: We have
 
7 −5 0
X·B= 4 2 6 .
−1 1 3

(d) [2 points] What is the effect of multiplying a matrix with three rows from the left by X?
Hint: How are B and X · B related?

Solution: Multiplying a matrix from the left by X has the effect of swapping the first and the
third row.
(e) [2 points] Compute (X · A) · C.
Hint: Try to use the results that you obtained in Part (a).

PAGE 2 OF 9
ENGG 1120 S ECTIONS A, B, C, D, E, F S TUDENT ’ S NAME :
L INEAR A LGEBRA FOR E NGINEERS S TUDENT ’ S I D :

Solution:
 
−12 32 38
(X · A) · C = X · (A · C) =  20 47 −4  .
11 35 −11

(f) [6 points] Compute Y · (A + YB + Y2 C).

Solution: We have
     
0 1 0 0 0 1 0 0 0
Y = 0 0 1 , Y2 = 0 0 0 , Y3 = 0 0 0 .
0 0 0 0 0 0 0 0 0

Therefore,

Y · (A + YB + Y2 C) = YA + Y2 B + Y3 C
     
2 0 5 7 −5 0 0 0 0
= 6 4 2 + 0 0 0 + 0 0 0
0 0 0 0 0 0 0 0 0
 
9 −5 5
= 6 4 2 .
0 0 0

2. Let a, b ∈ R be some parameters. Consider the system of linear equations


 x2 + 2x3 = −4
3x1 − 4x2 + ax3 = 4
2x1 − 3x2 + 6x3 = b


(a) [8 points] Determine all value(s) of a and b such that this system of linear equations has no solu-
tion. Justify your answer.
Solution: Let à = (A | b) be the augmented matrix. We bring à into row echelon form by a
suitable sequence of elementary row operations:
 
0 1 2 −4
à =  3 −4 a 4 
2 −3 6 b
 
3 −4 a 4
∼ 0 1 2 −4 
2 −3 6 b
 
3 −4 a 4
∼ 0 1 2 −4 
0 − 3 6 − 3 b − 38
1 2a
 
3 −4 a 4
∼ 0 1 2 −4  .
2·(10−a)
0 0 3 b−4

Let Ã′ = (A′ | b′ ) be the obtained augmented matrix. Because we applied only elementary row
operations, it holds that rank(A) = rank(A′ ) and rank(Ã) = rank(Ã′ ).

PAGE 3 OF 9
 M IDTERM E XAMINATION
ENGG 1120 S ECTIONS A, B, C, D, E, F 11 M ARCH 2021, 20:00–21:30 HKT
L INEAR A LGEBRA FOR E NGINEERS S IGN - IN TIME : 19:30 HKT

The system of linear equations has no solution if and only if a = 10 and b ̸= 4.

Reasoning:

• First approach: Recall that a system of linear equations has no solution if and only if it is
inconsistent, i.e., if and only if Ã′ contains a row where all entries except the last entry are
zero. Here this is the case if and only if a = 10 and b ̸= 4.
• Second approach: Recall that a system of linear equations has no solution if and only if

rank(A′ ) < rank(Ã′ ).

Here, rank(A′ ) = 2 and rank(Ã′ ) = 3 (and with this rank(A′ ) < rank(Ã′ )) if and only if
a = 10 and b ̸= 4.

(b) [4 points] Determine all value(s) of a and b such that this system of linear equations has a unique
solution. Justify your answer.
Solution: The system of linear equations has a unique solution if and only if a ̸= 10.
Reasoning:

• First approach: Recall that a system of linear equations has a unique solution if and only if
det(A) ̸= 0, i.e., if and only if det(A′ ) ̸= 0. Because det(A′ ) = 20 − 2a, this is the case if and
only if a ̸= 10.
• Second approach: Recall that a system of linear equations with three unknowns has a
unique solution if and only if

rank(A′ ) = rank(Ã′ ) = 3.

Here, rank(A′ ) = rank(Ã′ ) = 3 if and only if a ̸= 10.

(c) [8 points] Determine the value(s) of a and b such that this system of linear equations has infinitely
many solutions. Moreover, find the solution set of the system in this case.
Solution: Recall that a system of linear equations with three unknowns has infinitely many so-
lutions if and only if

rank(A′ ) = rank(Ã′ ) < 3.

Here, rank(A′ ) = rank(Ã′ ) = 2 < 3 if and only if a = 10 and b = 4.

(Note that rank(A′ ) ≥ 2 for any choice of a and b.)
For a = 10 and b = 4, we obtain
 
3 −4 10 4
Ã′ =  0 1 2 −4  .
0 0 0 0

PAGE 4 OF 9
ENGG 1120 S ECTIONS A, B, C, D, E, F S TUDENT ’ S NAME :
L INEAR A LGEBRA FOR E NGINEERS S TUDENT ’ S I D :

We bring Ã′ into reduced row echelon form by a suitable sequence of elementary row operations:
 
3 −4 10 4
Ã′ =  0 1 2 −4 
0 0 0 0
4 10 4
 
1 −3 3 3
∼ 0 1 2 −4 
0 0 0 0
 
1 0 6 −4
∼  0 1 2 −4  .
0 0 0 0

Thus the solution set is

 
 x1 = −4 − 6x3 
S= (x1 , x2 , x3 ) ∈ R3 x2 = −4 − 2x3 .
x3 ∈ R
 

3. (a) [8 points] Let α ∈ R be some parameter. Define the matrix

 
α 2 2
A = 2 1 2 .
2 2 α

For which values of α is the matrix A invertible?

Note: You do not need to compute the inverse of A for these values of α.

Solution: Recall that A is invertible if and only if det(A) ̸= 0. Let us therefore compute the
determinant of A and find for which values of α it is nonzero. We get

det(A) = α · (1 · α − 2 · 2) − 2 · (2 · α − 2 · 2) + 2 · (2 · 2 − 1 · 2)
= α2 − 4α − 4α + 8 + 8 − 4
= α2 − 8α + 12.

Note that det(A) = 0 if and only if

√
8± 64 − 4 · 1 · 12
α= = 4 ± 2.
2·1
Therefore, the matrix A is invertible if and only if α ̸= 2, 6.

(b) [7 points] Let A be some invertible square matrix and let

B = (AT · A)−1 · AT .

Use determinant properties toward expressing det(B) in terms of det(A). Justify your answer.
Solution:

PAGE 5 OF 9
 M IDTERM E XAMINATION
ENGG 1120 S ECTIONS A, B, C, D, E, F 11 M ARCH 2021, 20:00–21:30 HKT
L INEAR A LGEBRA FOR E NGINEERS S IGN - IN TIME : 19:30 HKT

First approach: We have

det(B) = det (AT · A)−1 · AT

= det (AT · A)−1 · det AT

= det (AT · A)−1 · det A

1

=
· det A
T
det A · A
1

= T
· det A
det(A ) · det(A)
1

= · det A
det(A) · det(A)
1
= ,
det(A)

• where the second and fifth equalities follow from the determinant of a product of matrices
being equal to the product of the determinants,

• where the third and sixth equalities follow from the determinant of the transpose of a matrix
being equal to the determinant of the matrix,
• where the fourth equality follows from the determinant of the inverse of a matrix being
equal to the multiplicative inverse of the determinant of the matrix.

Second approach: We start by observing that

B = (AT · A)−1 · AT
= A−1 · (AT )−1 · AT
= A−1 · I
= A−1 ,

where the second equality follows from the expression (C · D)−1 = D−1 · C−1 , which holds for
invertible square matrices C and D of the same size. This implies

det(B) = det A−1

1
= ,
det(A)

where the second equality follows from the determinant of the inverse of a matrix being equal to
the multiplicative inverse of the determinant of the matrix.

4. (a) [5 points] Let A be an n × n symmetric nonsingular matrix. Prove that A−1 is also symmetric.
Note: A matrix A is called symmetric if AT = A.

Solution:

PAGE 6 OF 9
ENGG 1120 S ECTIONS A, B, C, D, E, F S TUDENT ’ S NAME :
L INEAR A LGEBRA FOR E NGINEERS S TUDENT ’ S I D :

First approach: We have

I = IT

T
= A · A−1
= (A−1 )T · AT
= (A−1 )T · A.

Since the inverse of the matrix A is unique, we get

(A−1 )T = A−1 .

Thus A−1 is symmetric.

Second approach: We start with

A = AT .

Computing the inverse of both sides results in

A−1 = (AT )−1 .

Using (AT )−1 = (A−1 )T , we get

A−1 = (A−1 )T .

Thus A−1 is symmetric.

(b) [10 points] Let

 
1 2 3
A = 2 4 5
3 5 6
Compute A−1 .
Solution:
First approach (based on adjoint matrix):
Note that A is symmetric. Therefore, because of the result in Part (a), the matrix A−1 will also be
symmetric. This observation allows us to simplify our calculations.
We obtain
4 5
M11 = = −1,
5 6
2 3 1 3
M21 = = −3, M22 = = −3,
5 6 3 6
2 3 1 3 1 2
M31 = = −2, M32 = = −1, M33 = = 0.
4 5 2 5 2 4

C11 = −1,
C21 = 3, C22 = −3,
C31 = −2, C32 = 1, C33 = 0.

PAGE 7 OF 9
 M IDTERM E XAMINATION
ENGG 1120 S ECTIONS A, B, C, D, E, F 11 M ARCH 2021, 20:00–21:30 HKT
L INEAR A LGEBRA FOR E NGINEERS S IGN - IN TIME : 19:30 HKT

and

det(A) = 1 · M11 − 2 · M21 + 3 · M31

= 1 · (−1) − 2 · (−3) + 3 · (−2)
= −1.

Thus, using Cij = Cji for all i, j ∈ {1, 2, 3}, we get

 T  T  
C11 C12 C13 −1 3 −2 1 −3 2
1 1
A−1 = · C21 C22 C23  = · 3 −3 1  = −3 3 −1 .
det(A) −1
C31 C32 C33 −2 1 0 2 −1 0

Second approach (Gauss–Jordan method): Applying elementary row operations to the matrix
(A | I), we obtain
 

1 2 3 1 0 0
A I = 2 4 5 0 1 0 
3 5 6 0 0 1
 
1 0 0 1 −3 2
∼ 0 1 0 −3 3 −1 
0 0 1 2 −1 0
A−1


= I .

Thus
 
1 −3 2
A−1 = −3 3 −1 .
2 −1 0

(c) [5 points] Solve the system of linear equations Ax = b, where

     
1 2 3 x1 4
A = 2 4 5 , x = x2  , b = 5 .
3 5 6 x3 6

Hint: Use the result from Part (b).

Solution:
     
1 −3 2 4 1
x = A−1 · b = −3 3 −1 · 5 = −3 .
2 −1 0 6 3

5. Let β ∈ R be some parameter. Define

   
1 2 3 2 1 β β 1
A = 3 1 −5 −2 1 , B = β β 2 .
7 8 −1 2 5 3 6 9
(a) [6 points] Determine rank(A). Justify your answer.

PAGE 8 OF 9
ENGG 1120 S ECTIONS A, B, C, D, E, F S TUDENT ’ S NAME :
L INEAR A LGEBRA FOR E NGINEERS S TUDENT ’ S I D :

Solution: We bring A into row echelon form by a suitable sequence of elementary row opera-
tions:
 
1 2 3 2 1
A = 3 1 −5 −2 1
7 8 −1 2 5
 
1 2 3 2 1
∼ 0 −5 −14 −8 −2
0 −6 −22 −12 −2
 
1 2 3 2 1
∼ 0 −5 −14 −8 −2 .
0 0 −5.2 −2.4 0.4

The rank of A equals the number of non-zero rows of the last matrix. Therefore,

rank(A) = 3.

(b) [6 points] Determine rank(B). Justify your answer.

Note: Distinguish different cases depending on the value of β.

Solution: We claim that

(
2 if β = 0
rank(B) = .
3 if β ̸= 0

Indeed, applying elementary row operations to B, we get

       
β β 1 3 6 9 3 6 9 3 6 9
B = β β 2 ∼ β β 1 ∼ β β 1 ∼ 0 −β −3β + 1 .
3 6 9 β β 2 0 0 1 0 0 1

If β ̸= 0, then the last matrix is in row echelon form and rank(B) = 3.

If β = 0, we get
   
3 6 9 3 6 9
B ∼ 0 0 1 ∼ 0 0 1 ,
0 0 1 0 0 0

which shows that rank(B) = 2.

(c) [3 points] Let C be a real matrix of size 3×5. What is the largest possible value for rank(C)? Justify
your answer.
Solution: The rank C is upper bounded by the number of rows and by the number of columns.
Therefore,

rank(C) ≤ min(3, 5) = 3.

PAGE 9 OF 9