Scribd
Upload
62 views2 pages

Assignment 6 MTH113

This document contains 19 problems related to linear algebra concepts such as linear transformations, rank, eigenvalues, eigenvectors, diagonalization, and orthonormal bases. The problems cover properties of and computations with matrices, including finding characteristic polynomials, diagonalizing matrices, and applying linear transformations. Practice with Gram-Schmidt process to generate orthonormal bases from given sets of vectors is also included.

Uploaded by

Tiger
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
62 views2 pages

Assignment 6 MTH113

This document contains 19 problems related to linear algebra concepts such as linear transformations, rank, eigenvalues, eigenvectors, diagonalization, and orthonormal bases. The problems cover properties of and computations with matrices, including finding characteristic polynomials, diagonalizing matrices, and applying linear transformations. Practice with Gram-Schmidt process to generate orthonormal bases from given sets of vectors is also included.

Uploaded by

Tiger
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Department of Mathematics and Statistics, IIT Kanpur

Linear Algebra(MTH113)–Assignment 6

1. Let A ∈ Mm×n (R) and consider the correponding linear transformation TA : Rn → Rm given by TA (v) = Av.
Show that
(a) r(TA ) = rank(A)
(b) TA is one-one if and only if rank(A) = n
(c) TA is onto if and only if rank(A) = m
(d) TA is an isomorphism (that is, one-one and onto) if and only if m = rank(A) = n

2. Let A be an n × n matrix with eigenvalues λ1 , . . . , λn . Show that det(A) = λ1 . . . λn and tr A = λ1 + · · · + λn .


Further show that A is invertible if and only if its all eigenvalues are non-zero.
3. Let A be a m × n matrix, that is, as a linear map A : Rn → Rm . Let N (A) = Kernel of A and R(A) = Row
space of A. Note that N (A) and R(A) are subspaces of Rn . Consider Rn as an inner product space with respect
to the usual dot product. Prove that:

(a) N (A) ⊥ R(A).


(b) N (A) ⊕ R(A) = Rn .

4. Let V be a subspace of Rn . Then show that dimV = n − 1 if and only if V = {x ∈ Rn | xaT = 0} for some
non-zero vector a ∈ Rn .
 
2 −1 0
5. Let A =  −1 2 0 
2 2 3
(a) Compute the characteristic polynomial of A.
(b) Show that A is diagonalisable.
(c) Find Q such that Q−1 AQ is diagonal.
(d) Also, compute A6 .

Practice problems:
6. Let V an inner product space of dimension n and S be an orthonormal subset of V consisting of exactly n
vectors. Show that S is a basis of V .
7. Use Gram-Schmidt process to transform each of the following into an orthonormal basis;
(a) {(1, 1, 1), (1, 0, 1), (0, 1, 2)} for R3 with dot product.
(b) Same set as in (i) but using the inner product defined by < (x, y, z), (x′ , y ′ , z ′ ) >= xx′ + 2yy ′ + 3zz ′ .
8. Does there exist a real matrix A, for which, the row space, Row(A) = Col(A), the column-space but the
null-space, Null(A) ̸= Null(AT ).
(Hint: N (A) = Row(A)⊥ and N (AT ) = Col(A)⊥ . Since Row(A) = Col(A), so we must have N (A) = N (AT )
)

1
9. Calculate the projection of the vector v = e1 + 2e2 − 3e3 on the subspace H := {(x1 , x2 , x3 , x4 ) ∈ R4 |
x1 + 2x2 + 4x4 = 0}. Here ei for 1 ≤ i ≤ 4 is the standard basis of R4 .
10. Suppose A is an n × n real invertible matrix. Describe the subspace of the row space of A which is orthogonal
to the first column of A−1 .
(Hint: Let Ai be the ith row of A. Since AA−1 = I. So consider the span of A2 , A3 , · · · , An Show that this is
the required space orthogonal to the first column of A−1 . )
11. Let A be an n × n matrix. Prove that
(i) A is invertible if and only if all the eigenvalues of A are not zero.
(ii) Show if A is invertible the eigenvalues of A−1 are reciprocals of eigenvalues of A.

12. Let A be an n × n matrix and α be a scalar. Find the eigenvalues of A − αI in terms of eigenvalues of A.
Further show that A and A − αI have the same eigenvectors.
13. Let A be an n×n matrix. Show that AT and A have the same eigenvalues. Do they have the same eigenvectors?
T
(Hint:
  Use det(A) = det(A ) to show the same eignevalues. For the second part and consider the matrix
0 1
)
0 0
14. Let A be an n × n matrix. Show that:

(a) If A is idempotent A2 = A then eigenvalues of A are either 0 or 1 .
(Am = 0 for some m ≥ 1) then all eigenvalues of A are 0.
(b) If A is nilpotent
 
7 −5 15
15. Let A =  6 −4 15 . Find a matrix Q such that Q−1 AQ is a diagonal matrix and hence calculate A6 .
0 0 1
 
1 1
16. Find the eigenvalues and corresponding eigenvectors of the matrix .
4 1

17. Construct a basis of R3 consisting of eigenvectors of the following matrices


 
0 0 2
(a)  0 2 0 
2 0 3
 
1 1 −1
(b)  −1 1 1 .
−1 1 1
 
−1 2 2
18. (a) Compute the characteristic polynomial of the matrix A =  2 2 2 .
−3 −6 −6
(b) Find the eigenvalues and eigenvectors of the matrix A.
(c) Show that A is diagonalisable.
(d) Find a matrix S such that SAS −1 is diagonal.
(e) Calculate A2021 .
19. Let A, B are square matrices of same order. Then prove that AB and BA have the same characteristic
polynomials.

Page 2

You might also like