Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedSession-authored (Fable 5 assisted)precheck passjudge pass (z-ai/glm-5.2)audited 2026-07-27
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

For a divergent series of positive terms with partial sums sks_k, the series ak/sk\sum a_k/s_k diverges and ak/sk2\sum a_k/s_k^2 converges

Statement

Let (ak)(a_k) be a sequence of reals with ak>0a_k > 0 for every kNk \in \mathbb{N} and suppose ak\sum a_k diverges (Series, partial sums, convergence and the sum, divergence, and the tail series). Write

Sn  :=  k=0nak(nN)S_n \;:=\; \sum_{k=0}^{n} a_k \qquad (n \in \mathbb{N})

for the inclusive partial sums, so that Sn=sn+1S_n = s_{n+1} in the notation sn=k<naks_n = \sum_{k<n} a_k of Series, partial sums, convergence and the sum, divergence, and the tail series. Then Sn>0S_n > 0 for every nNn \in \mathbb{N}, and:

  1. nanSn\displaystyle\sum_{n} \frac{a_n}{S_n} diverges;
  2. nanSn2\displaystyle\sum_{n} \frac{a_n}{S_n^{2}} converges.

Why the divisor is the inclusive partial sum. The exclusive partial sum of Series, partial sums, convergence and the sum, divergence, and the tail series has s0=0s_0 = 0, the empty sum, so a0/s0a_0/s_0 has no value and a series divided by sns_n would have to begin at n=1n = 1. The inclusive sum has S0=a0>0S_0 = a_0 > 0, so both series above are series of sequences on N\mathbb{N} with no shift and no excluded index. The classical statement, which writes sn=a1++ans_n = a_1 + \dots + a_n and starts at n=1n = 1, is this one with the indices moved by one.

What the theorem says. No divergent series of positive terms is slowest: dividing its terms by the running total produces a series that still diverges but whose terms are eventually strictly smaller. Dividing by the square of the running total overshoots and produces a convergent series. Claim 1 is what refutes the existence of a universal comparison series (FALSE: there is a divergent series of positive terms that diverges more slowly than every other, hence a universal comparison test).

Facts & Assumptions

Given: A sequence (ak)(a_k) of reals with ak>0a_k > 0 for every kk, with ak\sum a_k divergent; the exclusive partial sums sn=k<naks_n = \sum_{k<n} a_k and the inclusive partial sums Sn=k=0nak=sn+1S_n = \sum_{k=0}^{n} a_k = s_{n+1} (Series, partial sums, convergence and the sum, divergence, and the tail series, Finite sums and finite products, by recursion).

[L2]

Splitting of finite sums: for mnm \le n, k=0nak=k=0mak+k=m+1nak\sum_{k=0}^{n} a_k = \sum_{k=0}^{m} a_k + \sum_{k=m+1}^{n} a_k, so k=m+1nak=SnSm\sum_{k=m+1}^{n} a_k = S_n - S_m; and monotonicity of finite sums (Laws of finite sums and finite products, Finite sums and finite products, by recursion).

[L3]

The Cauchy criterion: dk\sum d_k converges if and only if for every real ε>0\varepsilon > 0 there is NN with k=m+1ndk<ε\big|\sum_{k=m+1}^{n} d_k\big| < \varepsilon for all n>mNn > m \ge N (A series converges iff for every ε>0\varepsilon > 0 there is NN with am+1++an<ε|a_{m+1} + \dots + a_n| < \varepsilon for all n>mNn > m \ge N).

[L4]

For positive terms, xn0x_n \to 0 if and only if 1/xn+1/x_n \to +\infty (For positive terms, null and divergence to ++\infty are reciprocal, Limits and Cauchy sequences of reals).

[L5]

(bnbn+1)\sum (b_n - b_{n+1}) converges whenever (bn)(b_n) converges ((bkbk+1)\sum (b_k - b_{k+1}) converges iff (bk)(b_k) converges, with sum b0limbkb_0 - \lim b_k).

[L7]

Reciprocation on the positives: 0<xy0 < x \le y implies 0<1/y1/x0 < 1/y \le 1/x (Inverses of positives are positive, and reciprocation reverses order); and x2=xxx^{2} = x \cdot x (Integer powers ama^m).

Proof

technique · direct
1.1

