TheoremBase

Induction shows that the partial sum up to M+p exceeds the one up to M by at least p/(M+p), so doubling the number of terms adds at least one half; hence the partial sums exceed j/2 for every j and, by the Archimedean property, are unbounded, so the nonnegative series diverges.

Proof

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

Conventions. Let ι:N→R\iota:\mathbb{N}\to\mathbb{R} be the canonical map through which natural numbers are read in R\mathbb{R} (The Real Numbers: Standing Notation and Background §numbers). By claim 3 of Properties of the Canonical Map from the Natural Numbers to an Ordered Field, 0<ι(m)0<\iota(m) and ι(m)−1\iota(m)^{-1} exists with 0<ι(m)−10<\iota(m)^{-1} for every m∈Nm\in\mathbb{N}, so h(m)=1m=ι(m)−1h(m)=\tfrac1m=\iota(m)^{-1} defines a sequence h:N→Rh:\mathbb{N}\to\mathbb{R} of positive terms. For M∈NM\in\mathbb{N} let

H(M)=∑m=1M1m,H(M)=\sum_{m=1}^{M}\frac1m ,

the finite sum of the restriction of hh to [M][M] (The Real Numbers: Standing Notation and Background §naturals); these are the partial sums of the series ∑m=1∞1m\sum_{m=1}^{\infty}\tfrac1m (Series of Real Numbers §partial-sums). The order of R\mathbb{R} is a total order, reflexive, antisymmetric and transitive by clauses 1, 2 and 3 of Total Order on a Set; x<yx<y means x≤yx\le y and x≠yx\ne y. Put 2=1+12=1+1; by claim 8 of Elementary Order Arithmetic in an Ordered Field, 0<20<2 and the inverse 2−12^{-1} exists, and 0<2−10<2^{-1} by claim 7 of that lemma.

Step 1 (recursion). H(1)=1H(1)=1, and H(S(M))=H(M)+h(S(M))H(S(M))=H(M)+h(S(M)) for every M∈NM\in\mathbb{N}. Indeed, by claim 1 of Properties of Finite Sums, H(1)=h(1)=ι(1)−1H(1)=h(1)=\iota(1)^{-1}, and ι(1)=1\iota(1)=1 by claim 1 of Properties of the Canonical Map from the Natural Numbers to an Ordered Field, so H(1)=1−1=1H(1)=1^{-1}=1 by the field axioms of Field. For the second identity apply claim 1 of Properties of Finite Sums to the restriction of hh to [S(M)][S(M)]; this is legitimate since M<S(M)M<S(M) by claim 5 of Properties of the Order on the Natural Numbers, hence M≤S(M)M\le S(M) and S(M)∈[S(M)]S(M)\in[S(M)] by claim 1 of Properties of the Order on the Natural Numbers, so [M]⊆[S(M)][M]\subseteq[S(M)] by transitivity (claim 1 of Properties of the Order on the Natural Numbers), and by claim 1 of Properties of Finite Sums the sum up to MM does not depend on which extension of the summands is used.

Step 2 (reciprocals reverse the order). If x,y∈Rx,y\in\mathbb{R} and 0<x≤y0<x\le y, then y−1≤x−1y^{-1}\le x^{-1}. By mixed transitivity (claim 2 of Elementary Order Arithmetic in an Ordered Field) 0<y0<y, so x−1x^{-1} and y−1y^{-1} exist and are positive by claim 7 of Elementary Order Arithmetic in an Ordered Field, and 0<x−1y−10<x^{-1}y^{-1} by claim 5 of Elementary Order Arithmetic in an Ordered Field. Multiplying x≤yx\le y by the nonnegative number x−1y−1x^{-1}y^{-1} (claim 5 of Elementary Arithmetic in an Ordered Field) gives x−1y−1x≤x−1y−1yx^{-1}y^{-1}x\le x^{-1}y^{-1}y, which by the field axioms of Field reads y−1≤x−1y^{-1}\le x^{-1}. Consequently, for m,m′∈Nm,m'\in\mathbb{N} with m<m′m<m' we have ι(m)<ι(m′)\iota(m)<\iota(m') by claim 6 of Properties of the Canonical Map from the Natural Numbers to an Ordered Field, and with 0<ι(m)0<\iota(m) this gives h(m′)≤h(m)h(m')\le h(m).

Step 3 (a block estimate). For every p∈Np\in\mathbb{N} and every M∈NM\in\mathbb{N},

H(M)+ι(p) h(M+p)≤H(M+p).H(M)+\iota(p)\,h(M+p)\le H(M+p).

Let AA be the set of those p∈Np\in\mathbb{N} for which this holds for every M∈NM\in\mathbb{N}; we show A=NA=\mathbb{N} by the principle of induction of Principle of Induction for the Natural Numbers, applied to the set AA.

(a) 1∈A1\in A. Let M∈NM\in\mathbb{N}. By clause 1 of Natural Numbers, M+1=S(M)M+1=S(M), and ι(1)=1\iota(1)=1 by claim 1 of Properties of the Canonical Map from the Natural Numbers to an Ordered Field; so the required inequality reads H(M)+h(S(M))≤H(S(M))H(M)+h(S(M))\le H(S(M)), which holds with equality by Step 1, hence by reflexivity.

