Prove that the set of all $n × n$ matrices of the form $AB-BA$ is equal to the set of all $n × n$ matrices with trace zero

3.5k Views Asked by At

Let $W$ be the space of $n × n$ matrices over the filed $F$, and let $W_0$ be the subspace spanned by the matrices $C$ of the form $AB - BA$. Prove that $W_0$ is exactly the subspace of matrices which have trace zero. (Hint: What is the dimension of the space of matrices of trace zero? Use the matrix 'units,' i.e. matrices with exactly one non-zero entry, to construct enough linearly independent mayrices of the form $AB-BA$. )

Let $K$ be the set of all $n × n$ matrices of the form $AB-BA$, amd let $U$ be the subspace of all $n × n$ matrices with trace zero.

First, I am not sure how $K$ is a subspace. Certainly it's closed under scalar multiplication, but how is it closed under addition?

We know that $K$ is a subset of $U$, but I am not sure how it's the other way around. We know that the $dim U = n^2-1$, and I could find $n^2-n$ 'unit' matrices (each of which has only one 1 on a non-diagonal entry) and express them as $AB-BA$. But I am not sure how to deal with the ones with at least one nonzero diagonal entry.

I am not even sure what the hint means. Any help?

1

There are 1 best solutions below

6
On BEST ANSWER

The space of the matrices whose trace is $0$ has dimension $n^2-1$. Now, consider the matrices $E_{ij}$ such that the entry at the row $i$ and column $j$ is $1$ and all others are $0$. Then all matrices of the type $E_{ij}$ (with $i\neq j$) together with the matrices of the type $E_{ii}-E_{jj}$ (again, with $i\neq j$) form a set of $n^2-1$ linearly independent matrices whose trace is equal to $0$. It is not hard to prove that each of these matrices is of the form $AB-BA$ for two matrices $A$ and $B$ of the type $n\times n$. For instance, $E_{ii}-E_{jj}=E_{ij}E_{ji}-E_{ji}E_{ij}$.