Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedprecheck 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 sup⁡k→∞∣ak+1∣1/(k+1), with the zero and infinite cases included

Statement

Let ∑n≥0an(x−c)n be a real power series with radius R (A real power series about a centre, its interval of convergence, and its radius in [0,+∞]), and put

L:=lim sup⁡k→∞∣ak+1∣1/(k+1)∈[0,+∞].

Then R is the reciprocal of L in the following explicit sense:

R={+∞,L=0,1/L,0<L<+∞,0,L=+∞.

Equivalently, with the conventions 1/0:=+∞ and 1/(+∞):=0, one has R=1/L. The roots use ak+1 and the exponent 1/(k+1) because N starts at 0 and a zeroth root is undefined.

Facts & Assumptions

Given: A real power series ∑an(x−c)n, its radius R, the nonnegative root sequence qk:=∣ak+1∣1/(k+1), and L:=lim sup⁡kqk.

[L2]

If L is real, then for every real ε>0, qk<L+ε eventually and qk>L−ε frequently (For finite L: L=lim sup⁡xk iff for every ε>0 one has xk<L+ε eventually and xk>L−ε frequently).

[L3]

The root test says that a real series from index 1 converges absolutely when the limit superior of its shifted roots is <1, and diverges when that limit superior is >1 (Root test: lim sup⁡∣ak∣1/k<1 gives absolute convergence and hence convergence, >1 gives divergence, and =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 x∈R and put d:=∣x−c∣. The shifted roots of the terms an(x−c)n, n≥1, are ∣ak+1(x−c)k+1∣1/(k+1)=qkd.

givenalgebra
2.1

If L=0, then for d=0 every root in step 1.1 is 0, while for d>0 and any η>0, [L2] applied with ε=η/d makes qkd<η eventually. Thus lim sup⁡k(qkd)=0<1 for every x.

step 1.1L2
2.2

Suppose 0<L<+∞. If d<1/L, choose a real t with L<t<1/d (with the second inequality omitted when d=0). By [L2], qk<t eventually, so lim sup⁡k(qkd)≤td<1. If d>1/L, choose t with 1/d<t<L; [L2] gives qk>t frequently, so lim sup⁡k(qkd)≥td>1.

step 1.1L2choose
2.3

If L=+∞ and d>0, then for every real M>0 and every index N there is k≥N with qk>M: otherwise M would bound a tail and its supremum, forcing the infimum of the tail suprema to be finite. Taking M>1/d shows qkd>1 arbitrarily late, hence lim sup⁡k(qkd)>1.

L1step 1.1choose
3.1

By [L3] and [L4], step 2.1 gives absolute convergence at every real x when L=0; step 2.2 gives absolute convergence for d<1/L and divergence for d>1/L when 0<L<+∞; and step 2.3 gives divergence at every x≠c when L=+∞, while the series converges at c to a0.

step 2.1step 2.2step 2.3L3L4
4.1

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

step 3.1∎

Depends on

Used by

Dependency tree · two levels

44 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