Proving Convergence of Series with Bounded Monotonic Sequences

  • Thread starter Thread starter JG89
  • Start date Start date
  • Tags Tags
    Series
Click For Summary

Homework Help Overview

The discussion revolves around proving the convergence of an infinite series formed by the product of two sequences, where one sequence is known to converge and the other is bounded and monotonic.

Discussion Character

  • Exploratory, Conceptual clarification, Mathematical reasoning

Approaches and Questions Raised

  • Participants explore the implications of the bounded and monotonic nature of the second sequence, suggesting comparisons to known convergent series. There are attempts to relate the behavior of the product series to the limit of the bounded sequence.

Discussion Status

The discussion is active, with participants providing insights and suggesting approaches, such as using epsilon-delta arguments and considering the limit of the bounded sequence. There is an ongoing exploration of how to formalize the intuitive ideas presented.

Contextual Notes

Some participants express uncertainty about how to transition from intuitive reasoning to a formal proof, indicating a need for clarity on the application of convergence criteria and the properties of the sequences involved.

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
[tex]\sum a_n b[/tex]
converges right? Now try to compare that to the sequence

[tex]\sum a_n b_n[/tex] 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:

Similar threads

  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 5 ·
Replies
5
Views
1K
Replies
15
Views
2K
  • · Replies 7 ·
Replies
7
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
Replies
6
Views
3K
  • · Replies 3 ·
Replies
3
Views
2K
Replies
4
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K