## You are here

HomeProof of Stolz-Cesaro theorem

## Primary tabs

# Proof of Stolz-Cesaro theorem

From the definition of convergence , for every $\epsilon>0$ there is $N(\epsilon)\in\mathbb{N}$ such that $(\forall)n\geq N(\epsilon)$ , we have :

$l-\epsilon<\frac{a_{{n+1}}-a_{n}}{b_{{n+1}}-b_{n}}<l+\epsilon$ |

Because $b_{n}$ is strictly increasing we can multiply the last equation with $b_{{n+1}}-b_{n}$ to get :

$(l-\epsilon)(b_{{n+1}}-b_{n})<a_{{n+1}}-a_{n}<(l+\epsilon)(b_{{n+1}}-b_{n})$ |

Let $k>N(\epsilon)$ be a natural number . Summing the last relation we get :

$(l-\epsilon)\sum_{{i=N(\epsilon)}}^{{k}}(b_{{i+1}}-b_{i})<\sum_{{i=N(\epsilon)% }}^{{k}}(a_{{n+1}}-a_{n})<(l+\epsilon)\sum_{{i=N(\epsilon)}}^{{k}}(b_{{i+1}}-b% _{i})\Rightarrow$ |

$(l-\epsilon)(b_{{k+1}}-b_{{N(\epsilon)}})<a_{{k+1}}-a_{{N(\epsilon)}}<(l+% \epsilon)(b_{{k+1}}-b_{{N(\epsilon)}})$ |

Divide the last relation by $b_{{k+1}}>0$ to get :

$(l-\epsilon)(1-\frac{b_{{N(\epsilon)}}}{b_{{k+1}}})<\frac{a_{{k+1}}}{b_{{k+1}}% }-\frac{a_{{N(\epsilon)}}}{b_{{k+1}}}<(l+\epsilon)(1-\frac{b_{{N(\epsilon)}}}{% b_{{k+1}}})\Leftrightarrow$ |

$(l-\epsilon)(1-\frac{b_{{N(\epsilon)}}}{b_{{k+1}}})+\frac{a_{{N(\epsilon)}}}{b% _{{k+1}}}<\frac{a_{{k+1}}}{b_{{k+1}}}<(l+\epsilon)(1-\frac{b_{{N(\epsilon)}}}{% b_{{k+1}}})+\frac{a_{{N(\epsilon)}}}{b_{{k+1}}}$ |

This means that there is some $K$ such that for $k\geq K$ we have :

$(l-\epsilon)<\frac{a_{{k+1}}}{b_{{k+1}}}<(l+\epsilon)$ |

This obviously means that :

$\lim_{{n\rightarrow\infty}}\frac{a_{n}}{b_{n}}=l$ |

and we are done .

Keywords:

sequence,limit,convergence

Major Section:

Reference

Type of Math Object:

Proof

Parent:

## Mathematics Subject Classification

40A05*no label found*

- Forums
- Planetary Bugs
- HS/Secondary
- University/Tertiary
- Graduate/Advanced
- Industry/Practice
- Research Topics
- LaTeX help
- Math Comptetitions
- Math History
- Math Humor
- PlanetMath Comments
- PlanetMath System Updates and News
- PlanetMath help
- PlanetMath.ORG
- Strategic Communications Development
- The Math Pub
- Testing messages (ignore)

- Other useful stuff

## Recent Activity

Apr 20

new image: information-theoretic-distributed-measurement-dds.png by rspuzio

new image: information-theoretic-distributed-measurement-4.2 by rspuzio

new image: information-theoretic-distributed-measurement-4.1 by rspuzio

new image: information-theoretic-distributed-measurement-3.2 by rspuzio

new image: information-theoretic-distributed-measurement-3.1 by rspuzio

new image: information-theoretic-distributed-measurement-2.1 by rspuzio

Apr 19

new collection: On the Information-Theoretic Structure of Distributed Measurements by rspuzio

Apr 15

new question: Prove a formula is part of the Gentzen System by LadyAnne

Mar 30

new question: A problem about Euler's totient function by mbhatia

new problem: Problem: Show that phi(a^n-1), (where phi is the Euler totient function), is divisible by n for any natural number n and any natural number a >1. by mbhatia

new image: information-theoretic-distributed-measurement-dds.png by rspuzio

new image: information-theoretic-distributed-measurement-4.2 by rspuzio

new image: information-theoretic-distributed-measurement-4.1 by rspuzio

new image: information-theoretic-distributed-measurement-3.2 by rspuzio

new image: information-theoretic-distributed-measurement-3.1 by rspuzio

new image: information-theoretic-distributed-measurement-2.1 by rspuzio

Apr 19

new collection: On the Information-Theoretic Structure of Distributed Measurements by rspuzio

Apr 15

new question: Prove a formula is part of the Gentzen System by LadyAnne

Mar 30

new question: A problem about Euler's totient function by mbhatia

new problem: Problem: Show that phi(a^n-1), (where phi is the Euler totient function), is divisible by n for any natural number n and any natural number a >1. by mbhatia