Alphabeta Math
False statementConstruction: AI-adaptedVerification: AI-adaptedSession-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.

FALSE: there is a divergent series of positive terms that diverges more slowly than every other, hence a universal comparison test

Statement

False claim: there is a sequence (bk)(b_k) of reals with bk>0b_k > 0 for every kNk \in \mathbb{N} such that bk\sum b_k diverges (Series, partial sums, convergence and the sum, divergence, and the tail series) and such that every sequence (ak)(a_k) of reals with ak>0a_k > 0 for every kk and ak\sum a_k divergent satisfies

bkakfor all k from some index on.b_k \le a_k \quad \text{for all } k \text{ from some index on.}

Such a (bk)(b_k) would be a slowest divergent series of positive terms, and it would give a universal comparison test: a positive series would diverge exactly when its terms eventually dominate those of (bk)(b_k).

No such sequence exists. The refutation is direct and uses no choice: given any divergent bk\sum b_k with positive terms, the Abel-Dini theorem (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) manufactures a divergent series of positive terms whose terms are eventually strictly smaller than the bkb_k, so (bk)(b_k) fails its own defining property.

Facts & Assumptions

Given: An arbitrary sequence (bk)(b_k) of reals with bk>0b_k > 0 for every kk and bk\sum b_k divergent; its inclusive partial sums Bn=k=0nbkB_n = \sum_{k=0}^{n} b_k (Series, partial sums, convergence and the sum, divergence, and the tail series, Finite sums and finite products, by recursion).

[L2]

Abel-Dini: if (ak)(a_k) has positive terms and ak\sum a_k diverges, then with Sn=k=0nakS_n = \sum_{k=0}^{n} a_k the series nan/Sn\sum_n a_n/S_n diverges (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).

[L3]

Order and reciprocals: for x>0x > 0 and y>1y > 1 one has 0<x/y<x0 < x/y < x (Inverses of positives are positive, and reciprocation reverses order); and a sum of positive terms is positive (Laws of finite sums and finite products).

[L4]

The refuted claim: some divergent series of positive terms is eventually dominated by every divergent series of positive terms.

Refutation

technique · direct
1.1

Let (bk)(b_k) be any sequence of positive reals with bk\sum b_k divergent, and put Bn=k=0nbkB_n = \sum_{k=0}^{n} b_k; every BnB_n is positive, being a sum of positive terms.

givenL3
1.2

Since bk\sum b_k diverges and its terms are nonnegative, its exclusive partial sums sn=k<nbks_n = \sum_{k<n} b_k diverge to ++\infty; and Bn=sn+1B_n = s_{n+1}, so Bn+B_n \to +\infty as well, any index bound for (sn)(s_n) serving for (Bn)(B_n).

givenL1algebra
2.1

Define cn:=bn/Bnc_n := b_n / B_n for nNn \in \mathbb{N}. Each cnc_n is positive, and by Abel-Dini applied to (bk)(b_k) the series cn\sum c_n diverges.

step 1.1L2L3
2.2

Since Bn+B_n \to +\infty there is NNN \in \mathbb{N} with Bn>1B_n > 1 for every nNn \ge N; for such nn, cn=bn/Bn<bnc_n = b_n/B_n < b_n.

step 1.2L3choose
3.1

So (cn)(c_n) is a sequence of positive reals with cn\sum c_n divergent, and there is no index from which bncnb_n \le c_n holds onwards: given any KK, at every index nn that is at least both KK and NN one has cn<bnc_n < b_n.

step 2.1step 2.2
4.1

Therefore the sequence (bk)(b_k) does not have the property demanded of it, and since (bk)(b_k) was an arbitrary divergent series of positive terms, no such sequence exists and the claim is false.

step 3.1L4

Remarks

  • What this rules out. There is no fixed series against which comparison decides divergence for all positive series, so the direct comparison test is unavoidably a family of tests, one for each comparison series, with none of them final. The refutation is constructive in the strong sense: it does not merely show that a slowest series cannot exist, it exhibits, for each candidate, a specific divergent series that beats it.

  • The scale of tests on this page inherits the same limitation. Ratio, Raabe and Gauss are successive refinements, each deciding series the previous one cannot, and the argument above says the sequence of refinements can never terminate in a universal criterion. What Kummer's test adds is a uniform way of describing the whole family, by naming the weights; it does not escape the obstruction, since each choice of weights is still a comparison against the single series 1/ζk\sum 1/\zeta_k.

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 83 results over 25 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