Difference between revisions of "Diagonalizable"
m |
m (bold) |
||
| Line 1: | Line 1: | ||
| − | An operator ''T'' on a finite-dimensional vectorspace ''V'' is diagonalizeable if ''V'' has a basis of eigenvectors for ''T''. | + | An operator ''T'' on a finite-dimensional vectorspace ''V'' is '''diagonalizeable''' if ''V'' has a basis of eigenvectors for ''T''. |
==Denseness of diagonalizeable operators== | ==Denseness of diagonalizeable operators== | ||
Revision as of 22:31, July 30, 2008
An operator T on a finite-dimensional vectorspace V is diagonalizeable if V has a basis of eigenvectors for T.
Denseness of diagonalizeable operators
The space of complex linear operators on <math>\mathbb{C}^n</math> may be identified with the vectorspace <math>M_n(\mathbb{C})</math> of nxn matrices with complex coefficients. As such, it inherits a natural structure as a topological space.
Given this topology, the set of diagonalizeable maps is a dense subset of <math>M_n(\mathbb{C}^n)</math>.
We can prove this as follows: Every complex matrix <math>A</math> is conjugate to a matrix <math>B</math> in Jordan-canonical form. One can then perturb the diagonal elements <math>b_{ii}</math> of <math>B</math> by arbitrarily small numbers <math>\epsilon_i</math> so that the diagonal elements <math>b_{ii}+\epsilon_i</math>of the perturbed matrix are distinct. But this implies that the perturbed matrix is diagonalizeable. Thus, we can find a diagonalizeable matrix arbitrarily close to a conjugate of <math>A</math>. But since conjugation is a length-preserving operation on the inner product space of complex matrices, this shows that <math>A</math> is arbitrarily close to a diagonalizeable matrix. This completes the proof.