Proving Convergence of Series with Bounded Monotonic Sequences

  • Thread starter Thread starter JG89
  • Start date Start date
  • Tags Tags
    Series
JG89
Messages
724
Reaction score
1

Homework Statement



If a_1 + a_2 + ... is an infinite series converging to A, and b1, b2, ... is an infinite sequence that is bounded and monotonic, prove that (a_1)(b_1) + (a_2)(b_2) + ... converges


Homework Equations





The Attempt at a Solution



I don't really know where to start...all I can say is that if a_1 + a_2 + ... converges, then a_n approaches 0 as n goes to infinity, and so (a_n)(b_n) also has a limit of 0, since b_n converges to some finite value.
 
Physics news on Phys.org
You know that bn is bounded and monotonic. Have you tried using that? Given a general number b, you know
\sum a_n b
converges right? Now try to compare that to the sequence

\sum a_n b_n choosing b such that |bn| < b for all n
 
Hi JG89! :smile:
JG89 said:
… since b_n converges to some finite value.

Yes :approve: … concentrate on that value (call it b) …

then use deltas and epsilons. :wink:
 
I have an intuitive idea of what's going on, but I'm having a hard time fleshing it out into an epsilon argument.

First off, since a_1 + a_2 + ... converges then b(a_1 + a_2 + ...) converges. I know that for large enough n, |(a_n)(b_n)| gets 'really' close to |(a_n)b|, since b is the limit of b_n. Since the b_n are monotonic, then as n increases the |(a_n)(b_n)| gets even closer to |(a_n)b|. I can in fact make this difference as small as I please, provided n is taken large enough and so it seems that after a certain n, the difference between (a_n)(b_n) and (a_n)b will become "negligible" and since (a_n)b is Cauchy, then (a_n)(b_n) is also Cauchy.
 
Last edited:
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top