Skip to content

Section 2.4 · PDF page 8

The reduction from primitive characters

The notation transcription is provisional. Check it against the printed mathematics when citing or reusing a formula.

2.4 The reduction from primitive characters

A primitive-character object ψ consists of a positive modulus d, a primitive Dirichlet character χ_{ψ} modulo d, and the indicated primitivity certificate. Write ZF for

∀ψ  ∀s∈C,Re⁡s>12⟹L(s,χψ)≠0.\forall\psi\;\forall s\in\mathbb C,\qquad \operatorname{Re}s>\frac12\quad\Longrightarrow\quad L(s,\chi_\psi)\ne0.
Checked LaTeX
\forall\psi\;\forall s\in\mathbb C,\qquad \operatorname{Re}s>\frac12\quad\Longrightarrow\quad L(s,\chi_\psi)\ne0.

This is the source’s Formalism.HC.ZeroFreeAll: Formalism/SharpRestriction/RamificationFrobenius/TotientGaloisClasses/ExplicitFormulaErrorOfHostConditions.lean:11--18. For the primitive trivial character modulo one, L(s, 1_{1}) = ζ(s) by (4), so the universal quantifier in (7) also includes the total function’s assigned value at s = 1. We account for that point explicitly, matching the case split in Formalism/SharpRestriction/RamificationFrobenius/TotientGaloisClasses/Landau.lean:508--516: for s ̸= 1, the analytic nonvanishing of the regularized function ζ_{1}(s) = (s −1)ζ(s) (riemannZetaOne_eq_mul_of_ne_one) yields ζ(s) ̸= 0, whereas at s = 1 the assigned value of Mathlib’s total function ζ(1) is nonzero by the pinned Mathlib theorem riemannZeta_ne_zero_of_one_le_re. By contrast, both EC (6) and ordinary RH (1) explicitly exclude s = 1 for the trivial character, so the total function’s convention at the pole s = 1 plays no role in ordinary RH itself.

Proposition 2.4. The assertion ZF implies EC.

Source: Development/AutomorphicArithmetic/CharacterBoxes/Imprimitive.lean:5--35; UpperTheory.Top.imprimitive.

Proof. Fix N ≥ 1, a character χ modulo N, and s with σ = Re s > 1/2 and (χ ̸= 1_{N} or s ̸= 1). Let d = cond(χ) and let χ^{′} be its primitive character. The conductor facts in Mathlib/NumberTheory/DirichletCharacter/Basic.lean give d ̸= 0, d | N, primitivity of χ^{′}, and changeLevel_{d|N}(χ^{′}) = χ (conductor_ne_zero, conductor_dvd_level, primitiveCharacter_isPrimitive, and changeLevel_primitiveCharacter, the last at310–312). Thus ψ = (d, χ^{′}) is one of the objects quantified in (7), and L(s, χ^{′}) ̸= 0.

We also have χ^{′} ̸= 1_{d} or s ̸= 1. If s ̸= 1 this is immediate. Otherwise the original disjunction gives χ ̸= 1_{N}; if χ^{′}= 1_{d}, changing level would give χ = 1_{N}, a contradiction. Here change of level preserves the trivial character, the theorem changeLevel_one in the same pinned file.

We may therefore apply the exact continuation identity DirichletCharacter.LFunction_changeLevel, Mathlib/NumberTheory/LSeries/DirichletContinuation.lean:150--154:

L(s,χ)=L(s,χ′)∏p∣N(1−χ′(p)p−s).L(s,\chi)=L(s,\chi')\prod_{p\mid N}(1-\chi'(p)p^{-s}).
Checked LaTeX
L(s,\chi)=L(s,\chi')\prod_{p\mid N}(1-\chi'(p)p^{-s}).

The product ranges over distinct prime divisors of N; primes dividing d cause no problem since χ^{′}(p) = 0. All the identity’s hypotheses have been checked: both moduli are nonzero, d | N, and the preceding disjunction holds for χ^{′}.

For every prime in this product, p > 1 and |χ^{′}(p)| ≤1. The latter is the exact character bound DirichletCharacter.norm_le_one, Mathlib/NumberTheory/DirichletCharacter/Bounds.lean:33--37. Our complex-power convention gives |p^{−s}| = p^{−σ}< 1. Hence |χ^{′}(p)p^{−s}| ≤p^{−σ}< 1, so 1 −χ^{′}(p)p^{−s}̸= 0. The finite product in (8) is nonzero, as is its first factor. This proves (6) with its full modulus and character quantifiers.