MAS 109 Introduction to Linear Algebra

Final Exam December 14 (Thursday), 2023 19:10 PM ∼ 21:55 PM

Fall 2023 MAS 109
Full Name :

Student Number:

Do not write in this box.

Instruction

• No items other than scratch papers (given by TA), pen, pencil, eraser and your id are allowed.
You must leave all of your belongings that are not allowed at the designated area in the front of
the classroom.

• Before you start, fill out the identification section on the title page with an inerasable pen.

• Show your work for full credit, unless noted otherwise. Write the final answer to each problem
in the box provided.

• The exam is for two hours and 45 minutes. Ask permission by raising your hand if you have
any question or need to go to toilet. You are not allowed to go to toilet for the first 30 minutes
and the last 15 minutes.

• Any attempt to cheat or a failure to follow this instruction leads to serious disciplinary actions
not limited to failing the exam or the course.

Do not write in this table.

Problem Score Problem Score Problem Score Problem Score
1 / 40 4 / 20 7 / 20 10 / 20

2 / 20 5 / 20 8 / 30 11 / 20

3 / 30 6 / 20 9 / 30 total / 270

–1–
MAS 109 2023 Fall

1. (True/False question) For each statement below, explicitly say whether it is true or false and
there is no need to explain how you obtained this answer. (For each correct answer 5pt and each
wrong answer -3pt (no answer = 0pt), total 40pt)

(1) For any n × n matrix A, col(A) = col(AT A).

(2) For any symmetric matrix A, A is similar to an upper triangular matrix B.
(3) If an n × n matrix A has full column rank, then the vectors Ae1 , · · · , Aen are linearly inde-
pendent where e1 , · · · , en are the standard unit vectors of Rn .
(4) Every subspace of Rn has an orthonormal basis.
(5) If an n × n matrix A has n distinct eigenvalues, then A is invertible.
(6) Let A, P be n × n matrices where P is invertible. If λ is an eigenvalue of A, then λ is an
eigenvalue of P −1 AP as well.
(7) Let A be an n × n matrix whose entries are all real. If 0 is the only eigenvalue of A, then A
is the zero matrix.
(8) For a matrix A, A has the full column rank if and only if A has the full row rank.

Ans:

–2–
MAS 109 2023 Fall

2. Solve the following problems. (each 10pt, total 20pt)

(1) Prove that if A is an invertible m × m matrix and B is an m × n matrix, then rank(AB) =

rank(B).
(2) Let A be an m × n matrix. Suppose m > n and A has n pivot columns. Prove or disprove
that AT AAT x = b is consistent for each column vector b in Rn .

Ans:

–3–
MAS 109 2023 Fall

! #
2
3. Let a = 1$ and let L be the line spanned by the vector a. Solve the following problems. (each
"
2
10pt, total 30pt)

(1) Find the standard matrix P for the orthogonal projection of R3 onto the line L.
(2) What is the rank of P ?
! #
1
(3) Let x = "1$. Express x as the sum of two vectors x1 and x2 where x1 lies in L and x2 is
2
perpendicular to L.

Ans:

–4–
MAS 109 2023 Fall

4. Find the least squares line y = ax + b of best fit to the following set of points:

{(0, 1), (2, 0), (1, 1), (3, 2), (5, 2)}

(20pt)

Ans:

–5–
MAS 109 2023 Fall

! #
−1 2 1
5. Let A = "−1 1 1$. Solve the following problems. (each 10pt, total 20pt)
−1 3 1

(1) Write definitions of the row space, the column space, and the null space of a matrix M
(these are called the fundamental spaces of M ).
(2) Choose two fundamental spaces for A and find bases for each of your choice.

Ans:

–6–
MAS 109 2023 Fall

! #
1 0 0
6. Let A = "−1 1 0$. Solve the following problems. (each 10pt, total 20pt)
−1 3 1

(1) Find a polynomial p(x) = x3 + ax2 + bx + c satisfying p(A) = 0.

(2) Find A5 .

Ans:

–7–
MAS 109 2023 Fall

7. Find a singular value decomposition (SVD) for each of the following matrices. Recall that finding
SVD for a matrix M amounts to say that we need to find matrices U , Σ and V such that M =
U ΣV T where U and V are orthogonal matrices. (each 10pt, total 20pt)
% &
0 1
(1) A =
−1 0
! #
2 2
(2) B = "1 0$
0 1

Ans:

–8–
MAS 109 2023 Fall

8. Let W be a k-dimensional subspace of Rn with a basis B = {w1 , ..., wk } and let M be the n × k
matrix whose columns are w1 , ..., wk . For x ∈ Rn , let ProjW (x) denote the orthogonal projection
of x onto W . Solve the following problems. (each 10pt, total 30pt)

(1) Show that M T x = M T ProjW (x) for each x ∈ Rn .

(2) Show that there exists v ∈ Rk such that M v = ProjW (x).
(3) Show that M T M is an invertible matrix.

Ans:

–9–
MAS 109 2023 Fall

9. Let A be an orthogonally digonalizable n × n matrix. Solve the following problems. (each 10pt,
total 30pt)

(1) Explain what it means for A to be orthogonally digonalizable.

(2) Prove or disprove that A is symmetric.
(3) Prove or disprove that if A is orthogonal, then A is the identity matrix.

Ans:

– 10 –
MAS 109 2023 Fall

10. Let B = {u1 , u2 , u3 } and B ′ = {u′1 , u′2 , u′3 } be two ordered bases for R3 where
! # ! # ! #
−1 −3 1
u1 = " 0 $ , u2 = " 2 $ , u3 = " 6 $
−1 −1 −1
! # ! # ! #
−2 −1 −2
u1 = −2 , u2 = −3 , u3 = −3$
′ " $ ′ " $ ′ "
0 2 7

Solve the following problems. (each 10pt, total 20pt)

(1) Find the transition matrix from B to B ′ .

# !
−3
(2) Compute the coordinate vectors [w]B and [w]B′ where w = " 2 $.
3

Ans:

– 11 –
MAS 109 2023 Fall

(Use this page for Problem 10, if necessary)

– 12 –
MAS 109 2023 Fall

11. Let T1 : R3 → R3 and T : R3 → R3 be linear operators. Suppose that

• T is one-to-one (this means that T (x) = T (y) implies x = y).

• T1 (x) − T (x) = x for all vector x in R3 .
• The subspace row ([T1 ]) is spanned by v = (1, 1, 1).
• 1
2
is an eigenvalue of [T −1 ] and the corresponding eigenspace is spanned by w = (−1, 2, 0).

Let ! # ! #
1 1 1 a 0 0
Q = "−1 −2 −2$ , D = " 0 b 0$
1 2 3 0 0 c
where a, b and c are constants with a ≤ b ≤ c. Solve the following problems. (each 10pt, total
20pt)

(1) Compute [T ] and show that [T ] is diagonalizable. Find a matrix P with zeros on the diago-
nal that diagonalizes [T ].
(2) Find a, b, c and an ordered basis B for R3 such that Q−1 [T ]B Q = D. Find the vectors u1 and
u2 in R3 that span row([T1 ]B ) and col([T1 ]B ), respectively.

Ans:

– 13 –
MAS 109 2023 Fall

(Use this page for Problem 11, if necessary)

– 14 –