Infinite Finite Difference

Calculus Level 4

Let a n a_n be a real sequence with positive terms such that lim n a n = 0 \displaystyle \lim_{n\to \infty} a_n = 0 .

If the sequence c n = a n a n + 1 c_n = a_n - a_{n+1} is nonincreasing, what is the strongest statement we can make about the limit lim n n c n \displaystyle \lim_{n\to \infty} n c_n (that is true for any choice of a n a_n )?

It exists and is equal to 0 It exists and is not equal to 0 It exists, and is not strictly positive It exists, and is a real number It may fail to exist

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

1 solution

Star Fall
Jul 7, 2016

Relevant wiki: Cauchy Sequences

The first step is to note that a n a_n must be monotone decreasing. To see this, assume that we had a n + 1 > a n a_{n+1} > a_n for some n n . Then, c n = a n a n + 1 < 0 c_n = a_n - a_{n+1} < 0 , and since the sequence c n c_n is nonincreasing its limit has to be strictly smaller than 0, which contradicts the fact that

lim n c n = lim n a n lim n a n + 1 = 0 0 = 0 \lim_{n\to \infty} c_n = \lim_{n\to \infty} a_n - \lim_{n\to \infty} a_{n+1} = 0 - 0 = 0

Denote d n = n c n d_n = n c_n . The sequence a n a_n is convergent, so in particular it is a Cauchy sequence. This means that for any ϵ > 0 \epsilon > 0 , there is N N such that for all n > N n > N , we have that a 2 n a n < ϵ |a_{2n} - a_n| < \epsilon . Using monotonicity and positivity of a n a_n , this gives

ϵ > a 2 n a n = a n a 2 n = k = n 2 n 1 a k a k + 1 = k = n 2 n 1 c k n c 2 n 1 \epsilon > |a_{2n} - a_n| = a_n - a_{2n} = \sum_{k=n}^{2n-1} a_k - a_{k+1} = \sum_{k=n}^{2n-1} c_k \geq n c_{2n-1}

Likewise, for the same N N we have that a 2 n + 1 a n < ϵ |a_{2n+1} - a_n| < \epsilon , and an entirely similar calculation shows that ( n + 1 ) c 2 n < ϵ (n+1) c_{2n} < \epsilon . Now, from these it follows that

lim n d 2 n = 2 lim n n c 2 n = 0 \lim_{n\to \infty} d_{2n} = 2\lim_{n\to \infty} n c_{2n} = 0 lim n d 2 n + 1 = 2 lim n n c 2 n + 1 + lim n c 2 n + 1 = 0 + 0 = 0 \lim_{n\to \infty} d_{2n+1} = 2\lim_{n\to \infty} n c_{2n+1} + \lim_{n\to \infty} c_{2n+1} = 0 + 0 = 0

Thus, the desired result lim n d n = 0 \lim_{n\to \infty} d_n = 0 follows, since any term of the sequence d n d_n belongs to one of the above subsequences.

Can you expalin the second line

k = n 2 n 1 c k n c 2 n 1 \sum_{k=n}^{2n-1} c_k \geq n c_{2n-1}

Kushal Bose - 4 years, 10 months ago

The sequence c n c_n is nonincreasing.

Star Fall - 4 years, 10 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...