Let (un) be a sequence, and a series (a new sequence) can be defined from it
such that:
sn=k=1∑nuk
Convergence
If (sn) is converging:
n→∞limsn=n→∞limk=1∑nuk=k=1∑∞uk=S∈R
Absolutely Converging
∑k=1nuk is absolutely converging iff
∑k=1n∣uk∣ is converging.
k=1∑n∣uk∣ is converging⟹k=1∑nuk is converging
Theorem
A series sn is absolutely converging to s iff rearranged series of
sn converges to s.
Conditionally Converging
∑k=1nuk is condtionally converging iff:
k=1∑n∣uk∣ is divergingandk=1∑nuk is converging
Theorem
Suppose sn is a conditionally converging series. Then:
- Sum of all the positive terms limits to ∞
- Sum of all the negative terms limits to −∞
- sn can be rearranged to have the sum:
- Any real number x
- ∞
- −∞
- Does not exist
Terms limit to 0
k=1∑nuk is converging⟹k→∞limuk=0
The converse is known as the
divergence test:
Grouping
Suppose ∑uk is a given series. If vn is formed by grouping a
finite number of adjacent terms uk, then ∑vk is a grouping of the
given series.
Rearrangement
Suppose ∑uk is a given series. If there is a bijection sequence kn
such that vn=ukn, then ∑vn is a rearrangement of the given
series.