|
|
|
|
proof of Abel's lemma (by induction)
|
(Proof)
|
|
|
Proof. The proof is by induction. However, let us first recall that sum on the right side is a piece-wise defined function of the upper limit . In other words, if the upper limit is below the lower limit 0, the sum is identically set to zero. Otherwise, it is an ordinary sum. We therefore need to manually check the first two cases. For the trivial case , both sides equal to . Also, for (when the sum is a normal sum), it is easy to verify that both sides simplify to
. Then, for the induction step, suppose that the claim holds for some . For , we then have
Since
, the claim follows. .
|
"proof of Abel's lemma (by induction)" is owned by mathcam. [ full author list (2) | owner history (1) ]
|
|
(view preamble)
Cross-references: lower limit, upper limit, function, side, right, sum, induction
There is 1 reference to this entry.
This is version 6 of proof of Abel's lemma (by induction), born on 2003-05-14, modified 2004-04-21.
Object id is 4283, canonical name is ProofOfAbelsLemmaByInduction.
Accessed 3246 times total.
Classification:
| AMS MSC: | 40A05 (Sequences, series, summability :: Convergence and divergence of infinite limiting processes :: Convergence and divergence of series and sequences) |
|
|
|
|
|
|
Pending Errata and Addenda
|
|
|
|
|
|
|
|
|
|
|