MA 103 (Linear Algebra)
Tutorial 5 (Eigenvalues and Eigenvectors; Diagonalizability)
Notations. N: the set of natural numbers; Z: the set of integers; Q: the set of
rationals; R: the set of real numbers; R∗: the set of non-zero real numbers; R+:
the set of all positive real numbers; C: the set of complex numbers.
All the vector spaces are assumed to be over R or C.
1. Prove that the set of complex numbers V = C is a vector space over R and also over C. What
are its bases over R and over C?
2. Let T : V → V be a linear operator on a finite dimensional vector space V . Given a scalar λ,
we define the operator T − λI and the set Eλ as follows:
(T − λI)(v) = T(v) − λv; Eλ = ker(T − λI).
If λ is an eigenvalue of T then Eλ is called the eigenspace of T with respect to the eigenvalue
λ. Prove that every eigenspace Eλ is T-invariant, i.e., T(Eλ) ⊆ Eλ.
3. Let T : R4 → R4 be the linear operator defined by T(x, y, z, w) = (x+y+2z−w, y+w, 2z−w, z+w).
Prove that the subspace W = {(t, s, 0, 0) | t, s ∈ R} is T-invariant. Is W an eigenspace of T?
matrix nilpotent (Ar = 0 for
4. (i) Prove that the matrix A = 0 −2 1 3
some positive integer r)? (ii)
1101
Show that the matrix A = is diagonalizable. Find an
is not diagonalizable. Is this invertible matrix P such that
P AP −1is a diagonal matrix. What is An, for a positive integer n?
5. Suppose that A ∈ Mn(R) has exactly two distinct eigenvalues λ1 and λ2, and that the
geometric multiplicity of λ1 is n − 1. Prove that A is diagonalizable.
6. Write the matrix representation for each of the following linear operators and test for
diagonalizablility:
(i) V = P2(R) and T(f(X)) = f′(X).
(ii) V = P2(R) and T(aX2 + bX + c) = cX2 + bX + a.
(iii) V = P2(R) and T(f(X)) = f(0) + f(1) · (X + X2).
(iv) V = P3(R) and T(f(X)) = f′(X) + f′′(X).
(v) V = R3and T(x1, x2, x3) = (x2, −x1, 2x3).
(vi) V = R3and T(x1, x2, x3) = (4x1 + x3, 2x1 + 3x2 + 2x3, x1 + 4x3).
(vii) V = R4and T(x1, x2, x3, x4) = (x1, x2, 2x3, 3x4).
Semester I; 2025-26 Department of Mathematics, IIT Gandhinagar
MA 103: Tutorial 5 2
(viii) V = M2(R) and T(A) = At.
7. (i) Prove that a linear operator T on a finite dimensional vector space V is an isomorphism if
and only if 0 is not an eigen value of T.
(ii) Let T be an isomorphism. Prove that λ is an eigen value of T if and only if 1λis an eigen
value of T−1.
8. (Cayley-Hamilton Theorem.) Let A be an n × n matrix with real (or complex) entries.
Let χA(λ) = det(A − λI) = a0 + a1λ + · · · + anλn
denote the characteristic polynomial of A. Then,
χA(A) = a0I + a1A + · · · + anAn = 0 − the zero matrix.
Let T : R2 → R2 denote the linear operator T(x, y) = (x + 2y, −2x + y). Compute the
characteristic polynomial of T and verify the Cayley-Hamilton theorem.
9. Let A be an n × n matrix that is similar to an upper triangular matrix and has the distinct
eigenvalues λ1, . . . , λk, with corresponding algebraic multiplicities m1, . . . , mk. Prove the
k
following statements: (i) tr(A) = P i=1 miλi;
m1 m2 mk
(ii) det(A) = (λ1) (λ2) · · ·(λk) .
10. Let T be a linear operator on a finite dimensional vector space V , and suppose that the
distinct eigen values of T are λ1, . . . , λk. Prove that
span({x ∈ V | x an eigenvector of T}) = Eλ1 ⊕ Eλ2 ⊕ · · · ⊕ Eλk.
Semester I; 2025-26 Department of Mathematics, IIT Gandhinagar