LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-16

How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Some vector has vector annihilator equal to the minimal polynomial

Statement

For every endomorphism $T$ of a finite-dimensional vector space $V$ , there is $v \in V$ such that $m_{T, v} = μ_{T}$ . If $V = 0$ , take $v = 0$ and both polynomials are $1$ .

Facts & Assumptions

Given: A finite-dimensional endomorphism $T$ .

[L1]

If $μ_{T} = \prod_{i < r} q_{i}^{e_{i}}$ is its factorisation into distinct monic irreducible powers, then $V = ⨁_{i < r} V_{i}$ with $V_{i} = \ker q_{i} (T)^{e_{i}}$ , and $T ∣_{V_{i}}$ has minimal polynomial exactly $q_{i}^{e_{i}}$ (Primary decomposition: the irreducible-power factors of $μ_{T}$ split $V$ into their invariant kernels).

[L2]

The vector annihilator is a monic divisor of the operator's minimal polynomial and detects exactly the polynomials that annihilate the vector (The vector annihilator is the unique monic generator of ${Ann}_{T} (v)$ and divides the minimal polynomial).

[L3]

The ring $F [x]$ is a unique factorisation domain (For every field $F$ , $F [x]$ is a unique factorisation domain).

Proof

technique · direct

1.1L1choose

For each nonempty primary summand $V_{i}$ in [L1], choose $v_{i} \in V_{i}$ with $q_{i} (T)^{e_{i} - 1} v_{i} \neq 0$ ; such a vector exists because otherwise $q_{i}^{e_{i} - 1}$ would annihilate $T ∣_{V_{i}}$ , contrary to its exact minimal polynomial.

2.1step 1.1L2L3

By [L2], $m_{T, v_{i}}$ divides $q_{i}^{e_{i}}$ ; [L3] makes it a power of $q_{i}$ , and step 1.1 rules out every exponent below $e_{i}$ . Hence $m_{T, v_{i}} = q_{i}^{e_{i}}$ .

3.1step 2.1L1L2L3construct

Put $v = \sum_{i < r} v_{i}$ . Directness in [L1] gives $p (T) v = 0$ exactly when $p (T) v_{i} = 0$ for every $i$ , which by step 2.1 is exactly when every $q_{i}^{e_{i}}$ divides $p$ ; pairwise coprimality and [L3] make this equivalent to $μ_{T} ∣ p$ . Thus [L2] gives $m_{T, v} = μ_{T}$ .

4.1L1L2∎

If $V = 0$ , [L1] is the empty direct sum and the published minimal-polynomial convention gives $μ_{T} = 1$ ; taking $v = 0$ gives $m_{T, 0} = 1$ by [L2].

Depends on

Used by

A cyclic vector exists exactly when the minimal and characteristic polynomials agree Theorem

Dependency tree · two levels

18 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources

K. Hoffman and R. Kunze, Linear Algebra, 2nd ed., Section 7.1 (standard reference, not scraped)