Is this proof for a sequence convergence problem correct?

  • Thread starter Thread starter jgens
  • Start date Start date
  • Tags Tags
    Proof Sequences
Click For Summary

Homework Help Overview

The discussion revolves around a proof concerning the convergence of a sequence, specifically addressing the relationship between the limit of a sequence and the limit of its average as the number of terms approaches infinity.

Discussion Character

  • Exploratory, Conceptual clarification

Approaches and Questions Raised

  • The original poster presents a proof and seeks verification of its correctness. Some participants express agreement with the proof's validity, while others simply acknowledge the original poster's efforts.

Discussion Status

Contextual Notes

There is a lack of detailed feedback on specific aspects of the proof, and the original poster's request for verification implies uncertainty about the proof's correctness.

jgens
Gold Member
Messages
1,575
Reaction score
50

Homework Statement



[tex]\lim_{n\to\infty}a_n=l \rightarrow \lim_{n\to\infty}\frac{a_1+\dots+a_n}{n}=l[/tex]

Homework Equations



N/A

The Attempt at a Solution



Could someone verify that this proof works? I would really appreciate it.

Proof: Since the sequence [itex]\{a_n\}[/itex] converges to [itex]l[/itex], for any given [itex]\varepsilon>0[/itex] it's possible to find a number [itex]N>0[/itex] such that if [itex]n>N[/itex], then [itex]|a_n-l|<\varepsilon/2[/itex]. Now, because there are only finitely many numbers [itex]|a_1-l|,\dots,|a_N-l|[/itex], we can choose the greatest such number. Denote this number by [itex]M[/itex].

Suppose that [itex]n>\max{(N,\frac{2MN}{\varepsilon})}[/itex], in which case, it clearly follows that [itex]\frac{\varepsilon}{2}>\frac{MN}{n}[/itex]. Therefore,

[tex]\left| \frac{a_1+\dots+a_N}{n}-\frac{Nl}{n}\right|\leq\frac{|a_1-l|}{n}+\dots+\frac{|a_N-l|}{n}\leq\frac{MN}{n}<\frac{\varepsilon}{2}[/tex]

Moreover, since [itex]n>N[/itex], we also have that

[tex]\left| \frac{a_{N+1}+\dots+a_n}{n}-\frac{(n-N)l}{n}\right|\leq\frac{|a_{N+1}-l|}{n}+\dots+\frac{|a_n-l|}{n}<\frac{(n-N)\varepsilon}{2n}<\frac{\varepsilon}{2}[/tex]

Combining these two results, we see that

[tex]\left| \frac{a_1+\dots+a_n}{n}-l\right|\leq\left| \frac{a_1+\dots+a_N}{n}-\frac{Nl}{n}\right|+\left| \frac{a_{N+1}+\dots+a_n}{n}-\frac{(n-N)l}{n}\right|<\frac{\varepsilon}{2}+\frac{\varepsilon}{2}=\varepsilon[/tex]

Completing the proof.
 
Physics news on Phys.org


Bump.
 


Looks good to me.
 


Thanks!
 

Similar threads

  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 8 ·
Replies
8
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K
Replies
11
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 5 ·
Replies
5
Views
1K