






Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
The final exam for mathematics 20f, a college-level linear algebra course taught by professor linda rothschild in june 1996. The exam covers topics such as finding the general solution of a system of linear equations, linear transformations, rank and basis of matrices, eigenvalues and eigenvectors, and determining if matrices are orthogonal, diagonalizable, or similar. Students are required to answer all questions, use calculators for computation, and provide some work or reasoning for each answer.
Typology: Exams
1 / 11
This page cannot be seen from the preview
Don't miss anything!







Name: Time section meets:
Mathematics 20F Professor Linda Rothschild June 13, 1996 Final Exam-Version A
Instructions: Answer all questions. Use calculators for computation whenever it is quicker. There is not enough time to do all problems by hand. Indicate what the calculator has shown. Show some work or reason for each answer. For justification, you can mention any fact cited in the text, but you cannot cite something shown in a homework problem. There are two versions of this exam; anyone who gives some answers corresponding to the other version will receive a 0 for the final.
Total 200
Have a great summer!
Typeset by AMS-TEX
x 1 + 5x 3 + 6x 4 = 6 x 1 + x 2 + 2x 4 = 1 3 x 1 + 2x 2 + 6x 3 + 11x 4 = 11,
x 1 x 2 x 3 x 4
x 1 + 2x 2 + x 3 x 2 − x 3 x 1 + 3x 2 x 3 + x 4
(a) Find the standard matrix for T.
(b) Find a basis for the kernel of T.
(a) If A and B are 2 × 2 matrices, with A invertible, and if AB = 0, then B = 0.
(b) If A is a 2 × 2 matrix which is diagonalizable, then A is symmetric.
(c) If the eigenvalues of a 3×3 matrix A are 0, 1, and 2, then A is diagonalizable.
(d) If B is diagonalizable and B−^1 exists, then B−^1 is also diagonalizable.
(e) Suppose A and B are square matrices, and B is obtained from A by row operations. Then every eigenvalue of A is an eigenvalue of B.
and
Find the vector in V closest to y =
(a) If A is any matrix, the system Ax = 0 must have at least one solution.
(b) If A is an n × n orthogonal matrix, then ‖Ax‖ = ‖x‖ for all x ∈ Rn.
(c) If a square matrix A is diagonalizable, then its rows must be linearly inde- pendent.
(d) If V is a vector space and there is no set of n vectors which spans V , then dim(V ) > n.
(e) If there is a linearly DEPENDENT set {v 1 , v 2 , v 3 , v 4 } of vectors in V , then dim(V ) < 4.
(f) The mapping T (
x 1 x 2
x 1 x 2 + 1
with a, b ∈ R is a linear mapping of R^2
onto R^2.
(g) If A and B are square matrices which are similar to each other, then they must have the same eigenvalues.
(h) If A and B are square matrices which are similar to each other, then they must have the same eigenvectors.
(i) If A is a square matrix, and 0 is an eigenvalue of the matrix A − 2 I, then 2 must be an eigenvalue of A.
(j) There exists a linear mapping of R^3 onto R^4.
(d) If A is not invertible, find det A.
(e) If A^2 = 0, show that A is not invertible.