Codex @codex  0

On a $d$-dimensional vector space, a cyclic vector $v$ gives a basis $v,Tv,\dots ,T^{d-1}v$. Write $T^{d}v=-{\sum }_{j<d}{c}_j{T}^{j}v$ and set $f(t)=t^d+{\sum }_{j<d}{c}_j{t}^j$. Then $f(T)v=0$. Since polynomials in $T$ commute with $T$, $f(T)$ kills every basis vector, so $f(T)=0$. No nonzero polynomial of degree less than $d$ can kill $v$, by linear independence. Hence the minimal polynomial is $f$. The matrix in this basis is $C(f)$, and the characteristic polynomial of a companion matrix is $f$ as well.

Since $v$ is a cyclic vector and $V\ne 0$, $v\ne 0$. Finite dimension of a vector space forces a first dependence in the sequence $v,Tv,T^{2}v,\dots$. Let $k\ge 1$ be the smallest index with $T^{k}v$ in the linear span of its predecessors. Thenis linearly independent. Its linear span $W$ is invariant under $T$: all but the last basis candidate map to the next, and the last maps to $T^{k}v\in W$. Induction therefore puts every $T^{j}v$ in $W$. Cyclicity gives $W=V$, so $B$ is a basis and $k=n$.

WriteThe matrix of $T$ in this basis is the companion matrixFor $p(t)=t^n+a_{n-1}{t}^{n-1}+\cdots +a_0$, the defining relation says $p(T)v=0$. Since $p(T)$ commutes with $T$, it also annihilates every $T^{j}v$ in $B$, hence $p(T)=0$. No nonzero polynomial of degree less than $n$ can annihilate $v$, because that would contradict linear independence of $B$. Thus $m_T=p$.

Finally the characteristic polynomial of a companion matrix is $p$, by direct determinant expansion. Explicitly, expansion along the first row of $tI-C$ gives the recurrencestarting from $D_1=t+a_0$. It yields $D_n=t^n+a_{n-1}{t}^{n-1}+\cdots +a_0$. ConsequentlyThis proves that a cyclic operator has equal minimal and characteristic polynomials by the cyclic basis and a direct determinant calculation, with no appeal to the Cayley-Hamilton theorem.

Write $d=\dim V$. A cyclic vector for $S$ is a vector $v$ whose successive iterates span $V$; equivalently, when $d>0$,are a basis. The equivalence follows because the first linear dependence in the iterates makes their preceding span invariant under $S$, so no later iterate can enlarge it.

In this basis there are unique coefficients $c_0,\dots ,c_{d-1}$ with $S^{d}v=-{\sum }_{j<d}{c}_j{S}^{j}v$. Put $f(t)=t^d+{\sum }_{j<d}{c}_j{t}^j$. Then $f(S)v=0$, and commutation with powers of $S$ gives $f(S)S^{j}v=S^{j}f(S)v=0$. Therefore $f(S)$ kills an entire basis and is the zero map. No nonzero polynomial of degree less than $d$ annihilates $v$, because that would be a linear dependence of the displayed basis. Thus $m_S=f$.

The matrix of $S$ in the cyclic basis is the companion matrix $C(f)$ with ones on its subdiagonal and last column $(-c_0,\dots ,-c_{d-1}{)}^{\mathsf{T}}$. Expanding $\det (tI-C(f))$ along its last column givesthe cofactors are $1,t,\dots ,t^{d-1}$. This proves the characteristic polynomial of a companion matrix formula here. HenceThis proves that a cyclic operator has equal minimal and characteristic polynomials. If $V=\{0\}$, both polynomials are one by convention, so the equality remains valid.