Linear and multilinear algebra; matrix theory Theorem
Diagonalisable iff the minimal polynomial has distinct roots
Builds on Diagonalisable matrixMinimal polynomial
Statement
Let be a field and let be an matrix over with minimal polynomial . Then is diagonalisable over if and only if for some pairwise distinct .
Remarks
In words: splits over and has no repeated roots. If , then divides , so each projection matrix is diagonalisable. The matrix has , so it is not diagonalisable.
Reading path
To understand this page from the ground up, read these 15 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 map definition
- Invertible matrix definition
- Diagonal matrix definition
- Endomorphism definition
- Similar matrices definition
- Polynomial of an endomorphism definition
- Diagonalisable matrix definition
- Annihilating polynomial definition
- Minimal polynomial definition
- Diagonalisable iff the minimal polynomial has distinct roots statement
Further reading
- Web https://en.wikipedia.org/wiki/Diagonalizable_matrix, Characterization
About this page
| Tag | 0MPAJRB23T |
|---|---|
| URI | m2://0MPAJRB23T |
| Kind | statement, theorem |
| Writing | W0 stub |
| MSC | 15A20 |
| Status | This copy of the site has no build data. Run m2 status 0MPAJRB23T. |
| Uses | Diagonalisable matrix, Minimal polynomial |
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.
What links here
No page links to this page yet.