(b) If p∈Ap\in A then S(p)∈AS(p)\in A. Let M∈NM\in\mathbb{N} and put q=M+pq=M+p. By clause 2 of Natural Numbers, M+S(p)=S(q)M+S(p)=S(q). Since q<S(q)q<S(q) by claim 5 of Properties of the Order on the Natural Numbers, Step 2 gives h(S(q))≤h(q)h(S(q))\le h(q); as 0≤ι(p)0\le\iota(p) (claim 3 of Properties of the Canonical Map from the Natural Numbers to an Ordered Field), claim 5 of Elementary Arithmetic in an Ordered Field gives ι(p)h(S(q))≤ι(p)h(q)\iota(p)h(S(q))\le\iota(p)h(q). Adding H(M)H(M) (clause 1 of Ordered Field) and using p∈Ap\in A and transitivity,

H(M)+ι(p)h(S(q))≤H(M)+ι(p)h(q)≤H(q).H(M)+\iota(p)h(S(q))\le H(M)+\iota(p)h(q)\le H(q).

Adding h(S(q))h(S(q)) (clause 1 of Ordered Field) and using Step 1,

H(M)+ι(p)h(S(q))+h(S(q))≤H(q)+h(S(q))=H(S(q)).H(M)+\iota(p)h(S(q))+h(S(q))\le H(q)+h(S(q))=H(S(q)).

By distributivity (Field) the left-hand side is H(M)+(ι(p)+1)h(S(q))H(M)+\bigl(\iota(p)+1\bigr)h(S(q)), and ι(p)+1=ι(p+1)=ι(S(p))\iota(p)+1=\iota(p+1)=\iota(S(p)) by claim 1 of Properties of the Canonical Map from the Natural Numbers to an Ordered Field and clause 1 of Natural Numbers. Since S(q)=M+S(p)S(q)=M+S(p), this is the required inequality for S(p)S(p) and MM. As MM was arbitrary, S(p)∈AS(p)\in A.

By Principle of Induction for the Natural Numbers, A=NA=\mathbb{N}.

Step 4 (doubling adds at least one half). For every M∈NM\in\mathbb{N}, H(M)+2−1≤H(M+M)H(M)+2^{-1}\le H(M+M). Take p=Mp=M in Step 3. By claim 4 of Properties of the Canonical Map from the Natural Numbers to an Ordered Field and the field axioms of Field, ι(M+M)=ι(M)+ι(M)=ι(M)⋅2\iota(M+M)=\iota(M)+\iota(M)=\iota(M)\cdot2, and since ι(M)≠0\iota(M)\ne0 and 2≠02\ne0 the field axioms give h(M+M)=(ι(M)⋅2)−1=ι(M)−12−1h(M+M)=(\iota(M)\cdot2)^{-1}=\iota(M)^{-1}2^{-1}, so ι(M)h(M+M)=2−1\iota(M)h(M+M)=2^{-1}. Step 3 now reads H(M)+2−1≤H(M+M)H(M)+2^{-1}\le H(M+M).

Step 5 (growth). For every j∈Nj\in\mathbb{N} there is M∈NM\in\mathbb{N} with ι(j)2−1≤H(M)\iota(j)2^{-1}\le H(M). Let A′A' be the set of those j∈Nj\in\mathbb{N} for which such an MM exists; we apply Principle of Induction for the Natural Numbers to A′A'.

(a) 1∈A′1\in A': since 0<10<1 (claim 6 of Elementary Order Arithmetic in an Ordered Field), claim 8 of Elementary Order Arithmetic in an Ordered Field gives 1⋅2−1<11\cdot2^{-1}<1, and ι(1)=1\iota(1)=1 (claim 1 of Properties of the Canonical Map from the Natural Numbers to an Ordered Field) and H(1)=1H(1)=1 (Step 1), so ι(1)2−1≤H(1)\iota(1)2^{-1}\le H(1).

(b) If j∈A′j\in A', witnessed by MM, then by clause 1 of Natural Numbers, claim 1 of Properties of the Canonical Map from the Natural Numbers to an Ordered Field and distributivity, ι(S(j))2−1=ι(j)2−1+2−1\iota(S(j))2^{-1}=\iota(j)2^{-1}+2^{-1}. Adding 2−12^{-1} to ι(j)2−1≤H(M)\iota(j)2^{-1}\le H(M) (clause 1 of Ordered Field) and applying Step 4 and transitivity,

ι(S(j))2−1≤H(M)+2−1≤H(M+M),\iota(S(j))2^{-1}\le H(M)+2^{-1}\le H(M+M),

so S(j)∈A′S(j)\in A', witnessed by M+MM+M.

By Principle of Induction for the Natural Numbers, A′=NA'=\mathbb{N}.

Step 6 (the partial sums are not bounded above). Suppose b∈Rb\in\mathbb{R} were an upper bound of {H(M):M∈N}\{H(M):M\in\mathbb{N}\} in the sense of The Real Numbers: Standing Notation and Background §bounds. Since 0<2−10<2^{-1}, claim 2 of The Archimedean Property of the Real Numbers gives j∈Nj\in\mathbb{N} with b<ι(j)2−1b<\iota(j)2^{-1}, and Step 5 gives MM with ι(j)2−1≤H(M)\iota(j)2^{-1}\le H(M). By mixed transitivity (claim 2 of Elementary Order Arithmetic in an Ordered Field), b<H(M)b<H(M). But H(M)≤bH(M)\le b, so antisymmetry gives b=H(M)b=H(M), contradicting b≠H(M)b\ne H(M). Hence the set is not bounded above.

Step 7 (divergence). The terms h(m)h(m) are nonnegative, being positive. By Series of Nonnegative Real Numbers, Comparison, and the Geometric Series §criterion the series ∑m=1∞1m\sum_{m=1}^{\infty}\tfrac1m converges if and only if the set of its partial sums {H(M):M∈N}\{H(M):M\in\mathbb{N}\} is bounded above, which fails by Step 6. So the series does not converge in the sense of Series of Real Numbers §convergent.

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…