Linear Algebra, Assignment 4

Dr. Maya Saran

April 10, 2022

1. For each part below, give an example of a 2 × 2 matrix that is:

(a) diagonalizable and invertible,

(b) diagonalizable but not invertible,

(c) invertible but not diagonalizable,

(d) neither invertible nor diagonalizable.

(This entire exercise can be done with 0’s and 1’s as the matrix entries.)
Moral: diagonalizability has nothing to do with invertibility.

2. True or false? In each case, give an explanation or a counterexample, as appropriate.

(a) Any 5 eigenvectors corresponding to different eigenvalues of a 5 × 5 matrix will form a basis for R5 .

(b) Any 5 eigenvectors corresponding to different eigenvalues of a 5 × 5 symmetric matrix will form a basis
of orthogonal vectors for R5 .

(c) If x1 , x2 , . . . x5 is a basis of R5 , and c1 , c2 , . . . c5 are non-zero scalars, then c1 x1 , c2 x2 , . . . c5 x5 is also a

basis of R5

(d) If x is an eigenvector of the 5 × 5 matrix A, and c is a non-zero scalar, then cx is also a eigenvector of
A.

(e) If A is a 5 × 5 matrix and R5 has a basis consisting of orthogonal eigenvectors of A, then R5 has a basis
consisting of orthonormal eigenvectors of A.

3. Let A, B, C be n × n matrices, let C be invertible, and let A = CBC −1 . In this situation we say A is
”similar” to B. If λ is an eigenvalue of A must it be an eigenvalue of B? Justify.

4. In each of the following, give an example of the object being described. If no example is possible, explain
why not.

(a) A 3x3 matrix which is invertible and has 0 as an eigenvalue.

(b) A 2x2 matrix with all pivots positive and all eigenvalues negative.

(c) A 2x2 symmetric matrix with all pivots positive and all eigenvalues negative.

1
 p
(d) A 3x3 matrix (not diagonal or triangular) with eigenvalues 4, 5, and (3).

(e) A non-diagonalizable 3x3 matrix with three different eigenvalues.

(f) A diagonalizable 3x3 matrix (not diagonal or triangular) with eigenvalues 4, 5.

5. What is the Spectral Theorem? In what sense are we dealing with a “spectrum” here? Explain in your
own words.

6. Let V be a finite dimensional inner product space. Let B be a basis for V . Prove the following:


(a) If x, z = 0 for all z ∈ B, then x = 0.



(b) If x, z = y, z for all z ∈ B, then x = y.

7. Let {w1 , w2 , . . . , wn } be an orthogonal set of non-zero vectors. We apply Gram-Schmidt Process and get
the vectors v1 , v2 , . . . , vn . Show that wi = vi for every i ∈ {1, 2, . . . , n}.
(Hint: Use mathematical induction.)

8. Let Rn be the vector space with the standard inner product. Prove or disprove the following:

(a) If ∥u + v∥2 = ∥ u ∥2 + ∥ v ∥2 , then u and v are orthogonal.

(b) If x is orthogonal to both u and v, then x is orthogonal to u − v.

(c) If a vector y coincides with its orthogonal projection onto a subspace W , then y ∈ W .

9. Let A be an m × n matrix. Let x ∈ Rn be an arbitrary vector. Prove that x can be written in the form
x = p + u where p ∈ Row(A) and u ∈ N ul(A).

10. Prove Theorem 7 from section 6.2.

11. Let {u1 , u2 , ...up } be an orthogonal basis for a subspace W of Rn and let T : Rn → Rn be defined
by T (x) = projW x. Show that T is a linear transformation. Find the kernel and range space of this
transformation.

12. Consider M2×2 (R), the set of all 2 × 2 matrices with real entries. This is a vector space with the
usual
 addition  and scalar multiplication. Consider a function f : M2×2 × M2×2 → R defined as
 of matrices
a11 a12 b11 b12
f( , ) = a11 b11 + a12 b12 + a21 b21 + a22 b22 . Show that f is an inner product.
a21 a22 b21 b22