MA-1-02 (TO): Linear Algebra and Differential Equations
©Indian Institute of Technology Jammu
Tutorial sheet-V
February 10, 2026
1. Find all the eigenvalues and the corresponding
eigenvectors
of the
following matrices:
3 10 5 2 −1 1
−5 2 0 −1
(a) (b) (c) −2 −3 −4 (d) −1 2 −1 .
2 −2 1 0
3 5 7 1 −1 2
2. For the following matrices, determine algebraic and geometric multiplicities of each
eigenvalues.
2 −1 −1 1 3 3
(a) −1 2 −1 (b) −3 −5 −3 .
−1 −1 2 3 3 1
3. Find two different 2 × 2 matrices A and B such that
both
have the same eigenvalues
1
λ1 = λ2 = 2 and both have the same eigenvector corresponding to 2.
0
4. Let A be an invertible matrix of size n with eigenvalues λ1 , λ2 , . . . , λn . Find the
eigenvalues of A−1 .
5. Let A be a 2 × 2 singular matrix such that tr(A) ̸= −1 and let I be the 2 × 2 identity
matrix. Then prove that
1
(I + A)−1 = I − A.
1 + tr(A)
2 1
Using the formula, calculate the inverse of the matrix .
1 2
6. Let A and B be n × n matrices over the field F. Check whether or not AB and BA
have the same eigenvalues.
7. Use Cayley-Hamilton Theorem to find the inverse of
7 2 −2
−6 −1 2
6 2 −1
3 1
8. Let A = . Use Cayley-Hamilton theorem to express 2A5 − 3A4 + A2 − 5I
1 2
as a linear polynomial in A.
1
1 0 0
9. Let A = 1 0 1 . Show that for every integer (n ≥ 3), An = An−2 + A2 − I.
0 1 0
Hence evaluate A50 .
10. The Fibonacci series Fn is inductively defined by: F1 = 0, F2 = 1, and Fn+2 =
Fn+1 + Fn for n ≥ 1. Find a matrix A such that the Fibonacci numbers satisfy the
following for each n ≥ 0:
Fn+2 F
= A n+1 .
Fn+1 Fn
Using eigenvectors and eigenspaces of the matrix A, find out the 100th Fibonacci
number F100 . (Hint: finding F100 is equivalent to finding A100 .)
4 1 1 1
11. Let A = and P = . If A = P DP −1 , then find the diagonal
2 3 1 −2
matrix D.
2 0 0
12. Check diagonalizability of the matrix : A = 4 2 0 .
6 0 2
6 −2 2
13. Let A = −2 3 −1 . Find a diagonal matrix D and an invertible matrix P
2 −1 3
such that A = P DP .−1
14. Examine whether the matrices A and B are similar or not, where
1 2 6 −1
(a) A = and B = .
3 4 4 −1
1 0 1 −3
(b) A = and B = .
0 1 −2 4
(c) A and B are the square matrices of the same size n, and such that A has rank n
and B has an eigenvalue 0.
0 0 −2 1 0 0
(d) A = 1 2 1, and B = 1 2 0
1 0 3 −3 5 2
15. Prove that the geometric multiplicity of an eigenvalue
is at most
its algebraic mul-
−1 1 0
tiplicity. Verify this statement for the matrix A = −4 3
0 .
1 0 2