TheoremBase

The harmonic partial sums gain at least one half on doubling the index, so by induction and the Archimedean property they are unbounded; the reciprocal-squares bound is an induction using 1/(N+1)^2 at most 1/N - 1/(N+1); the centred sum is split into its middle term and two reflected halves bounded by the reciprocal squares; and the exponential terms beyond an Archimedean threshold are dominated by a geometric series, the even and odd parts having partial sums below those of the full series.

Proof

Each result cited is universally quantified over the data in its own statement.

Preliminaries. A sum ∑k=1nak\sum_{k=1}^{n}a_{k} with n∈Nn\in\mathbb{N} is the sum over the set [n][n] and agrees with the iterated sum of Iterated Operations: Finite Sums and Finite Products §iterated, by Sums and Products over a Finite Set and over an Interval §intervals; so Iterated Operations: Recursion, Splitting, Reordering, Termwise Combination and Homomorphisms applies to it. Sums, products, differences and inequalities of natural numbers are the same in N0\mathbb{N}_{0} and in R\mathbb{R}, by The Real Numbers, with the Natural Numbers, Integers and Rationals Identified with Subsets of the Reals, and Completeness §agreement. For n∈Nn\in\mathbb{N} one has 1≤n1\le n, so nn is a positive real number; and for k∈N0k\in\mathbb{N}_{0}, 1≤k!1\le k! by The Factorial: Recursion, Positivity and Bounds by Powers §positive, so k!k! is positive. For y∈Ry\in\mathbb{R}, y2=y⋅yy^{2}=y\cdot y 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, as 2=1+12=1+1; hence y2≥0y^{2}\ge0, (−y)2=y2(-y)^{2}=y^{2}, n2>0n^{2}>0 for n∈Nn\in\mathbb{N}, and 1+αy2≥1>01+\alpha y^{2}\ge1>0. So every denominator in the statement is positive.

Clause harmonic. For n∈Nn\in\mathbb{N} let Hn=∑m=1n1mH_{n}=\sum_{m=1}^{n}\frac{1}{m}; these are the partial sums of ∑m=1∞1m\sum_{m=1}^{\infty}\frac{1}{m}. Let n∈Nn\in\mathbb{N}. By Iterated Operations: Recursion, Splitting, Reordering, Termwise Combination and Homomorphisms §splitting, Hn+n=Hn+∑j=1n1n+jH_{n+n}=H_{n}+\sum_{j=1}^{n}\frac{1}{n+j}. For j∈[n]j\in[n] one has j≤nj\le n, hence n+j≤n+nn+j\le n+n, so 0<n+j≤n+n0<n+j\le n+n in R\mathbb{R} and 1n+n≤1n+j\frac{1}{n+n}\le\frac{1}{n+j}. By Finite Sums in a Commutative Ring and in an Ordered Field: Distributivity, Differences, Telescoping, Constant Terms, Comparison and the Triangle Inequality §comparison and Finite Sums in a Commutative Ring and in an Ordered Field: Distributivity, Differences, Telescoping, Constant Terms, Comparison and the Triangle Inequality §constant, ∑j=1n1n+j≥n⋅1n+n=12\sum_{j=1}^{n}\frac{1}{n+j}\ge n\cdot\frac{1}{n+n}=\frac{1}{2}, so

Hn+n≥Hn+12(n∈N).(1)H_{n+n}\ge H_{n}+\frac{1}{2}\qquad(n\in\mathbb{N}).\tag{1}

Let AA be the class of those j∈Nj\in\mathbb{N} for which there is n∈Nn\in\mathbb{N} with Hn≥j2H_{n}\ge\frac{j}{2}. Then 1∈A1\in A, witnessed by n=1n=1, since H1=11=1≥12H_{1}=\frac{1}{1}=1\ge\frac{1}{2} by Iterated Operations: Recursion, Splitting, Reordering, Termwise Combination and Homomorphisms §recursion. If j∈Aj\in A, witnessed by nn, then (1) gives Hn+n≥j2+12=j+12H_{n+n}\ge\frac{j}{2}+\frac{1}{2}=\frac{j+1}{2}, so j+1∈Aj+1\in A. By The Natural Numbers and the Natural Numbers with Zero: Arithmetic, Order, Induction and Recursion §induction, A=NA=\mathbb{N}. Suppose now that b∈Rb\in\mathbb{R} were an upper bound of {Hn:n∈N}\{H_{n}:n\in\mathbb{N}\}. Choose first, by The Real Numbers, with the Natural Numbers, Integers and Rationals Identified with Subsets of the Reals, and Completeness §archimedean applied to 2b2b, some j∈Nj\in\mathbb{N} with 2b<j2b<j; then, as j∈Aj\in A, choose n∈Nn\in\mathbb{N} with Hn≥j2H_{n}\ge\frac{j}{2}. Then b<j2≤Hn≤bb<\frac{j}{2}\le H_{n}\le b, which is impossible. So the set has no upper bound, that is, it is not bounded above in the sense of Bounds, Least and Greatest Elements, Suprema and Infima for a Partial Order §bounded, and by Bounded Sequences of Real Numbers §bounded the sequence (Hn)(H_{n}) is not bounded above. The terms 1m\frac{1}{m} are positive, so by Series of Real Numbers with Nonnegative Terms, Comparison, Absolute Convergence and the Geometric Series §bounded the series ∑m=1∞1m\sum_{m=1}^{\infty}\frac{1}{m} does not converge, that is, it diverges.

