Question About Proof

**JG89** · Jun23-09, 11:40 PM

In my calculus textbook there is a theorem:

"If a sequence a_1 + a_2 + ... converges and if b_1, b_2, ... is a bounded monotonic sequence of numbers, then (a_1)(b_1) + (a_2)(b_2) + ... converges"

Proof:

Let s_n denote the partial sums of $LaTeX Code: \\sum_{v=1}^n a_v$ , s the sum, and let $LaTeX Code: \\xi_n = s_n - s$ . Then $LaTeX Code: \\sum_{v=n}^m a_v b_v = \\sum_{v=n}^m (\\xi_v - \\xi_{v-1}) b_v = \\sum_{v=n}^m \\xi_v(b_v - b_{v+1}) - \\xi_{n-1} b_n + \\xi_m b_{m+1}$ .

For every sufficiently large v, $LaTeX Code: |\\xi_v| < \\epsilon$ , and

$LaTeX Code: \\sum_{v=n}^m a_v b_v < \\epsilon \\sum_{v=n}^m |b_v - b_{v+1}| + \\epsilon |b_n| + \\epsilon |b_{m+1}| < \\epsilon |b_n - b_{m+1}| + \\epsilon |b_n| + \\epsilon |b_{m+1}|$ .

This is in turn less than $LaTeX Code: 4B \\epsilon$ , where B is a bound for |b_v|, and the series $LaTeX Code: \\sum_{v=1}^{\\infty} a_v b_v$ converges

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

I understand the proof and everything. I was wondering though, how did the writer of the proof know to rewrite the sum as this: $LaTeX Code: \\sum_{v=n}^m a_v b_v = \\sum_{v=n}^m (\\xi_v - \\xi_{v-1}) b_v = \\sum_{v=n}^m \\xi_v(b_v - b_{v+1}) - \\xi_{n-1} b_n + \\xi_m b_{m+1}$ ?

It just seems so random, something that I never would've thought about. If you could, could you please explain the thought processes he went through to realize he had to rewrite the sum in that form?

Thanks

**mikepol** · Jun25-09, 08:08 PM

Hi JG89,

This is probably not the answer you were looking for. What you are describing is usually referred as Abel's test for convergence of the series in the form $LaTeX Code: $\\sum a_n b_n$$ . The formula used in the proof is called Abel's partial summation formula. Every text that I've seen proves this theorem using this formula. It is a standard result that was discovered by Abel, probably by doing some other mathematics and uncovering this formula in the process. He was probably not trying to proof this theorem, since it didn't exist before him, or at least wasn't stated in these terms. This theorem probably followed the discovery of the formula, not the other way around.

**thofer** · Jun26-09, 02:20 AM

Hi JG89
With the definition of $LaTeX Code: \\xi_n$ you can write $LaTeX Code: \\xi_n - \\xi_{n-1} = s_n - s - (s_{n-1} - s) = s_n - s_{n-1} = \\sum_{v=1}^n a_v - \\sum_{v=1}^{n-1} a_v = a_n$ .
This gives the first step.
Now you can write the sum of the second step as follows:
$LaTeX Code: \\sum_{v=n}^m (\\xi_v - \\xi_{v-1})b_v = \\sum_{v=n}^m \\xi_vb_v - \\sum_{v=n}^m \\xi_{v-1}b_v = \\sum_{v=n}^m \\xi_v b_v - \\sum_{k=n-1}^{m-1} \\xi_k b_{k+1} = \\sum_{v=n}^m \\xi_v b_v- \\sum_{k=n}^m \\xi_kb_{k+1} - \\xi_{n-1}b_n + \\xi_mb_{m+1}.$
If you switch again to index v in the second sum you get the result. To do the second step in the above equation you set k=v-1, and then substitute every v in the sum.

**JG89** · Jun26-09, 03:15 AM

Originally Posted by thofer

Hi JG89
With the definition of $LaTeX Code: \\xi_n$ you can write $LaTeX Code: \\xi_n - \\xi_{n-1} = s_n - s - (s_{n-1} - s) = s_n - s_{n-1} = \\sum_{v=1}^n a_v - \\sum_{v=1}^{n-1} a_v = a_n$ .
This gives the first step.
Now you can write the sum of the second step as follows:
$LaTeX Code: \\sum_{v=n}^m (\\xi_v - \\xi_{v-1})b_v = \\sum_{v=n}^m \\xi_vb_v - \\sum_{v=n}^m \\xi_{v-1}b_v = \\sum_{v=n}^m \\xi_v b_v - \\sum_{k=n-1}^{m-1} \\xi_k b_{k+1} = \\sum_{v=n}^m \\xi_v b_v- \\sum_{k=n}^m \\xi_kb_{k+1} - \\xi_{n-1}b_n + \\xi_mb_{m+1}.$
If you switch again to index v in the second sum you get the result. To do the second step in the above equation you set k=v-1, and then substitute every v in the sum.

Beautiful.

Thanks