The Stolz–Cesàro theorem
In connectoin with the operation with sequences having limits (finite or infinite) we ran into the problem of "eliminating the indeterminates". We known that if an ⟶ ℓ and bn ⟶ ℓ' (with ℓ' ≠ 0) we have
an/ bn ⟶ ℓ/ℓ'
It may happen that an ⟶ 0 and bn ⟶ 0, but the sequence {an/bn} is still convergent. For example this is the case for an = bn = 1/n
The following Stolz–Cesàro theorem has been called the de L'Hôpital's Theorem for sequences because is its analogous for the discrete case. It is due to Otto Stolz (1859-1906) and Ernesto Cesàro (1859-1906).
Theorem 2.7.1. (Stolz–Cesàro theorem) Let {an} and {bn} be two sequences of real numbers convergent to 0, with {bn} strictly positive, increasing and unbounded, if
Then
Proof. Fix ε > 0. There exists n0 sucht that for n ≥ n0
Because bn+1 − bn ≥ 0, this is equivalent to
ℓ − ε (bn+1 − bn) < an+1 − an < ℓ + ε (bn+1 − bn)
Let k ≥ n0. Summing the inequality from n0, n0 + 1, ..., k we get
which gives
ℓ − ε (bk+1 − bn0) < ak+1 − an0 < ℓ + ε (bk+1 − bn0)
Dividing by bk + 1, we obtain
(ℓ − ε) (1 − bn0/bk+1) + an0 / bk+1 < ak+1/bk+1 < (ℓ + ε) (1 − bn0/bk+1) + an0 / bk+1
Since limk ⟶ ∞ bk = ∞, the above inequality immediately gives
ℓ − ε < ak+1/bk+1 < ℓ + ε
hence, limn ⟶ ∞ an/bn = ℓ.
If ℓ = +∞, then for all ε > 0 there exists an n0 such that for all n ≥ n0 we have
ℓ − ε < (an + 1 − an)/(bn + 1 − bn) < ℓ + ε
Thus it follows that
an + 1 − an > ε(bn + 1 − bn).
Let k ≥ n0 be a natural number. Adding the above inequality for n0, n0 + 1, ..., k we get
ak+1 − an0 > ε(bk + 1 − bn0).
Dividing by bk + 1, we obtain
ak+1/bk + 1 − an0/bk + 1 > ε(1 − bn0/bk + 1).
Now since bn0/bk + 1 and an0/bk + 1 tend to zero as k ⟶ ∞, we find ak+1/bk + 1 > ε, which implies that limn ⟶ ∞ an/bn = ∞. □
If {bn} is decreasing it suffices to change sign to the two sequences as {−bn} and {−an} .