Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)verified 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.

Abel-Dini applied to ∑1/k: ∑1/(ksk) still diverges while ∑1/(ksk2) converges

Example

Take ak:=1/ι(k+1) for k∈N, so that ∑ak is the harmonic series ∑k≥11/k, which has positive terms and diverges (The harmonic series ∑1/k diverges, by condensation and by Oresme block grouping). Its inclusive partial sums are the harmonic numbers

Sn  =  ∑k=0nak  =  ∑k=1n+11k  =  Hn+1(n∈N),

all of them positive. The Abel-Dini theorem (For a divergent series of positive terms with partial sums sk, the series ∑ak/sk diverges and ∑ak/sk2 converges) then says that

∑nanSn  =  ∑n1(n+1) Hn+1diverges,∑nanSn2  =  ∑n1(n+1) Hn+12converges.

Classically these are written ∑k≥11/(kHk) and ∑k≥11/(kHk2), with Hk=1+1/2+⋯+1/k.

What the pair shows. The harmonic series is a familiar slowly divergent explicit series, and dividing its terms by the running total produces something that diverges more slowly still. Dividing by the square of the running total overshoots into convergence. So exponent 1 gives a divergent member and exponent 2 a convergent one. The absence of a slowest divergent positive series comes from applying Abel-Dini again to the newly produced divergent series, not from a last-exponent claim about this fixed pair.

Facts & Assumptions

Given: The sequence ak:=1/ι(k+1), k∈N, and its inclusive partial sums Sn=∑k=0nak (Series, partial sums, convergence and the sum, divergence, and the tail series, Finite sums and finite products, by recursion, Canonical naturals are positive and strictly increasing).

[L1]

The canonical naturals are positive, so each ak is positive and each Sn is a sum of positive terms (Canonical naturals are positive and strictly increasing, Inverses of positives are positive, and reciprocation reverses order).

[L2]

The harmonic series ∑k≥11/k diverges (The harmonic series ∑1/k diverges, by condensation and by Oresme block grouping), and it is by definition the series of j↦1/ι(j+1) (Series, partial sums, convergence and the sum, divergence, and the tail series).

[L3]

Abel-Dini: for a sequence of positive terms whose series diverges, with Sn the inclusive partial sums, ∑nan/Sn diverges and ∑nan/Sn2 converges (For a divergent series of positive terms with partial sums sk, the series ∑ak/sk diverges and ∑ak/sk2 converges, Integer powers am).

Verification

technique · direct
1.1

Every term ak=1/ι(k+1) is positive.

givenL1
1.2

The series ∑ak is the harmonic series ∑k≥11/k and therefore diverges.

givenL2
1.3

Its inclusive partial sums are Sn=∑k=0n1/ι(k+1)=∑k=1n+11/k=Hn+1, a reindexing of the sum by k↦k+1.

givenL1
2.1

The hypotheses of Abel-Dini are met by (ak): positive terms and a divergent series.

step 1.1step 1.2L3
3.1

Therefore ∑nanSn=∑n1ι(n+1)Hn+1 diverges.

step 2.1step 1.3L3
4.1

And ∑nanSn2=∑n1ι(n+1)Hn+12 converges.

step 2.1step 1.3L3∎

Remarks

  • This is the concrete form of the no-slowest-series obstruction. The general statement is that no divergent series of positive terms is eventually dominated by every other; here it is exhibited for the standard candidate. Anyone proposing the harmonic series as a universal comparison series is answered by the first of the two conclusions.

  • No growth estimate for Hk is used or needed. The classical statement Hk≈log⁡k would make both conclusions look like instances of the p-series with a logarithmic correction, but neither the logarithm nor that estimate is available in this library at this point, and the theorem does not require them: it needs only that the running totals are positive, nondecreasing and unbounded.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

46 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