Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedprecheck 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<1, the Abel transform of a series is (1−x)2∑n≥0(n+1)σnxn, where σn are the Cesaro means of its partial sums

Statement

Let Sn:=∑k=0nak and σn:=ι(n+1)−1∑k=0nSk. If (σn) is bounded, then for every 0<x<1 the Abel series converges and

∑n=0∞anxn=(1−x)2∑n=0∞ι(n+1)σnxn.

Facts & Assumptions

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

[L1]

The canonical natural ι(n+1) is positive. Thus, putting Tn:=∑k=0nSk, the definition of σn gives Tn=ι(n+1)σn. Also Sn=Tn−Tn−1 with T−1:=0; putting S−1:=0 gives an=Sn−Sn−1 for every n≥0 (Abel summability by lim⁡x↑1∑anxn and Cesaro summability by the Cesaro means of the partial sums, Finite sums and finite products, by recursion, The canonical natural ι(n)=n⋅1F 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 M≥0 with ∣σn∣≤M for every n. Then ∣Tnxn∣≤Mι(n+1)xn; [L2] and [L3] give convergence of the majorant series, so [L4] gives absolute convergence of ∑nTnxn.

L1L2L3L4choose
2.1

Since Sn=Tn−Tn−1, step 1.1 gives absolute convergence of ∑nSnxn. With T−1=0, the shifted series satisfies ∑n≥0Tn−1xn=x∑n≥0Tnxn; combining the two convergent series by [L3] gives ∑n≥0Snxn=(1−x)∑n≥0Tnxn.

step 1.1L1L3algebra
3.1

Since an=Sn−Sn−1 with S−1=0, step 2.1 likewise gives absolute convergence and ∑nanxn=(1−x)∑nSnxn. Substitute step 2.1 and Tn=ι(n+1)σn to get the formula.

step 2.1L1L3∎

Depends on

Used by

Dependency tree · two levels

45 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