Ask your own question, for FREE!
Mathematics 23 Online
OpenStudy (anonymous):

Can someone help me prove a property of matrices?

OpenStudy (anonymous):

Prove that id A and B are square matrices of order n, then Tr(AB)=Tr(BA)

OpenStudy (anonymous):

*if

OpenStudy (anonymous):

when you say order, is that like rank? or just the fact that they are both n x n?

OpenStudy (anonymous):

I guess that they are NxN

OpenStudy (anonymous):

what are traces?

OpenStudy (anonymous):

The trace is the sum of the entries on the main diagonal of a matrix.

OpenStudy (anonymous):

Well if AB=BA the Tra(AB)=Tra(BA)

OpenStudy (jamesj):

You'll want to write down explicitly what is the (i,i) term of AB; e.g., (1,1) term of AB is equal to \[ \sum_j a_{1j}b_{j1} \] and sum them up over the diagonal. Then write down the expression for a diagonal element of BA, and then sum them up. Finally, show the two sums are equal.

OpenStudy (anonymous):

@rld that is only if AB = BA, but generally matrix multiplication is not commutative. James' idea is the bet one, it will be a proof that shows you can formally manipulate summations.

OpenStudy (anonymous):

best*

OpenStudy (jamesj):

It's not that hard and it's a very good exercise in manipulating indices and summations.

OpenStudy (anonymous):

A trace of an n-by-n square matrix A is defined to be the sum of the elements on the main diagonal (the diagonal from the upper left to the lower right).

OpenStudy (anonymous):

LOL i hate summations

OpenStudy (anonymous):

You'll find that a lot of these problems, especially in deeper linear algebra and representation theory, can only be proven by frustratingly long summations that can only be solved using clever techniques and lots and lots of patience. So don't be too afraid of summations!

OpenStudy (anonymous):

LOL i guess it is time to overcome my fear

OpenStudy (anonymous):

I just never learnt summations in hs so i dont have a background

OpenStudy (zarkon):

you can also look at the eigenvalues

OpenStudy (anonymous):

Didnt learn eigenvalues yet lol

OpenStudy (watchmath):

Let \(E_{i,j}\) be the matrix where all the entries are zero except 1 at the (i,j) position. I think the problem can be reduce into proving \(tr(E_{i,j}E_{k,l}=tr(E_{k,l}E_{i,j}\). What do you think?

OpenStudy (anonymous):

Tr(AB)=Tr(BA) Proof: Let A=a_{ij} and B=b_{ij} with AB = c_{ij} and BA = d_{ij} Then, \[Tr(AB) = \sum_{i=1}^n c_{ii}\]\[= \sum_{i=1}^n \sum_{j=1}^n a_{ij} b_{ji}\]\[= \sum_{j=1}^n \sum_{i=1}^n b_{ji} a_{ij}\]\[=\sum_{j=1}^n d_{jj}\]\[=Tr(BA)\]

OpenStudy (anonymous):

Thanks Guys :D U guys r awesome

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!