17.02.2014 Views

Mathematical Methods for Physicists: A concise introduction - Site Map

Mathematical Methods for Physicists: A concise introduction - Site Map

Mathematical Methods for Physicists: A concise introduction - Site Map

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

SIMILARITY TRANSFORMATION<br />

where ~ S is a non-singular matrix, the transition matrix from the new coordinate<br />

system to the old system. With these, Eq. (3.51a) becomes<br />

or<br />

Combining this with Eq. (3.51) gives<br />

~SR 0 ˆ ~A ~Sr 0<br />

R 0 ˆ ~S 1 ~A ~Sr 0 :<br />

~A 0 ˆ ~S 1 ~ A ~ S; …3:52†<br />

where ~A 0 and ~A are similar matrices. Eq. (3.52) is called a similarity trans<strong>for</strong>mation.<br />

Generalization of this idea to n-dimensional vectors is straight<strong>for</strong>ward. In this<br />

case, we take r and R as two n-dimensional vectors in a particular basis, having<br />

their coordinates connected by the matrix ~A (a n n square matrix) through Eq.<br />

(3.51a). In another basis they are connected by Eq. (3.51b). The relationship<br />

between ~A and ~A 0 is given by Eq. (3.52). The trans<strong>for</strong>mation of ~A into ~S 1 ~A ~S<br />

is called a similarity trans<strong>for</strong>mation.<br />

All identities involving vectors and matrices will remain invariant under a<br />

similarity trans<strong>for</strong>mation since this arises only in connection with a change in<br />

basis. That this is so can be seen in the following two simple examples.<br />

Example 3.10<br />

Given the matrix equation ~A ~B ˆ ~C, and the matrices ~A, ~B, ~C subjected to the<br />

same similarity trans<strong>for</strong>mation, show that the matrix equation is invariant.<br />

Solution: Since the three matrices are all subjected to the same similarity trans<strong>for</strong>mation,<br />

we have<br />

~A 0 ˆ ~S A ~ S ~ 1 ; ~B 0 ˆ ~S ~B S ~ 1 ; C ~ 0 ˆ ~S C ~ S ~ 1<br />

and it follows that<br />

~A 0 ~B 0 ˆ…~S ~A ~S 1 †… ~S ~B ~S 1 †ˆ ~S ~A~I ~B ~S 1 ˆ ~S ~A ~B ~S 1 ˆ ~S ~C ~S 1 ˆ ~C 0 :<br />

Example 3.11<br />

Show that the relation ~AR ˆ ~Br is invariant under a similarity trans<strong>for</strong>mation.<br />

Solution: Since matrices A ~ and ~B are subjected to the same similarity trans<strong>for</strong>mation,<br />

we have<br />

~A 0 ˆ ~S A ~ S ~ 1 ; ~B 0 ˆ ~S ~B S ~ 1<br />

we also have<br />

R 0 ˆ ~SR;<br />

r 0 ˆ ~Sr:<br />

123

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!