Alphabeta Math
CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-16
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.

A complex power-series sum has complex derivatives of every order, obtained by repeated termwise differentiation

Statement

If f(z)=∑n≥0cn(z−a)n has radius R, then for every k∈N and ∣z−a∣<R, f(k)(z)=∑n≥kn!(n−k)!cn(z−a)n−k. Every derived series has radius R.

Facts & Assumptions

Given: A complex power series f of radius R.

[L1]

A complex power series may be differentiated term by term inside its radius (Inside its disc of convergence a complex power series is holomorphic and may be differentiated term by term).

[L2]

A complex power series ∑n≥0cn(z−a)n, its formal derivative ∑n≥0(n+1)cn+1(z−a)n, and its zero-constant-term formal antiderivative ∑n≥0cn(z−a)n+1/(n+1) have the same radius of convergence (A complex power series, its formal derivative, and its zero-constant-term formal antiderivative have the same radius).

[L3]

Falling factorials satisfy nk‾=n!/(n−k)! when k≤n (The factorial n! and the falling factorial nk‾, defined by recursion in N).

Proof

technique · induction
1.1baseL3

For k=0, the displayed formula is the original series because n!/(n−0)!=1.

1.2ihL1L2L3

Assume the formula holds for k, with its series having radius R. [L2] is stated for one series and its formal derivative, so it is applied once at this induction step, to the kth series: its formal derivative again has radius R. That is exactly what the induction needs, and no claim about "every successive derivative" is taken from [L2] at once. Then [L1] differentiates termwise and changes the coefficient n!/(n−k)! into n!/(n−k−1)! for n≥k+1.

2.1step 1.1step 1.2discharge-induction∎

Thus the formula holds for k+1, and induction gives it for every k. The cases k>n contribute no term and k=0 was the base case.

Depends on

Used by

Dependency tree · two levels

21 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