Given S, T, prove that ST and TS have the same eigenvalues.

  • Context: Graduate 
  • Thread starter Thread starter mind0nmath
  • Start date Start date
  • Tags Tags
    Eigenvalues
Click For Summary
SUMMARY

The discussion focuses on proving that the linear operators ST and TS have the same eigenvalues when S and T are linear operators on a finite-dimensional vector space V. Key points include the definition of the commutator [S, T] = ST - TS and the assertion that linear operators over complex numbers always have eigenvalues, while those over real numbers may not. The proof involves selecting an arbitrary vector and demonstrating that if ST has an eigenvalue, then TS must also possess the same eigenvalue, although they may not share the same eigenvectors.

PREREQUISITES
  • Understanding of linear operators in vector spaces
  • Familiarity with eigenvalues and eigenvectors
  • Knowledge of the characteristic polynomial
  • Basic concepts of commutators in linear algebra
NEXT STEPS
  • Study the properties of eigenvalues for linear operators on complex and real vector spaces
  • Learn about the characteristic polynomial and its role in determining eigenvalues
  • Explore the implications of the commutator [S, T] in quantum mechanics
  • Investigate Jordan forms and their significance in linear algebra
USEFUL FOR

Mathematicians, physics students, and anyone studying linear algebra, particularly those interested in eigenvalue problems and their applications in quantum mechanics.

mind0nmath
Messages
19
Reaction score
0
I need help starting/doing this proof.
Suppose S,T are Linear Operators on a Finite Dimensional Vector Space V. Prove that ST and TS have the same eigenvalues.
A linear operator is a linear map from a vector space to itself.
thanks.
 
Physics news on Phys.org
do you know what a characteristic polynomial is?
 
how can u prove that?
S T must sutysfy more conditions... that u didint typed?

which ones??
 
thanks but I think I have the answer. If you pick an arbitrary vector in V and define T(u) = au and S(u) = bu, where a,b are eigenvalues for u, then applying S to T(u) and T to S(u) will give the wanted results.
 
mind0nmath said:
thanks but I think I have the answer. If you pick an arbitrary vector in V and define T(u) = au and S(u) = bu, where a,b are eigenvalues for u, then applying S to T(u) and T to S(u) will give the wanted results.

yes and what is the answer?

[S,T]=0

think abou it... very usefull in QM
ciao
 
mind0nmath said:
thanks but I think I have the answer. If you pick an arbitrary vector in V and define T(u) = au and S(u) = bu, where a,b are eigenvalues for u, then applying S to T(u) and T to S(u) will give the wanted results.
But you can't "define" that because you want to show it is true for any T and S. What if T or S don't have eigenvalues?
 
Marco_84 said:
yes and what is the answer?

[S,T]=0

think abou it... very usefull in QM
ciao
And completely meaningless since you haven't bothered to define "[S, T]"!
 
isn't it true that all linear operators on a finite dimensional vector space have eigenvalues? I don't really know what [S, T] is though.
 
No, it is not. Linear operators on a vector space over the complex numbers always have eigenvalues. Linear operators on a vector space over the real numbers may not have (real) eigenvalues.

I took Marco84 to task for not defining it [S, T]. The standard definition is [S, T]= ST- TS but I really don't see how it will help here. ST and TS always have the same eigenvalues but not the same eigenvectors!

Suppose \lambda is an eigenvalue for ST. That is, there is some non-zero vector v such that STv= \lambdav. Let u= Tv. Then Su= STv= \lambdav. What happens if you apply T to Su? That shows that \lambda is an eigenvalue for TS as long as u is not 0. Now suppose u= 0.
 
Last edited by a moderator:
  • #10
i seem to have constructed counter examples from the simplest non trivial 3x3 jordan forms.
 

Similar threads

  • · Replies 3 ·
Replies
3
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 3 ·
Replies
3
Views
3K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 4 ·
Replies
4
Views
5K