Diagonalizable matrix

In linear algebra, a square matrix A is called diagonalizable if it is similar to a diagonal matrix, i.e., if there exists an invertible matrix P such that P⁻¹AP is a diagonal matrix. If V is a finite-dimensional vector space, then a linear map T : V → V is called diagonalizable if there exists an ordered basis of V with respect to which T is represented by a diagonal matrix. Diagonalization is the process of finding a corresponding diagonal matrix for a diagonalizable matrix or linear map.^[1] A square matrix that is not diagonalizable is called defective.

Diagonalizable matrices and maps are of interest because diagonal matrices are especially easy to handle: their eigenvalues and eigenvectors are known, one can raise a diagonal matrix to a power by simply raising the diagonal entries to that same power, and the determinant of a diagonal matrix is simply the product of all diagonal entries. Geometrically, a diagonalizable matrix is an inhomogeneous dilation (or anisotropic scaling) — it scales the space, as does a homogeneous dilation, but by a different factor in each direction, determined by the scale factors on each axis (diagonal entries).

Characterization

The fundamental fact about diagonalizable maps and matrices is expressed by the following:

An n×n matrix A over the field F is diagonalizable if and only if the sum of the dimensions of its eigenspaces is equal to n, which is the case if and only if there exists a basis of Fⁿ consisting of eigenvectors of A. If such a basis has been found, one can form the matrix P having these basis vectors as columns, and P⁻¹AP will be a diagonal matrix. The diagonal entries of this matrix are the eigenvalues of A.
A linear map T : V → V is diagonalizable if and only if the sum of the dimensions of its eigenspaces is equal to dim(V), which is the case if and only if there exists a basis of V consisting of eigenvectors of T. With respect to such a basis, T will be represented by a diagonal matrix. The diagonal entries of this matrix are the eigenvalues of T.

Another characterization: A matrix or linear map is diagonalizable over the field F if and only if its minimal polynomial is a product of distinct linear factors over F. (Put in another way, a matrix is diagonalizable if and only if all of its elementary divisors are linear.)

The following sufficient (but not necessary) condition is often useful.

An n×n matrix A is diagonalizable over the field F if it has n distinct eigenvalues in F, i.e. if its characteristic polynomial has n distinct roots in F; however, the converse may be false. Let us 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 A)

\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 → 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 F. If A is diagonalizable, then so is any power of it. Conversely, if A is invertible, F is algebraically closed, and Aⁿ is diagonalizable for some n that is not an integer multiple of the characteristic of F, then A is diagonalizable. Proof: If Aⁿ is diagonalizable, then A is annihilated by some polynomial $(x^n - \lambda_1) \cdots (x^n - \lambda_k)$ , which has no multiple root (since $\lambda_j \ne 0$ ) and is divided by the minimal polynomial of A.

As a rule of thumb, over C almost every matrix is diagonalizable. More precisely: the set of complex n×n matrices that are not diagonalizable over C, considered as a subset of C^n×n, has Lebesgue measure zero. One can also say that the diagonalizable matrices form a dense subset with respect to the Zariski topology: the complement lies inside the set where the discriminant of the characteristic polynomial vanishes, which is a hypersurface. From that follows also density in the usual (strong) topology given by a norm. The same is not true over R.

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.

Diagonalization

If a matrix A can be diagonalized, that is,

P^{-1}AP=\begin{pmatrix}\lambda_{1}\\ & \lambda_{2}\\ & & \ddots\\ & & & \lambda_{n}\end{pmatrix},

then:

AP=P\begin{pmatrix}\lambda_{1}\\ & \lambda_{2}\\ & & \ddots\\ & & & \lambda_{n}\end{pmatrix} .

Writing P as a block matrix of its column vectors $\vec{\alpha}_{i}$

P=\begin{pmatrix}\vec{\alpha}_{1} & \vec{\alpha}_{2} & \cdots & \vec{\alpha}_{n}\end{pmatrix},

the above equation can be rewritten as

A\vec{\alpha}_{i}=\lambda_{i}\vec{\alpha}_{i}\qquad(i=1,2,\cdots,n).

So the column vectors of P are right eigenvectors of A, 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 Fⁿ. This is the necessary and sufficient condition for diagonalizability and the canonical approach of diagonalization. The row vectors of P⁻¹ are the left eigenvectors of A.

