Annihilation Operators: Prove af(a^\dagger)|n>=df(a^\dagger)/da|0>

  • Context: Graduate 
  • Thread starter Thread starter Shadowz
  • Start date Start date
  • Tags Tags
    Annihilation Operators
Click For Summary

Discussion Overview

The discussion revolves around the mathematical proof involving annihilation operators and polynomials of creation operators in quantum mechanics. Participants explore the expression af(a^\dagger)|n> = df(a^\dagger)/da|0> and its implications, focusing on the properties of these operators and their action on quantum states.

Discussion Character

  • Technical explanation
  • Mathematical reasoning
  • Debate/contested

Main Points Raised

  • Some participants suggest that since f(a^\dagger) is a polynomial, it suffices to show that a(a^\dagger)^n |0> = n(a^\dagger)^{n-1} for n = 0, 1, 2, ...
  • Others express confusion about how the left-hand side (LHS) raises |n> to a higher state while the right-hand side (RHS) involves |0>, questioning the validity of the original expression.
  • One participant points out that the formula should be written as af(a^\dagger)|n> = f'(a^\dagger)|0> because f(a^\dagger) does not depend on a.
  • Another participant proposes using the commutation relation [a, (a^\dagger)^n] to compute the action of a on the polynomial.
  • Some participants discuss the implications of the LHS and RHS not depending on n in the same way, suggesting a potential mistake in the formulation.
  • There is a suggestion that the expression holds true for any polynomial of degree n if |0> is considered on both sides of the equality.
  • One participant raises a question about the relationship between n and the degree of f, indicating a possible connection that needs exploration.

Areas of Agreement / Disagreement

Participants express varying levels of agreement on the formulation of the problem and the implications of the operators involved. There is no consensus on the correctness of the original expression, and multiple competing views remain regarding how to approach the proof.

Contextual Notes

Some participants note that the original expression may lack clarity regarding the dependence on the quantum states involved, particularly the ground state |0> versus excited states |n>. There are also unresolved mathematical steps related to the commutation relations and their application in this context.

Shadowz
Messages
41
Reaction score
0
So we all know about [tex]a[/tex] and [tex]a^\dagger[/tex].

My problem says that if [tex]f(a^\dagger)[/tex] is an arbitrary polynomial in [tex]a^\dagger[/tex] then [tex]af(a^\dagger)|n> = \frac{df(a^\dagger)}{da}|0>[/tex] where |0> is the ground state energy. How can I go about proving this?

A hint would be highly appreciated.

Thanks,
 
Physics news on Phys.org
Shadowz said:
So we all know about [tex]a[/tex] and [tex]a^\dagger[/tex].

My problem says that if [tex]f(a^\dagger)[/tex] is an arbitrary polynomial in [tex]a^\dagger[/tex] then [tex]af(a^\dagger)|n> = \frac{df(a^\dagger)}{da}|0>[/tex] where |0> is the ground state energy. How can I go about proving this?

A hint would be highly appreciated.

Thanks,

Since [tex]f(a^\dagger)[/tex] is a polynomial.
It suffices to show that
[tex]a (a^\dagger)^n |0\rangle = n(a^\dagger)^{n-1}[/tex]
where [tex]n = 0,1,2,\cdots[/tex]

And you know the commutator of [tex][a,a^\dagger] = ...[/tex]
 
ismaili said:
Since [tex]f(a^\dagger)[/tex] is a polynomial.
It suffices to show that
[tex]a (a^\dagger)^n |0\rangle = n(a^\dagger)^{n-1}[/tex]
where [tex]n = 0,1,2,\cdots[/tex]

And you know the commutator of [tex][a,a^\dagger] = ...[/tex]

Maybe I don't quite get it but you said we can assume [tex]f(a^\dagger)[/tex] be [tex](a^\dagger)^n[/tex]

But then if I consider the LHS, will that operator raises |n> to |2n-1>? (each [tex]a^\dagger[/tex] would raise |n> to |n+1>) but the RHS has |0>.

Thank for your help,
 
Last edited:
The formula

[tex] af(a^\dagger)|n> = \frac{df(a^\dagger)}{da}|0>[/tex]

Is written very sloppily. It should be written as

[tex] af(a^\dagger)|n> = f'(a^\dagger)|0>[/tex]

Why? Because [tex]f(a^\dagger)[/tex] does not depend on [tex]a[/tex].
 
Thank you for pointing that out.

So is it correct to consider

[tex]a(a^{\dagger})^{n-1}(a^{\dagger})|n> = \sqrt{n}a(a^\dagger)^{n-1}|n+1>[/tex]

