Is the trace of a matrix preserved by an orthogonal transformation?

ehrenfest
Messages
2,001
Reaction score
1

Homework Statement


My statistical mechanics book says that if M is an real, symmetric n by n matrix, and U is the matrix of its eigenvectors as column vectors, then the transformation UMU^{-1} preserves the trace of M. Is that true? If so, is it obvious? If it is true but not obvious, how do you prove it?

Homework Equations


The Attempt at a Solution

 
Physics news on Phys.org
It's true and obvious. And U doesn't need to be unitary. Use the cyclic property of trace. Tr(ABC)=Tr(CAB).
 
Dick said:
Tr(ABC)=Tr(CAB).

Why is that true?

EDIT: never mind http://en.wikipedia.org/wiki/Trace_(linear_algebra )
 
Last edited by a moderator:
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...

Similar threads

Back
Top