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.
The full product of Dirichlet L-functions has no zero on Re s = 1
Statement
Let
Then has no zero on the line . Moreover, is meromorphic on a neighbourhood of the closed half-plane , and any singularity at is at most a simple pole.
Facts & Assumptions
Given: A modulus and the product .
For unit classes, the character sum is when and otherwise (Orthogonality relations for Dirichlet characters modulo q).
Each has its Euler product on (Euler product for Dirichlet L-functions).
The principal factor has one simple pole at (The principal Dirichlet L-function factors through zeta).
Every nonprincipal factor is holomorphic on (Nonprincipal Dirichlet L-functions are holomorphic on Re s greater than 0).
An Euler product whose logarithmic Dirichlet coefficients are nonnegative cannot vanish on if it has at most a simple pole at (Positive logarithmic Dirichlet series force boundary nonvanishing).
Proof
For , [L2] gives . If , then every term is . If , then [L1] applied to the unit class of shows that the inner character sum is when and otherwise. Hence the logarithmic coefficients of are nonnegative.
By [L3] and [L4], the product is meromorphic on a neighbourhood of , with at most a simple pole at and no other singularities on the boundary line. Step 1.1 therefore places under [L5], so has no zero on . This proves both the nonvanishing claim and the stated meromorphic control at .
Depends on
Used by
Dependency tree · two levels
20 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
- Kiran S. Kedlaya, Notes on Analytic Number Theory, Theorem 3.7 (standard reference, not scraped)
- Leonard Tomczak, Analytic Number Theory, Chapter 4 (standard reference, not scraped)