Inverse eigenvalues theorem: Difference between revisions

Revision as of 00:01, 27 August 2009

Revision as of 11:26, 16 December 2009

Line 1:

{{Unreferenced|date=December 2009}}

{{Orphan|date=December 2009}}

In [[numerical analysis]] and [[linear algebra]], the '''Inverse eigenvalues theorem''' states that, given a matrix A that is [[nonsingular]], with [[eigenvalue]] <math>\lambda>0</math>, <math>\lambda</math> is an eigenvalue of <math>A</math> if and only if <math>\lambda^{-1}</math> is an eigenvalue of <math>A^{-1}</math>.

Line 8 ⟶ 11:

Since A is [[non-singular]], null(A) = {0} and so <math>\lambda \neq 0</math>. Therefore we may multiply both sides of the above equation by <math>\lambda^{-1}</math> to get that <math>A^{-1}x = \lambda^{-1} x</math>; i.e., <math>\lambda^{-1}</math> is an eigenvalue of <math>A^{-1}</math>. By repeating the previous argument but with A replaced by <math>A^{-1}</math> we see that if <math>\lambda^{-1}</math> is an eigenvalue of <math>A^{-1}</math> then <math>\lambda</math> is an eigenvalue of A.

{{DEFAULTSORT:Inverse Eigenvalues Theorem}}

[[Category:Linear algebra]]

[[Category:Mathematical theorems]]

[[Category:Articles lacking sources (Erik9bot)]]

[[Category:Articles containing proofs]]