Alphabeta Math
TheoremStatement: 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 converges absolutely and uniformly on every closed subdisc strictly inside its disc of convergence

Statement

Let ∑n≥0cn(z−a)n have radius R. For every real r with 0≤r<R, the series converges absolutely and uniformly on the closed disc ∣z−a∣≤r.

Facts & Assumptions

Given: A complex power series of radius R and 0≤r<R.

[L1]

The Cauchy–Hadamard theorem gives absolute convergence for ∣z−a∣<R, divergence for ∣z−a∣>R, and no boundary assertion (Cauchy-Hadamard for complex power series, including zero and infinite radius).

[L2]

The complex M-test gives uniform and pointwise absolute convergence under a convergent real majorant series (Weierstrass M-test for complex-valued function series).

[L3]

For complex numbers, ∣zw∣=∣z∣∣w∣ (Conjugation is an involutive real-field automorphism, zz‾=∣z∣2, and modulus is definite, multiplicative, and subadditive).

Proof

technique · direct
1.1L1

By [L1], the real series ∑∣cn∣rn converges, since it is the modulus series at any point whose distance from a is r; for r=0 it has only the constant contribution.

1.2L3algebra

If ∣z−a∣≤r, then [L3] gives ∣cn(z−a)n∣≤∣cn∣rn.

2.1step 1.1step 1.2L2∎

Apply [L2] to the majorants of step 1.1 and the bound of step 1.2. This also covers R=+∞ and makes no assertion when r=R.

Depends on

Used by

Dependency tree · two levels

18 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