Eigenvectors and diagnolization

  • Thread starter Thread starter Hallingrad
  • Start date Start date
  • Tags Tags
    Eigenvectors
Click For Summary
SUMMARY

The discussion centers on the diagonalization of matrices, specifically addressing two key points. First, a 3x3 matrix with a zero row has a determinant of 0, indicating that it has at least one eigenvalue of 0, thus it cannot be diagonalizable. Second, it is established that an n x n matrix A in complex space with n distinct eigenvalues guarantees that A is diagonalizable, as distinct eigenvalues correspond to independent eigenvectors. The reasoning provided in the discussion clarifies common misconceptions regarding the relationship between eigenvalues and eigenvectors.

PREREQUISITES
  • Understanding of eigenvalues and eigenvectors
  • Knowledge of matrix diagonalization
  • Familiarity with determinants and their implications
  • Basic concepts of linear transformations in vector spaces
NEXT STEPS
  • Study the implications of the determinant being zero on matrix properties
  • Learn about the relationship between eigenvalues and eigenvectors in depth
  • Explore the conditions under which a matrix is diagonalizable
  • Investigate the concept of linear independence in the context of eigenvectors
USEFUL FOR

Mathematicians, students studying linear algebra, and anyone interested in understanding matrix theory and its applications in various fields.

Hallingrad
Messages
29
Reaction score
0
Two questions. First, I'm given a 3x3 matrix with the last row all zeroes. I'm asked to diagonalizable it, but the determinant is 0, so there are no eigenvalues. Am I reasoning correctly here? It seems an odd question to ask.

Second, I'm asked to prove that if A n x n matrix in C space, then if A has n distinct eigenvalues, A is then diagonalizable. The way I proved it is to say that for A to be diagonalizable, it must have n distinct eigenvectors, which is only the case if it has n distinct eigenvalues. This seems far too easy, am I missing something?
 
Physics news on Phys.org
If the determinant is 0 then 0 is an eigenvalue for the matrix
 
Hallingrad said:
Two questions. First, I'm given a 3x3 matrix with the last row all zeroes. I'm asked to diagonalizable it, but the determinant is 0, so there are no eigenvalues. Am I reasoning correctly here? It seems an odd question to ask.

Second, I'm asked to prove that if A n x n matrix in C space, then if A has n distinct eigenvalues, A is then diagonalizable. The way I proved it is to say that for A to be diagonalizable, it must have n distinct eigenvectors, which is only the case if it has n distinct eigenvalues. This seems far too easy, am I missing something?
Pretty much nothing you have said is right. First of all, you are going the "wrong way". You were asked to prove that if A has n distinct eigenvalues, then it is diagonalizable.

What you are trying to prove is that "if A is diagonalizable then it has n distinct eigenvalues".

You cannot prove that because it is NOT true! Further, it is not true that a matirix having n distinct eigenvectors "is only the case if it has n distinct eigenvalues. The n by n identity matrix has n independent eigenvectors but all n of its eigenvalues is the same.


The other way is correct. Since eigenvectors corresponding to distinct eigenvalues are independent, if an n by n matrix has n distinct eigenvalues then it must have n independent ("distinct" is not enough) eigenvectors and so is diagonalizable. (Write the linear transformation corresponding in a basis consisting of those eigenvectors.)
 

Similar threads

  • · Replies 7 ·
Replies
7
Views
2K
Replies
3
Views
2K
Replies
7
Views
4K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 33 ·
2
Replies
33
Views
3K
  • · Replies 1 ·
Replies
1
Views
5K
Replies
4
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K