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.
Cyclic subspaces, cyclic vectors, and vector annihilators
Definition
Let be an endomorphism and . The -cyclic subspace generated by is It is the smallest -invariant subspace containing . The vector is a cyclic vector for when , and is cyclic when it has a cyclic vector.
The annihilator ideal of is When is finite-dimensional this ideal is nonzero and has a unique monic generator, whose existence is proved in The vector annihilator is the unique monic generator of and divides the minimal polynomial ↗; that generator is the vector annihilator . For , the ideal is all of and .
Finite dimensionality is not a convenience: it is what forces the ideal to be nonzero, and without it the ideal can vanish. On with and , every nonzero gives , so and there is no monic generator. It is not necessary, however: for on any and any , , so and .
Depends on
Used by
- The commutant of a cyclic endomorphism consists of its polynomials Corollary
- Some vector has vector annihilator equal to the minimal polynomial Lemma
- The vector annihilator is the unique monic generator of Ann_T(v) and divides the minimal polynomial Proposition
- A vector annihilator gives a power basis and its companion matrix Theorem
- Every finite cyclic extension has a normal basis Theorem
Dependency tree · two levels
7 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)