- 7,643
- 1,601
Dirac Proves 0 = 1
Suppose A is an observable, i.e., a self-adjoint operator, with real eigenvalue a and normalized eigenket \left| a \right>. In other words,
A \left| a \right> = a \left| a \right>, \hspace{.5 in} \left< a | a \right> = 1.
Suppose further that A and B are canonically conjugate observables, so
\left[ A , B \right] = i \hbar I,
where I is the identity operator. Compute, with respect to \left| a \right>, the matrix elements of this equation divided by i \hbar:
<br /> \begin{equation*}<br /> \begin{split}<br /> \frac{1}{i \hbar} \left< a | \left[ A , B \right] | a \right> &= \left< a | I | a \right>\\<br /> \frac{1}{i \hbar} \left( \left< a | AB | a \right> - \left<a | BA | a \right> \right) &= <a|a>.<br /> \end{split}<br /> \end{equation*}<br />
In the first term, let A act on the bra; in the second, let A act on the ket:
\frac{1}{i \hbar} \left( a \left< a | B | a \right> - a \left<a | B | a \right> \right)= <a|a>.
Thus,
0 = 1.
This is my favourite "proof" of the well-known equation 0 = 1.
What gives?
In order not spoil other people's fun, it might be best to put "spoiler" at the top of any post that explains what's happening.
Regards,
George
Suppose A is an observable, i.e., a self-adjoint operator, with real eigenvalue a and normalized eigenket \left| a \right>. In other words,
A \left| a \right> = a \left| a \right>, \hspace{.5 in} \left< a | a \right> = 1.
Suppose further that A and B are canonically conjugate observables, so
\left[ A , B \right] = i \hbar I,
where I is the identity operator. Compute, with respect to \left| a \right>, the matrix elements of this equation divided by i \hbar:
<br /> \begin{equation*}<br /> \begin{split}<br /> \frac{1}{i \hbar} \left< a | \left[ A , B \right] | a \right> &= \left< a | I | a \right>\\<br /> \frac{1}{i \hbar} \left( \left< a | AB | a \right> - \left<a | BA | a \right> \right) &= <a|a>.<br /> \end{split}<br /> \end{equation*}<br />
In the first term, let A act on the bra; in the second, let A act on the ket:
\frac{1}{i \hbar} \left( a \left< a | B | a \right> - a \left<a | B | a \right> \right)= <a|a>.
Thus,
0 = 1.
This is my favourite "proof" of the well-known equation 0 = 1.
What gives?
In order not spoil other people's fun, it might be best to put "spoiler" at the top of any post that explains what's happening.
Regards,
George
Last edited: