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 , the sum of over nontrivial zeros with is , with multiplicity. Adjoining any real nontrivial zeros preserves the estimate.
Facts & Assumptions
Given: The data and hypotheses of the statement.
A unit-interval bound for zeta zeros: The number of nontrivial zeta zeros, with multiplicity, whose ordinates lie in is for .
The Riemann zeta zero-counting function: For , is the number, with multiplicity, of nontrivial zeros of the meromorphic continuation of zeta satisfying . Thus a zero on the top boundary is included.
The Riemann xi function has its genus-one Hadamard product over the nontrivial zeros of zeta: There exist constants such that where the product runs over the nontrivial zeros of , counted with multiplicity, and The product converges in the genus-one canonical sense.
Proof
Nontrivial zeros have no accumulation in a compact subset of the plane. The finitely many with 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.
For each integer , zeros with each contribute at most . The count in either band is ; the negative band follows from , first on its defining half-plane and then by continuation. Therefore the remaining sum is at most . Endpoint overlap only increases this upper bound.
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
- §7.2, proof of Theorem 7.7 after Theorem 7.6 (standard reference, not scraped)