Matrix with repeated eigenvalues is diagonalizable....?

In summary, the textbook emphasizes that matrices with repeated eigenvalues are not necessarily diagonalizable. However, if all eigenvalues exist in the underlying field or ring and there are as many as the dimension is, then the matrix is diagonalizable. A necessary condition for diagonalizability is that the characteristic polynomial only has linear factors, which may be repeated. This means that all zeros of the characteristic polynomial must exist in the underlying field or ring. However, the existence of eigenvalues alone is not sufficient for diagonalizability, as a basis of eigenvectors must also be found.
  • #1
kostoglotov
234
6
MIT OCW 18.06 Intro to Linear Algebra 4th edt Gilbert Strang

Ch6.2 - the textbook emphasized that "matrices that have repeated eigenvalues are not diagonalizable".

Q4pbi33.jpg

imgur: http://i.imgur.com/Q4pbi33.jpg

and

RSOmS2o.jpg

imgur: http://i.imgur.com/RSOmS2o.jpg

Upon rereading...I do see the possibility to interpret this to mean that fewer than n independent eigenvectors leads to an undiagonalizable matrix...that n-all different eigenvalues ensures n-independent eigenvectors...leaving open the possibility of n-independent eigenvectors with repeated eigenvalues...? Yes, no?

Because the second worked example shows a matrix with eigenvalues 1,5,5,5, and the use of diagonalization of that matrix, and Matlab is quite happy to produce a matrix of n-independent eigenvectors from this matrix.

The matrix in question is 5*eye(4) - ones(4);

What is the actual rule, because I don't feel clear on this.
 
Physics news on Phys.org
  • #2
If all n eigenvalues are distinct, then the matrix is diagonalizable. However, the converse is not true. There are matrices that are diagonalizable even if their eigenvalues are not distinct, as your example clearly shows.
 
  • #3
Diagonalizable means per definition that you can find a basis of eigenvectors. If all eigenvalues exist in the underlying field or ring and there are as many as the dimension is, there is clearly a basis of eigenvectors. This condition is sufficient but not necessary since diag(1,...,1) is diagonalized with just one (repeated) eigenvalue 1. A necessary condition is that the characteristic polynomial det(A-t*id) of a matrix A has only linear factors (which may be repeated, e.g. det(id - t*id) = (1-t)^dimension ). i.e. all zeros of the characteristic polynomial exist in the underlying field or ring. Those zeros are exactly the eigenvalues.

Ps: You have still to find a basis of eigenvectors. The existence of eigenvalues alone isn't sufficient. E.g.
0 1
0 0
is not diagonalizable although the repeated eigenvalue 0 exists and the characteristic po1,0lynomial is t^2. But here only (1,0) is a eigenvector to 0.
 
Last edited:
  • Like
Likes kostoglotov

1. What does it mean for a matrix to have repeated eigenvalues?

Having repeated eigenvalues means that there are multiple eigenvalues with the same value in a matrix. This means that there are fewer distinct eigenvalues than the dimension of the matrix.

2. How do you determine if a matrix with repeated eigenvalues is diagonalizable?

A matrix is diagonalizable if it has a complete set of linearly independent eigenvectors. To determine if a matrix with repeated eigenvalues is diagonalizable, we need to check if the number of linearly independent eigenvectors equals the number of repeated eigenvalues.

3. Can a matrix with repeated eigenvalues be diagonalized?

Yes, a matrix with repeated eigenvalues can be diagonalized if it has a complete set of linearly independent eigenvectors. If the number of linearly independent eigenvectors is less than the number of repeated eigenvalues, then the matrix is not diagonalizable.

4. What is the importance of diagonalizing a matrix with repeated eigenvalues?

Diagonalizing a matrix with repeated eigenvalues can simplify calculations and make it easier to find the powers of the matrix. It also allows us to easily analyze the behavior of the matrix and understand its properties.

5. How is the diagonalization process different for a matrix with repeated eigenvalues compared to a matrix with distinct eigenvalues?

The diagonalization process for a matrix with repeated eigenvalues is similar to that of a matrix with distinct eigenvalues, but with additional considerations. In addition to finding a complete set of linearly independent eigenvectors, we also need to find generalized eigenvectors for each repeated eigenvalue. These generalized eigenvectors form the basis for the Jordan canonical form of the matrix.

Similar threads

  • Linear and Abstract Algebra
Replies
9
Views
1K
  • Linear and Abstract Algebra
Replies
2
Views
4K
  • Linear and Abstract Algebra
Replies
4
Views
4K
  • Linear and Abstract Algebra
Replies
2
Views
1K
  • Calculus and Beyond Homework Help
Replies
5
Views
2K
  • Linear and Abstract Algebra
Replies
1
Views
2K
  • Linear and Abstract Algebra
Replies
10
Views
983
  • Linear and Abstract Algebra
Replies
9
Views
3K
  • Linear and Abstract Algebra
Replies
7
Views
2K
  • Linear and Abstract Algebra
Replies
4
Views
4K
Back
Top