Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-07
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.

Zeta reciprocal zero sum bound

Statement

For T2, the sum of 1/ρ over nontrivial zeros with 0<ImρT is O(log2T), with multiplicity. Adjoining any real nontrivial zeros preserves the estimate.

Facts & Assumptions

Given: The data and hypotheses of the statement.

[F1]

A unit-interval bound for zeta zeros: The number of nontrivial zeta zeros, with multiplicity, whose ordinates lie in [T,T+1] is O(log(T+2)) for T0.

[F2]

The Riemann zeta zero-counting function: For T>0, N(T) is the number, with multiplicity, of nontrivial zeros ρ=β+iγ of the meromorphic continuation of zeta satisfying 0<γT. Thus a zero on the top boundary is included.

[F3]

The Riemann xi function has its genus-one Hadamard product over the nontrivial zeros of zeta: There exist constants A,BC such that ξ(s)=eA+BsρE1(s/ρ), where the product runs over the nontrivial zeros ρ of ζ, counted with multiplicity, and E1(w)=(1w)ew. The product converges in the genus-one canonical sense.

Proof

1.1

Nontrivial zeros have no accumulation in a compact subset of the plane. The finitely many with Imρ1 have nonzero denominator: the product for xi has no zero at zero, and its factors have exactly the nontrivial zeros. Their reciprocal sum is a fixed finite constant.

F3
2.1

For each integer n1, zeros with nImρn+1 each contribute at most 1/n. The count in either band is O(log(n+2)); the negative band follows from ζ(s)=ζ(s), first on its defining half-plane and then by continuation. Therefore the remaining sum is at most CnTlog(n+2)/n=O(log2T). Endpoint overlap only increases this upper bound.

F1F2step 1.1

Depends on

Used by

Dependency tree · two levels

12 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