1. The document discusses linear algebra concepts including constructing the general solution of a matrix equation involving complex eigenfunctions, finding the minimal polynomial and diagonalizability of matrices, examples of matrices that are or aren't diagonalizable over R and C, and constructing matrices that are triangulable but not diagonalizable over R.
2. Several problems are presented involving finding eigenvalues and eigenvectors of matrices, solving initial value problems for systems of differential equations defined by matrices, determining minimal polynomials, and analyzing properties like diagonalizability.
3. Examples are given of matrices whose minimal polynomials indicate they are triangulable but not diagonalizable over R.
1. The document discusses linear algebra concepts including constructing the general solution of a matrix equation involving complex eigenfunctions, finding the minimal polynomial and diagonalizability of matrices, examples of matrices that are or aren't diagonalizable over R and C, and constructing matrices that are triangulable but not diagonalizable over R.
2. Several problems are presented involving finding eigenvalues and eigenvectors of matrices, solving initial value problems for systems of differential equations defined by matrices, determining minimal polynomials, and analyzing properties like diagonalizability.
3. Examples are given of matrices whose minimal polynomials indicate they are triangulable but not diagonalizable over R.
1. The document discusses linear algebra concepts including constructing the general solution of a matrix equation involving complex eigenfunctions, finding the minimal polynomial and diagonalizability of matrices, examples of matrices that are or aren't diagonalizable over R and C, and constructing matrices that are triangulable but not diagonalizable over R.
2. Several problems are presented involving finding eigenvalues and eigenvectors of matrices, solving initial value problems for systems of differential equations defined by matrices, determining minimal polynomials, and analyzing properties like diagonalizability.
3. Examples are given of matrices whose minimal polynomials indicate they are triangulable but not diagonalizable over R.
Indian Institute of Information Technology Vadodara
MA 101: Linear Algebra and Matrices
Tutorial 8
1. Construct the general solution of x0 = Ax involving complexeigenfunc-
3 1 tions and then obtain the general real solution, where A = −2 1
2. Let x(t) be the position of a particle at time t. Let A bea 2 × 2 matrix
−1 1 with eigenvalues -3 and -1 corresponding to eigenvectors and . 1 1 0 2 Solve the initial value problem x = Ax with x(0) = . 3 3. Find the minimal polynomial of following matrix and answer diagonal- izabilty and triangulability of the matrix by analysing minimal poly- nomial. 0 1 0 1 1 0 1 0 0 1 0 1 1 0 1 0
4. Find a 3 × 3 matrix whose minimal polynomial is λ2 .
5. Show that every matrix A ∈ Mn (R) with A2 = A is diagonalisable over
R.
6. Give an example of a matrix which is not diagonalisable over C. Show
that every square matrix with complex entries is triangulable over C. 0 1 0 ··· 0 0 0 1 0 7. Let P (t) = a0 +a1 t+· · ·+an−1 tn−1 +tn . Consider A = .. . .. . . −a0 −a1 −a2 · · · −an−1 Show that characteristics polynomial of A is P (t). What can you say about minimal polynomial of A? Construct a 4 × 4 matrix which is triangulable over R but not diagonalizable over R.