0% found this document useful (0 votes)
54 views1 page

Limit of Decreasing Sequence Proof

The document provides a proof that if a sequence of real numbers is decreasing and the sum of the sequence converges, then the limit of the product of each term and its index is 0. It first states the assumptions and goal of the proof. It then provides a hint involving using the comparison test to show the series would diverge if the limit was not 0. The bulk of the document is the full proof based on this hint, using properties of decreasing sequences and convergence.

Uploaded by

tarikjary1976
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
54 views1 page

Limit of Decreasing Sequence Proof

The document provides a proof that if a sequence of real numbers is decreasing and the sum of the sequence converges, then the limit of the product of each term and its index is 0. It first states the assumptions and goal of the proof. It then provides a hint involving using the comparison test to show the series would diverge if the limit was not 0. The bulk of the document is the full proof based on this hint, using properties of decreasing sequences and convergence.

Uploaded by

tarikjary1976
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Math 320 Homework Hint 2.15.

7 Summer 2015

P
Show that if {an } is a decreasing sequence of real numbers and if an converges, then limn→∞ nan = 0. (Notice
that the two assumptions guarantee that an ց 0 as n → ∞. In particular, an > 0.) Here’s a better hint than the
one given in the text.

Hint: Suppose P this is false. That is, suppose that limn→∞ nan = c > 0. Now use the Comparison Test to conclude
that the series an diverges.

Below I put together a proof based on the textbook’s hint.

Proof. Let ε > 0. Then following the textbook’s hint (the Cauchy Criterion), there exists an M ∈ N such that for
all n > M we have
ε
(1) aM +1 + aM +2 + · · · + an <
2
Note: Absolute value signs are not necessary since the terms are positive. Now we fix M for the remainder of this
argument. By Corollary 14.5 from the text, there exists a P ∈ N such that n ≥ P implies an < ε/(2M ).

Now let N = max{M, P } and let n > N . Then

(2) nan = an + an + · · · + an
| {z }
n terms

(3) ≤ aP + aP + · · · + aP + aM +1 + aM +2 + · · · + an
| {z } | {z }
M terms n−M terms
ε
(4) < M aP +
2
ε ε
(5) <M + =ε
2M 2

(3) - Since the sequence is decreasing. That is, since an ≤ an−1 ≤ · · · ≤ a1 .


(4) - From (1).
(5) - Since an → 0 as n → ∞.
Remark. Notice how monotonicity is used in a big way!

rjh

You might also like