TheoremBase

Nonnegative series are handled by monotone convergence of the partial sums, comparison by bounding the partial sums and, for tails, by index shift and order of series, absolute convergence by writing each term as the difference of the nonnegative terms of two convergent series, and the geometric series and its tails by the finite geometric sum and the convergence of powers to zero.

Proof

Each result cited is universally quantified over the data in its own statement. Write S={sn:n∈N}S=\{s_{n}:n\in\mathbb{N}\}, tn=∑k=1nbkt_{n}=\sum_{k=1}^{n}b_{k} and un=∑k=1n∣ak∣u_{n}=\sum_{k=1}^{n}|a_{k}| for n∈Nn\in\mathbb{N}; then (tn)(t_{n}) and (un)(u_{n}) are the sequences of partial sums of (bk)(b_{k}) and of (∣ak∣)(|a_{k}|). By Series of Real Numbers: Partial Sums, Convergence, the Sum and Absolute Convergence §converges, Convergent Sequences of Real Numbers §converges and The Limit of a Convergent Sequence §limit, a series converges if and only if its sequence of partial sums converges to some real number, and its sum is then that number.

Clause bounded. Let ak≥0a_{k}\ge0 for every k∈Nk\in\mathbb{N}. For n∈Nn\in\mathbb{N}, sn+1=sn+an+1s_{n+1}=s_{n}+a_{n+1} by Iterated Operations over Finite Sets: Singletons, Disjoint Unions, Reindexing, Products of Sets, Termwise Combination, Homomorphisms and Intervals §interval-recursion (with m=1m=1), and an+1≥0a_{n+1}\ge0, so sn≤sn+1s_{n}\le s_{n+1}; thus (sn)(s_{n}) is nondecreasing by Monotone Sequences §monotone. Also 0≤sn0\le s_{n} for every nn by Finite Sums in a Commutative Ring and in an Ordered Field: Distributivity, Differences, Telescoping, Constant Terms, Comparison and the Triangle Inequality §nonnegative. If (sn)(s_{n}) is bounded above, then sn→sup⁡Ss_{n}\to\sup S by Completeness of the Real Numbers for Sequences: Monotone Convergence, the Bolzano-Weierstrass Theorem and Cauchy Sequences §monotone, so by the opening paragraph the series ∑k=1∞ak\sum_{k=1}^{\infty}a_{k} converges with sum sup⁡S\sup S. Conversely, if it converges, then (sn)(s_{n}) is convergent by Series of Real Numbers: Partial Sums, Convergence, the Sum and Absolute Convergence §converges, hence bounded by Limits of Sequences of Real Numbers: Uniqueness, Boundedness, Constants, Tails, Arithmetic, Quotients, Absolute Values, Finite Sums, Order, Squeezing, Domination and Subsequences §bounded, hence bounded above by Limits of Sequences of Real Numbers: Uniqueness, Boundedness, Constants, Tails, Arithmetic, Quotients, Absolute Values, Finite Sums, Order, Squeezing, Domination and Subsequences §two-sided, and its sum is sup⁡S\sup S as just shown. In that case sup⁡S\sup S is an upper bound of SS by Bounds, Least and Greatest Elements, Suprema and Infima for a Partial Order §supremum and Bounds, Least and Greatest Elements, Suprema and Infima for a Partial Order §bounds, so 0≤sn≤sup⁡S=∑k=1∞ak0\le s_{n}\le\sup S=\sum_{k=1}^{\infty}a_{k} for every n∈Nn\in\mathbb{N}.

