Absolute convergence

[Alexmahone]

Prove that if $\displaystyle \left|\frac{a_{n+1}}{a_n}\right|\le\left|\frac{b_{n+1}}{b_n}\right|$ for $\displaystyle n\gg 1$, and $\displaystyle\sum b_n$ is absolutely convergent, then $\displaystyle\sum a_n$ is absolutely convergent.

 

[Prove It]

Prove that if $\displaystyle \left|\frac{a_{n+1}}{a_n}\right|\le\left|\frac{b_{n+1}}{b_n}\right|$ for $\displaystyle n\gg 1$, and $\displaystyle\sum b_n$ is absolutely convergent, then $\displaystyle\sum a_n$ is absolutely convergent.

Isn't this obvious from the comparison test?

 

[Alexmahone]

Isn't this obvious from the comparison test?

My attempt:

Pick a $\displaystyle c$ large enough so that $\displaystyle|a_1|<c|b_1|$.

Assume that $\displaystyle|a_n|<c|b_n|$ for some $n$.

$\displaystyle|a_{n+1}|\le|a_n|\left|\frac{b_{n+1}}{b_n}\right|=\left|\frac{a_n}{b_n}\right||b_{n+1}|<c|b_{n+1}|$

So, by induction, $\displaystyle|a_n|<c|b_n|$ for all $n$.

Since $\displaystyle\sum c|b_n|$ converges, $\displaystyle\sum|a_n|$ also converges by the comparison test.

------------------------------------------------------------------------

Does that look ok?

 

[Also sprach Zarathustra]

My attempt:

Pick a $\displaystyle c$ large enough so that $\displaystyle|a_1|<c|b_1|$.

Assume that $\displaystyle|a_n|<c|b_n|$ for some $n$.

$\displaystyle|a_{n+1}|\le|a_n|\left|\frac{b_{n+1}}{b_n}\right|=\left|\frac{a_n}{b_n}\right||b_{n+1}|<c|b_{n+1}|$

So, by induction, $\displaystyle|a_n|<c|b_n|$ for all $n$.

Since $\displaystyle\sum c|b_n|$ converges, $\displaystyle\sum|a_n|$ also converges by the comparison test.

------------------------------------------------------------------------

Does that look ok?

Yes. And if to be more accurate your $c$ is $\frac{a_k}{b_k}$ for some natural $k$.

 

[Alexmahone]

And if to be more accurate your $c$ is $\frac{a_k}{b_k}$ for some natural $k$.

What do you mean?

 

[Also sprach Zarathustra]

What do you mean?

Say that, for some n \geq k, the followinf true:

$$ \frac{a_{n+1}}{a_n}\le\frac{b_{n+1}}{b_n} $$

We'll write:

$$ \frac{a_{k+1}}{a_k}\le\frac{b_{k+1}}{b_k} $$

$$ \frac{a_{k+2}}{a_{k+1}}\le\frac{b_{k+2}}{b_{k+1}} $$

$$ \frac{a_{k+3}}{a_{k+2}}\le\frac{b_{k+3}}{b_{k+2}} $$

.
.
.

$$ \frac{a_{n}}{a_{n-1}}\le\frac{b_{n}}{b_{n-1}} $$


Now, if we multiply these inqualities, we'll get:

$$ \frac{a_n}{a_k}\le\frac{b_n}{b_k} $$

or:

$$a_n\le\frac{a_k}{b_k}b_n$$