Xrfgtjtk

While preparing my tutoring group on (currently) measure theory and Lebesgue integration on $mathbb R^n$, I by chance came across the following result (at least I hope this is a result and my proof is valid) which I don't recall seeing up until today.

Let $(a_n)_{ninmathbb N}$ be a monotonically increasing sequence of positive numbers such that $lim_{ntoinfty}a_n=infty$. Then
$$sum_{n=2}^infty frac{a_n-a_{n-1}}{a_n}=infty,.$$

The proof I found for this relies on dominated convergence and goes as follows:

Proof. Given the sequence $(a_n)_{ninmathbb N}$ in question, define a sequence of functions $(f_n)_{ninmathbb N}$ via
$$
f_n:[0,infty)to [0,infty)qquad xmapsto frac1{a_n}mathbb 1_{[0,a_n]}(x)
$$
with $mathbb 1_{A}$ being the usual indicator function for arbitrary $Asubseteqmathbb R$. Obviously, $int_0^infty f_n(x),dx=1$ for all $ninmathbb N$ and $(f_n)_{ninmathbb N}$ converges pointwise to zero as $lim_{ntoinfty}a_n=infty$ by assumption. This however implies
$$
lim_{ntoinfty}int_0^infty f_n(x),dx=1neq 0=int_0^infty0,dx=int_0^inftylim_{ntoinfty} f_n(x),dx
$$
so by (the converse of) Lebesgue's dominated convergence theorem, no dominating integrable function $g$ for $(f_n)_{ninmathbb N}$ can exist. This in turn means that every dominating function $g$ we find has to be non-integrable. The obvious choice here is (written in a sloppy way but it should be clear how $g$ operates)
$$
g:[0,infty)to[0,infty)qquad xmapsto begin{cases} frac1{a_1}&text{ if }xin[0,a_1]\frac1{a_2}&text{ if }xin(a_1,a_2]\cdots end{cases},.
$$
Note that $g$ is well-defined as $(a_n)_n$ is assumed to be monotonically increasing and unconditionally convergent and, evidently, $|f_n|leq g$ for all $ninmathbb N$. Finally,
$$
infty=int_0^infty g(x),dx=operatorname{vol}([0,a_1])cdotfrac1{a_1}+operatorname{vol}((a_1,a_2])cdotfrac1{a_2}+ldots=1+sum_{n=2}^infty frac{a_n-a_{n-1}}{a_n}
$$
which concludes the proof.$quadsquare$

Of course the above result is trivial if $lim_{ntoinfty}frac{a_{n-1}}{a_n}neq 1$, but assuming $(a_n-a_{n-1})/a_nto 0$ as $ntoinfty$, I did not see an easy way to obtain this in an elementary way - admittedly, I didn't think about an alternate proof for too long. Given a quick glance I also did not find a similar result on this site just yet. Hence my question is:

Is there a simpler way to show this result (assuming it holds and I did not make a mistake)? If so, was this maybe already discussed somewhere on math.SE?

Thanks in advance for any answer or comment!

As a final remark (or rather small example), a direct application of this to the sequence $a_n:=sum_{k=1}^n frac1k$ immediatly yields the divergence of the series
$$
sum_{n=2}^infty frac1{n(sum_{k=1}^n frac1k)}=infty,.
$$
Given the divergence of $sum_{n=2}^infty frac1{nlog(n)}$ this is of course not surprising but nontheless this (at least in my opinion) is interesting to play around with.

Heuristics. Consider its continuum analogue: If $y(t) > 0$ and $y(t) to infty$ as $t to infty$, then

$$ int_{0}^{R} frac{y'(t)}{y(t)} , mathrm{d}t = log y(R) - log y(0) xrightarrow[Rtoinfty]{} infty.$$

We can adapt this intuition to our case. Write $b_n = (a_n - a_{n-1})/a_n$. Then it suffices to assume that $b_n to 0$, for otherwise the conclusion is trivial. Now since

$$ lim_{ntoinfty} frac{b_n}{log a_n - log a_{n-1}} = lim_{ntoinfty} frac{b_n}{-log(1 - b_n)} = 1, $$

the conclusion follows from

• (Limit Comparison Test) If $A_n, B_n > 0$ and $lim A_n/B_n $ converges in $(0, infty)$, then $sum_n A_n$ converges if and only if $sum_n B_n$ converges.




• $sum_{n=1}^{N} (log a_n - log a_{n-1}) = log a_N - log a_0 to infty$ as $Ntoinfty$, provided $lim a_n = infty$.