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.
For finite-dimensional , is finitely generated and torsion, with annihilator generated by the minimal polynomial
Statement
Let be an endomorphism of a finite-dimensional -vector space . The -module is finitely generated and torsion. The annihilator of is generated by the minimal polynomial .
Facts & Assumptions
Given: The polynomial action of The -module of an endomorphism, the module finite-generation convention of Generated submodule, cyclic and finitely generated modules, module basis and free module, and the operator-annihilator definition of The annihilator set ; once existence is proved, its unique monic generator is the minimal polynomial.
For every endomorphism of a finite-dimensional -vector space, is a nonzero ideal of and has a unique monic generator ; moreover exactly when (The annihilator ideal is nonzero and has a unique monic generator; if and only if ).
Proof
Any finite -basis of generates over , because constant polynomials already give every -linear combination. On the zero space the empty basis generates.
By [L1], , so kills every vector. Thus every vector is torsion and is a torsion -module.
A polynomial annihilates the whole module exactly when for every , exactly when . By [L1], this is equivalent to , so . For , both ideals are .
Depends on
- The $F[x]$-module $V_T$ of an endomorphism
- The annihilator set $\operatorname{Ann}(T)=\{p\in F[x]:p(T)=0\}$; once existence is proved, its unique monic generator $\mu_T$ is the minimal polynomial
- The annihilator ideal is nonzero and has a unique monic generator; $p(T)=0$ if and only if $\mu_T\mid p$
- Generated submodule, cyclic and finitely generated modules, module basis and free module
Used by
Dependency tree · two levels
15 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
- M. Brussel, Finitely Generated Modules over a PID, Section 5.2 (standard reference, not scraped)
- A. Apisa, Wisconsin Math 542, Lectures 11-12 (standard reference, not scraped)