Clause comparison. Let 0≤ak≤bk0\le a_{k}\le b_{k} for every k∈Nk\in\mathbb{N}, and let ∑k=1∞bk\sum_{k=1}^{\infty}b_{k} converge, with sum BB. As bk≥0b_{k}\ge0 for every kk, clause bounded, applied to (bk)(b_{k}), gives tn≤Bt_{n}\le B for every n∈Nn\in\mathbb{N}. By Finite Sums in a Commutative Ring and in an Ordered Field: Distributivity, Differences, Telescoping, Constant Terms, Comparison and the Triangle Inequality §comparison, sn≤tn≤Bs_{n}\le t_{n}\le B for every nn. Hence BB is an upper bound of SS by Bounds, Least and Greatest Elements, Suprema and Infima for a Partial Order §bounds, so SS is bounded above by Bounds, Least and Greatest Elements, Suprema and Infima for a Partial Order §bounded, that is, (sn)(s_{n}) is bounded above by Bounded Sequences of Real Numbers §bounded. By clause bounded, applied to (ak)(a_{k}), the series ∑k=1∞ak\sum_{k=1}^{\infty}a_{k} converges; with AA its sum, sn→As_{n}\to A, and since sn≤Bs_{n}\le B for every n≥1n\ge1, A≤BA\le B by Limits of Sequences of Real Numbers: Uniqueness, Boundedness, Constants, Tails, Arithmetic, Quotients, Absolute Values, Finite Sums, Order, Squeezing, Domination and Subsequences §order.

Now let n∈Nn\in\mathbb{N}. As ∑k=1∞ak\sum_{k=1}^{\infty}a_{k} and ∑k=1∞bk\sum_{k=1}^{\infty}b_{k} converge, Elementary Properties of Series of Real Numbers: Linearity, Null Terms, the Cauchy Criterion, Index Shifts, Tails, Order and Telescoping §shift, applied with p=np=n to (ak)(a_{k}) and to (bk)(b_{k}), shows that ∑k=1∞an+k\sum_{k=1}^{\infty}a_{n+k} and ∑k=1∞bn+k\sum_{k=1}^{\infty}b_{n+k} converge. Since an+k≤bn+ka_{n+k}\le b_{n+k} for every k∈Nk\in\mathbb{N}, Elementary Properties of Series of Real Numbers: Linearity, Null Terms, the Cauchy Criterion, Index Shifts, Tails, Order and Telescoping §order, applied to the sequences (an+k)k∈N(a_{n+k})_{k\in\mathbb{N}} and (bn+k)k∈N(b_{n+k})_{k\in\mathbb{N}}, gives ∑k=1∞an+k≤∑k=1∞bn+k\sum_{k=1}^{\infty}a_{n+k}\le\sum_{k=1}^{\infty}b_{n+k}. Since an+k≥0a_{n+k}\ge0 for every k∈Nk\in\mathbb{N}, clause bounded, applied to (an+k)k∈N(a_{n+k})_{k\in\mathbb{N}}, gives 0≤∑j=11an+j≤∑k=1∞an+k0\le\sum_{j=1}^{1}a_{n+j}\le\sum_{k=1}^{\infty}a_{n+k}, so 0≤∑k=1∞an+k0\le\sum_{k=1}^{\infty}a_{n+k}.

