Proving Convergence of Sequences Using the Mean Value Theorem

  • Context: Graduate 
  • Thread starter Thread starter quasar987
  • Start date Start date
  • Tags Tags
    Test
Click For Summary

Discussion Overview

The discussion revolves around proving the convergence of the sequence \{b_n\}, defined as the average of the first n terms of another sequence \{a_n\}, given that \{a_n\} converges to a limit. The focus is on the application of convergence concepts and the Mean Value Theorem in the context of analysis.

Discussion Character

  • Technical explanation
  • Mathematical reasoning
  • Exploratory

Main Points Raised

  • One participant presents the problem of proving that if \{a_n\} converges to a, then \{b_n\} also converges to a, expressing difficulty in applying various convergence tests.
  • Another participant suggests splitting the sequence into an initial part and the rest to analyze how closely "the rest" resembles the limit.
  • A detailed mathematical argument is provided, involving the use of epsilon-delta definitions and limits, to show that the limits of \{b_n\} can be bounded by the limits of \{a_n\}.
  • A participant expresses appreciation for the proof, indicating it is instructive and elegant.
  • Concerns are raised about the clarity of the proof, with one participant suggesting that some lines may need fixing for better understanding.
  • Another participant reassures that the proof is understandable as presented, implying that it is sufficient for the audience.

Areas of Agreement / Disagreement

Participants generally agree on the validity of the proof's approach, though there are differing opinions on the clarity of the presentation and whether revisions are necessary. No consensus is reached on the need for corrections.

Contextual Notes

Some mathematical steps and assumptions may not be fully detailed, and the discussion reflects varying levels of comfort with the notation and presentation style used in the proof.

quasar987
Science Advisor
Homework Helper
Gold Member
Messages
4,796
Reaction score
32
There was this question in my analysis exam today. I have a feeling it should be easy but no one I've asked knew how to do it.

We associate to the sequence [itex]\{a_n\}[/itex] the sequence defined by

[tex]b_n=\frac{a_1+a_2+...+a_n}{n}[/tex]

Show that if [itex]\{a_n\}[/itex] converges towards a, then [itex]\{b_n\}[/itex] converges towards a.

I realized that

[tex]b_n=\frac{\sum_{n=1}^{\infty} a_n}{n}[/tex]

or even

[tex]b_n=\frac{\sum_{k=1}^{n} a_k}{\sum_{k=1}^{n} 1}[/tex]

but all my attemps involving epsilon-delta, convergence tests, Cauchy convergence "caracterisation", etc. failed. Please tell me how to do this. Thanks a lot.
 
Physics news on Phys.org
It often helps to split convergent sequences into two parts, an initial part, and the rest, because you can decide how much "the rest" resembles the limit.
 
let [tex]\epsilon > 0[/tex]. then since a_n converges there exists N>0 such that [tex]a - \epsilon < a_n < a + \epsilon[/tex].

now [tex]b_n = \frac{a_1 + a_2 + ... + a_n}{n}[/tex] for n[tex]\geq[/tex]

so [tex]b_n = \frac{a_1 + a_2 + ... + a_N}{n} + \frac{a_1 + a_2 + ... + a_n}{n}[/tex]

& since [tex]\frac{(n-N)(a-\epsilon)}{n} < \frac{a_N+1 + ... + a_n}{n} < \frac{(n-N)(a+\epsilon)}{n}[/tex],

[tex]\frac{a_1 + a_2 + ... + a_N}{n} + \frac{(n-N)(a-\epsilon)}{n} < b_n < \frac{a_1 + a_2 + ... + a_N}{n} + \frac{(n-N)(a+\epsilon)}{n}[/tex]

now using that fact that [tex]\limsup a_n \leq \limsup b_n[/tex] if [tex]a_n \leq b_n[/tex] on the previous inequality we get

[tex]\limsup ( \frac{a_1 + a_2 + ... + a_N}{n} + \frac{(n-N)(a-\epsilon)}{n} ) \leq \limsup b_n \leq \limsup \frac{a_1 + a_2 + ... + a_N}{n} + \frac{(n-N)(a+\epsilon)}{n}[/tex].

since [tex]\lim ( \frac{a_1 + a_2 + ... + a_N}{n} + \frac{(n-N)(a-\epsilon)}{n} ) = 0 + (a - \epsilon[/tex] )
and [tex]\lim ( \frac{a_1 + a_2 + ... + a_N}{n} + \frac{(n-N)(a+\epsilon)}{n} ) = 0 + (a + \epsilon[/tex] )

we can conclude that
a - [tex]\epsilon \leq \limsup b_n \leq a+\epsilon[/tex], for any [tex]\epsilon > 0[/tex]

since epsilon is arbitrary, [tex]a \leq \limsup b_n \leq a[/tex], so [tex]a = \limsup b_n[/tex], similarily for liminf, and the result follows from the limsup & liminf being equal
 
Last edited:
holy cow!

I now feel my feeling was injustified. It's a beautiful proof and very instructive; a gazilion thanks fourier!
 
there are a couple lines that need fixing but i wonder if it would be worth the trouble or if people can still follow it. i need to get used to the tex-ing
 
It's good enough. And if I could understand it, the others must have too.
 

Similar threads

  • · Replies 5 ·
Replies
5
Views
4K
  • · Replies 9 ·
Replies
9
Views
2K
  • · Replies 17 ·
Replies
17
Views
6K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 3 ·
Replies
3
Views
5K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 6 ·
Replies
6
Views
5K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K