Polynomial of an endomorphism
Definition
Let be a field, let be a vector space over , and let be an endomorphism. Let be a polynomial in . The value of at is the endomorphism where is the composition of copies of . For an matrix , in the same way.
Remarks
The map is a homomorphism of algebras : and . In particular, any two polynomials in commute. If , then .
Explanations
L1 human
We can put a matrix into a polynomial, because matrices can be added, scaled and multiplied. The constant term becomes a multiple of the identity matrix. For example, if , then .
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 4 nodes in this order. The foundations come first, and the list ends with this node.
- no evidence level
- Vector space definition
- Linear map definition
- Endomorphism definition
- Polynomial of an endomorphism definition
What depends on this
11 nodes use this node, directly or through other nodes.
- Annihilating polynomial 052M4SX57M
- Generalised eigenspace 07PNDWA7CE
- Minimal polynomial divides the characteristic polynomial 093X6MN6Y6
- Cayley–Hamilton theorem 0F765KFC2J
- Diagonalisable iff the minimal polynomial has distinct roots 0MPAJRB23T
- Cayley–Hamilton theorem for linear maps 0QEM68Y0DE
- Eigenvalues are the roots of the minimal polynomial 0QF4ZEFG52
- Generalised eigenvector 0SAAHC36J9
- Minimal polynomial 0V58FPM3EQ
- Minimal polynomial divides every annihilating polynomial 0VTAD25A3G
- Decomposition into generalised eigenspaces 0Z3GDY89T5
Sources
- Web https://en.wikipedia.org/wiki/Matrix_polynomial, lead section
What links here
Used by
- Annihilating polynomial 052M4SX57M
- Cayley–Hamilton theorem 0F765KFC2J
- Cayley–Hamilton theorem for linear maps 0QEM68Y0DE
- Generalised eigenvector 0SAAHC36J9