Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passaudited 2026-07-31
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.

Tauber's theorem: an Abel-summable series with ι(n+1)an0\iota(n+1)a_n\to0 converges ordinarily to its Abel sum

Statement

Let n0an\sum_{n\ge0}a_n be Abel summable to ss. If

ι(n+1)an0,\iota(n+1)a_n\longrightarrow0,

then its ordinary partial sums converge to ss.

Facts & Assumptions

Given: The Abel sum A(x):=n0anxnsA(x):=\sum_{n\ge0}a_nx^n\to s as x1x\uparrow1 and the stated Tauber condition.

[L1]

The block lemma supplies uniform bounds for the weighted middle and tail when xN:=11/ι(N+1)x_N:=1-1/\iota(N+1) (If ι(n+1)an0\iota(n+1)a_n\to0, short multiplicative blocks of the coefficients have uniformly small sums).

[L2]

The Archimedean reciprocal property gives a reciprocal below every positive tolerance. Canonical naturals increase and reciprocation reverses positive order, so every later reciprocal remains below that tolerance; hence 1/ι(N+1)01/\iota(N+1)\to0 and xN1x_N\uparrow1. Abel summability then gives A(xN)sA(x_N)\to s (For every ε>0\varepsilon > 0 in a complete ordered field there is a natural n1n \ge 1 with 1/n<ε1/n < \varepsilon, Canonical naturals are positive and strictly increasing, Inverses of positives are positive, and reciprocation reverses order, Abel summability by limx1anxn\lim_{x\uparrow1}\sum a_nx^n and Cesaro summability by the Cesaro means of the partial sums, Limits and Cauchy sequences of reals).

Proof

technique · direct
1.1

Write SN:=n=0NanS_N:=\sum_{n=0}^{N}a_n. For N1N\ge1, one has SNA(xN)=n=0Nan(1xNn)n>NanxNnS_N-A(x_N)=\sum_{n=0}^{N}a_n(1-x_N^n)-\sum_{n>N}a_nx_N^n.

givenalgebra
2.1

Given ε>0\varepsilon>0, choose N0N_0 from [L1]. The part of the first sum with n<N0n<N_0 tends to 00 because it is finite and xN1x_N\to1; the remaining part and the tail have absolute value at most ε\varepsilon each by [L1].

step 1.1L1choose
3.1

Hence SNA(xN)0S_N-A(x_N)\to0. Since A(xN)sA(x_N)\to s by [L2], it follows that SNsS_N\to s.

step 2.1L2

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · next 3 levels

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