statement theorem
Triangularisation
Statement
Let be a field and let be an matrix over . Then is similar to an upper triangular matrix over if and only if the characteristic polynomial of splits over . Here, to split means to be a product of linear factors. In particular, over an algebraically closed field, such as , each square matrix is similar to an upper triangular matrix.
Remarks
The diagonal entries of the triangular matrix are the eigenvalues of , with their algebraic multiplicities. The proof is by induction: choose an eigenvector, extend it to a basis, and work on the quotient space. Over , the matrix can even be chosen unitary; this is the Schur decomposition.
Explanations
L1 human
Not every matrix can be diagonalised, but over every matrix can be made triangular by a change of basis. A triangular form is almost as useful: its eigenvalues are on the diagonal. Over , a rotation matrix cannot be triangularised, because it has no real eigenvalue.
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 14 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
- Upper triangular matrix definition
- Multilinear map definition
- Similar matrices definition
- Alternating multilinear map definition
- Determinant definition
- Characteristic polynomial definition
- Triangularisation statement
Sources
- Web https://en.wikipedia.org/wiki/Triangular_matrix, Triangularisability
What links here
No node links to this node yet.