Diagonalizable Matrices & Eigenvalues

  • Context: Undergrad 
  • Thread starter Thread starter Este
  • Start date Start date
  • Tags Tags
    Eigenvalues Matrices
Click For Summary

Discussion Overview

The discussion revolves around the conditions under which an nXn matrix is diagonalizable, particularly focusing on the relationship between distinct eigenvalues and diagonalizability. Participants explore various methods to determine diagonalizability, including empirical testing and theoretical theorems.

Discussion Character

  • Exploratory
  • Technical explanation
  • Debate/contested
  • Mathematical reasoning

Main Points Raised

  • Some participants propose that having fewer than n distinct eigenvalues is a sufficient condition to conclude that a matrix is not diagonalizable.
  • Others suggest that empirical testing on simple matrices could clarify the diagonalizability of a given matrix.
  • A theorem is cited stating that if a matrix has n distinct eigenvalues, then it is diagonalizable, but this does not imply that all matrices with fewer than n distinct eigenvalues are non-diagonalizable.
  • It is noted that a matrix is diagonalizable if and only if it has n independent eigenvectors, and that even matrices with repeated eigenvalues may still possess independent eigenvectors.
  • Examples are provided to illustrate matrices with the same eigenvalue but differing diagonalizability, highlighting the complexity of the topic.

Areas of Agreement / Disagreement

Participants express differing views on the implications of distinct eigenvalues for diagonalizability. While some agree on the theorem regarding distinct eigenvalues, there is no consensus on the sufficiency of having fewer distinct eigenvalues to determine non-diagonalizability.

Contextual Notes

Limitations include the dependence on definitions of diagonalizability and eigenvectors, as well as the need for further exploration of cases where eigenvalues are not distinct.

Este
Messages
7
Reaction score
0
Hello,

Is it sufficient to determine that a nXn matrix is not diagonalizable by showing that the number of its distinct eigenvalues is less than n?

Thanks for your time.
 
Physics news on Phys.org
You should empirically test your hypothesis; try it out on the simplest matrices you can imagine.
 
For example, how many distinct eigenvalues does

[tex]\begin{bmatrix} 1 & 0 & 0 \\ 0 & 1 & 0 \\ 0 & 0 & 1\end{bmatrix}[/tex]
have?
 
Ok I got your point...I think the question should be now, how to check whether a matrix is diagonalizable or not?

A theorem I've encountered in my textbook:
Theorem 3: Suppose that A is an nXn matrix and that A has n distinct eigenvalues, then A is diagonalizable.

and somewhere else I read this is sufficient to prove a matrix is diagonalizable but not the other way around.. that's why I posted the question..

So now, all I can do is to prove that Matrix x is diagonalizable, but if it's not, I can't tell for sure...what other methods should I be using?

Thanks for your responses.
 
The most direct way to tell if a matrix isn't diagonalizable is to try and diagonalize it.
 
Este said:
Ok I got your point...I think the question should be now, how to check whether a matrix is diagonalizable or not?

A theorem I've encountered in my textbook:


and somewhere else I read this is sufficient to prove a matrix is diagonalizable but not the other way around.. that's why I posted the question..
Yes- sufficient but not necessary.

So now, all I can do is to prove that Matrix x is diagonalizable, but if it's not, I can't tell for sure...what other methods should I be using?

Thanks for your responses.
An n by n matrix is diagonalizable if and only if it has n independent eigenvectors. Since eigenvectors corresponding to distinct eigenvalues are always independent, if there are n distinct eigenvalues, then there are n independent eigenvectors and so the matrix is diagonalizable. But even if the eigenvalues are not all distinct, there may still be independent eigenvectors.

[tex]\begin{bmatrix}1 & 0 & 0 \\ 0 & 1 & 0 \\ 0 & 0 & 1\end{bmatrix}[/tex]
as I pointed out before has the single eigenvalue 1 but is already diagonal because <1, 0, 0>, <0, 1, 0>, and <0, 0, 1> are independent eigenvectors.

[tex]\begin{bmatrix}1 & 0 & 0 \\ 0 & 1 & 1 \\ 0 & 0 & 1\end{bmatrix}[/tex]
also has 1 as its only eigenvalue. Now, <1, 0, 0> and <0, 0, 1> are the only eigenvectors so this matrix cannot be diagonalized.

Finally,
[tex]\begin{bmatrix}1 & 1 & 0 \\ 0 & 1 & 1 \\ 0 & 0 & 1\end{bmatrix}[/tex]
also has 1 as its only eigenvalue but now only <1, 0, 0> and multiples of that are eigenvectors.
 
Great! Things are pretty clear now, thanks HallsofIvy!
 
Last edited:

Similar threads

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