Diagonalizable matrix

In linear algebra, a square matrix A is called diagonalizable or non-defective if it is similar to a diagonal matrix.

Uses your system voice; voice and rate in settings.

Snapshot

≈ 18 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

In linear algebra, a square matrix A is called diagonalizable or non-defective if it is similar to a diagonal matrix. That is, if there exists an invertible matrix P and a diagonal matrix D such that . This is equivalent to (Such D are not unique.)

This property exists for any linear map: for a finite-dimensional vector space a linear map T:V\to V is called diagonalizable if there exists an ordered basis of V consisting of eigenvectors of T . These definitions are equivalent: if T has a matrix representation A = PDP^{-1} as above, then the column vectors of P form a basis consisting of eigenvectors of and the diagonal entries of D are the corresponding eigenvalues of with respect to this eigenvector basis, T is represented by Diagonalization is the process of finding the above P and and makes many subsequent computations easier. One can raise a diagonal matrix D to a power by simply raising the diagonal entries to that power.

The determinant of a diagonal matrix is simply the product of all diagonal entries. Such computations generalize easily to The geometric transformation represented by a diagonalizable matrix is an inhomogeneous dilation (or anisotropic scaling). That is, it can scale the space by a different amount in different directions.

The direction of each eigenvector is scaled by a factor given by the corresponding eigenvalue.…

In linear algebra, a square matrix A is called diagonalizable or non-defective if it is similar to a diagonal matrix. That is, if there exists an invertible matrix P and a diagonal matrix D such that . This is equivalent to (Such D are not unique.)

This property exists for any linear map: for a finite-dimensional vector space a linear map T:V\to V is called diagonalizable if there exists an ordered basis of V consisting of eigenvectors of T . These definitions are equivalent: if T has a matrix representation A = PDP^{-1} as above, then the column vectors of P form a basis consisting of eigenvectors of and the diagonal entries of D are the corresponding eigenvalues of with respect to this eigenvector basis, T is represented by Diagonalization is the process of finding the above P and and makes many subsequent computations easier. One can raise a diagonal matrix D to a power by simply raising the diagonal entries to that power.

The determinant of a diagonal matrix is simply the product of all diagonal entries. Such computations generalize easily to The geometric transformation represented by a diagonalizable matrix is an inhomogeneous dilation (or anisotropic scaling). That is, it can scale the space by a different amount in different directions.

The direction of each eigenvector is scaled by a factor given by the corresponding eigenvalue. A square matrix that is not diagonalizable is called defective.

It can happen that a matrix A with real entries is defective over the real numbers, meaning that A = PDP^{-1} is impossible for any invertible P and diagonal D with real entries, but it is possible with complex entries, so that A is diagonalizable over the complex numbers. For example, this is the case for a generic rotation matrix.

Many results for diagonalizable matrices hold only over an algebraically closed field (such as the complex numbers). In this case, diagonalizable matrices are dense in the space of all matrices, which means any defective matrix can be deformed into a diagonalizable matrix by a small perturbation; and the Jordan–Chevalley decomposition states that any matrix is uniquely the sum of a diagonalizable matrix and a nilpotent matrix.

Over an algebraically closed field, diagonalizable matrices are equivalent to semi-simple matrices. An n \times n matrix A is diagonalizable over the field F if it has n distinct eigenvalues in i.e. if its characteristic polynomial has n distinct roots in however, the converse may be false.

