intermediate · Physics · The Harmonic Oscillator: Ladder Operators
Raising and Lowering States
We know a and a† shift the number eigenvalue by ∓1, but by how much — what is the
exact scalar coefficient? Fixing the normalization is what turns the qualitative "ladder" picture
into a calculational tool.
Why the eigenvalue shifts
From the algebra N^a†=a†(N^+1) (a rearrangement of
[N^,a†]=a†), apply both sides to ∣n⟩:
N^(a†∣n⟩)=a†(N^+1)∣n⟩=(n+1)(a†∣n⟩).
So a†∣n⟩ is an eigenstate of N^ with eigenvalue n+1; it must be proportional
to ∣n+1⟩. Likewise a∣n⟩∝∣n−1⟩. It remains to find the proportionality
constants.
Fixing the coefficients by normalization
Write a†∣n⟩=cn∣n+1⟩ for some constant cn. Take the squared norm of both
sides. The right side gives ∣cn∣2 (since ∣n+1⟩ is normalized). The left side is
⟨n∣aa†∣n⟩=⟨n∣(a†a+1)∣n⟩=⟨n∣(N^+1)∣n⟩=n+1,
using the commutator aa†=a†a+1. Therefore ∣cn∣2=n+1, and choosing the
phase so the coefficient is real and positive,
a†∣n⟩=n+1∣n+1⟩.
The same argument for the lowering operator uses ⟨n∣a†a∣n⟩=n, giving
a∣n⟩=n∣n−1⟩.
Notice that a∣0⟩=0∣−1⟩=0 automatically — the ladder simply stops at the
bottom, exactly as the spectrum argument required.
Building states from the ground state
Iterating the raising relation generates every number state from ∣0⟩:
∣n⟩=n!(a†)n∣0⟩.
For example, a†∣0⟩=1∣1⟩, then a†∣1⟩=2∣2⟩,
so (a†)2∣0⟩=2∣2⟩=2!∣2⟩, consistent with the
1/n! normalization. The factorial appears because each step contributes its own
n+1.
Try it
This is a numerical exercise — your code should return a number. Apply a† three times to
the ground state ∣0⟩ to reach ∣3⟩, and return the cumulative coefficient
1⋅2⋅3=6.
Run your code to see the quantum state.
Sign in on the full site to ask questions and join the discussion.