Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedSession-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.

For 0<x<10<x<1, the Abel transform of a series is (1x)2n0(n+1)σnxn(1-x)^2\sum_{n\ge0}(n+1)\sigma_nx^n, where σn\sigma_n are the Cesaro means of its partial sums

Statement

Let Sn:=k=0nakS_n:=\sum_{k=0}^{n}a_k and σn:=ι(n+1)1k=0nSk\sigma_n:=\iota(n+1)^{-1}\sum_{k=0}^{n}S_k. If (σn)(\sigma_n) is bounded, then for every 0<x<10<x<1 the Abel series converges and

n=0anxn=(1x)2n=0ι(n+1)σnxn.\sum_{n=0}^{\infty}a_nx^n=(1-x)^2\sum_{n=0}^{\infty}\iota(n+1)\sigma_nx^n.

Facts & Assumptions

Given: The coefficients, partial sums, and Cesaro means in the statement.

[L1]

The canonical natural ι(n+1)\iota(n+1) is positive. Thus, putting Tn:=k=0nSkT_n:=\sum_{k=0}^{n}S_k, the definition of σn\sigma_n gives Tn=ι(n+1)σnT_n=\iota(n+1)\sigma_n. Also Sn=TnTn1S_n=T_n-T_{n-1} with T1:=0T_{-1}:=0; putting S1:=0S_{-1}:=0 gives an=SnSn1a_n=S_n-S_{n-1} for every n0n\ge0 (Abel summability by limx1anxn\lim_{x\uparrow1}\sum a_nx^n and Cesaro summability by the Cesaro means of the partial sums, Finite sums and finite products, by recursion, The canonical natural ι(n)=n1F\iota(n) = n \cdot 1_F of a field, Canonical naturals are positive and strictly increasing).

[L3]

Convergent real series may be added, subtracted and scaled term by term (Convergent series add and scale termwise).

Proof

technique · direct
1.1

Choose M0M\ge0 with σnM|\sigma_n|\le M for every nn. Then TnxnMι(n+1)xn|T_nx^n|\le M\iota(n+1)x^n; [L2] and [L3] give convergence of the majorant series, so [L4] gives absolute convergence of nTnxn\sum_nT_nx^n.

L1L2L3L4choose
2.1

Since Sn=TnTn1S_n=T_n-T_{n-1}, step 1.1 gives absolute convergence of nSnxn\sum_nS_nx^n. With T1=0T_{-1}=0, the shifted series satisfies n0Tn1xn=xn0Tnxn\sum_{n\ge0}T_{n-1}x^n=x\sum_{n\ge0}T_nx^n; combining the two convergent series by [L3] gives n0Snxn=(1x)n0Tnxn\sum_{n\ge0}S_nx^n=(1-x)\sum_{n\ge0}T_nx^n.

step 1.1L1L3algebra
3.1

Since an=SnSn1a_n=S_n-S_{n-1} with S1=0S_{-1}=0, step 2.1 likewise gives absolute convergence and nanxn=(1x)nSnxn\sum_na_nx^n=(1-x)\sum_nS_nx^n. Substitute step 2.1 and Tn=ι(n+1)σnT_n=\iota(n+1)\sigma_n to get the formula.

step 2.1L1L3

Depends on

Used by

Dependency tree · next 3 levels

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