Math 2.0

definition

Annihilating polynomial

Definition

Let FF be a field, let VV be a vector space over FF, and let T ⁣:V→VT \colon V \to V be an endomorphism. A polynomial p∈F[x]p \in F[x] annihilates TT when p(T)=0p(T) = 0, where p(T)p(T) is the value of pp at TT. Such a polynomial is an annihilating polynomial of TT.

Remarks

The annihilating polynomials of TT form an ideal of F[x]F[x]. If dim⁡V=n\dim V = n is finite, then a nonzero annihilating polynomial exists, because the n2+1n^2 + 1 maps id⁡V,T,…,Tn2\id_V, T, \dots, T^{n^2} are linearly dependent. The monic generator of this ideal is the minimal polynomial of TT. For a projection PP, the polynomial x2−xx^2 - x annihilates PP.

Explanations

L1 human

An annihilating polynomial is a polynomial that becomes the zero map when we put TT into it. For example, a reflection RR satisfies R2=IR^2 = I, so x2−1x^2 - 1 annihilates it. Such relations tell us a lot about the possible eigenvalues.

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 5 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

What depends on this

5 nodes use this node, directly or through other nodes.

Sources

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