Question Regarding Harmonic Oscillator Eigenkets

Join the discussion
Ask a follow-up here, or get your own question answered by working scientists, mathematicians and engineers — people, not an autocomplete.
Real named experts · corrections over time · the nuance an AI answer skips
4 replies · 2K views
Thunder_Jet
Messages
18
Reaction score
0
Hi everyone!

Given that a harmonic oscillator has eigenkstates |n> where n = 1,2,3,..., how can we calculate <X>, <P>, <X^2>, etc. Is there a need to define a wavefunction in the |n> basis?

Thanks!
 
Physics news on Phys.org
Essentially no, because |n>'s are eigenkets of the number operator/Hamiltonian and X and P, though unbounded & with purely continuous spectrum, can be expressed as linear combinations of the raising & lowering ladder operators whose action on the eigenket's space becomes known once you establish that |n>'s are eigenkets of H and N.
 
So that means just express the |n> kets as linear combinations of the ladder operators, and then use them as ψ in the formula <X> = <ψ|X|ψ>? But how would you deal with the infinite dimensionality? Will the answer be finite in that case?

Thank you by the way for the idea!
 
Consider that
[tex] \hat{a}=\frac{1}{\sqrt{2}}(\hat{x}+i\hat{p})[/tex]
and
[tex] \hat{a}^{\dagger}=\frac{1}{\sqrt{2}}(\hat{x}-i\hat{p})[/tex]
You can use these to write [itex]\hat{x}[/itex] and [itex]\hat{p}[/itex] in terms of [itex]\hat{a}[/itex] and [itex]\hat{a}^{\dagger}[/itex]. Then you know
[tex] \hat{a}|n\rangle = \sqrt{n}|n-1\rangle[/tex]
and
[tex] \hat{a}^{\dagger}|n\rangle=\sqrt{n+1}|n+1\rangle[/tex]
You have the tools to take the expectation value.
 
Thunder_Jet said:
So that means just express the |n> kets as linear combinations of the ladder operators, and then use them as ψ in the formula <X> = <ψ|X|ψ>? But how would you deal with the infinite dimensionality? Will the answer be finite in that case?

Thank you by the way for the idea!

You don't express the kets as ladder operators acting on the vacuum, you express x and p as ladder operators.