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.
The vector annihilator is the unique monic generator of and divides the minimal polynomial
Statement
For an endomorphism of a finite-dimensional vector space and , is a nonzero ideal of . It has a unique monic generator , and Moreover . In particular .
Facts & Assumptions
Given: A finite-dimensional endomorphism and a vector .
The annihilator ideal is (Cyclic subspaces, cyclic vectors, and vector annihilators).
The minimal polynomial satisfies (The annihilator ideal is nonzero and has a unique monic generator; if and only if ).
Every ideal of is principal (For every field , is a principal ideal domain).
Proof
Linearity of polynomial evaluation shows that [L1] is closed under addition and under multiplication by arbitrary polynomials, so it is an ideal; it is nonzero because [L2] puts in it.
By [L3] the ideal is for a nonzero polynomial ; scaling by the inverse of its leading coefficient gives a monic generator , and two monic generators of one ideal are associates and hence equal.
Membership in is exactly divisibility by , proving the displayed equivalence. Since belongs to the ideal, ; if , the ideal contains and its monic generator is .
Depends on
Used by
- Some vector has vector annihilator equal to the minimal polynomial Lemma
- A vector annihilator gives a power basis and its companion matrix Theorem
- Every finite cyclic extension has a normal basis Theorem
Cited to discharge well-definedness by Cyclic subspaces, cyclic vectors, and vector annihilators.
Dependency tree · two levels
13 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)