Clause reciprocal-squares. Let PP be the class of those N∈NN\in\mathbb{N} with ∑m=1N1m2≤2−1N\sum_{m=1}^{N}\frac{1}{m^{2}}\le2-\frac{1}{N}. By Iterated Operations: Recursion, Splitting, Reordering, Termwise Combination and Homomorphisms §recursion and 12=11^{2}=1 (Powers in a Commutative Ring, a Field and an Ordered Field: Exponent Laws, Factorisation, Geometric Sums, Monotonicity and Bernoulli's Inequality §product), ∑m=111m2=1=2−11\sum_{m=1}^{1}\frac{1}{m^{2}}=1=2-\frac{1}{1}, so 1∈P1\in P. Let N∈PN\in P. By Iterated Operations: Recursion, Splitting, Reordering, Termwise Combination and Homomorphisms §recursion,

∑m=1N+11m2=∑m=1N1m2+1(N+1)2.\sum_{m=1}^{N+1}\frac{1}{m^{2}}=\sum_{m=1}^{N}\frac{1}{m^{2}}+\frac{1}{(N+1)^{2}}.

From 0<N≤N+10<N\le N+1 and 0<N+10<N+1 we get 0<N(N+1)≤(N+1)(N+1)=(N+1)20<N(N+1)\le(N+1)(N+1)=(N+1)^{2}, hence 1(N+1)2≤1N(N+1)=1N−1N+1\frac{1}{(N+1)^{2}}\le\frac{1}{N(N+1)}=\frac{1}{N}-\frac{1}{N+1}. Adding this to the inequality for NN gives ∑m=1N+11m2≤2−1N+1N−1N+1=2−1N+1\sum_{m=1}^{N+1}\frac{1}{m^{2}}\le2-\frac{1}{N}+\frac{1}{N}-\frac{1}{N+1}=2-\frac{1}{N+1}, so N+1∈PN+1\in P. By The Natural Numbers and the Natural Numbers with Zero: Arithmetic, Order, Induction and Recursion §induction, P=NP=\mathbb{N}; in particular M∈PM\in P. The terms 1m2\frac{1}{m^{2}} are positive, and the partial sums sN=∑m=1N1m2s_{N}=\sum_{m=1}^{N}\frac{1}{m^{2}} satisfy sN≤2−1N≤2s_{N}\le2-\frac{1}{N}\le2 for every N∈NN\in\mathbb{N}, so (sN)(s_{N}) is bounded above by Bounded Sequences of Real Numbers §bounded and Bounds, Least and Greatest Elements, Suprema and Infima for a Partial Order §bounded. By Series of Real Numbers with Nonnegative Terms, Comparison, Absolute Convergence and the Geometric Series §bounded the series ∑m=1∞1m2\sum_{m=1}^{\infty}\frac{1}{m^{2}} converges with sum sup⁡{sN:N∈N}\sup\{s_{N}:N\in\mathbb{N}\}, which is at most 22 because 22 is an upper bound of that set and the supremum is its least upper bound (Bounds, Least and Greatest Elements, Suprema and Infima for a Partial Order §supremum).

Clause centred. For m∈[2M+1]m\in[2M+1] put cm=11+α(m−M−1)2c_{m}=\frac{1}{1+\alpha(m-M-1)^{2}}, and for r∈[M]r\in[M] put er=11+αr2e_{r}=\frac{1}{1+\alpha r^{2}}. Since 2M+1=M+(1+M)2M+1=M+(1+M), two applications of Iterated Operations: Recursion, Splitting, Reordering, Termwise Combination and Homomorphisms §splitting and one of Iterated Operations: Recursion, Splitting, Reordering, Termwise Combination and Homomorphisms §recursion give

∑m=12M+1cm=∑m=1Mcm+∑j=11+McM+j=∑m=1Mcm+cM+1+∑r=1McM+1+r.\sum_{m=1}^{2M+1}c_{m}=\sum_{m=1}^{M}c_{m}+\sum_{j=1}^{1+M}c_{M+j}=\sum_{m=1}^{M}c_{m}+c_{M+1}+\sum_{r=1}^{M}c_{M+1+r}.

In R\mathbb{R}, (M+1)−M−1=0(M+1)-M-1=0, so cM+1=1c_{M+1}=1; and (M+1+r)−M−1=r(M+1+r)-M-1=r, so cM+1+r=erc_{M+1+r}=e_{r} for r∈[M]r\in[M]. By Iterated Operations over an Interval: Extracting One Term and Reversing the Order §reversal, applied to the restriction of cc to [M][M], ∑m=1Mcm=∑r=1McM+1−r\sum_{m=1}^{M}c_{m}=\sum_{r=1}^{M}c_{M+1-r}; and in R\mathbb{R}, (M+1−r)−M−1=−r(M+1-r)-M-1=-r, so cM+1−r=erc_{M+1-r}=e_{r} by (−r)2=r2(-r)^{2}=r^{2}. Hence

∑m=12M+1cm=1+2∑r=1Mer.\sum_{m=1}^{2M+1}c_{m}=1+2\sum_{r=1}^{M}e_{r}.

For r∈[M]r\in[M], 0<αr2<1+αr20<\alpha r^{2}<1+\alpha r^{2}, so er<1αr2=1α⋅1r2e_{r}<\frac{1}{\alpha r^{2}}=\frac{1}{\alpha}\cdot\frac{1}{r^{2}}. By Finite Sums in a Commutative Ring and in an Ordered Field: Distributivity, Differences, Telescoping, Constant Terms, Comparison and the Triangle Inequality §comparison, Finite Sums in a Commutative Ring and in an Ordered Field: Distributivity, Differences, Telescoping, Constant Terms, Comparison and the Triangle Inequality §distributive, clause reciprocal-squares and 0<1α0<\frac{1}{\alpha},

∑r=1Mer≤1α∑r=1M1r2≤1α(2−1M)≤2α.\sum_{r=1}^{M}e_{r}\le\frac{1}{\alpha}\sum_{r=1}^{M}\frac{1}{r^{2}}\le\frac{1}{\alpha}\Big(2-\frac{1}{M}\Big)\le\frac{2}{\alpha}.

Therefore ∑m=12M+1cm≤1+4α\sum_{m=1}^{2M+1}c_{m}\le1+\frac{4}{\alpha}.

Clause exponential. Put A=∣x∣≥0A=|x|\ge0 and uk=Akk!u_{k}=\frac{A^{k}}{k!} for k∈N0k\in\mathbb{N}_{0}. By Powers in a Commutative Ring, a Field and an Ordered Field: Exponent Laws, Factorisation, Geometric Sums, Monotonicity and Bernoulli's Inequality §sign, uk≥0u_{k}\ge0 and ∣xkk!∣=∣xk∣k!=uk\big|\frac{x^{k}}{k!}\big|=\frac{|x^{k}|}{k!}=u_{k}, as k!>0k!>0. By The Factorial: Recursion, Positivity and Bounds by Powers §recursion, 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, (k+1)!=(k+1) k!(k+1)!=(k+1)\,k! and Ak+1=AkAA^{k+1}=A^{k}A, so uk+1=uk⋅Ak+1u_{k+1}=u_{k}\cdot\frac{A}{k+1} for k∈N0k\in\mathbb{N}_{0}.

Choose, depending on xx only, N∈NN\in\mathbb{N} with 2A<N2A<N, by The Real Numbers, with the Natural Numbers, Integers and Rationals Identified with Subsets of the Reals, and Completeness §archimedean. Let QQ be the class of those p∈N0p\in\mathbb{N}_{0} with uN+p≤uN(12)pu_{N+p}\le u_{N}\big(\frac{1}{2}\big)^{p}. Then 0∈Q0\in Q, as N+0=NN+0=N and (12)0=1\big(\frac{1}{2}\big)^{0}=1 (Commutative Rings, Fields and Ordered Fields: Standard Notation §rings). Let p∈Qp\in Q and q=N+p+1q=N+p+1. Then N≤N+(p+1)=qN\le N+(p+1)=q, so 2A<N≤q2A<N\le q in R\mathbb{R} and Aq<12\frac{A}{q}<\frac{1}{2}; as uN+p≥0u_{N+p}\ge0, uN+p+1=uN+p⋅Aq≤12uN+p≤uN(12)p+1u_{N+p+1}=u_{N+p}\cdot\frac{A}{q}\le\frac{1}{2}u_{N+p}\le u_{N}\big(\frac{1}{2}\big)^{p+1}, using 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. So p+1∈Qp+1\in Q, and Q=N0Q=\mathbb{N}_{0} by The Natural Numbers and the Natural Numbers with Zero: Arithmetic, Order, Induction and Recursion §induction.

By Series of Real Numbers with Nonnegative Terms, Comparison, Absolute Convergence and the Geometric Series §geometric, applied with r=12r=\frac{1}{2} (as ∣12∣=12<1|\frac{1}{2}|=\frac{1}{2}<1), the series ∑k=1∞(12)k\sum_{k=1}^{\infty}\big(\frac{1}{2}\big)^{k} converges with sum 1/21−1/2=1\frac{1/2}{1-1/2}=1; its terms are positive by Powers in a Commutative Ring, a Field and an Ordered Field: Exponent Laws, Factorisation, Geometric Sums, Monotonicity and Bernoulli's Inequality §sign, so its partial sums are at most 11 by Series of Real Numbers with Nonnegative Terms, Comparison, Absolute Convergence and the Geometric Series §bounded. Hence for 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 and Finite Sums in a Commutative Ring and in an Ordered Field: Distributivity, Differences, Telescoping, Constant Terms, Comparison and the Triangle Inequality §distributive,

∑k=1nuN+k≤uN∑k=1n(12)k≤uN.\sum_{k=1}^{n}u_{N+k}\le u_{N}\sum_{k=1}^{n}\Big(\frac{1}{2}\Big)^{k}\le u_{N}.

So the series ∑k=1∞uN+k\sum_{k=1}^{\infty}u_{N+k} has nonnegative terms and partial sums bounded above by uNu_{N}, and it converges by Series of Real Numbers with Nonnegative Terms, Comparison, Absolute Convergence and the Geometric Series §bounded and Bounded Sequences of Real Numbers §bounded. By Elementary Properties of Series of Real Numbers: Linearity, Null Terms, the Cauchy Criterion, Index Shifts, Tails, Order and Telescoping §shift with p=Np=N, ∑k=1∞uk\sum_{k=1}^{\infty}u_{k} converges; let SS be its sum. As ∣xkk!∣=uk\big|\frac{x^{k}}{k!}\big|=u_{k}, the series ∑k=1∞xkk!\sum_{k=1}^{\infty}\frac{x^{k}}{k!} converges absolutely.

Now let φ:N→N\varphi:\mathbb{N}\to\mathbb{N} be either k↦2kk\mapsto2k or k↦2k+1k\mapsto2k+1. It is injective, by cancellation in N\mathbb{N}, and for n∈Nn\in\mathbb{N} and k∈[n]k\in[n] one has 1≤k≤2k≤φ(k)≤2k+1≤2n+11\le k\le2k\le\varphi(k)\le2k+1\le2n+1, as 1≤k≤n1\le k\le n. So φ\varphi maps [n][n] bijectively onto En={φ(k):k∈[n]}⊆[2n+1]E_{n}=\{\varphi(k):k\in[n]\}\subseteq[2n+1], and by Iterated Operations over Finite Sets: Singletons, Disjoint Unions, Reindexing, Products of Sets, Termwise Combination, Homomorphisms and Intervals §reindexing, Sums over Finite Sets in a Commutative Ring and in an Ordered Field: Distributivity, Products of Sums, Vanishing Terms, Sums over Pairs, Expanding Products of Sums, Counting, Comparison, Monotonicity and the Triangle Inequality §monotone and Series of Real Numbers with Nonnegative Terms, Comparison, Absolute Convergence and the Geometric Series §bounded,

∑k=1nuφ(k)=∑j∈Enuj≤∑j=12n+1uj≤S.\sum_{k=1}^{n}u_{\varphi(k)}=\sum_{j\in E_{n}}u_{j}\le\sum_{j=1}^{2n+1}u_{j}\le S.

Thus ∑k=1∞uφ(k)\sum_{k=1}^{\infty}u_{\varphi(k)} has nonnegative terms and partial sums bounded above by SS, so it converges by Series of Real Numbers with Nonnegative Terms, Comparison, Absolute Convergence and the Geometric Series §bounded and Bounded Sequences of Real Numbers §bounded. Since ∣xφ(k)φ(k)!∣=uφ(k)\big|\frac{x^{\varphi(k)}}{\varphi(k)!}\big|=u_{\varphi(k)}, the series ∑k=1∞x2k(2k)!\sum_{k=1}^{\infty}\frac{x^{2k}}{(2k)!} and ∑k=1∞x2k+1(2k+1)!\sum_{k=1}^{\infty}\frac{x^{2k+1}}{(2k+1)!} converge absolutely.

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…