Consider \begin{bmatrix} -1 & 3 & -1 \\ -3 & 5 & -1 \\ -3 & 3 & 1 \end{bmatrix}, which has eigenvalues 1, 2, 2 (not all distinct) and is diagonalizable with diagonal form (similar to \begin{bmatrix} 1 & 0 & 0 \\ 0 & 2 & 0 \\ 0 & 0 & 2 \end{bmatrix} and change of basis matrix P : \begin{bmatrix} 1 & 1 & -1 \\ 1 & 1 & 0 \\ 1 & 0 & 3 \end{bmatrix}. The converse fails when A has an eigenspace of dimension higher than 1.

In this example, the eigenspace of A associated with the eigenvalue 2 has dimension 2. A linear map T : V \to V with n = \dim(V) is diagonalizable if it has n distinct eigenvalues, i.e. if its characteristic polynomial has n distinct roots in F . Let A be a matrix over If A is diagonalizable, then so is any power of it.

Conversely, if A is invertible, F is algebraically closed, and A^n is diagonalizable for some n that is not an integer multiple of the characteristic of then A is diagonalizable. Proof: If A^n is diagonalizable, then A is annihilated by some polynomial which has no multiple root (since and is divided by the minimal polynomial of Over the complex numbers \Complex , almost every matrix is diagonalizable.

More precisely: the set of complex n \times n matrices that are not diagonalizable over considered as a subset of has Lebesgue measure zero. One can also say that the diagonalizable matrices form a dense subset with respect to the Zariski topology: the non-diagonalizable matrices lie inside the vanishing set of the discriminant of the characteristic polynomial, which is a hypersurface.

From that follows also density in the usual (strong) topology given by a norm. The same is not true over The Jordan–Chevalley decomposition expresses an operator as the sum of its semisimple (i.e., diagonalizable) part and its nilpotent part. Hence, a matrix is diagonalizable if and only if its nilpotent part is zero.

Put in another way, a matrix is diagonalizable if each block in its Jordan form has no nilpotent part; i.e., each "block" is a one-by-one matrix. Consider the two following arbitrary bases E = \{{ \boldsymbol{e}_i | \forall i \in [n] } \} and F = \{ {\boldsymbol{\alpha}_i | \forall i \in [n] } \} .

Suppose that there exists a linear transformation represented by a matrix A_E which is written with respect to basis E. Suppose also that there exists the following eigen-equation: A_E \boldsymbol{\alpha}_{E,i} = \lambda_i \boldsymbol{\alpha}_{E,i} The alpha eigenvectors are written also with respect to the E basis. Since the set F is both a set of eigenvectors for matrix A and it spans some arbitrary vector space, then we say that there exists a matrix D_F which is a diagonal matrix that is similar to A_E . In other words, A_E is a diagonalizable matrix if the matrix is written in the basis F. We perform the change of basis calculation using the transition matrix S , which changes basis from E to F as follows: D_F = S_{E}^F \ A_E \ S_{E}^{-1F} , where S_{E}^F is the transition matrix from E-basis to F-basis.

The inverse can then be equated to a new transition matrix P which changes basis from F to E instead and so we have the following relationship : S_{E}^{-1 F} = P_{F}^{E} Both S and P transition matrices are invertible. Thus we can manipulate the matrices in the following fashion: \begin{align} D = S \ A_{E} \ S^{-1} \\ D = P^{-1} \ A_{E} \ P \end{align} The matrix A_{E} will be denoted as A , which is still in the E-basis.

Similarly, the diagonal matrix is in the F-basis. If a matrix A can be diagonalized, that is, P^{-1}AP = \begin{bmatrix} \lambda_1 & 0 & \cdots & 0 \\ 0 & \lambda_2 & \cdots & 0 \\ \vdots & \vdots & \ddots & \vdots \\ 0 & 0 & \cdots & \lambda_n \end{bmatrix} = D, then: AP = P\begin{bmatrix} \lambda_1 & 0 & \cdots & 0 \\ 0 & \lambda_2 & \cdots & 0 \\ \vdots & \vdots & \ddots & \vdots \\ 0 & 0 & \cdots & \lambda_n \end{bmatrix}.

The transition matrix S has the E-basis vectors as columns written in the basis F. Inversely, the inverse transition matrix P has F-basis vectors \boldsymbol{\alpha}_i written in the basis of E so that we can represent P in block matrix form in the following manner: P = \begin{bmatrix} \boldsymbol{\alpha}_{E,1} & \boldsymbol{\alpha}_{E,2} & \cdots & \boldsymbol{\alpha}_{E,n} \end{bmatrix}, as a result we can write: \begin{align} A \begin{bmatrix} \boldsymbol{\alpha}_{E,1} & \boldsymbol{\alpha}_{E,2} & \cdots & \boldsymbol{\alpha}_{E,n} \end{bmatrix} = \begin{bmatrix} \boldsymbol{\alpha}_{E,1} & \boldsymbol{\alpha}_{E,2} & \cdots & \boldsymbol{\alpha}_{E,n} \end{bmatrix}D. \end{align} In block matrix form, we can consider the A-matrix to be a matrix of 1x1 dimensions whilst P is a 1xn dimensional matrix. The D-matrix can be written in full form with all the diagonal elements as an nxn dimensional matrix: A \begin{bmatrix} \boldsymbol{\alpha}_{E,1} & \boldsymbol{\alpha}_{E,2} & \cdots & \boldsymbol{\alpha}_{E,n} \end{bmatrix}= \begin{bmatrix} \boldsymbol{\alpha}_{E,1} & \boldsymbol{\alpha}_{E,2} & \cdots & \boldsymbol{\alpha}_{E,n} \end{bmatrix} \begin{bmatrix} \lambda_1 & 0 & \cdots & 0 \\ 0 & \lambda_2 & \cdots & 0 \\ \vdots & \vdots & \ddots & \vdots \\ 0 & 0 & \cdots & \lambda_n \end{bmatrix}.

Performing the above matrix multiplication we end up with the following result: \begin{align} A \begin{bmatrix} \boldsymbol{\alpha}_1 & \boldsymbol{\alpha}_2 & \cdots & \boldsymbol{\alpha}_n \end{bmatrix} = \begin{bmatrix} \lambda_1 \boldsymbol{\alpha}_1 & \lambda_2\boldsymbol{\alpha}_2 & \cdots & \lambda_n \boldsymbol{\alpha}_n \end{bmatrix} \end{align} Taking each component of the block matrix individually on both sides, we end up with the following: A\boldsymbol{\alpha}_i = \lambda_i \boldsymbol{\alpha}_i \qquad (i=1,2,\dots,n). So the column vectors of P are right eigenvectors of and the corresponding diagonal entry is the corresponding eigenvalue. The invertibility of P also suggests that the eigenvectors are linearly independent and form a basis of This is the necessary and sufficient condition for diagonalizability and the canonical approach of diagonalization.

The row vectors of P^{-1} are the left eigenvectors of When a complex matrix A\in\mathbb{C}^{n\times n} is a Hermitian matrix (or more generally a normal matrix), eigenvectors of A can be chosen to form an orthonormal basis of and P can be chosen to be a unitary matrix. If in addition, A\in\mathbb{R}^{n\times n} is a real symmetric matrix, then its eigenvectors can be chosen to be an orthonormal basis of \mathbb{R}^n and P can be chosen to be an orthogonal matrix.

For most practical work matrices are diagonalized numerically using computer software. Many algorithms exist to accomplish this. Real symmetric matrices are diagonalizable by orthogonal matrices; i.e., given a real symmetric matrix Q^{\mathrm T}AQ is diagonal for some orthogonal matrix More generally, matrices are diagonalizable by unitary matrices if and only if they are normal.

In the case of the real symmetric matrix, we see that so clearly AA^{\mathrm T} = A^{\mathrm T}A holds. Examples of normal matrices are real symmetric (or skew-symmetric) matrices (e.g. covariance matrices) and Hermitian matrices (or skew-Hermitian matrices). See spectral theorems for generalizations to infinite-dimensional vector spaces.

Additional geometric visualizations of orthogonal diagonalization, including reflection and orthogonal projection matrices, are available at Wikimedia Commons. C = \begin{bmatrix} 0 & 1 \\ 0 & 0 \end{bmatrix}. This matrix is not diagonalizable: there is no matrix U such that U^{-1}CU is a diagonal matrix.

Indeed, C has one eigenvalue (namely zero) and this eigenvalue has algebraic multiplicity 2 and geometric multiplicity 1. Some real matrices are not diagonalizable over the reals. Consider for instance the matrix B = \left[\begin{array}{rr} 0 & 1 \\ \!-1 & 0 \end{array}\right].

The matrix B does not have any real eigenvalues, so there is no real matrix Q such that Q^{-1}BQ is a diagonal matrix. However, we can diagonalize B if we allow complex numbers. Indeed, if we take Q = \begin{bmatrix} 1 & i \\ i & 1 \end{bmatrix}, then Q^{-1}BQ is diagonal.

It is easy to find that B is the rotation matrix which rotates counterclockwise by angle \theta = -\frac{\pi}{2} Note that the above examples show that the sum of diagonalizable matrices need not be diagonalizable. A=\left[\begin{array}{rrr} 0 & 1 & \!\!\!-2\\ 0 & 1 & 0\\ 1 & \!\!\!-1 & 3 \end{array}\right].

The roots of the characteristic polynomial p(\lambda)=\det(\lambda I-A) are the eigenvalues Solving the linear system \left(1I-A\right) \mathbf{v} = \mathbf{0} gives the eigenvectors \mathbf{v}_1 = (1,1,0) and while \left(2I-A\right)\mathbf{v} = \mathbf{0} gives that is, A \mathbf{v}_i = \lambda_i \mathbf{v}_i for These vectors form a basis of so we can assemble them as the column vectors of a change-of-basis matrix P to get: P^{-1}AP = \left[\begin{array}{rrr} 1 & 0 & 1\\ 1 & 2 & 0\\ 0 & 1 & \!\!\!\!-1 \end{array}\right]^{-1} \left[\begin{array}{rrr} 0 & 1 & \!\!\!-2\\ 0 & 1 & 0\\ 1 & \!\!\!-1 & 3 \end{array}\right] \left[\begin{array}{rrr} 1 & \,0 & 1\\ 1 & 2 & 0\\ 0 & 1 & \!\!\!\!-1 \end{array}\right] P^{-1} AP \mathbf{e}_i = P^{-1} A \mathbf{v}_i = P^{-1} (\lambda_i\mathbf{v}_i) = \lambda_i\mathbf{e}_i, so that P^{-1} AP has the standard basis as its eigenvectors, which is the defining property of Note that there is no preferred order of the eigenvectors in changing the order of the eigenvectors in P just changes the order of the eigenvalues in the diagonalized form of A^k &= \left(PDP^{-1}\right)^k = \left(PDP^{-1}\right) \left(PDP^{-1}\right) \cdots \left(PDP^{-1}\right) \\ &= PD\left(P^{-1}P\right) D \left(P^{-1}P\right) \cdots \left(P^{-1}P\right) D P^{-1} = PD^kP^{-1}, \end{align} and the latter is easy to calculate since it only involves the powers of a diagonal matrix. For example, for the matrix A with eigenvalues \lambda = 1,1,2 in the example above we compute: \begin{align} A^k = PD^kP^{-1} &= \left[\begin{array}{rrr} 1 & \,0 & 1 \\ 1 & 2 & 0 \\ 0 & 1 & \!\!\!\!-1 \end{array}\right] \begin{bmatrix} 1^k & 0 & 0 \\ 0 & 1^k & 0 \\ 0 & 0 & 2^k \end{bmatrix} \left[\begin{array}{rrr} 1 & \,0 & 1 \\ 1 & 2 & 0 \\ 0 & 1 & \!\!\!\!-1 \end{array}\right]^{-1} \\[1em] &= \begin{bmatrix} 2 - 2^k & -1 + 2^k & 2 - 2^{k + 1} \\ 0 & 1 & 0 \\ -1 + 2^k & 1 - 2^k & -1 + 2^{k + 1} \end{bmatrix}. \end{align} This approach can be generalized to matrix exponential and other matrix functions that can be defined as power series.

For example, defining we have: \begin{align} \exp(A) = P \exp(D) P^{-1} &= \left[\begin{array}{rrr} 1 & \,0 & 1 \\ 1 & 2 & 0 \\ 0 & 1 & \!\!\!\!-1 \end{array}\right] \begin{bmatrix} e^1 & 0 & 0 \\ 0 & e^1 & 0 \\ 0 & 0 & e^2 \end{bmatrix} \left[\begin{array}{rrr} 1 & \,0 & 1\\ 1 & 2 & 0\\ 0 & 1 & \!\!\!\!-1 \end{array}\right]^{-1} \\[1em] &= \begin{bmatrix} 2 e - e^2 & -e + e^2 & 2 e - 2 e^2 \\ 0 & e & 0 \\ -e + e^2 & e - e^2 & -e + 2 e^2 \end{bmatrix}. \end{align} This is particularly useful in finding closed form expressions for terms of linear recursive sequences, such as the Fibonacci numbers. M = \begin{bmatrix}a & b - a\\ 0 & b\end{bmatrix}.

Calculating the various powers of M reveals a surprising pattern: M^2 = \begin{bmatrix}a^2 & b^2-a^2 \\ 0 &b^2 \end{bmatrix},\quad M^3 = \begin{bmatrix}a^3 & b^3-a^3 \\ 0 &b^3 \end{bmatrix},\quad M^4 = \begin{bmatrix}a^4 & b^4-a^4 \\ 0 &b^4 \end{bmatrix},\quad \ldots The above phenomenon can be explained by diagonalizing To accomplish this, we need a basis of \R^2 consisting of eigenvectors of One such eigenvector basis is given by \mathbf{u} = \begin{bmatrix} 1 \\ 0 \end{bmatrix} = \mathbf{e}_1,\quad \mathbf{v} = \begin{bmatrix} 1 \\ 1 \end{bmatrix} = \mathbf{e}_1 + \mathbf{e}_2, where e i denotes the standard basis of R n . The reverse change of basis is given by \mathbf{e}_1 = \mathbf{u},\qquad \mathbf{e}_2 = \mathbf{v} - \mathbf{u}. Straightforward calculations show that M\mathbf{u} = a\mathbf{u},\qquad M\mathbf{v} = b\mathbf{v}.

Thus, a and b are the eigenvalues corresponding to u and v, respectively. By linearity of matrix multiplication, we have that M^n \mathbf{u} = a^n \mathbf{u},\qquad M^n \mathbf{v} = b^n \mathbf{v}.

Switching back to the standard basis, we have \begin{align} M^n \mathbf{e}_1 &= M^n \mathbf{u} = a^n \mathbf{e}_1, \\ M^n \mathbf{e}_2 &= M^n \left(\mathbf{v} - \mathbf{u}\right) = b^n \mathbf{v} - a^n\mathbf{u} = \left(b^n - a^n\right) \mathbf{e}_1 + b^n\mathbf{e}_2. \end{align} The preceding relations, expressed in matrix form, are M^n = \begin{bmatrix} a^n & b^n - a^n \\ 0 & b^n \end{bmatrix}, thereby explaining the above phenomenon. Let H be a Hilbert space.

An operator D: H \to H is a diagonal operator iff there exists an orthonormal basis (e_n)_n of H , such that De_n = \lambda_n e_n for some \lambda_n \in \C . For any p \geq 1 , define the p-Schatten norm as follows. Let T: H \to H be an operator, then \|T\|_p := \operatorname{Tr}(|T|^p)^{1/p} , where \operatorname{Tr} is the trace.

The p-Schatten class is the set of all operators with finite p-Schatten norm. Weyl, von Neumann, and Kuroda, showed the following: For any p > 1 , any self-adjoint operator T on a Hilbert space H , and any \epsilon > 0 , there exists a diagonal operator D , such that \|T-D\|_p \leq \epsilon .

In other words, any self-adjoint operator is an infinitesimal perturbation from a diagonal operator, where "infinitesimal" is in the sense of p-Schatten norm. In particular, since the Hilbert–Schmidt operator class is the 2-Schatten class, this means that any self-adjoint operator is diagonalizable after a perturbation by an infinitesimal Hilbert–Schmidt operator.

In fact, the above result could be further generalized: For any norm ideal that is not the trace class, with norm \|\cdot\|_J , any self-adjoint operator T on a Hilbert space H , and any \epsilon > 0 , there exists a diagonal operator D , such that \|T-D\|_J \leq \epsilon . The result is false for p= 1 (the trace class).

This is a simple corollary of the Kato –Rosenblum theorem, which states that if T is self-adjoint, and A is trace class, then T, T+A have the same absolutely continuous part of the spectrum. The result is sharp, however, in the sense that if T has no absolutely continuous part, then it can be diagonalized after perturbation by an infinitesimal trace class operator.

For simultaneous diagonalization, it's known that, given a finite list of T_1, \dots, T_n self-adjoint operators that commute with each other, for any \epsilon > 0 , there exists a sequence of diagonal operators D_1, \dots, D_n , such that \|T_1-D_1\|_n \leq \epsilon, \dots, \|T_n-D_n\|_n \leq \epsilon , where \|\cdot\|_n is the n-Schatten norm. Note that n \ge 2

Text derived from https://en.wikipedia.org/w/index.php?oldid=1378610409 under CC BY-SA 4.0; modifications have been made.

Sources cited in this revision

7 named source(s) extracted from the cited revision. A source with no author is shown by its publication; nothing is invented.