Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-09-04
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.

Convergence at one point of a Dirichlet series forces local uniform convergence on the open half-plane to its right

Statement

Let D(s)=∑n≥1ann−s be a Dirichlet series. If it converges at some point s0, then it converges locally uniformly on the half-plane ℜs>ℜs0 and therefore defines a holomorphic function there.

Facts & Assumptions

Given: A Dirichlet series D(s)=∑n≥1ann−s converging at s0, and a compact set K⊆{s:ℜs>ℜs0}.

[L1]

Abel summation for complex series rewrites ∑n=MNunbn in terms of the partial sums of (un) (Abel summation by parts for complex coefficients and their partial sums).

Proof

technique · direct
1.1L1givenalgebra

Write σ0:=ℜs0 and un:=ann−s0. Since ∑un converges, its partial sums UN are bounded: ∣UN∣≤B. Put ε:=min⁡s∈K(ℜs−σ0)>0. For s∈K, apply [L1] to the tail with weights bn=n−(s−s0). Because bn−bn+1=OK(n−1−ε) and ∣bN∣≤N−ε, there is a constant CK such that ∣∑n=MNann−s∣≤CKB(M−ε+∑n=MN−1n−1−ε). The right-hand side tends to 0 uniformly in s∈K, so the series converges uniformly on K.

2.1L2step 1.1∎

Each partial sum is holomorphic, being a finite linear combination of the holomorphic functions s↦n−s. Since the convergence is uniform on every compact subset of the half-plane, [L2] makes the limit holomorphic there.

Depends on

Used by

Dependency tree · two levels

22 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