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−1AP 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. 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; once 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).
- 1 Characterization
- 2 Diagonalization
- 3 Simultaneous diagonalization
- 4 Examples
- 5 An application
- 6 Quantum mechanical application
- 7 See also
- 8 Notes
- 9 References
- 10 External links
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 Fn 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−1AP 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
which has eigenvalues 1, 2, 2 (not all distinct) and is diagonalizable with diagonal form (similar to A)
and change of basis matrix P
- 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 An is diagonalizable for some n that is not an integer multiple of the characteristic of F, then A is diagonalizable. Proof: If An is diagonalizable, then A is annihilated by some polynomial , which has no multiple root (since ) 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 Cn×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.
If a matrix A can be diagonalized, that is,
Writing P as a block matrix of its column vectors
the above equation can be rewritten as
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 Fn. 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 A.
When a complex matrix A[a] is a Hermitian matrix (or a real matrix[b], a symmetric matrix), eigenvectors of A can be chosen to form an orthonormal basis of ℂn (or ℝn for a real matrix). Under such circumstance P will be a unitary matrix (resp. orthogonal matrix) and P−1 equals the conjugate transpose of P (if real, then the transpose) of P).
For most practical work matrices are diagonalized numerically using computer software. Many algorithms exist to accomplish this.
A set of matrices is said to be simultaneously diagonalizable if there exists a single invertible matrix P such that P−1AP 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 diagonalizable.
The set of all n×n diagonalizable matrices (over C) with n > 1 is not simultaneously diagonalizable. For instance, the matrices
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 diagonalizable by a unitary matrix; that is, there exists a unitary matrix U such that U*AU is diagonal for every A in the set.
- 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, QTAQ 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 = AT, so clearly AAT = ATA 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
This matrix is not diagonalizable: there is no matrix U such that U−1CU 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
The matrix B does not have any real eigenvalues, so there is no real matrix Q such that Q−1BQ is a diagonal matrix. However, we can diagonalize B if we allow complex numbers. Indeed, if we take
then Q−1BQ is diagonal. It is easy to find that B is the rotation matrix which rotates counterclockwise by angle θ = 3π/2
Note that the above examples show that the sum of diagonalizable matrices need not be diagonalizable.
How to diagonalize a matrix
Consider a matrix
This matrix has eigenvalues
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
One can easily check that
Now, let P be the matrix with these eigenvectors as its columns:
Then P diagonalizes A, as a simple computation confirms, having calculated P −1 using any suitable method:
In fact, this follows abstractly from the fact that for the standard basis we have
where we make use of the fact that is the k-th column of and hence . Note that the eigenvalues appear in the diagonal matrix.
Diagonalization can be used to compute the powers of a matrix A efficiently, provided the matrix is diagonalizable. Suppose we have found that
where is a diagonal matrix. Then, as the matrix product is associative,
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 that can be defined as power series.
For example, consider the following matrix:
Calculating the various powers of M reveals a surprising pattern:
The above phenomenon can be explained by diagonalizing M. To accomplish this, we need a basis of R2 consisting of eigenvectors of M. One such eigenvector basis is given by
where ei denotes the standard basis of Rn. The reverse change of basis is given by
Straightforward calculations show that
Thus, a and b are the eigenvalues corresponding to u and v, respectively. By linearity of matrix multiplication, we have that
Switching back to the standard basis, we have
The preceding relations, expressed in matrix form, are
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.
First-order perturbation theory also leads to matrix eigenvalue problem for degenerate states.
- Defective matrix
- Scaling (geometry)
- Triangular matrix
- Semisimple operator
- Diagonalizable group
- Jordan normal form
- Weight module – associative algebra generalization
- Orthogonal diagonalization
- A in ℂn×n
- A in ℝn×n
- Horn, Roger A.; Johnson, Charles R. (1985). Matrix Analysis. Cambridge University Press. ISBN 978-0-521-38632-6.