statement theorem
Diagonalisable iff the minimal polynomial has distinct roots
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.
Explanations
L1 human
The minimal polynomial decides whether a matrix is diagonalisable. The matrix is diagonalisable exactly when this polynomial is a product of distinct linear factors. A repeated factor, like , signals a Jordan block of size at least .
What this node 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 node is. They do not measure its truth.
What this needs
To read this node, read these 15 nodes in this order. The foundations come first, and the list ends with this node.
- 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
Sources
- Web https://en.wikipedia.org/wiki/Diagonalizable_matrix, Characterization
What links here
No node links to this node yet.