Proof that eigenvalues of matrix with zero trace are all equal to zero

1.2k Views Asked by At

I'm working on the following question:

"Suppose that $A$ is a complex square matrix such that the trace of $A^k$ is zero for every $k \in \mathbb{N}$. Show that all the eigenvalues of $A$ are zero."

I think perhaps I should use the fact that the trace of a matrix is equal to the sum of its eigenvalues? Thoughts?

1

There are 1 best solutions below

0
On

Let $A$ be $n \times n$. $\sum \lambda_i^{k} =0$ for all $k\geq 1$. Hence $\sum f(\lambda_i) =f(0) n$ for every polynomial $f$, hence for all continuous functions $f$ (by Weierstarss Theorem). If $\lambda_i \neq 0$ we can find a continuous function $f$ such that $f(\lambda_i)=1$ and $f(0)=f(\lambda_j)=0$ for all $j \neq i$ leading to a contradiction.