Clause absolute. Let ∑k=1∞ak\sum_{k=1}^{\infty}a_{k} converge absolutely. By Series of Real Numbers: Partial Sums, Convergence, the Sum and Absolute Convergence §absolute the series ∑k=1∞∣ak∣\sum_{k=1}^{\infty}|a_{k}| converges; let UU be its sum, so un→Uu_{n}\to U. For k∈Nk\in\mathbb{N} put pk=ak+∣ak∣p_{k}=a_{k}+|a_{k}|; since −∣ak∣≤ak≤∣ak∣-|a_{k}|\le a_{k}\le|a_{k}|, we have 0≤pk≤2∣ak∣0\le p_{k}\le2|a_{k}|. The partial sums of (2∣ak∣)(2|a_{k}|) are ∑k=1n2∣ak∣=2un\sum_{k=1}^{n}2|a_{k}|=2u_{n} by Finite Sums in a Commutative Ring and in an Ordered Field: Distributivity, Differences, Telescoping, Constant Terms, Comparison and the Triangle Inequality §distributive, and 2un→2U2u_{n}\to2U by Limits of Sequences of Real Numbers: Uniqueness, Boundedness, Constants, Tails, Arithmetic, Quotients, Absolute Values, Finite Sums, Order, Squeezing, Domination and Subsequences §arithmetic, so ∑k=1∞2∣ak∣\sum_{k=1}^{\infty}2|a_{k}| converges. By clause comparison above, applied to (pk)(p_{k}) and (2∣ak∣)(2|a_{k}|), the series ∑k=1∞pk\sum_{k=1}^{\infty}p_{k} converges; let PP be its sum, so Pn=∑k=1npk→PP_{n}=\sum_{k=1}^{n}p_{k}\to P. As ak=pk−∣ak∣a_{k}=p_{k}-|a_{k}| for every kk, sn=Pn−uns_{n}=P_{n}-u_{n} by Finite Sums in a Commutative Ring and in an Ordered Field: Distributivity, Differences, Telescoping, Constant Terms, Comparison and the Triangle Inequality §difference, so sn→P−Us_{n}\to P-U by Limits of Sequences of Real Numbers: Uniqueness, Boundedness, Constants, Tails, Arithmetic, Quotients, Absolute Values, Finite Sums, Order, Squeezing, Domination and Subsequences §arithmetic. Hence ∑k=1∞ak\sum_{k=1}^{\infty}a_{k} converges; let AA be its sum, so sn→As_{n}\to A. Then ∣sn∣→∣A∣|s_{n}|\to|A| by Limits of Sequences of Real Numbers: Uniqueness, Boundedness, Constants, Tails, Arithmetic, Quotients, Absolute Values, Finite Sums, Order, Squeezing, Domination and Subsequences §absolute, and ∣sn∣≤un|s_{n}|\le u_{n} for every n≥1n\ge1 by Finite Sums in a Commutative Ring and in an Ordered Field: Distributivity, Differences, Telescoping, Constant Terms, Comparison and the Triangle Inequality §triangle, so ∣A∣≤U|A|\le U by Limits of Sequences of Real Numbers: Uniqueness, Boundedness, Constants, Tails, Arithmetic, Quotients, Absolute Values, Finite Sums, Order, Squeezing, Domination and Subsequences §order.

Clause dominated. Let ∣ak∣≤bk|a_{k}|\le b_{k} for every k∈Nk\in\mathbb{N}, and let ∑k=1∞bk\sum_{k=1}^{\infty}b_{k} converge. Then 0≤∣ak∣≤bk0\le|a_{k}|\le b_{k} for every kk, so by clause comparison above, applied to (∣ak∣)(|a_{k}|) and (bk)(b_{k}), the series ∑k=1∞∣ak∣\sum_{k=1}^{\infty}|a_{k}| converges and ∑k=1∞∣ak∣≤∑k=1∞bk\sum_{k=1}^{\infty}|a_{k}|\le\sum_{k=1}^{\infty}b_{k}. Thus ∑k=1∞ak\sum_{k=1}^{\infty}a_{k} converges absolutely, and by clause absolute above it converges with ∣∑k=1∞ak∣≤∑k=1∞∣ak∣\big|\sum_{k=1}^{\infty}a_{k}\big|\le\sum_{k=1}^{\infty}|a_{k}|.

