Recursion relation in the hydrogen atom

Click For Summary

Homework Help Overview

The discussion revolves around a recursion relation related to the eigenstates of the hydrogen atom, specifically examining the implications of a given recursion formula and the conditions under which certain terms may be non-zero.

Discussion Character

  • Exploratory, Assumption checking, Conceptual clarification

Approaches and Questions Raised

  • Participants explore the implications of the recursion formula, questioning how a term can be non-zero if the preceding term is zero. They discuss the indeterminate form that arises and consider the application of L'Hôpital's rule, although some express skepticism about its relevance.

Discussion Status

The discussion is active, with participants sharing various interpretations and exploring the mathematical reasoning behind the recursion relation. There is no explicit consensus, but several lines of reasoning are being examined regarding the conditions for non-zero terms.

Contextual Notes

Participants note that the recursion formula is derived in the context of calculating eigenstates of the hydrogen atom, and there is mention of differing formulas found in literature, which may affect the interpretation of the problem.

sunrah
Messages
191
Reaction score
22

Homework Statement


Given the following recursion formula:

[itex]b_{j} = 2 \frac{kj - a}{j(j+1)-l(l+1)} \cdot b_{j-1}[/itex]

(where a, k and l are constants) how can

[itex]b_{j = l} \neq 0[/itex] if [itex]b_{j - 1} = 0[/itex].

Homework Equations



The Attempt at a Solution



This is a part question and I really can't see why. if bl-1 = 0 then bl = 0 also. But then all subsequent bj as well !
 
Physics news on Phys.org
Well firstly bj=l = (2(kl-a))/0*bj-1 thus if bj-1 = 0 we come to the indeterminant form 0/0 . This implies that bj=l could possibly be nonzero. I know this isn't very mathematically rigorous, but I suppose you could try l'hopital's rule on the first equation with respect to l.
 
grindfreak said:
you could try l'hopital's rule on the first equation with respect to l.

hi, I don't see how that would help. surely you'd have to differentiate w.r.t. j and take the limit as j → l but my understanding is that the bj are constants not dependent on j so the factor bj-1=0 would remain after differentiating.
 
Perhaps not l'hospital's rule, but the only way that bl-1 can equal zero is if kl-a=0 or l=a/k. This also makes the numerator of bl=j = 0 as well as it's denominator. Since you end up with the indeterminate form of 0/0, we don't know for sure that bl=j = 0 and thus might actually be nonzero. I believe your problem was looking for speculation and not necessarily a formal proof.
 
second question, how would you use this recursion formula? If bj-1:= 0, then when moving forward with increasing j all subsequent bj would also equal zero. Is it possible to move back from a non zero upper limit perhaps j = n, where n is the main quantum number.
 
Hmmm, I'm not sure about moving backwards since, like you've stated, every bj is zero due to the fact that every numerator of the recursion is zero. The one exception being bj=l where both the denominator and the numerator are zero. Since this is the case, we end up with an indeterminate form. Now where to go from there I'm not sure, since it is neither zero, nor infinite, there is definitely a chance that it is nonzero. But, judging by how the question is worded I don't think they're looking for a rigorous proof, but how it is possible that it is nonzero.
 
hi, this formula is used to calculate the eigenstates of the hydrogen atom (at least that's the context of how we derived it in class) so it should produce a range of non-zero results. It's weird because I can't find this formula in the literature, all the books I know use a different one without the pole at j = l
 
Yes I noticed this, most texts use:

[tex]c_{j+1}=\frac{2(j+l+1-n}{(j+1)(j+2(l+1))}c_{j}\[/tex]

I believe.
 

Similar threads

  • · Replies 0 ·
Replies
0
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 21 ·
Replies
21
Views
2K
Replies
4
Views
2K
Replies
5
Views
4K
Replies
5
Views
2K
  • · Replies 7 ·
Replies
7
Views
6K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 14 ·
Replies
14
Views
3K