Is this proof for a sequence convergence problem correct?

In summary, the given proof shows that if a sequence \{a_n\} converges to l, then the sequence \{\frac{a_1+\dots+a_n}{n}\} also converges to l. This is proven by showing that for any given \varepsilon>0, there exists a number N>0 such that if n>N, then \left| \frac{a_1+\dots+a_n}{n}-l\right|<\varepsilon.
  • #1
jgens
Gold Member
1,593
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
  • #2


Bump.
 
  • #3


Looks good to me.
 
  • #4


Thanks!
 

1. What is a sequence proof problem?

A sequence proof problem is a type of mathematical problem that involves proving a statement about a sequence of numbers using mathematical techniques and logical reasoning.

2. How do you solve a sequence proof problem?

To solve a sequence proof problem, you need to first understand the given statement and the sequence of numbers. Then, you can use mathematical techniques such as induction, direct proof, or contradiction to prove the statement is true for all numbers in the sequence.

3. What is the difference between a sequence proof and a regular proof?

The main difference between a sequence proof and a regular proof is that a sequence proof deals specifically with proving a statement about a sequence of numbers, while a regular proof can involve any type of mathematical statement or problem.

4. Can you give an example of a sequence proof problem?

Sure, an example of a sequence proof problem is proving that the sum of the first n natural numbers is equal to n(n+1)/2 for all positive integers n.

5. Are there any tips for solving sequence proof problems?

Yes, some tips for solving sequence proof problems include understanding the given statement and sequence, using mathematical techniques effectively, and checking your work for any errors or mistakes. It may also be helpful to practice with different types of sequence proof problems to improve your skills.

Similar threads

  • Calculus and Beyond Homework Help
Replies
2
Views
187
  • Calculus and Beyond Homework Help
Replies
8
Views
817
  • Calculus and Beyond Homework Help
Replies
2
Views
711
  • Calculus and Beyond Homework Help
Replies
1
Views
258
  • Calculus and Beyond Homework Help
Replies
1
Views
715
  • Calculus and Beyond Homework Help
Replies
5
Views
489
  • Calculus and Beyond Homework Help
Replies
11
Views
1K
  • Calculus and Beyond Homework Help
Replies
9
Views
1K
Replies
8
Views
993
  • Calculus and Beyond Homework Help
Replies
3
Views
843
Back
Top