Clause geometric. First let x∈Rx\in\mathbb{R} with ∣x∣<1|x|<1. Then x≤∣x∣<1x\le|x|<1, so x≠1x\neq1 and 1−x≠01-x\neq0. For n∈Nn\in\mathbb{N}, ∑k=1nxk−1=1−xn1−x\sum_{k=1}^{n}x^{k-1}=\frac{1-x^{n}}{1-x} by Powers in a Commutative Ring, a Field and an Ordered Field: Exponent Laws, Factorisation, Geometric Sums, Monotonicity and Bernoulli's Inequality §geometric. For k∈Nk\in\mathbb{N}, 1+(k−1)=k1+(k-1)=k by The Difference of Two Natural Numbers with Zero §difference, so xk=x1xk−1=x xk−1x^{k}=x^{1}x^{k-1}=x\,x^{k-1} by Powers in a Commutative Ring, a Field and an Ordered Field: Exponent Laws, Factorisation, Geometric Sums, Monotonicity and Bernoulli's Inequality §exponents and Powers in a Commutative Ring, a Field and an Ordered Field: Exponent Laws, Factorisation, Geometric Sums, Monotonicity and Bernoulli's Inequality §product; hence ∑k=1nxk=x 1−xn1−x\sum_{k=1}^{n}x^{k}=x\,\frac{1-x^{n}}{1-x} by Finite Sums in a Commutative Ring and in an Ordered Field: Distributivity, Differences, Telescoping, Constant Terms, Comparison and the Triangle Inequality §distributive. Now xn→0x^{n}\to0 by Completeness of the Real Numbers for Sequences: Monotone Convergence, the Bolzano-Weierstrass Theorem and Cauchy Sequences §geometric, and the constant sequence (1)n∈N(1)_{n\in\mathbb{N}} converges to 11 by Limits of Sequences of Real Numbers: Uniqueness, Boundedness, Constants, Tails, Arithmetic, Quotients, Absolute Values, Finite Sums, Order, Squeezing, Domination and Subsequences §constant, so by Limits of Sequences of Real Numbers: Uniqueness, Boundedness, Constants, Tails, Arithmetic, Quotients, Absolute Values, Finite Sums, Order, Squeezing, Domination and Subsequences §arithmetic first 1−xn→11-x^{n}\to1, then 11−x(1−xn)→11−x\frac{1}{1-x}(1-x^{n})\to\frac{1}{1-x} and x1−x(1−xn)→x1−x\frac{x}{1-x}(1-x^{n})\to\frac{x}{1-x}. Hence ∑k=1∞xk−1\sum_{k=1}^{\infty}x^{k-1} and ∑k=1∞xk\sum_{k=1}^{\infty}x^{k} converge, with sums 11−x\frac{1}{1-x} and x1−x\frac{x}{1-x}. Now let ∣r∣<1|r|<1. Taking x=rx=r gives 1−r≠01-r\neq0 and the convergence of both series with the stated sums. As ∣∣r∣∣=∣r∣<1\big||r|\big|=|r|<1, taking x=∣r∣x=|r| shows that ∑k=1∞∣r∣k−1\sum_{k=1}^{\infty}|r|^{k-1} and ∑k=1∞∣r∣k\sum_{k=1}^{\infty}|r|^{k} converge; since ∣rk−1∣=∣r∣k−1|r^{k-1}|=|r|^{k-1} and ∣rk∣=∣r∣k|r^{k}|=|r|^{k} by Powers in a Commutative Ring, a Field and an Ordered Field: Exponent Laws, Factorisation, Geometric Sums, Monotonicity and Bernoulli's Inequality §sign, these are the series ∑k=1∞∣rk−1∣\sum_{k=1}^{\infty}|r^{k-1}| and ∑k=1∞∣rk∣\sum_{k=1}^{\infty}|r^{k}|, so both series converge absolutely.

Clause geometric-tail. Let ∣r∣<1|r|<1 and n∈Nn\in\mathbb{N}. By the paragraph on clause geometric, taken with x=rx=r, 1−r≠01-r\neq0, ∑k=1nrk=r 1−rn1−r\sum_{k=1}^{n}r^{k}=r\,\frac{1-r^{n}}{1-r} and ∑k=1∞rk=r1−r\sum_{k=1}^{\infty}r^{k}=\frac{r}{1-r}. As r rn=r1rn=r1+n=rn+1r\,r^{n}=r^{1}r^{n}=r^{1+n}=r^{n+1} by Powers in a Commutative Ring, a Field and an Ordered Field: Exponent Laws, Factorisation, Geometric Sums, Monotonicity and Bernoulli's Inequality §product and Powers in a Commutative Ring, a Field and an Ordered Field: Exponent Laws, Factorisation, Geometric Sums, Monotonicity and Bernoulli's Inequality §exponents, we get r(1−rn)=r−rn+1r(1-r^{n})=r-r^{n+1}, so ∑k=1nrk=r−rn+11−r\sum_{k=1}^{n}r^{k}=\frac{r-r^{n+1}}{1-r}. Subtracting, ∑k=1∞rk−∑k=1nrk=r1−r−r−rn+11−r=rn+11−r\sum_{k=1}^{\infty}r^{k}-\sum_{k=1}^{n}r^{k}=\frac{r}{1-r}-\frac{r-r^{n+1}}{1-r}=\frac{r^{n+1}}{1-r}.

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…