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.
Primitive Dirichlet L Functions and Functional Equations
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Analyticity of Holomorphic Functions; Liouville and Morera
- Arc Length and Rectifiable Curves
- Arithmetic Functions and Dirichlet Convolution
- Binary Operations, Monoids, Groups and Subgroups
- Bounded Variation and the Riemann–Stieltjes Integral
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Complex Coordinate and Path Transport
- Complex Differentiability and the Cauchy–Riemann Equations
- Complex Power Series and Analytic Functions
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Connectedness
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Contour Integration
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Determinants of Matrices over a Commutative Ring
- Dirichlet Characters L Functions and Primes in Progressions
- Dirichlet Series and Euler Products
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Probability and the Probabilistic Method
- Foundations of the Real Numbers for Analysis
- Fubini and Change of Variables
- Fundamental Trigonometric Identities
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Goursat's Theorem and Cauchy's Theorem in a Convex Domain
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Improper and Parameter-Dependent Multiple Integrals
- Improper Integrals
- Incidence Algebras and Möbius Inversion
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Line Integrals and the Gradient Theorem
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Metric Spaces
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Partitions of Unity and Paracompactness
- pi: the Equivalent Characterizations
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic
- Properties of the Integral and the Working FTC
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Separation Axioms: the Hierarchy
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Simple Field Extensions and the Construction of the Complex Numbers
- Sine, Cosine, and the Definition of Pi
- Subspaces, Products, and Quotients
- Suprema and Infima
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Complex Exponential and Euler's Formula
- The Derivative and the Mean Value Theorems
- The Exponential Function
- The Fundamental Theorems of Calculus
- The Gamma Function
- The Identity Theorem, the Maximum Principle and the Open Mapping Theorem
- The Inverse and Implicit Function Theorems
- The Logarithm and General Powers
- The Real Gamma and Beta Functions
- The Riemann Integral in Rᵐ and Jordan Content
- The Riemann Integral: Definition and Integrability
- The Topology of Euclidean Space
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Summary
This page fixes and . It develops primitive characters, their Gauss sums, and the parity-sensitive theta argument leading to the completed Dirichlet -function and its functional equation. The primitive principal character modulo remains the zeta exception.
3 · Logical flowchart
4 · Definitions, theorems and proofs
Induced Dirichlet characters
Definition
Let , and let be a Dirichlet character modulo . Its induction to modulus is the Dirichlet character modulo whose arithmetic function is Equivalently, on units modulo it is the pullback along reduction to units modulo . Thus it can be zero at an integer which is a unit modulo but not modulo ; this is stronger than merely composing unit-group maps.
Primitive Dirichlet characters and conductor
Definition
A character modulo is primitive if it is not induced from a proper divisor of . By Unique primitive ancestor of a Dirichlet character, every character has a unique primitive ancestor; its modulus is the conductor. The principal character modulo is primitive and has conductor .
Unique primitive ancestor of a Dirichlet character
Statement
Every Dirichlet character modulo is induced by a unique primitive character of a conductor dividing .
Facts & Assumptions
Given: A character modulo .
Reduction modulo a divisor gives the stated zero-extended induction (Induced Dirichlet characters).
CRT identifies residues modulo a product of pairwise coprime moduli with their local residues (Chinese remainder theorem for a finite pairwise-coprime list: simultaneous residues determine one class modulo the product, and the resulting bijection preserves addition and multiplication).
Proof
Write . For each , choose the least for which the local unit character factors through reduction modulo ; the finite set of possible exponents has such a least element.
CRT combines the resulting local characters into a character modulo , and [F1] shows that its induction has the same values as , including zero precisely on the nonunits modulo .
If a primitive character modulo induces , each of its local exponents must be at least ; minimality gives . If , its local character factors through a proper divisor, contradicting primitivity. Hence and CRT gives .
Finite Euler factors under character induction
Statement
If modulo is induced by its primitive ancestor modulo , then, for ,
Facts & Assumptions
Given: The indicated induced pair and .
The ancestor has conductor dividing (Unique primitive ancestor of a Dirichlet character).
Dirichlet -functions have their absolutely convergent Euler products in this half-plane (Euler product for Dirichlet L-functions).
Proof
In [F2], the local factors of and agree unless but ; at exactly those primes , while the primitive factor is .
Cancelling all common local factors and multiplying the finite exceptional set gives the displayed identity.
Gauss sum of a Dirichlet character
Definition
Put . For a character modulo , its Gauss sum is The displayed additive character and the complete residue system fix its phase.
Primitive Gauss-sum twist
Statement
If is primitive modulo , then for every integer ,
Facts & Assumptions
Given: A primitive modulo and .
The normalization of is fixed above (Gauss sum of a Dirichlet character).
Primitivity excludes induction from a proper divisor (Primitive Dirichlet characters and conductor).
Proof
If , substitution permutes the residue classes and gives the sum as .
If , choose a unit for which ; otherwise the unit character factors modulo , contrary to [F2]. Multiplication by leaves unchanged and multiplies the sum by , so the sum is zero.
In the second case , so the right side is also zero; the two cases prove the formula.
Norm of a primitive Gauss sum
Statement
For a primitive character modulo , .
Facts & Assumptions
Given: A primitive character modulo .
The primitive twist identity holds for every integer (Primitive Gauss-sum twist).
Proof
By the definition of the Gauss sum, Multiplying by and using [F1] with gives
The inner sum over is when and otherwise. Thus only remains, and the expression in step 1.1 is .
Parity of a Dirichlet character
Definition
Since , define by . The character is even for and odd for . The character modulo is even.
Fourier transform of a Gaussian
Statement
For and ,
Facts & Assumptions
Given: ; the Gaussian is a Schwartz function.
Proof
Put . The Gaussian integral The Gaussian integral , followed by , gives . On every compact -interval, the derivative of the integrand is dominated by a constant multiple of , so Differentiation under an improper multiple integral under an integrable derivative bound applied to real and imaginary parts gives
Since , integration by parts on and then (the boundary term tends to ) yields . Hence , and step 1.1 gives .
Substitute in the defining integral and apply step 2.1 to obtain the stated scaling.
Poisson summation
Statement
For every Schwartz function under ,
Facts & Assumptions
Given: A Schwartz function .
Proof
Define the periodization . Schwartz decay makes this series, and every termwise derivative series, converge uniformly on compact sets, so is a smooth -periodic function.
Its th Fourier coefficient is where absolute convergence justifies interchange and the intervals partition .
The sequence is rapidly decreasing, so the Fourier series of converges absolutely and uniformly to . Evaluating at gives
Twisted Poisson summation
Statement
For primitive modulo and Schwartz ,
Facts & Assumptions
Given: A primitive character modulo and a Schwartz function .
Poisson summation holds for Schwartz functions (Poisson summation).
The primitive additive twist is (Primitive Gauss-sum twist).
Proof
Decompose the left side by and apply [F1] to each translated, -scaled Schwartz function.
The finite coefficient of is , which is [F2]. Substitution gives the formula.
Completed primitive Dirichlet L-function
Definition
For primitive modulo of parity , define This is the completed function, not the entire xi-function used in a theta proof.
Analytic continuation of primitive Dirichlet L-functions
Statement
If primitive is nonprincipal, then and extend to entire functions. For the principal primitive character modulo , is meromorphic with its unique simple pole at , while is meromorphic with simple poles at and .
Facts & Assumptions
Given: A primitive character modulo of parity .
The Gaussian has the stated Fourier transform (Fourier transform of a Gaussian).
Twisted Poisson summation has the displayed -normalization (Twisted Poisson summation).
The reciprocal extends to an entire function (The Weierstrass product for reciprocal Gamma).
Proof
Suppose first that is nonprincipal, so and . Put for , with also at . Since , the positive and negative terms pair. Termwise Mellin integration, absolutely valid for , gives The last equality is the exact normalization of Completed primitive Dirichlet L-function.
Apply [F2] to . For , [F1] gives its Fourier transform directly. For , differentiating that transform with respect to frequency and using gives the extra factor . Thus in both parity cases The transformed character also has zero constant term because .
Split the Mellin integral of step 1.1 at and use step 2.1 on , then substitute . Writing gives Both theta kernels and all their derivatives in the displayed complex powers decay exponentially as the real variable tends to infinity, since their zero terms vanish and their remaining summands are a fixed polynomial times a Gaussian. Uniform domination on every compact -set makes both integrals entire in . They therefore continue entirely. Since is entire by [F4] and the other completion factor is entire and nonzero, is entire too.
The only primitive principal character has (Primitive Dirichlet characters and conductor). Now and has constant term , with by [F1] and [F2]. For , . Splitting at and using gives The integrals are entire by Gaussian decay. Their boundary terms give exactly simple poles at and , with nonzero residues and for . Multiplication by the entire reciprocal Gamma from [F4] cancels the pole at without introducing another pole, while its value at is nonzero by the product formula. Thus has exactly one simple pole, at .
Functional equation for primitive Dirichlet L-functions
Statement
For primitive modulo of parity , For this is the zeta functional equation.
Facts & Assumptions
Given: A primitive character modulo of parity .
The completion continues as stated (Analytic continuation of primitive Dirichlet L-functions).
Its normalization is fixed in Completed primitive Dirichlet L-function.
The Gaussian transform and twisted Poisson formula have the stated normalizations (Fourier transform of a Gaussian, Twisted Poisson summation).
Proof
Define, for , For , [F3] applied to gives For , differentiating the Gaussian transform gives so [F3] gives the same formula with the extra factor and exponent . Thus in both cases
Suppose first that . Then , so termwise integration for and parity give Substitute after using step 1.1; the exponent becomes , so the right side is . Thus the displayed equation holds for by [F1].
For , put . Step 1.1 becomes , while termwise integration gives Splitting at and substituting in the first piece yields The right side is invariant under and supplies its meromorphic continuation, so . Together with step 2.1 this proves the theorem.
Unit modulus of the Dirichlet root number
Statement
For primitive , .
Facts & Assumptions
Given: A primitive character .
Proof
Taking absolute values in [F1] gives .
Fact [F2] makes this quotient .
Parity-forced trivial zeros
Statement
For primitive nonprincipal of parity , for every . Thus occurs only in the even nonprincipal case; no zero at is asserted for the principal character modulo .
Facts & Assumptions
Given: A primitive nonprincipal of parity .
The completed function is entire for a primitive nonprincipal character (Analytic continuation of primitive Dirichlet L-functions).
Gamma has simple poles at the nonpositive integers (Meromorphic continuation of Gamma).
Proof
At , has a pole by [F2].
The regularity in [F1] forces to cancel that pole. The principal exception is outside the hypothesis.
5 · Examples, counterexamples and false statements
None yet.
Sources
- Nickolas Andersen, Analytic Number Theory, Lemma 16.1
- Nickolas Andersen, Analytic Number Theory, section 16.1
- Nickolas Andersen, Analytic Number Theory, Theorem 16.2
- Nickolas Andersen, Analytic Number Theory, equation (16.2)
- Nickolas Andersen, Analytic Number Theory, section 16.2
- Nickolas Andersen, Analytic Number Theory, Lemma 16.3
- Nickolas Andersen, Analytic Number Theory, Lemma 16.4
- Kiran S. Kedlaya, A Course in Analytic Number Theory, Definition 6.1
- Nickolas Andersen, Analytic Number Theory, Chapter 16 Gaussian transform
- Nickolas Andersen, Analytic Number Theory, Theorem 16.5
- Nickolas Andersen, Analytic Number Theory, Theorem 16.6
- Nickolas Andersen, Analytic Number Theory, section 16.3
- Nickolas Andersen, Analytic Number Theory, Theorems 16.7-16.8
- Andersen, Remark 16.9
- Andersen, sections 16.3.1-16.3.2