and then I have to find a way to do [tex]a|n+1> = \sqrt{n}|n>[/tex] in order to get to the form [tex]n(a^\dagger)^{n-1}[/tex] but the RHS has |0> so I don't know how to get it.

Thanks,
 
Why not start with something like [tex][A,BC]=A[B,C]+[A,B]C[/tex], thus

[tex][a,(a^\dagger)^n]=a^\dagger [a,(a^\dagger)^{n-1}]+[a,a^\dagger](a^\dagger )^{n-1}=\ldots ...[/tex]

in order to compute [tex][a,(a^\dagger)^n][/tex]
 
Last edited:
arkajad said:
Why not start with something like [tex][A,BC]=A[B,C]+[A,B]C[/tex], thus

[tex][a,(a^\dagger)^n]=a^\dagger [a,(a^\dagger)^{n-1}]+[a,a^\dagger](a^\dagger )^{n-1}=\ldots ...[/tex]

in order to compute [tex][a,(a^\dagger)^n][/tex]

If my algebra is correct then [tex][a,(a^\dagger)^n] = (a^\dagger)^{n-1} +(n-1)(a^\dagger)^{n-1} = n(a^\dagger)^{n-1}[/tex]Should I try to operate both sides with |0>?
 
So, your algebra can be generalized to

[tex][a,f(a^\dagger)]=f'(a^\dagger)[/tex]

Don't you think there is a mistake on the LHS of the equation you want to prove? Don't you think there should be |0> there rather than |n>? The RHS does not depend on n, how the LHS can?
 
Last edited:
Yes. So the RHS is close, but then we still have to break the commutator and somehow put in n and 0.

By the way, thank you!

and so I rearrange it to be

[tex]af(a^\dagger) = f(a^\dagger)a + f'(a^\dagger)[/tex]

but then how can we prove that [tex](f(a^\dagger)a + f'(a^\dagger))|n> = f'(a^\dagger)|0>[/tex]?
 
Last edited:
  • #10
I am 95% sure that the expression I try to show is correct because it also says that " |0> is the ground state energy and |n> is any harmonic oscillator state."

PS: Although I think it would make a lot of sense to have |0> on both side since [tex]f(a^\dagger)a|0> =0[/tex]
 
Last edited:
  • #11
Just think of n=1000 and [tex]f(x)\equiv 1[/tex]

Then on LHS you will have 999th excited state a|n>, on the LHS you will have just 0 (because f'=0 in this case).
 
Last edited:
  • #12
Yes that is exactly what my 3rd post said (or not exactly, but similar idea)

Now I think that [tex]\frac{df(a^\dagger) }{da}[/tex] can make a difference.
 
  • #13
Isn't there a relation between n and the degree of f?
 
  • #14
It seems to be true for any polynomial (of degree = n)
if you take |0> on each side of the equality.
 
  • #15
naima said:
It seems to be true for any polynomial (of degree = n)
if you take |0> on each side of the equality.

You're right. I got it. Thank all of you for help!
 
  • #16
Hi,

How can I write [tex]\Delta x[/tex] and [tex]\Delta p[/tex] as operators? I want to show that [tex]\Delta x|\alpha> = c\Delta p|\alpha>[/tex] where [tex]|\alpha>[/tex] is coherent state.

I feel like I have to write x and p in terms of annihilation operators, but I always think that [tex]\Delta x[/tex] and [tex]\Delta p[/tex] are numbers, not operators.

Thanks,
 
  • #17
It is not clear by itself what [itex]\Delta x,\Delta p[/itex] can mean in this context. One can try to guess their meaning, but it is not evident.
 
  • #18
So all I try to do was to show that the coherent state has minimum uncertainty equally distributed between x and p. And the hint given was to show that [tex]\Delta x |\alpha> = x\Delta p |\alpha>[/tex], and thus it makes me think that I should treat [tex]\Delta x[/tex] and [tex]\Delta p[/tex] as operators rather than numbers.
 
  • #19
For minimum uncertainty you need to calculate [tex]\langle \alpha|(\Delta x)^2|\alpha\rangle=\langle\Delta x\alpha|\Delta x\alpha\rangle[/tex], where [itex]\Delta x=x-\langle\alpha| x|\alpha\rangle .[/itex] Now you can plug in your anihilation and creation operators. The same for [itex]\Delta p[/itex].
 

Similar threads

  • · Replies 0 ·
Replies
0
Views
2K
  • · Replies 10 ·
Replies
10
Views
2K
  • · Replies 4 ·
Replies
4
Views
3K
  • · Replies 4 ·
Replies
4
Views
4K
  • · Replies 19 ·
Replies
19
Views
4K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K