Math 2.0

definition

Minimal polynomial

Definition

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. The minimal polynomial of TT is the monic polynomial mT∈F[x]m_T \in F[x] of least degree with mT(T)=0m_T(T) = 0. It is the monic generator of the ideal of annihilating polynomials of TT. The minimal polynomial of a square matrix is defined in the same way.

Remarks

The minimal polynomial exists and is unique. It divides each annihilating polynomial, in particular the characteristic polynomial. For I2I_2, the minimal polynomial is x−1x - 1; for (1101)\begin{pmatrix} 1 & 1 \\ 0 & 1 \end{pmatrix}, it is (x−1)2(x - 1)^2. Similar matrices have the same minimal polynomial.

Explanations

L1 human

The minimal polynomial is the shortest polynomial relation that a matrix satisfies. All other relations are multiples of it. Its roots are exactly the eigenvalues of the matrix.

What this node needs for W2
  • edge instance_of in: one example (0 of 1)
  • edge not_instance_of in: one non-example that fails one clause (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 6 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

What depends on this

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

Sources

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