Calculating Eigenvalues: 0 Root Meanings

  • Thread starter Thread starter wakko101
  • Start date Start date
  • Tags Tags
    Eigenvalues Root
Click For Summary
SUMMARY

When calculating eigenvalues for a matrix, obtaining a root of 0 indicates that the matrix is singular, meaning it does not have an inverse. This does not imply anything special about the eigenvectors; rather, the eigenvectors corresponding to a zero eigenvalue form the basis for the null space of the matrix. For example, in the diagonalized form of the matrix, the eigenvector associated with the eigenvalue 0 is (0,1,0). Eigenvectors are not uniquely determined, as any nonzero scalar multiple of an eigenvector is also an eigenvector.

PREREQUISITES
  • Understanding of linear algebra concepts, specifically eigenvalues and eigenvectors
  • Familiarity with matrix diagonalization techniques
  • Knowledge of singular matrices and their properties
  • Basic understanding of finite fields, particularly GF(2)
NEXT STEPS
  • Study the properties of singular matrices and their implications in linear algebra
  • Learn about the null space and its relationship with eigenvalues
  • Explore matrix diagonalization and its applications in various fields
  • Investigate finite fields, particularly GF(2), and their significance in algebra
USEFUL FOR

Students and professionals in mathematics, particularly those studying linear algebra, as well as data scientists and engineers working with matrix computations and eigenvalue problems.

wakko101
Messages
61
Reaction score
0
This is just a general question:

If, when you are calculating the eigenvalues for a matrix, you get a root of 0 (eg. x^3 - x) --> x(x-1)(x+1), what does that mean for the eigenvectors?

thanks,
w.
 
Physics news on Phys.org
Nothing. It just means that one of the eigenvalues is zero, it doesn't mean anything special about eigenvectors... When diagonalized the matrix of the operator looks like
<br /> \left(<br /> \begin{array}{ccc}<br /> -1 &amp; 0 &amp; 0 \\<br /> 0 &amp; 0 &amp; 0 \\<br /> 0&amp; 0 &amp; 1<br /> \end{array}<br /> \right)\;.<br />
In this basis, the eigenvector with eigenvalue -1 is (1,0,0) and the eigenvector with eigenvalue 0 is (0,1,0) and the eigenvector with eigenvalue 1 is (0,0,1).
 
There is nothing wrong with an eigenvalue being zero, and it is not more special than an eigenvalue being -1, i or \pi.

Only an eigenvector cannot be zero. Which makes sense, because the zero vector trivially satisfies A 0 = \lambda 0 for any number \lambda.
 
A zero eigenvalue means the matrix in question is singular. The eigenvectors corresponding to the zero eigenvalues form the basis for the null space of the matrix.
 
According to definition: Ax=cx,x is nonzero vector,then
we have Ax=0,
which means it has nonzero solutions,
also means A is signular,
also means the corresponding eigenvector is not uniquely determined.
 
uiulic said:
also means the corresponding eigenvector is not uniquely determined.
Eigenvectors are never1 uniquely determined; at the very least, any nonzero scalar multiple of an eigenvector is an eigenvector.

1: Unless your scalar field is GF(2).
 
And who, might I ask, is GF(2) ? :eek:
 
Thank Hurkyl for pointing out my misunderstanding (I was thinking about sth else.)
 
GF(2) is the finite field with two elements. It's isomorphic to the integers modulo 2.
 

Similar threads

Replies
5
Views
2K
  • · Replies 24 ·
Replies
24
Views
4K
  • · Replies 2 ·
Replies
2
Views
2K
Replies
11
Views
2K
  • · Replies 4 ·
Replies
4
Views
1K
  • · Replies 22 ·
Replies
22
Views
975
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 2 ·
Replies
2
Views
1K
Replies
9
Views
2K
  • · Replies 8 ·
Replies
8
Views
2K