Math 2.0

statement proposition

Minimal polynomial divides every annihilating polynomial

Statement

Let FF be a field, let VV be a finite-dimensional vector space over FF, and let T ⁣:V→VT \colon V \to V be an endomorphism with minimal polynomial mTm_T. If p∈F[x]p \in F[x] and p(T)=0p(T) = 0, then mTm_T divides pp.

Remarks

The proof divides with remainder: p=qmT+rp = q m_T + r with deg⁡r<deg⁡mT\deg r < \deg m_T. Then r(T)=0r(T) = 0, so r=0r = 0 by the minimality of deg⁡mT\deg m_T.

Explanations

L1 human

Every polynomial that kills TT is a multiple of the minimal polynomial. If a matrix satisfies A2=AA^2 = A, then its minimal polynomial divides x2−xx^2 - x. So it is xx, x−1x - 1 or x2−xx^2 - x.

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 7 nodes in this order. The foundations come first, and the list ends with this node.

Each node uses the nodes above it. The colour of the bar on a box shows the evidence level, and the box also gives it as text. The list below has the same nodes.
  • no evidence level
  1. Vector space definition
  2. Linear map definition
  3. Endomorphism definition
  4. Polynomial of an endomorphism definition
  5. Annihilating polynomial definition
  6. Minimal polynomial definition
  7. Minimal polynomial divides every annihilating polynomial statement

What depends on this

1 node uses this node, directly or through other nodes.

Sources

  1. Web https://en.wikipedia.org/wiki/Minimal_polynomial_(linear_algebra), Formal definition