Bourbaki

Proposition 7 ("Raabe's test")

Tag 08G8, permanent. Cite it as [Bourbaki, Tag 08G8].

Functions of a Real Variable, chapter V, § 4. APPLICATION TO SERIES WITH POSITIVE TERMS

Let (un)(u_n) be a series with terms >0> 0 from some point on. If, from a certain stage, un+1/un⩽1−αnu_{n+1}/u_n \leqslant 1 - \frac{\alpha}{n} for some α>1\alpha > 1, then the series (un)(u_n) converges; if, from a certain point on, un+1/un⩾1−1nu_{n+1}/u_n \geqslant 1 - \frac{1}{n}, then the series (un)(u_n) has infinite sum.

Indeed, if un+1/un⩽1−αnu_{n+1}/u_n \leqslant 1 - \frac{\alpha}{n} with α>1\alpha > 1, for all n⩾n0n \geqslant n_0, then one has un≼pn=∏k=n0n(1−αk)u_n \preccurlyeq p_n = \prod_{k=n_0}^{n} \left( 1 - \frac{\alpha}{k} \right). Now, log⁡(1−αn)=−αn−α22n2+o(1n2)\log \left( 1 - \frac{\alpha}{n} \right) = -\frac{\alpha}{n} - \frac{\alpha^2}{2n^2} + o \left( \frac{1}{n^2} \right), whence log⁡pn=\log p_n = −αlog⁡n+k+o(1/n)-\alpha \log n + k + o(1/n) (kk constant), and pn∼ek1nαp_n \sim e^k \frac{1}{n^\alpha}; since α>1\alpha > 1 the logarithmic criterion of order 0 allows one to finish.

If, on the other hand, un+1/un≥1−1nu_{n+1}/u_n \geq 1 - \frac{1}{n} from a certain point, then the same calculation proves that un≥1nu_n \geq \frac{1}{n}, whence the proposition.

One can prove in the same way, using the logarithmic criteria of order >0> 0, the following criterion of the second kind:

Bourbaki puts the proof directly after the statement, so what is above is the statement and its proof together.

Cited by

Nothing.

Cites

Nothing.

Transcribed from the printed volume. Not translated.