If is a square matrix with entries from a field of characteristic zero such that the trace of is zero for all positive integers then is nilpotent. This is a very well-known result in linear algebra and there are at least two well-known proofs of that (see here for example) that use the Vandermonde determinant and Newton identities. In this post, I’m going to give a different proof. Since I have not seen this proof anywhere, I think I can claim it’s mine! 🙂
Let be a field, and let be the ring of matrices with entries from For let denote the trace of If is nilpotent, then clearly is also nilpotent for all positive integers and hence The well-known fact we are now going to prove is that the converse is also true if the characteristic of is zero.
Theorem. Let be a field of characteristic zero, and let such that for all integers Then is nilpotent.
Proof (Y. Sharifi). As we showed here as an application of Fitting’s lemma, there exists an integer an invertible matrix and a nilpotent matrix such that is similar to a block diagonal matrix If then hence is nilpotent and we are done. We now suppose that and show that this case is impossible. For any positive integer we have
Let be the characteristic polynomial of Note that since is invertible, By Cayley-Hamilton, where is the identity matrix. Thus, taking the trace of both sides and using , gives which is not possible since and has characteristic zero.
Remark 1. The Theorem also holds true if has positive characteristic To see that, look at the last sentence in the proof of the Theorem again. We got which implies and so which is not possible since
Remark 2. The Theorem does not necessarily hold if has positive characteristic For example, choose to be the identity matrix. Then for all positive integers but is not nilpotent.
The Theorem has many applications; let me give you one of them here.
The following problem was posted on the Art of Problem Solving a few weeks ago; you can see the problem and my solution (post #4) here. The proposer assumes that matrices have real entries but that is not necessary; the entries can come from any field of characteristic zero For any we denote by the additive commutator of i.e. Clearly is bilinear and
Problem (V. Brayman). Let be a field of characteristic zero, and let be such that for all Prove that
Solution (Y. Sharifi). First notice that for any positive integer
and so, by the Theorem, is nilpotent. Let be the smallest positive integer such that
If we are done. Suppose now that Since the set is -linearly dependent and so there exist an integer and such that But then
because for all But contradicts the minimality of So we can’t have