Alphabeta Math
RemarkRemark: AI-adaptedProof: Not applicableverified 2026-08-09 (gpt-5.6-terra-codex-subscription)
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.

How the nonnegative tests are ordered by strength, and which of them this page cannot state without the logarithm

The tests on this page are not independent criteria of comparable status. Some of them are strictly stronger than others, in the precise sense that whenever the weaker one decides a series, the stronger one decides it the same way, and there are series the stronger one decides and the weaker one does not. This remark records exactly which comparisons are proved here, and, equally importantly, which are not.

Everything on this page is a comparison in disguise. If 0≤ak≤bk eventually, convergence of ∑bk gives convergence of ∑ak, and divergence of ∑ak gives divergence of ∑bk compares against an arbitrary series; the strength of every later test is the strength of the particular series it compares against. The root and ratio tests compare against a geometric series (For ∣r∣<1, ∑k≥0rk=1/(1−r), and for ∣r∣≥1 the series diverges); Raabe's test compares against the harmonic series, through the weights ζk=k+1 in Kummer: for positive terms ak and weights ζk>0, lim inf⁡(ζkak/ak+1−ζk+1)>0 gives convergence, and if ∑1/ζk diverges while that expression is eventually ≤0 the series diverges; and the borderline branch of Gauss: for positive terms, if ak/ak+1=1+h/k+rk with ∣rk∣≤C k−1−ε for k≥1, some constant C and some rational ε>0, the series converges iff h>1 compares against the harmonic series again. For a nonincreasing nonnegative sequence, ∑ak converges iff ∑2ka2k converges is of a different kind: it does not compare, it reindexes, and that is why it settles the whole p-series family (For rational p>0, ∑1/kp converges iff p>1) in one step.

The comparisons proved on this page.

Two comparisons that are not claimed here. Raabe's test is not compared with the root test on this page, in either direction, and nothing above should be read as ordering them. Nor is Kummer's test claimed to be universal: the choice of weights is free, and the question of which series some choice of weights decides is not addressed.

And one that is refuted. No comparison test can be final. For a divergent series of positive terms with partial sums sk, the series ∑ak/sk diverges and ∑ak/sk2 converges turns any divergent series of positive terms into a divergent series of positive terms with eventually smaller terms, and FALSE: there is a divergent series of positive terms that diverges more slowly than every other, hence a universal comparison test draws the conclusion: there is no slowest divergent series of positive terms, hence no universal comparison test. The hierarchy above is therefore an initial segment of something with no last term, not an approach to a best test.

What this page cannot state, and why. Every gap below is a missing definition, not a missing proof.

  • The p-series at irrational exponents. Rational powers ar of a positive base defines ar for rational r and positive a. So ∑1/kp is a well-formed expression here only for rational p, and For rational p>0, ∑1/kp converges iff p>1 is the full theorem for every exponent this page can name. Real exponents wait for the exponential and the logarithm.
  • Bertrand's test. Its criterion is a condition on log⁡k (k(ak/ak+1−1)−1), and it is the natural next member of the Kummer family, with weights ζk=klog⁡k. Both the weights and the criterion mention the logarithm, so neither can be written down here.
  • The integral test. It compares ∑f(k) with ∫f, and the Riemann integral is developed much later in this library. Condensation is the substitute used on this page, and for the p-series it does the same work.
  • The general form of Gauss's test. The classical statement assumes rk=O(k−β) for some real β>1. The version proved here writes β=1+ε with ε a positive rational. This loses no case covered by the classical hypothesis: given β>1, choose a rational 0<ε<β−1 and weaken the eventual bound. An error of order 1/(klog⁡k) is not a Gauss remainder at h=1; it is the next Bertrand borderline.

A limitation that has been removed, and one that has not. The comparison with a geometric series inside Root test: lim sup⁡∣ak∣1/k<1 gives absolute convergence and hence convergence, >1 gives divergence, and =1 decides nothing and Ratio test: lim sup⁡∣ak+1/ak∣<1 gives absolute convergence and hence convergence, and lim inf⁡∣ak+1/ak∣>1 gives divergence delivers convergence of ∑∣ak∣ and not, on its own, of ∑ak. That the second follows from the first is If ∑∣ak∣ converges then ∑ak converges, proved on this page from A series converges iff for every ε>0 there is N with ∣am+1+⋯+an∣<ε for all n>m≥N and the triangle inequality for finite sums, so both tests do reach their standard conclusion here. What is not on this page is the rest of that theory: the converse fails, and the alternating harmonic series that witnesses the failure needs the alternating series test, which is not proved here; rearrangement, the Riemann series theorem and products of series belong with it on the page that follows. Nothing above asserts a converse or identifies any sum.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

69 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources