Skip to content

Section 2.2 · PDF page 7

The functional-equation argument

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

2.2 The functional-equation argument

Proposition 2.1. Suppose

∀w∈C,Re⁡w>12,w≠1⟹ζ(w)≠0.\forall w\in\mathbb{C},\qquad\operatorname{Re}w>\frac12,\quad w\ne1\quad\Longrightarrow\quad\zeta(w)\ne0.
Checked LaTeX
\forall w\in\mathbb{C},\qquad\operatorname{Re}w>\frac12,\quad w\ne1\quad\Longrightarrow\quad\zeta(w)\ne0.

Then the Riemann Hypothesis in (1) holds.

Source: Formalism/GammaFactorNonvanishing/RhOfRight.lean:5--62; Formalism.VW.rh_of_right.

Proof. Let s satisfy the three hypotheses on the left of (1). If Re s > 1/2, (5) contradicts ζ(s) = 0. If Re s = 1/2, the conclusion already holds. It remains to exclude Re s < 1/2.

First s ̸= 0, since otherwise ζ(s) = −1/2 by (i). Set w = 1 −s. Then Re w = 1 − Re s > 1/2 and w ̸= 1. For every n ∈ ℕ, the real part of −n is nonpositive, whereas Re w > 0; hence w ̸= −n. These verify every hypothesis of (ii), so (2) applies. Its left side is zero.

The factors 2 and (2π)^{−w} are nonzero. The factor Γ(w) is nonzero by (iii), since Re w > 0. The factor ζ(w) is nonzero by (5), since Re w > 1/2 and w ̸= 1. To handle the remaining factor, suppose cos(πw/2) = 0. By (iv), πw/2 = (2k+1)π/2 for an integer k. Cancelling the nonzero real number π gives w = 2k + 1, and therefore s = −2k. If k < 0, then k ≤−1 and Re s = −2k ≥2, contrary to Re s < 1/2. If k = 0, then s = 0, already excluded. If k > 0, set n = k −1 ∈ℕ; then s = −2(n + 1), contrary to the nontrivial-zero hypothesis. Thus the cosine factor is also nonzero. The right side of (2) is consequently a product of nonzero complex numbers, contradicting its zero left side. This excludes the remaining case.

Definition 2.2. Write EC for the statement

∀N≥1  ∀χ mod N  ∀s∈C,Re⁡s>12,(χ≠1N or s≠1)⟹L(s,χ)≠0.\forall N\ge1\;\forall\chi\bmod N\;\forall s\in\mathbb C,\qquad \operatorname{Re}s>\frac12,\quad (\chi\ne 1_N\text{ or }s\ne1)\quad\Longrightarrow\quad L(s,\chi)\ne0.
Checked LaTeX
\forall N\ge1\;\forall\chi\bmod N\;\forall s\in\mathbb C,\qquad \operatorname{Re}s>\frac12,\quad (\chi\ne 1_N\text{ or }s\ne1)\quad\Longrightarrow\quad L(s,\chi)\ne0.

This is exactly UpperTheory.EveryCharacter in Development/AutomorphicArithmetic/CharacterBoxes/EveryCharacter.lean:13--14. The typeclass condition NeZero N means N ̸= 0; for N ∈ℕ it is exactly the stated

Selectable PDF notation • transcription unchecked
N ≥1.

Proposition 2.3. The statement EC implies ordinary RH.

Source: Formalism/GammaFactorNonvanishing/CritLine.lean:29--32; Formalism.VW.rh_of_every.

Proof. For Re s > 1/2 and s ̸= 1, specialize (6) to N = 1 and χ = 1_{1}. The disjunction in that statement holds through s ̸= 1. Equation (4) therefore gives ζ(s) ̸= 0. Proposition 2.1 applies.