Matterwave said:
So, is this result generally true? That all commutators which are simply just numbers times the identity arise from operators such that the eigenfunctions of one operator is not in the domain of the commutator?
Not sure.
Matterwave said:
I saw the other thread you posted, and they basically said that the eigenfunctions are non-normalizable and therefore not in the Hilbert space, but I didn't understand their proof for such a statement.
Edit: I should have read your comment more carefully. You're talking about a result about eigenfunctions, and I'm proving a result about operators. D'oh.
OK, this I can explain. I haven't yet thought about how much of this applies to semi-inner product spaces, so I'll prove it for the case of Hilbert spaces. I will need to cover some of the basics: A linear operator A on a Hilbert space H is said to be
bounded if there's an M>0 such that
$$\frac{\|Ax\|}{\|x\|}\leq M$$ for all ##x\in H##. The norm of a bounded linear operator A is defined by
$$\|A\|=\sup_{x\in H}\frac{\|Ax\|}{\|x\|}.$$ The right-hand side is easily seen to be equal to ##\sup_{\|x\|=1}\|Ax\|##. You just prove this:
$$\big\{\|Ax\|/\|x\| : x\in H\big\}=\big\{\|Ax\|:x\in H,\ \|x\|=1\big\}.$$ If the sets are equal, their supremums are too.
Theorem: If A and B are bounded linear operators on H, then
(a) ##\|Ax\|\leq \|A\|\|x\|## for all ##x\in H##.
(b) ##\|AB\|\leq\|A\|\|B\|##.
Proof: Let ##x\in H## be arbitrary.
(a) We have ##\frac{\|Ax\|}{\|x\|}\leq\|A\|##, because the left-hand side is an element of the set that the right-hand side is the supremum of.
(b) We have ##\|ABx\|\leq \|A\|\|Bx\|\leq\|A\|\|B\|\|x\|##. Since x is arbitrary, this implies that ##\|A\|\|B\|## is an upper bound of the set that ##\|AB\|## is the supremum of.
Lemma: If A and B are bounded linear operators on H such that ##[A,B]=cI##, where c is a complex number and I is the identity operator, then for all ##n\in\mathbb Z^+##, we have ##[A,B]=ncB^{n-1}##.
Proof: We will use induction, obviously. For each ##n\in\mathbb Z^+##, let P(n) be the statement ##[A,B^n]=ncB^{n-1}##. Since ##[A,B]=cI=cIB^{1-1}##, P(1) is true. Let ##n\in\mathbb Z^+## be arbitrary and suppose that ##P(n)## is true. Since
$$[A,B^{n+1}]=B[A,B^n]+[A,B]B^n=BncB^{n-1}+cIB^n = (n+1)B^n,$$ P(n+1) is true. By induction, ##P(k)## is true for all ##k\in\mathbb Z^+##.
Hmm...I see a problem with the final theorem that I haven't had time to solve yet. Here's a theorem and proof that may or may not have a division by zero issue:
"Theorem:" If A and B are bounded linear operators on H, then [A,B] can't be a number times the identity operator on H.
"Proof." Suppose that A and B are bounded linear operators on H. We will prove that there's no complex number c such that [A,B]=cI by deriving a contradiction from the assumption that this is false. So suppose that there's a ##c\in\mathbb C## such that ##[A,B]=cI##. Let ##n\in\mathbb Z^+## be arbitrary. The lemma tells us that ##[A,B^n]=ncB^{n-1}##. This implies that
$$n|c|\|B^{n-1}\|=\|ncB^{n-1}\|=\|[A,B^n\| =\|AB^n-B^nA\|\leq \|AB^n\|+\|B^nA\|\leq 2\|A\|\|B^{n-1}\|.$$ Since n is arbitrary, this implies that ##\|A\|\geq nc/2## for all n, contradicting the assumption that ##\|A\|## is bounded.
The problem here is that if ##\|B^{n-1}\|=0## for some n, then we're dividing by zero. I haven't yet thought about whether this is something we need to worry about. It's possible that we may have to modify the proof and maybe even the theorem a bit to deal with this issue.