A square matrix A is diagonalizable if there exists an invertible matrix P and a diagonal matrix D such that A = PDP⁻¹. The columns of P are linearly independent eigenvectors of A, and the corresponding eigenvalues appear along the diagonal of D in the same order. Diagonalization changes the coordinate system to an eigenvector basis, in which the transformation acts independently along each eigenvector direction. This makes calculations such as raising a matrix to a large integer power significantly easier because the powers of a diagonal matrix can be calculated by raising each diagonal entry to that power. An n × n matrix with n distinct eigenvalues is always diagonalizable over the field containing those eigenvalues. However, repeated eigenvalues do not automatically prevent diagonalization; the matrix must still have enough linearly independent eigenvectors. Some matrices are not diagonalizable because their eigenvectors do not form a complete basis. Diagonalization is useful in differential equations, dynamical systems, vibration analysis, quantum mechanics, and numerical methods.
Diagonalization of Matrices
Diagonalization is the process of expressing a square matrix as a product involving a diagonal matrix and an invertible change-of-basis matrix. It simplifies many matrix calculations by replacing a general matrix with a diagonal one.
A = PDP⁻¹
Explanation
Variables
| Symbol | Meaning | Unit |
|---|---|---|
A | The original square matrix | Matrix |
P | An invertible matrix whose columns are linearly independent eigenvectors of A | Matrix |
D | A diagonal matrix containing the corresponding eigenvalues | Matrix |
P⁻¹ | The inverse of the eigenvector matrix P | Matrix |
n | The order of the square matrix | Dimension |
Example or application
Consider A = [[2, 0], [0, 3]]. It is already diagonal, so choose P = [[1, 0], [0, 1]] and D = [[2, 0], [0, 3]]. Since P is the identity matrix, A = PDP⁻¹ holds directly. For a non-diagonalizable matrix, no invertible eigenvector matrix P with a complete eigenvector basis can be constructed.
Key Properties
Only square matrices can be diagonalized in the standard sense.
The diagonal entries of D are eigenvalues of A.
The columns of P are corresponding linearly independent eigenvectors.
P must be invertible.
A matrix with n distinct eigenvalues is diagonalizable over a field containing those eigenvalues.
Repeated eigenvalues may still allow diagonalization if enough independent eigenvectors exist.
A matrix is diagonalizable if it has a basis of eigenvectors.
Powers of diagonalizable matrices are easier to calculate.
Diagonalization is particularly useful in solving systems of differential equations and studying repeated transformations.
Sources and verification
Sources are shown as provided in the project data. Not every source has yet been independently verified. Please report errors or missing citations.
- SCIENEXY Mathematics Reference