Let $V$ vector space with $\dim(V)=n$, and let $T: V \rightarrow V$ a linear operator such that $$\dim(\ker(T))=n-1$$
Prove: $T$ has at most 2 distinct eigenvalues.
I know that $\dim(\mathrm{im}(T))=1$ and it has to do with geometric multiplicty for finding an upper limit, but I don't know.
I'd appreciate a full exact proof in order to learn perfect writing. Thanks!
If $n>1$, then $0$ is an eigenvalue. Let $v$ be a generator of the image $T(v)=cv$. Let $w$ another eigenvalue. Write $w=u+av, u\in ker(T) $, $T(w) =aT(v) $ implies that $w=av$.