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.

Cauchy–Hadamard: the reciprocal radius is lim supkak+11/(k+1)\limsup_{k\to\infty}|a_{k+1}|^{1/(k+1)}, with the zero and infinite cases included

Statement

Let n0an(xc)n\sum_{n\ge0}a_n(x-c)^n be a real power series with radius RR (A real power series about a centre, its interval of convergence, and its radius in [0,+][0,+\infty]), and put

L:=lim supkak+11/(k+1)[0,+].L:=\limsup_{k\to\infty}|a_{k+1}|^{1/(k+1)}\in[0,+\infty].

Then RR is the reciprocal of LL in the following explicit sense:

R={+,L=0,1/L,0<L<+,0,L=+.R=\begin{cases}+\infty,&L=0,\\[2pt]1/L,&0<L<+\infty,\\[2pt]0,&L=+\infty.\end{cases}

Equivalently, with the conventions 1/0:=+1/0:=+\infty and 1/(+):=01/(+\infty):=0, one has R=1/LR=1/L. The roots use ak+1a_{k+1} and the exponent 1/(k+1)1/(k+1) because N\mathbb N starts at 00 and a zeroth root is undefined.

Facts & Assumptions

Given: A real power series an(xc)n\sum a_n(x-c)^n, its radius RR, the nonnegative root sequence qk:=ak+11/(k+1)q_k:=|a_{k+1}|^{1/(k+1)}, and L:=lim supkqkL:=\limsup_k q_k.

[L2]

If LL is real, then for every real ε>0\varepsilon>0, qk<L+εq_k<L+\varepsilon eventually and qk>Lεq_k>L-\varepsilon frequently (For finite LL: L=lim supxkL = \limsup x_k iff for every ε>0\varepsilon > 0 one has xk<L+εx_k < L + \varepsilon eventually and xk>Lεx_k > L - \varepsilon frequently).

[L3]

The root test says that a real series from index 11 converges absolutely when the limit superior of its shifted roots is <1<1, and diverges when that limit superior is >1>1 (Root test: lim supak1/k<1\limsup |a_k|^{1/k} < 1 gives absolute convergence and hence convergence, >1> 1 gives divergence, and =1= 1 decides nothing).

[L4]

Absolute convergence means convergence of the series of absolute values (Absolutely convergent and conditionally convergent series, and the general starting index).

Proof

technique · direct
1.1

Fix xRx\in\mathbb R and put d:=xcd:=|x-c|. The shifted roots of the terms an(xc)na_n(x-c)^n, n1n\ge1, are ak+1(xc)k+11/(k+1)=qkd|a_{k+1}(x-c)^{k+1}|^{1/(k+1)}=q_kd.

givenalgebra
2.1

If L=0L=0, then for d=0d=0 every root in step 1.1 is 00, while for d>0d>0 and any η>0\eta>0, [L2] applied with ε=η/d\varepsilon=\eta/d makes qkd<ηq_kd<\eta eventually. Thus lim supk(qkd)=0<1\limsup_k(q_kd)=0<1 for every xx.

step 1.1L2
2.2

Suppose 0<L<+0<L<+\infty. If d<1/Ld<1/L, choose a real tt with L<t<1/dL<t<1/d (with the second inequality omitted when d=0d=0). By [L2], qk<tq_k<t eventually, so lim supk(qkd)td<1\limsup_k(q_kd)\le td<1. If d>1/Ld>1/L, choose tt with 1/d<t<L1/d<t<L; [L2] gives qk>tq_k>t frequently, so lim supk(qkd)td>1\limsup_k(q_kd)\ge td>1.

step 1.1L2choose
2.3

If L=+L=+\infty and d>0d>0, then for every real M>0M>0 and every index NN there is kNk\ge N with qk>Mq_k>M: otherwise MM would bound a tail and its supremum, forcing the infimum of the tail suprema to be finite. Taking M>1/dM>1/d shows qkd>1q_kd>1 arbitrarily late, hence lim supk(qkd)>1\limsup_k(q_kd)>1.

L1step 1.1choose
3.1

By [L3] and [L4], step 2.1 gives absolute convergence at every real xx when L=0L=0; step 2.2 gives absolute convergence for d<1/Ld<1/L and divergence for d>1/Ld>1/L when 0<L<+0<L<+\infty; and step 2.3 gives divergence at every xcx\ne c when L=+L=+\infty, while the series converges at cc to a0a_0.

step 2.1step 2.2step 2.3L3L4
4.1

Reading these three alternatives through the definition of the radius yields R=+R=+\infty, R=1/LR=1/L, and R=0R=0, respectively, which is the stated convention-complete formula.

step 3.1

Depends on

Used by

Dependency tree · next 3 levels

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