Proof:
Lemma: If an≥an+1≥0 and ∑an converges, then ∑√a2n converges. Proof: By theorem 3.25, ∑2na2n converges, so by the root test lim sup n√2na2n=2lim sup n√a2n≤1 so lim sup n√a2n≤1/2 implying ∑√a2n converges by the root test by lim sup n√√a2n≤√1/2<1 (since one may show without advancing in theory that lim sup √xn≤√lim sup xn for any positive sequence xn).
Now, every nonempty subset of a convergent series' terms {an} has an absolute greatest element, since by the epsilon-delta method there are only finitely many elements absolutely greater than any chosen term. Since ∑an=∑|an|, use this to inductively construct a rearrangement ∑bn such that bn≥bn+1 without losing convergence.
If we prove ∑√bnn converges, then though ∑√ann is not generally a rearrangement, we may observe the effect of transpositions on partial sums to show the former bounds the latter, demonstrating the latter's convergence. So by 3.25, the former is equivalent to ∑√b2n converging, which is established by the lemma. ◻
No comments:
Post a Comment