Alphabeta Math
Pipeline-generated
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

2 · Summary

This page fixes e(x)=exp(2πix) and f^(ξ)=Rf(x)e(xξ)dx. It develops primitive characters, their Gauss sums, and the parity-sensitive theta argument leading to the completed Dirichlet L-function and its functional equation. The primitive principal character modulo 1 remains the zeta exception.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-06Open item page →

Induced Dirichlet characters

Definition

Let dq, and let χ be a Dirichlet character modulo d. Its induction to modulus q is the Dirichlet character χ modulo q whose arithmetic function is χ(n)={χ(n),(n,q)=1,0,(n,q)>1. Equivalently, on units modulo q it is the pullback along reduction to units modulo d. Thus it can be zero at an integer which is a unit modulo d but not modulo q; this is stronger than merely composing unit-group maps.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-06Open item page →

Primitive Dirichlet characters and conductor

Definition

A character modulo q is primitive if it is not induced from a proper divisor of q. By Unique primitive ancestor of a Dirichlet character, every character has a unique primitive ancestor; its modulus is the conductor. The principal character modulo 1 is primitive and has conductor 1.

TheoremStatement: Literature-sourcedProof: Literature-sourcedjudge pass (gpt-5.6-terra)audited 2026-09-06Open item page →

Unique primitive ancestor of a Dirichlet character

Statement

Every Dirichlet character modulo q is induced by a unique primitive character of a conductor dividing q.

Facts & Assumptions

Given: A character χ modulo q.

[F1]

Reduction modulo a divisor gives the stated zero-extended induction (Induced Dirichlet characters).

Proof

technique · direct
1.1

Write q=pep. For each p, choose the least cpep for which the local unit character factors through reduction modulo pcp; the finite set of possible exponents has such a least element.

givenconstruct
2.1

CRT combines the resulting local characters into a character χ modulo d=pcp, and [F1] shows that its induction has the same values as χ, including zero precisely on the nonunits modulo q.

F1F2step 1.1
3.1

If a primitive character modulo d induces χ, each of its local exponents must be at least cp; minimality gives dd. If d>d, its local character factors through a proper divisor, contradicting primitivity. Hence d=d and CRT gives χ=χ.

F2step 1.1
TheoremStatement: Literature-sourcedProof: Literature-sourcedjudge pass (gpt-5.6-terra)audited 2026-09-06Open item page →

Finite Euler factors under character induction

Statement

If χ modulo q is induced by its primitive ancestor χ modulo d, then, for Res>1, L(s,χ)=L(s,χ)pq, pd(1χ(p)ps).

Facts & Assumptions

Given: The indicated induced pair and Res>1.

[F1]

The ancestor has conductor dividing q (Unique primitive ancestor of a Dirichlet character).

[F2]

Dirichlet L-functions have their absolutely convergent Euler products in this half-plane (Euler product for Dirichlet L-functions).

Proof

technique · direct
1.1

In [F2], the local factors of χ and χ agree unless pq but pd; at exactly those primes χ(p)=0, while the primitive factor is (1χ(p)ps)1.

F1F2given
2.1

Cancelling all common local factors and multiplying the finite exceptional set gives the displayed identity.

step 1.1algebra
DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-06Open item page →

Gauss sum of a Dirichlet character

Definition

Put e(x)=exp(2πix). For a character χ modulo q, its Gauss sum is τ(χ)=amodqχ(a)e(a/q). The displayed additive character and the complete residue system fix its phase.

LemmaStatement: Literature-sourcedProof: Literature-sourcedjudge pass (gpt-5.6-terra)audited 2026-09-06Open item page →

Primitive Gauss-sum twist

Statement

If χ is primitive modulo q, then for every integer m, amodqχ(a)e(am/q)=χ(m)τ(χ).

Facts & Assumptions

Given: A primitive χ modulo q and mZ.

[F1]

The normalization of τ(χ) is fixed above (Gauss sum of a Dirichlet character).

[F2]

Primitivity excludes induction from a proper divisor (Primitive Dirichlet characters and conductor).

Proof

technique · cases
1.1

If (m,q)=1, substitution b=am permutes the residue classes and gives the sum as χ(m)τ(χ).

F1givenassume-case unit
2.1

If g=(m,q)>1, choose a unit u1(modq/g) for which χ(u)1; otherwise the unit character factors modulo q/g, contrary to [F2]. Multiplication by u leaves e(am/q) unchanged and multiplies the sum by χ(u), so the sum is zero.

F2step 1.1assume-case nonunit
3.1

In the second case χ(m)=0, so the right side is also zero; the two cases prove the formula.

step 2.1cases-exhaustive
TheoremStatement: Literature-sourcedProof: Literature-sourcedjudge pass (gpt-5.6-terra)audited 2026-09-06Open item page →

Norm of a primitive Gauss sum

Statement

For a primitive character χ modulo q, τ(χ)2=q.

Facts & Assumptions

Given: A primitive character χ modulo q.

[F1]

The primitive twist identity holds for every integer (Primitive Gauss-sum twist).

Proof

technique · direct
1.1

By the definition of the Gauss sum, τ(χ)=amodqχ(a)e(a/q). Multiplying by τ(χ) and using [F1] with m=a gives τ(χ)2=amodqbmodqχ(b)e(ab/q)e(a/q).

F1givenalgebra
2.1

The inner sum over a is q when b1(modq) and 0 otherwise. Thus only b=1 remains, and the expression in step 1.1 is qχ(1)=q.

step 1.1algebra
DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-06Open item page →

Parity of a Dirichlet character

Definition

Since χ(1){1,1}, define a{0,1} by χ(1)=(1)a. The character is even for a=0 and odd for a=1. The character modulo 1 is even.

LemmaStatement: Literature-sourcedProof: Literature-sourcedjudge pass (gpt-5.6-terra)audited 2026-09-06Open item page →

Fourier transform of a Gaussian

Statement

For t>0 and f^(ξ)=Rf(x)e(xξ)dx, eπtx2^(ξ)=t1/2eπξ2/t.

Facts & Assumptions

Given: t>0; the Gaussian is a Schwartz function.

Proof

technique · direct
1.1

Put G(ξ)=Reπx2e(xξ)dx. The Gaussian integral The Gaussian integral ex2dx=π, followed by u=πx, gives G(0)=1. On every compact ξ-interval, the derivative of the integrand is dominated by a constant multiple of xeπx2, so Differentiation under an improper multiple integral under an integrable derivative bound applied to real and imaginary parts gives G(ξ)=R(2πix)eπx2e(xξ)dx.

given
2.1

Since (eπx2)=2πxeπx2, integration by parts on [R,R] and then R (the boundary term tends to 0) yields G(ξ)=2πξG(ξ). Hence (eπξ2G(ξ))=0, and step 1.1 gives G(ξ)=eπξ2.

step 1.1algebra
3.1

Substitute u=tx in the defining integral and apply step 2.1 to obtain the stated t1/2 scaling.

step 2.1algebra
TheoremStatement: Literature-sourcedProof: Literature-sourcedjudge pass (gpt-5.6-terra)audited 2026-09-06Open item page →

Poisson summation

Statement

For every Schwartz function f under f^(ξ)=f(x)e(xξ)dx, nZf(n)=mZf^(m).

Facts & Assumptions

Given: A Schwartz function f.

Proof

technique · direct
1.1

Define the periodization F(x)=nZf(x+n). Schwartz decay makes this series, and every termwise derivative series, converge uniformly on compact sets, so F is a smooth 1-periodic function.

given
2.1

Its mth Fourier coefficient is 01F(x)e(mx)dx=nZ01f(x+n)e(m(x+n))dx=f^(m), where absolute convergence justifies interchange and the intervals [n,n+1] partition R.

step 1.1
3.1

The sequence (f^(m))mZ is rapidly decreasing, so the Fourier series of F converges absolutely and uniformly to F. Evaluating at 0 gives nZf(n)=F(0)=mZf^(m).

step 2.1
TheoremStatement: Literature-sourcedProof: Literature-sourcedjudge pass (gpt-5.6-terra)audited 2026-09-06Open item page →

Twisted Poisson summation

Statement

For primitive χ modulo q and Schwartz f, nZχ(n)f(n)=τ(χ)qmZχ(m)f^(m/q).

Facts & Assumptions

Given: A primitive character χ modulo q and a Schwartz function f.

[F1]

Poisson summation holds for Schwartz functions (Poisson summation).

[F2]

The primitive additive twist is χ(m)τ(χ) (Primitive Gauss-sum twist).

Proof

technique · direct
1.1

Decompose the left side by na(modq) and apply [F1] to each translated, q-scaled Schwartz function.

F1given
2.1

The finite coefficient of f^(m/q)/q is amodqχ(a)e(am/q), which is [F2]. Substitution gives the formula.

F2step 1.1algebra
DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-06Open item page →

Completed primitive Dirichlet L-function

Definition

For primitive χ modulo q of parity a, define Λ(s,χ)=(qπ)(s+a)/2Γ((s+a)/2)L(s,χ). This is the completed function, not the entire xi-function used in a theta proof.

TheoremStatement: Literature-sourcedProof: Literature-sourcedjudge pass (gpt-5.6-terra)audited 2026-09-06Open item page →

Analytic continuation of primitive Dirichlet L-functions

Statement

If primitive χ is nonprincipal, then L(s,χ) and Λ(s,χ) extend to entire functions. For the principal primitive character modulo 1, L=ζ is meromorphic with its unique simple pole at s=1, while Λ(s,χ)=πs/2Γ(s/2)ζ(s) is meromorphic with simple poles at s=0 and s=1.

Facts & Assumptions

Given: A primitive character χ modulo q of parity a.

[F1]

The Gaussian has the stated Fourier transform (Fourier transform of a Gaussian).

[F2]

Twisted Poisson summation has the displayed q-normalization (Twisted Poisson summation).

Proof

technique · direct
1.1

Mellin-transform n1χ(n)naeπn2t/q; for Res>1 this equals a nonzero constant times Λ(s,χ).

givenalgebra
2.1

Apply [F1] in [F2] to transform the theta kernel under t1/t. Splitting the Mellin integral at 1 gives two rapidly decaying integrals, hence an entire continuation when χ is nonprincipal.

F1F2step 1.1
3.1

The only primitive principal case is q=1. Splitting the Mellin integral for the Jacobi theta kernel and separating its constant term continues πs/2Γ(s/2)ζ(s) meromorphically, with the two boundary terms giving simple poles at s=0 and s=1. Equivalently, the standard entire completion is 12s(s1)πs/2Γ(s/2)ζ(s). Fact [F3] separately says that L=ζ itself has only its simple pole at s=1.

F1F3step 2.1algebra
TheoremStatement: Literature-sourcedProof: Literature-sourcedjudge pass (gpt-5.6-terra)audited 2026-09-06Open item page →

Functional equation for primitive Dirichlet L-functions

Statement

For primitive χ modulo q of parity a, Λ(s,χ)=ε(χ)Λ(1s,χ),ε(χ)=(i)aτ(χ)/q. For q=1 this is the zeta functional equation.

Facts & Assumptions

Given: A primitive character χ modulo q of parity a.

[F1]

The completion continues as stated (Analytic continuation of primitive Dirichlet L-functions).

[F2]

Its normalization is fixed in Completed primitive Dirichlet L-function.

[F3]

The Gaussian transform and twisted Poisson formula have the stated normalizations (Fourier transform of a Gaussian, Twisted Poisson summation).

Proof

technique · direct
1.1

Define, for t>0, θχ(t)=nZnaχ(n)eπn2t/q. For a=0, [F3] applied to xeπtx2/q gives θχ(t)=τ(χ)qt1/2θχ(1/t). For a=1, differentiating the Gaussian transform gives xeπtx2/q^(m/q)=imqt3/2eπm2/(qt), so [F3] gives the same formula with the extra factor i and exponent t3/2. Thus in both cases θχ(t)=ε(χ)ta1/2θχ(1/t).

F3givenalgebra
2.1

Suppose first that q>1. Then χ(0)=0, so termwise integration for Res>1 and parity give 2Λ(s,χ)=0θχ(t)t(s+a)/21dt. Substitute t=1/u after using step 1.1; the exponent becomes u(1s+a)/21, so the right side is 2ε(χ)Λ(1s,χ). Thus the displayed equation holds for q>1 by [F1].

F1F2step 1.1algebra
3.1

For q=1, put θ(t)=nZeπn2t. Step 1.1 becomes θ(t)=t1/2θ(1/t), while termwise integration gives 2Λ(s,1)=0(θ(t)1)ts/21dt(Res>1). Splitting at 1 and substituting t=1/u in the first piece yields 2Λ(s,1)=1(θ(t)1)(ts/21+t(1s)/21)dt+2s(s1). The right side is invariant under s1s and supplies its meromorphic continuation, so Λ(s,1)=Λ(1s,1). Together with step 2.1 this proves the theorem.

F1F2step 1.1algebra
CorollaryStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-06Open item page →

Unit modulus of the Dirichlet root number

Statement

For primitive χ, ε(χ)=1.

Facts & Assumptions

Given: A primitive character χ.

[F1]

ε(χ)=(i)aτ(χ)/q (Functional equation for primitive Dirichlet L-functions).

[F2]

τ(χ)2=q (Norm of a primitive Gauss sum).

Proof

technique · direct
1.1

Taking absolute values in [F1] gives ε(χ)=τ(χ)/q.

F1given
2.1

Fact [F2] makes this quotient 1.

F2step 1.1algebra
CorollaryStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-06Open item page →

Parity-forced trivial zeros

Statement

For primitive nonprincipal χ of parity a, L(a2m,χ)=0 for every m0. Thus 0 occurs only in the even nonprincipal case; no zero at 0 is asserted for the principal character modulo 1.

Facts & Assumptions

Given: A primitive nonprincipal χ of parity a.

[F1]

The completed function is entire for a primitive nonprincipal character (Analytic continuation of primitive Dirichlet L-functions).

[F2]

Gamma has simple poles at the nonpositive integers (Meromorphic continuation of Gamma).

Proof

technique · direct
1.1

At s=a2m, Γ((s+a)/2) has a pole by [F2].

F2given
2.1

The regularity in [F1] forces L(s,χ) to cancel that pole. The principal exception is outside the hypothesis.

F1step 1.1

5 · Examples, counterexamples and false statements

None yet.

Sources