Intereting Posts

Why is “the set of all sets” a paradox?
What is the closed form of $\int e^{x^2} \, dx$?
Choosing points in fractions of the unit interval
limit of a recursively defined function
Irreducibility of Polynomials in $k$
Find Galois Group
A and B disjoint, A compact, and B closed implies there is positive distance between both sets
How to formalize $\text{span}(S)=\{c_1v_1+\cdots+c_kv_k\mid v_1,~\cdots,~v_k\in S,~c_1,~\cdots,~c_k\in F\}$ rigorously in first order language?
Non-squarefree version of Pell's equation?
Factorizing a polynomial $f$ in $A$ (with $A$ commutative), where $f$ has a zero in its field of fractions
Inverse Matrices and Infinite Series
Computing $ \int_{0}^{2\pi}\frac{\sin(nx)}{\sin(x)} \mathrm dx $
Convergence of the arithmetic mean
How to factor $a^n – b^n$?
Showing that $n$ exponential functions are linearly independent.

In Bergman’s companion notes to Rudin, he says that “If a sequence of positive terms has convergent sum, so does every sequence of positive terms which decays more rapidly.” So given a sequence $\{a_n\}$ of positive terms such that $\sum_n a_n$ converges, if $\{b_n\}$ is such that

$$

\lim_{n\to\infty} \frac{a_n}{b_n} = +\infty,

$$ then $\sum_nb_n$ converges. I can prove this given $\{a_n\}$ and $\{b_n\}$. However, can we find $b_n$ which decays more slowly, i.e.

$$

\lim_{n\to\infty} \frac{b_n}{a_n} = +\infty

$$ such that $\sum_n b_n$ converges?

Similarly, we have the claim “if a sequence of positive terms has divergent sum, then so does every sequence of positive terms which decays more slowly.”

- How do I prove that $\lim_{x→0} x⋅\ln x=0$
- Square Root Inequality
- Is the total variation function uniform continuous or continuous?
- Is the boundary of the unit sphere in every normed vector space compact?
- A converse of sorts to the intermediate value theorem, with an additional property
- If $(X,d)$ is a metric space then I want to show that limit point compactness and sequential compactness are equivalent.

- limits of sequences exponential and factorial: $a_n=e^{5\cos((\pi/6)^n)}$ and $a_n=\frac{n!}{n^n}$
- Paradox as to Measure of Countable Dense Subsets?
- Convergence of $\sum \frac{\sqrt{a_n}}{n^p}$
- Convergence of a sequence (possibly Riemann sum)
- Understanding the Proof of the Arzela-Ascoli Theorem from Carothers
- Show that $\lim _{r \to 0} \|T_rf−f\|_{L_p} =0.$
- How to prove periodicity of $\sin(x)$ or $\cos(x)$ starting from the Taylor series expansion?
- What is the significance of the three nonzero requirements in the $\varepsilon-\delta$ definition of the limit?
- Find $\sum_{k=1}^{\infty}\frac{1}{2^{k+1}-1}$
- Computability, Continuity and Constructivism

The question is the following:

Show that for every converging series $\sum\limits_na_n$ with positive terms there exists a converging series $\sum\limits_nb_n$ with positive terms such that $\lim\limits_{n\to\infty}\frac{a_n}{b_n}=0$.

A hands-on approach is as follows: for every $n$, consider $$A_n=\sum_{k\geqslant n}a_k,$$ then, by hypothesis, $A_n\to0$ hence, for each $k\geqslant0$, there exists some finite $\nu(k)$ such that $$A_{\nu(k)}\leqslant2^{-k}.$$ Assume without loss of generality that the sequence $(\nu(k))$ is nondecreasing and define $(b_n)$ by

$$\color{red}{\forall k\geqslant0,\quad\forall n\in[\nu(k),\nu(k+1))},\quad \color{red}{b_n=k\,a_n}.$$

Then $\frac{a_n}{b_n}\to0$ when $n\to\infty$ and $$\sum_{n\geqslant\nu(0)}b_n=\sum_{k\geqslant0}k\sum_{n=\nu(k)}^{\nu(k+1)-1}a_n\leqslant\sum_{k\geqslant0}kA_{\nu(k)}\leqslant\sum_{k\geqslant0}k2^{-k},$$ which is finite, hence the series $\sum\limits_nb_n$ converges, as desired.

If I can remember, Rudin clearly shows that there is no threshold for convergence or divergence of positive series, in chapter 3 of his book. You can construct convergent series with arbitrary slow decay by multiplying by logarithms.

For instance

$$

\sum_n \frac{1}{n \log n \log \log n}

$$

diverges, whereas

$$

\sum_n \frac{1}{n \log n (\log \log n)^2}

$$

converges, and so on.

You can build this using: $R_n = \sum_{k=n}^{+\infty} a_k \geq 0$ (exists since $\sum a_k$ converges)

$\sum a_n$ converges, i.e : $R_n \rightarrow 0$ , when $n\rightarrow +\infty$

You can define: $$b_n = \sqrt{R_n} -\sqrt{R_{n+1}}$$

Note that whenever $a_i = 0$ : $b_i = \sqrt{R_i} -\sqrt{R_{i+1}} =\sqrt{R_{i+1}} -\sqrt{R_{i+1}} = 0 $

So if you define: $v_n = \frac{a_n}{b_n} $ you can set: $v_i = 0$ when $a_i = 0$

Now when $a_n \neq 0$: $$v_n = \frac{a_n}{b_n} = \frac{R_n – R_{n+1}}{\sqrt{R_n} -\sqrt{R_{n+1}}} = \sqrt{R_n} +\sqrt{R_{n+1}} \rightarrow 0 , n\rightarrow +\infty $$

And $\sum b_n$ converges by a telescoping.

**Edit:** Likewise, you can also find a sequence ($c_n$) such as :$\frac{c_n}{a_n} \rightarrow 0$ and $\sum c_n$ converges.

You can consider : $c_n = R_n^2-R_{n+1}^2$ with the same statements as for $b_n$ when ($a_n$) contains zero terms:

$$ \frac{c_n}{a_n} = \frac{R_n^2-R_{n+1}^2}{a_n} = \frac{R_n^2-R_{n+1}^2}{R_n – R_{n+1}} = R_n + R_{n+1} \rightarrow 0 $$

Here again $\sum c_n$ converges by telescoping.

So one cannot define the notion of fastest converging series, since given any converging one you can build a new that converges faster.

There are a couple of things… slightly off… in your understanding.

The theorem does not say, as you imply, that if $$\sum_{n=1}^\infty a_n$$ exists and if $$\lim_{n\to\infty}\frac{b_n}{a_n} = \infty,$$ then the sum $$\sum_{n=1}^\infty b_n$$ exists. I advise you to re-check what your notes say.

- Replacing entries of dice by average of it neighbours
- Summation of series $\sum_{k=0}^\infty 2^k/\binom{2k+1}{k}$
- Prove that any set of 2015 numbers has a subset who's sum is divisible by 2015
- Classical texts that should not be missing from any shelf
- Question about definition of Semi algebra
- Number of zeros at the end of $k!$
- Presentations of subgroups of groups given by presentations
- Name for a certain “product game”
- Is there such thing as an unnormed vector space?
- If every compact set is closed, then is the space Hausdorff?
- Geodesics on the product of manifolds
- Geometric proof for inequality
- Is there a standard way to compute $\lim\limits_{n\to\infty}(\frac{n!}{n^n})^{1/n}$?
- Compact sets as point spectrum of a bounded operator
- Extreme Value Theorem Proof (Spivak)