Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 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.

A Dirichlet series with absolute convergence on a right half-plane is determined there by its coefficients

Statement

Let f,g:Z>0C be arithmetic functions. Suppose the Dirichlet series

n1f(n)ns,n1g(n)ns

both converge absolutely on some half-plane s>σ, and agree there as functions. Then f(n)=g(n) for every n.

Facts & Assumptions

Given: Absolute convergence and equality of the two Dirichlet series on s>σ.

[L1]

A Dirichlet series is a sum anns (Dirichlet series).

Proof

technique · direct
1.1

Subtract the two series. It is enough to prove that if n1h(n)ns=0 for all s>σ and the series converges absolutely there, then h=0. Assume otherwise and let m be the least index with h(m)0.

L1givenassume-contra
2.1

For real t>σ, multiply the zero identity by mt: 0=h(m)+n>mh(n)(mn)t. Because the original series converges absolutely at one fixed real point t0>σ, the tail is dominated by n>mh(n)(mn)t0, and for each n>m the factor (m/n)t tends to 0 as t+. Hence the tail tends to 0, so letting t+ yields 0=h(m), contradiction.

step 1.1givenalgebra
3.1

Therefore no such least m exists and all coefficients agree.

step 1.1step 2.1discharge-contradiction

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

3 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