When the matrix A is a Hermitian matrix (resp. symmetric matrix), eigenvectors of A can be chosen to form an orthonormal basis of Cⁿ (resp. Rⁿ). Under such circumstance P will be a unitary matrix (resp. orthogonal matrix) and P⁻¹ equals the conjugate transpose (resp. transpose) of P.

In practice, matrices are diagonalized numerically using computers. Many algorithms exist to accomplish this.

Simultaneous diagonalization

A set of matrices is said to be simultaneously diagonalizable if there exists a single invertible matrix P such that P⁻¹AP is a diagonal matrix for every A in the set. The following theorem characterises simultaneously diagonalisable matrices: A set of diagonalizable matrices commutes if and only if the set is simultaneously diagonalisable.^[2]

The set of all n×n diagonalisable matrices (over C) with n > 1 is not simultaneously diagonalisable. For instance, the matrices

\begin{bmatrix} 1 & 0 \\ 0 & 0 \end{bmatrix} \quad\text{and}\quad \begin{bmatrix} 1 & 1 \\ 0 & 0 \end{bmatrix}

are diagonalizable but not simultaneously diagonalizable because they do not commute.

A set consists of commuting normal matrices if and only if it is simultaneously diagonalisable by a unitary matrix; that is, there exists a unitary matrix U such that U*AU is diagonal for every A in the set.

In the language of Lie theory, a set of simultaneously diagonalisable matrices generate a toral Lie algebra.

Examples

Diagonalizable matrices

Involutions are diagonalizable over the reals (and indeed any field of characteristic not 2), with ±1 on the diagonal.
Finite order endomorphisms are diagonalisable over C (or any algebraically closed field where the characteristic of the field does not divide the order of the endomorphism) with roots of unity on the diagonal. This follows since the minimal polynomial is separable, because the roots of unity are distinct.
Projections are diagonalizable, with 0s and 1s on the diagonal.
Real symmetric matrices are diagonalizable by orthogonal matrices; i.e., given a real symmetric matrix A, Q^TAQ is diagonal for some orthogonal matrix Q. 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 A = A^T, so clearly AA^T = A^TA 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.

Matrices that are not diagonalizable

In general, a rotation matrix is not diagonalizable over the reals, but all rotation matrices are diagonalizable over the complex field. Even if a matrix is not diagonalizable, it is always possible to "do the best one can", and find a matrix with the same properties consisting of eigenvalues on the leading diagonal, and either ones or zeroes on the superdiagonal - known as Jordan normal form.

Some matrices are not diagonalizable over any field, most notably nonzero nilpotent matrices. This happens more generally if the algebraic and geometric multiplicities of an eigenvalue do not coincide. For instance, consider

C = \begin{bmatrix} 0 & 1 \\ 0 & 0 \end{bmatrix}.

This matrix is not diagonalizable: there is no matrix U such that U⁻¹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 = \begin{bmatrix} 0 & 1 \\ -1 & 0 \end{bmatrix}.

The matrix B does not have any real eigenvalues, so there is no real matrix Q such that Q⁻¹BQ is a diagonal matrix. However, we can diagonalize B if we allow complex numbers. Indeed, if we take

Q = \begin{bmatrix} 1 & \textrm{i} \\ \textrm{i} & 1 \end{bmatrix},

then Q⁻¹BQ is diagonal.

Note that the above examples show that the sum of diagonalizable matrices need not be diagonalizable.

How to diagonalize a matrix

Consider a matrix

A=\begin{bmatrix} 1& 2 & 0 \\ 0 & 3 & 0 \\ 2 & -4 & 2 \end{bmatrix}.

This matrix has eigenvalues

\lambda_1 = 3, \quad \lambda_2 = 2, \quad \lambda_3= 1.

A is a 3×3 matrix with 3 different eigenvalues; therefore, it is diagonalizable. Note that if there are exactly n distinct eigenvalues in an n×n matrix then this matrix is diagonalizable.

These eigenvalues are the values that will appear in the diagonalized form of matrix A, so by finding the eigenvalues of A we have diagonalized it. We could stop here, but it is a good check to use the eigenvectors to diagonalize A.

The eigenvectors of A are

