Linear and multilinear algebra; matrix theory Theorem
A matrix is diagonalisable iff it has a basis of eigenvectors
Builds on Diagonalisable matrixEigenvectorBasis
Statement
Let be a field and let be an matrix over . Then is diagonalisable if and only if has a basis of eigenvectors of . If is such a basis with , and has the columns , then is the diagonal matrix with entries .
Remarks
The equation says column by column that . Equivalently, is the direct sum of the eigenspaces of . Equivalently, the sum of the geometric multiplicities of the eigenvalues is .
Reading path
To understand this page from the ground up, read these 20 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Identity matrix object
- Matrix definition
- Vector space definition
- Matrix multiplication definition
- Square matrix definition
- Linear combination definition
- Linear map definition
- Linear subspace definition
- Invertible matrix definition
- Diagonal matrix definition
- Linear independence definition
- Endomorphism definition
- Linear span definition
- Similar matrices definition
- Eigenvalue definition
- Spanning set definition
- Diagonalisable matrix definition
- Eigenvector definition
- Basis definition
- A matrix is diagonalisable iff it has a basis of eigenvectors statement
Where this leads
1 page builds on this one.
Further reading
- Web https://en.wikipedia.org/wiki/Diagonalizable_matrix, Characterization
About this page
| Tag | 056SW1E0AC |
|---|---|
| URI | m2://056SW1E0AC |
| Kind | statement, theorem |
| Writing | W0 stub |
| MSC | 15A20 |
| Status | This copy of the site has no build data. Run m2 status 056SW1E0AC. |
| Uses | Diagonalisable matrix, Eigenvector, Basis |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.