monotone convergence problem

**sjhlax89** · October 30th 2007, 03:25 PM

Let {bn} be a bounded sequence of nonnegative numbers and r be any number such that 0≤r<1.

sn = b1r + b2r^2 + ….. + bnr^n for every index n.

Use the monotone convergence theorem to prove that the series {sn} converges.

**Plato** · October 30th 2007, 03:49 PM

Because all these numbers are nonnegative, then it should be clear to you that $\left( {s_n } \right)$ is an non-decreasing sequence. Now let B be the bound such that $\left( {\forall n} \right)\left( {\left| {b_n } \right| \le B} \right)$ .
It should also be clear that, $s_n = \sum\limits_{k = 1}^n {b_k r^k } \le B\sum\limits_{k = 1}^n {r^k } \le \frac{{Br}}{{1 - r}}$ .

What do you know about a bounded non-decreasing sequence?

Thread: monotone convergence problem

LinkBack

Thread Tools

Display

monotone convergence problem

Similar Math Help Forum Discussions

Monotone

Monotone convergence vs Dominated Convergence

Monotone sequence - how can this be a monotone sequence if it bounces between numbers

analysis-bounded monotone sequence problem

Is every strictly locally monotone sequence strictly monotone?

Search Tags