Characteristic polynomial of a linear map
Definition
Let be a field, let be a finite-dimensional vector space over , and let be an endomorphism. The characteristic polynomial of is the characteristic polynomial of the matrix of in a basis of , where .
Remarks
The polynomial does not depend on , see the invariance of the characteristic polynomial. Its degree is . For the identity map of , it is .
Explanations
L1 human
A linear map has a matrix in each basis. All these matrices have the same characteristic polynomial. So we can call it the characteristic polynomial of the map.
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 19 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
- Square matrix definition
- Linear combination definition
- Linear map definition
- Linear subspace definition
- Linear independence definition
- Endomorphism definition
- Linear span definition
- Multilinear map definition
- Spanning set definition
- Alternating multilinear map definition
- Basis definition
- Determinant definition
- Coordinate vector definition
- Characteristic polynomial definition
- Matrix of a linear map definition
- Characteristic polynomial of a linear map definition
What depends on this
6 nodes use this node, directly or through other nodes.
- Eigenvalues are the roots of the characteristic polynomial 053QVHF6N7
- Existence of an eigenvalue over an algebraically closed field 08CJB2NQ92
- Determinant is the product of the eigenvalues 0C2F40MEBC
- Trace is the sum of the eigenvalues 0NMXDCNNKR
- Cayley–Hamilton theorem for linear maps 0QEM68Y0DE
- Algebraic multiplicity 0S7A0EMPF4
Sources
- Web https://en.wikipedia.org/wiki/Characteristic_polynomial, Formal definition