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.
Nonprincipal Dirichlet L-functions are holomorphic on Re s greater than 0
Statement
If is a Dirichlet character, then the Dirichlet series converges for every and defines a holomorphic function there.
Facts & Assumptions
Given: A nonprincipal Dirichlet character .
The partial sums satisfy (Nonprincipal Dirichlet character partial sums are bounded).
The Dirichlet -function is the Dirichlet series (Dirichlet L-functions).
Proof
Apply [L2] to the coefficients with . By [L1], the summatory function is bounded, so for every one has , and the integral converges absolutely and locally uniformly on each half-plane because and .
A locally uniformly convergent parameter integral of holomorphic integrands is holomorphic in the parameter. Hence the right-hand side of step 1.1 defines a holomorphic function on , and on the smaller half-plane it agrees with the defining Dirichlet series [L3]. Therefore is holomorphic on .
Depends on
Used by
- The character chi₄ and the Gregory-Leibniz series Example
- A nonreal Dirichlet L-function is nonzero at one Lemma
- A real nonprincipal Dirichlet L-function is nonzero at one Lemma
- Mertens sum for primes in an arithmetic progression Theorem
- Primes in one reduced residue class have Dirichlet density 1 over phi(q) Theorem
- The full product of Dirichlet L-functions has no zero on Re s = 1 Theorem
Dependency tree · two levels
8 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.5 (standard reference, not scraped)
- Andrew V. Sutherland, Number Theory I, Proposition 18.20 (standard reference, not scraped)