Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicableaudited 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.

Cyclic subspaces, cyclic vectors, and vector annihilators

Definition

Let T:V→V be an endomorphism and v∈V. The T-cyclic subspace generated by v is Z(v;T):={p(T)v:p∈F[x]}=span⁡{v,Tv,T2v,…}. It is the smallest T-invariant subspace containing v. The vector v is a cyclic vector for T when Z(v;T)=V, and T is cyclic when it has a cyclic vector.

The annihilator ideal of v is Ann⁡T(v):={p∈F[x]:p(T)v=0}. When V 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 Ann⁡T(v) and divides the minimal polynomial ↗; that generator is the vector annihilator mT,v. For v=0, the ideal is all of F[x] and mT,0=1.

Finite dimensionality is not a convenience: it is what forces the ideal to be nonzero, and without it the ideal can vanish. On V=⨁n≥0Fen with T(en)=en+1 and v=e0, every nonzero p=∑k≤makxk gives p(T)v=∑k≤makek≠0, so Ann⁡T(v)=(0) and there is no monic generator. It is not necessary, however: for T=0 on any V and any v≠0, p(T)v=p(0)v, so Ann⁡T(v)=(x) and mT,v=x.

Depends on

Used by

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