Does the Raising Operator Have Right Eigenvectors?

Click For Summary

Homework Help Overview

The discussion revolves around the raising operator in quantum mechanics, specifically questioning whether it has right eigenvectors. Participants are tasked with demonstrating that the raising operator has no right eigenvectors, using the operator's action on a state vector expressed as a sum over basis states.

Discussion Character

  • Exploratory, Assumption checking, Mathematical reasoning

Approaches and Questions Raised

  • Participants define a state vector and apply the raising operator to it, leading to a series of equations. There is an exploration of the implications of these equations on the coefficients of the state vector.

Discussion Status

Some participants have provided guidance on the meaning of eigenvectors in this context and suggested different ways to approach the problem. There is an ongoing exploration of the relationships between coefficients and the conditions under which they must equal zero. Multiple interpretations of the equations are being discussed, indicating a productive exchange of ideas.

Contextual Notes

Participants note the importance of writing down the eigenvector equation and the potential confusion arising from the notation used in the equations. There is an emphasis on the need for normalization of eigenvectors and the implications of the recurrence relationships among the coefficients.

Pouyan
Messages
103
Reaction score
8

Homework Statement


show that the raising operator at has no right eigenvectors

Homework Equations


We know at|n> = √(n+1)|n+1>

The Attempt at a Solution


we define a vector |Ψ> = ∑cn|n> (for n=0 to ∞)

at|Ψ>=at∑cn|n>=∑cn(√n+1)|n+1>

But further I give up!:cry:
 
Physics news on Phys.org
Pouyan said:

Homework Statement


show that the raising operator at has no right eigenvectors

Homework Equations


We know at|n> = √(n+1)|n+1>

The Attempt at a Solution


we define a vector |Ψ> = ∑cn|n> (for n=0 to ∞)

at|Ψ>=at∑cn|n>=∑cn(√n+1)|n+1>

But further I give up!:cry:

You have to try. It's not that hard.
 
  • Like
Likes   Reactions: Pouyan
PeroK said:
You have to try. It's not that hard.
Well I do see this :

at|Ψ>=at∑cn|n>=∑cn(√n+1)|n+1>
In a solution i do see:

gif.gif


Latex code : \sum_{n=0}^{\infty}c_{n}|n>=\sum_{n=1}^{\infty}c_{n-1}\sqrt{n}|n>
I know how to iterate a sum serie but why shall we say so ?!

and the only possible value is c_n=0
 

Attachments

  • gif.gif
    gif.gif
    1.1 KB · Views: 791
Pouyan said:
Well I do see this :

at|Ψ>=at∑cn|n>=∑cn(√n+1)|n+1>
In a solution i do see:

View attachment 230995

Latex code : \sum_{n=0}^{\infty}c_{n}|n>=\sum_{n=1}^{\infty}c_{n-1}\sqrt{n}|n>
I know how to iterate a sum serie but why shall we say so ?!

and the only possible value is c_n=0

Two things.

1) You should be writing down what it means for ##a^t## to have an eigenvector:

##a^t|\Psi \rangle = \lambda |\Psi \rangle##

2) Sometimes you can see things better using the ##\sum## notation. And sometimes you can see things better with the terms written out. If you are stuck, you should always try both ways. In this case, for example, let:

##|\Psi \rangle = c_0 |0 \rangle + c_1 |1 \rangle + c_2 |2 \rangle \dots ##

You are right that you can show that ##c_n = 0##. Can you show this fully? Also, what about the case where ##\lambda = 0## as a possible eigenvalue?
 
  • Like
Likes   Reactions: Pouyan
PeroK said:
Two things.

1) You should be writing down what it means for ##a^t## to have an eigenvector:

##a^t|\Psi \rangle = \lambda |\Psi \rangle##

2) Sometimes you can see things better using the ##\sum## notation. And sometimes you can see things better with the terms written out. If you are stuck, you should always try both ways. In this case, for example, let:

##|\Psi \rangle = c_0 |0 \rangle + c_1 |1 \rangle + c_2 |2 \rangle \dots ##

You are right that you can show that ##c_n = 0##. Can you show this fully? Also, what about the case where ##\lambda = 0## as a possible eigenvalue?
this is my problem, I don't get it
How can I show
gif-gif.gif


is right if and only if c_n = 0...?
I know the only solution for all n must be c_n=0
 

Attachments

  • gif-gif.gif
    gif-gif.gif
    1.1 KB · Views: 725
Pouyan said:
this is my problem, I don't get it
How can I show View attachment 231005

is right if and only if c_n = 0...?
I know the only solution for all n must be c_n=0

You haven't followed either of my suggestions. You must at least write down what it means to have an eigenvector. Maths doesn't solve itself. You need to start working with the equations.

Anyway, the rules of PF are clear: you must start to show some of your work.
 
Pouyan said:
In a solution i do see:
$$\sum_{n=0}^{\infty}c_{n}|n\rangle=\sum_{n=1}^{\infty}c_{n-1}\sqrt{n}|n\rangle$$
You might be getting confused because that's wrong. What it should say is
$$\hat a^\dagger \sum_{n=0}^{\infty}c_{n}|n\rangle=\sum_{n=0}^{\infty}c_{n}\sqrt{n+1}|n+1\rangle = \sum_{n=1}^{\infty}c_{n-1}\sqrt{n}|n\rangle.$$ From this alone, you can't conclude anything about the coefficients. You need to use the eigenvector equation @PeroK mentioned above.
 
  • Like
Likes   Reactions: PeroK
The equations given by @PeroK and @vela imply a certain recurrance relationship on your coefficients, i.e.

if ##c_1=1## then ##c_2=\dots## then etc..

Try to write it out, and see what it implies, bearing in mind that one usually wants eigenvectors that can be normalized
 

Similar threads

Replies
46
Views
3K
Replies
24
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
Replies
5
Views
2K
  • · Replies 9 ·
Replies
9
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 14 ·
Replies
14
Views
3K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 0 ·
Replies
0
Views
2K
  • · Replies 9 ·
Replies
9
Views
2K