Matrix with repeated eigenvalues is diagonalizable....?

Click For Summary
SUMMARY

The discussion clarifies that matrices with repeated eigenvalues can be diagonalizable under certain conditions. Specifically, while the textbook "Linear Algebra" by Gilbert Strang states that repeated eigenvalues may lead to non-diagonalizability, examples demonstrate that it is possible to have n-independent eigenvectors even with repeated eigenvalues. The matrix example provided, 5*eye(4) - ones(4), successfully produces independent eigenvectors in MATLAB. The key takeaway is that having distinct eigenvalues guarantees diagonalizability, but the converse is not necessarily true.

PREREQUISITES
  • Understanding of eigenvalues and eigenvectors
  • Familiarity with diagonalization of matrices
  • Knowledge of characteristic polynomials
  • Experience using MATLAB for matrix computations
NEXT STEPS
  • Study the concept of eigenvector bases in linear algebra
  • Learn about the implications of the characteristic polynomial in diagonalization
  • Explore MATLAB functions for eigenvalue and eigenvector calculations
  • Investigate examples of matrices with repeated eigenvalues and their diagonalizability
USEFUL FOR

Students and professionals in mathematics, particularly those studying linear algebra, as well as software engineers and data scientists utilizing MATLAB for matrix analysis.

kostoglotov
Messages
231
Reaction score
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
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.
 
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   Reactions: kostoglotov

Similar threads

  • · Replies 33 ·
2
Replies
33
Views
2K
  • · Replies 4 ·
Replies
4
Views
3K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 3 ·
Replies
3
Views
4K
  • · Replies 2 ·
Replies
2
Views
5K
  • · Replies 4 ·
Replies
4
Views
6K
  • · Replies 9 ·
Replies
9
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 3 ·
Replies
3
Views
4K
  • · Replies 1 ·
Replies
1
Views
3K