Definition: A square matrix $A$ is diagonalizable if it is similar to a diagonal matrix, i.e., there exists an invertible matrix $P$ such that:
$$P^{-1}AP = D = \text{diag}(\lambda_1, \lambda_2, \ldots, \lambda_n)$$
where $\lambda_i$ are the eigenvalues of $A$.
Criterion: $A$ is diagonalizable if and only if $A$ has $n$ linearly independent eigenvectors (equivalently, the geometric multiplicity equals the algebraic multiplicity for each eigenvalue).
Procedure:
- Find eigenvalues by solving $\det(A - \lambda I) = 0$
- For each eigenvalue, find eigenvectors by solving $(A - \lambda I)v = 0$
- If there are $n$ linearly independent eigenvectors, form $P$ from them and $D$ from the eigenvalues
Example: $A = \begin{pmatrix} 4 & 1 \\ 2 & 3 \end{pmatrix}$ has eigenvalues 5 and 2, so $A = PDP^{-1}$ with $D = \begin{pmatrix} 5 & 0 \\ 0 & 2 \end{pmatrix}$.
Diagonalization simplifies computing powers: $A^k = PD^kP^{-1}$.
Parents
Children
- Definition of matrix diagonalizationDiagonalization expresses a square matrix as $A=PDP^{-1}$ with $P$ invertible and $D$ diagonal. Equivalently,...
- Definition of diagonalizable matrixA matrix is diagonalizable over $\mathbb F$ when it is similar over $\mathbb F$ to a diagonal matrix. It must have a...
- An n-by-n matrix is diagonalizable if and only if it has n linearly independent eigenvectors.An $n\times n$ matrix over $\mathbb F$ is diagonalizable iff it has $n$ linearly independent eigenvectors over...
- An n-by-n matrix is diagonalizable if and only if the sum of the dimensions of the eigenspaces equals n.A matrix is diagonalizable over $\mathbb F$ iff the sum of dimensions of its distinct eigenspaces over $\mathbb F$ is...
- Diagonalizability requires splitting and equality of geometric and algebraic multiplicitiesA matrix is diagonalizable over $\mathbb F$ iff its characteristic polynomial splits over $\mathbb F$ and each...
- A diagonalizable matrix is diagonalized by a matrix having the eigenvectors as columns.If $v 1,\ldots,v n$ are independent eigenvectors with $Av j=\lambda jv j$, let $P=[v 1\ \cdots\ v n]$. Then...
- An n-by-n matrix is diagonalizable if and only if the union of the basis vectors for the eigenspaces is a basis for R^n (or C^n).Choose a basis for each eigenspace corresponding to an eigenvalue in $\mathbb F$. The matrix is diagonalizable over...
- An n-by-n matrix with n distinct eigenvalues is diagonalizable.If an $n\times n$ matrix has $n$ distinct eigenvalues in $\mathbb F$, their eigenvectors are independent, so the...
- Real block form and complex diagonalization for a 2-by-2 matrixLet real $A$ have eigenvalue $a+ib$ with $b\ne0$ and eigenvector $u+iv$. Then $Au=au-bv$ and $Av=bu+av$. With $P=[u\...
No children match.
Like how this is organised?
Build your own knowledge tree on knowen.md: notes, decisions and tasks in one connected markdown graph, shared with your team and your AI agents.