Every SnS_n is a sum of positive terms, so Sn>0S_n > 0; and SnSn+1S_n \le S_{n+1} since Sn+1Sn=an+1>0S_{n+1} - S_n = a_{n+1} > 0, so (Sn)(S_n) is nondecreasing and SmSnS_m \le S_n whenever mnm \le n.

givenL2L1
1.2

Since ak\sum a_k diverges and its terms are nonnegative, the exclusive partial sums are unbounded above and sn+s_n \to +\infty; hence Sn=sn+1+S_n = s_{n+1} \to +\infty, because for a given real MM any index bound KK working for (sn)(s_n) also works for (Sn)(S_n).

givenL1algebra
2.1

For all naturals n>mn > m, using SkSnS_k \le S_n for knk \le n and ak>0a_k > 0: k=m+1nakSk  k=m+1nakSn = SnSmSn = 1SmSn\displaystyle\sum_{k=m+1}^{n} \frac{a_k}{S_k} \ \ge \ \sum_{k=m+1}^{n} \frac{a_k}{S_n} \ = \ \frac{S_n - S_m}{S_n} \ = \ 1 - \frac{S_m}{S_n}.

step 1.1L2L7
2.2

Put bn:=1/Snb_n := 1/S_n, which is positive; since 1/bn=Sn+1/b_n = S_n \to +\infty, the sequence (bn)(b_n) converges to 00.

step 1.1step 1.2L4L7
2.3

For every nNn \in \mathbb{N}: bnbn+1=1Sn1Sn+1=Sn+1SnSnSn+1=an+1SnSn+1  an+1Sn+12 > 0b_n - b_{n+1} = \dfrac{1}{S_n} - \dfrac{1}{S_{n+1}} = \dfrac{S_{n+1}-S_n}{S_n S_{n+1}} = \dfrac{a_{n+1}}{S_n S_{n+1}} \ \ge \ \dfrac{a_{n+1}}{S_{n+1}^{2}} \ > \ 0, the inequality because 0<SnSn+1Sn+120 < S_n S_{n+1} \le S_{n+1}^{2}.

step 1.1L2L7algebra
3.1

Let NNN \in \mathbb{N} be arbitrary and put m:=Nm := N. Since Sn+S_n \to +\infty there is n>mn > m with Sn>2SmS_n > 2 S_m, and then Sm/Sn<1/2S_m/S_n < 1/2, so the block of step 2.1 satisfies k=m+1nak/Sk>1/2\sum_{k=m+1}^{n} a_k/S_k > 1/2.

step 1.2step 2.1L7choose
3.2

Therefore n(bnbn+1)\sum_n (b_n - b_{n+1}) converges.

step 2.2L5
4.1

So no NN witnesses the Cauchy condition for the tolerance ε=1/2\varepsilon = 1/2, and nan/Sn\sum_n a_n/S_n diverges, which is claim 1.

step 3.1L3
5.1

By comparison, nan+1Sn+12\sum_n \dfrac{a_{n+1}}{S_{n+1}^{2}} converges; that series is the 11-st tail series of nanSn2\sum_n \dfrac{a_n}{S_n^{2}}, so the latter converges, which is claim 2.

step 3.2step 2.3L6

Remarks

  • The two claims are not two theorems but one pair of estimates. Divergence comes from bounding a block below by 1Sm/Sn1 - S_m/S_n, which the Cauchy criterion turns into a refutation of convergence; convergence comes from bounding a single term above by a telescoping difference. The first estimate needs SnS_n to grow without bound and the second needs it to be nondecreasing, and both facts come from divergence of ak\sum a_k together with positivity of its terms.

  • The exponent 22 is not optimal, and this page does not pursue that. The classical refinement replaces Sn2S_n^{2} by Sn1+δS_n^{1+\delta} for a rational δ>0\delta > 0; the argument is the same in outline but needs an estimate for SnδSn+1δS_n^{-\delta} - S_{n+1}^{-\delta} that the tools on this page do not supply cleanly. The square is what claim 1 needs a companion for, and it is enough for every use made of the theorem here.

  • Positivity is used at every step. It gives Sn>0S_n > 0, so the quotients exist; it makes (Sn)(S_n) nondecreasing, which both estimates use; and it makes the terms of the two derived series nonnegative, which is what lets comparison and the boundedness criterion apply to them.

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 102 results over 27 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.

Sources