v_1 = \begin{bmatrix} -1 \\ -1 \\ 2 \end{bmatrix}, \quad v_2 = \begin{bmatrix} 0 \\ 0 \\ 1 \end{bmatrix}, \quad v_3 = \begin{bmatrix} -1 \\ 0 \\ 2 \end{bmatrix}.

One can easily check that $A v_k = \lambda_k v_k.$

Now, let P be the matrix with these eigenvectors as its columns:

P= \begin{bmatrix} -1 & 0 & -1 \\ -1 & 0 & 0 \\ 2 & 1 & 2 \end{bmatrix}.

Note that there is no preferred order of the eigenvectors in P; changing the order of the eigenvectors in P just changes the order of the eigenvalues in the diagonalized form of A.^[3]

Then P diagonalizes A, as a simple computation confirms, having calculated P⁻¹ using any suitable method:

P^{-1}AP = \begin{bmatrix} 0 & -1 & 0 \\ 2 & 0 & 1 \\ -1 & 1 & 0 \end{bmatrix} \begin{bmatrix} 1 & 2 & 0 \\ 0 & 3 & 0 \\ 2 & -4 & 2 \end{bmatrix} \begin{bmatrix} -1 & 0 & -1 \\ -1 & 0 & 0 \\ 2 & 1 & 2 \end{bmatrix} = \begin{bmatrix} 3 & 0 & 0 \\ 0 & 2 & 0 \\ 0 & 0 & 1\end{bmatrix}.

In fact, this follows abstractly from the fact that for the standard basis $e_{1},e_{2},e_{3}$ we have

P^{-1}APe_{k}=P^{-1}Av_{k}=P^{-1}\lambda _{k}v_{k}=\lambda _{k}e_{k}.

where we make use of the fact that $Pe_{k}=v_{k}$ is the k-th column of $P$ and hence $P^{-1}v_{k}=e_{k}$ . Note that the eigenvalues $\lambda _{k}$ appear in the diagonal matrix.

An application

Diagonalization can be used to compute the powers of a matrix A efficiently, provided the matrix is diagonalizable. Suppose we have found that

P^{-1}AP = D \Rightarrow PP^{-1}APP^{-1} = PDP^{-1} \Rightarrow A = PDP^{-1}

where $D$ is a diagonal matrix. Then, as the matrix product is associative,

\begin{align} A^k &= (PDP^{-1})^k = (PDP^{-1}) \cdot (PDP^{-1}) \cdots (PDP^{-1}) \\ &= PD(P^{-1}P) D (P^{-1}P) \cdots (P^{-1}P) 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. This approach can be generalized to matrix exponential and other matrix functions since they can be defined as power series.

This is particularly useful in finding closed form expressions for terms of linear recursive sequences, such as the Fibonacci numbers.

Particular application

For example, consider the following matrix:

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 M. To accomplish this, we need a basis of R² consisting of eigenvectors of M. 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ⁿ. 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

M^n \mathbf{e}_1 = M^n \mathbf{u} = a^n \mathbf{e}_1,

M^n \mathbf{e}_2 = M^n (\mathbf{v}-\mathbf{u}) = b^n \mathbf{v} - a^n\mathbf{u} = (b^n-a^n) \mathbf{e}_1+b^n\mathbf{e}_2.

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.

Quantum mechanical application

In quantum mechanical and quantum chemical computations matrix diagonalization is one of the most frequently applied numerical processes. The basic reason is that the time-independent Schrödinger equation is an eigenvalue equation, albeit in most of the physical situations on an infinite dimensional space (a Hilbert space). A very common approximation is to truncate Hilbert space to finite dimension, after which the Schrödinger equation can be formulated as an eigenvalue problem of a real symmetric, or complex Hermitian, matrix. Formally this approximation is founded on the variational principle, valid for Hamiltonians that are bounded from below. But also first-order perturbation theory for degenerate states leads to a matrix eigenvalue problem.

Notes

↑ Horn & Johnson 1985
↑ Horn & Johnson 1985, pp. 51–53
↑ Anton, H.; Rorres, C. (22 Feb 2000). Elementary Linear Algebra (Applications Version) (8th ed.). John Wiley & Sons. ISBN 978-0-471-17052-5.

References

Horn, Roger A.; Johnson, Charles R. (1985). Matrix Analysis. Cambridge University Press. ISBN 978-0-521-38632-6.

External links

"Diagonalization". PlanetMath.

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.