One more Quantum Matrix question

  • Thread starter Thread starter Ed Quanta
  • Start date Start date
  • Tags Tags
    Matrix Quantum
Click For Summary

Homework Help Overview

The discussion revolves around properties of Hermitian matrices and their eigenvectors, specifically focusing on a matrix S formed by the orthonormal eigenvectors of a given Hermitian matrix A. Participants are tasked with demonstrating that S is unitary and that the transformation Sinv(A)S results in a diagonal matrix of eigenvalues.

Discussion Character

  • Exploratory, Conceptual clarification, Mathematical reasoning

Approaches and Questions Raised

  • Participants explore the definition of a unitary matrix and its implications for the orthonormality of the eigenvectors. They also discuss the relationship between the matrix A and its eigenvectors, questioning how to express AS in terms of S and a diagonal matrix D.

Discussion Status

The discussion is ongoing, with participants offering insights into the properties of unitary matrices and the implications of eigenvalue equations. Some participants express uncertainty about how to proceed without specific eigenvectors, while others suggest focusing on the implications of the eigenvalue equation for A.

Contextual Notes

There is a noted concern regarding the accuracy of the relationships being discussed, particularly the expressions AS=DS versus AS=SD, indicating a potential misunderstanding of the matrix operations involved.

Ed Quanta
Messages
296
Reaction score
0
Let A be a Hermitian nxn matrix. Let the column vectors of the nxn matrix S be comprised of the orthnormalized eigenvectors of A

Again, Sinv is the inverse of S

a) Show that S is unitary
b) Show that Sinv(A)S is a diagonal matrix comrpised of the eigenvalues of A

No idea how to start this one off.
 
Physics news on Phys.org
a) U is a unitary matrix <=> U*U = I, where "*" denotes conjugate transpose <=> [tex]\sum_{j} u_{ji}^{*}u_{jk} = \delta_{ik}[/tex] <=> [tex]u_{i}^{*}u_{k}=\delta_{ik}[/tex], where [tex]u_{i}[/tex] is the ith column of U. The last relation implies orthogonality of columns of U.

b)This one needs a little thought. If u is an eigenvector of A, then [tex]Au=\lambda u[/tex]. Then what is AS? Remember that each column of S is just an eigenvector of A. Also note that Sinv*S=I.
 
Last edited:
Wong said:
a) U is a unitary matrix <=> U*U = I, where "*" denotes conjugate transpose <=> [tex]\sum_{j} u_{ji}^{*}u_{jk} = \delta_{ik}[/tex] <=> [tex]u_{i}^{*}u_{k}=\delta_{ik}[/tex], where [tex]u_{i}[/tex] is the ith column of U. The last relation implies orthogonality of columns of U.

b)This one needs a little thought. If u is an eigenvector of A, then [tex]Au=\lambda u[/tex]. Then what is AS? Remember that each column of S is just an eigenvector of A. Also note that Sinv*S=I.


Sorry, I am still not sure how to find AS without knowing the eigenvectors of A.
 
Ed Quanta said:
Sorry, I am still not sure how to find AS without knowing the eigenvectors of A.

First try to think about what you want to prove. That is, [tex]S^{-1}AS=D[/tex], where D is a diagonal matrix. This is equivalent to proving AS=DS, where D is diagonal. Now each column of S is an eigenvector of A. So A acting on S should produce something quite simple. (Try to think of what is the defining eigenvalue equation for A.) May you put the result in the form DS, where D is a diagonal matrix?
 
Wong Wrong

I have doubts that either of you guys will read this anytime soon. I had this same problem and the conclusion that Wong tried to provide is incorrect. Instead of [tex]AS=DS[/tex] it's actually [tex]AS=SD[/tex]. The product DS will produce the correct entries along the diagonal but false elsewhere (really think about what you're doing here). But if you use the produce SD it will provide the correct eigenvalue for every eigenvector.
 

Similar threads

  • · Replies 15 ·
Replies
15
Views
3K
  • · Replies 4 ·
Replies
4
Views
7K
  • · Replies 14 ·
Replies
14
Views
5K
Replies
2
Views
1K
  • · Replies 33 ·
2
Replies
33
Views
4K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 18 ·
Replies
18
Views
4K
  • · Replies 2 ·
Replies
2
Views
4K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 2 ·
Replies
2
Views
3K