Difference between revisions of "Diagonalizable"

From Conservapedia
Jump to navigation Jump to search
 
(8 intermediate revisions by 5 users not shown)
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 [[vector space]] ''V'' is '''diagonalizable''' if ''V'' has a [[basis]] of [[eigenvector]]s for ''T''.
 +
 
 +
==Denseness of diagonalizable operators==
 +
 
 +
The space of [[complex]] [[linear]] [[operator]]s on <math>\mathbb{C}^n</math> may be identified with the vector space <math>M_n(\mathbb{C})</math> of nxn [[matrices]] with complex [[coefficient]]s. As such, it inherits a natural structure as a [[topological space]].
 +
 
 +
 
 +
Given this topology, the set of diagonalizable functions 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 diagonalizable. Thus, we can find a diagonalizable 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 diagonalizable matrix. This completes the proof.
  
 
[[Category:Mathematics]]
 
[[Category:Mathematics]]

Latest revision as of 13:46, May 1, 2010

An operator T on a finite-dimensional vector space V is diagonalizable if V has a basis of eigenvectors for T.

Denseness of diagonalizable operators

The space of complex linear operators on may be identified with the vector space of nxn matrices with complex coefficients. As such, it inherits a natural structure as a topological space.


Given this topology, the set of diagonalizable functions is a dense subset of .

We can prove this as follows: Every complex matrix is conjugate to a matrix in Jordan canonical form. One can then perturb the diagonal elements of by arbitrarily small numbers so that the diagonal elements of the perturbed matrix are distinct. But this implies that the perturbed matrix is diagonalizable. Thus, we can find a diagonalizable matrix arbitrarily close to a conjugate of Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle A} . But since conjugation is a length-preserving operation on the inner product space of complex matrices, this shows that Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle A} is arbitrarily close to a diagonalizable matrix. This completes the proof.