riemann

The Lean code claims a proof of the Riemann Hypothesis. This site has not checked the claim yet. See what is checked.

From primitive to all Dirichlet characters

drafted

Statement

Assume ZeroFreeAll: for each primitive Dirichlet character ψ\psi and each s∈ℂs \in \mathbb{C} with Re⁡(s)>12\operatorname{Re}(s) > \tfrac12, L(s,ψ)≠0L(s, \psi) \neq 0. Here LL is the Dirichlet L-function of Mathlib, DirichletCharacter.LFunction.

Let N≠0N \neq 0 be a natural number, let χ\chi be a Dirichlet character modulo NN with values in ℂ\mathbb{C}, and let s∈ℂs \in \mathbb{C}. Suppose that Re⁡(s)>12\operatorname{Re}(s) > \tfrac12, and that χ≠1\chi \neq 1 or s≠1s \neq 1. Then L(s,χ)≠0L(s, \chi) \neq 0.

The conclusion is the statement EveryCharacter.

Lean

theorem UpperTheory.Top.imprimitive : ZeroFreeAll → ∀ (N : ℕ) [NeZero N] (χ : DirichletCharacter ℂ N) (s : ℂ), 1 / 2 < s.re → (χ ≠ 1 ∨ s ≠ 1) → DirichletCharacter.LFunction χ s ≠ 0

The declaration is in Development/AutomorphicArithmetic/CharacterBoxes/Imprimitive.lean, line 5. Its page has the full list of what it uses and what uses it, and a link to the source.

Proof

Let hh be the proof of ZeroFreeAll. Let qq be the conductor of χ\chi, and let χ∗\chi^* be the primitive character modulo qq that induces χ\chi (Mathlib χ.primitiveCharacter).

  1. The conductor qq is not zero. The proof gets this from the structure PChar.of χ, which packs qq, χ∗\chi^* and the proof that χ∗\chi^* is primitive. This is bookkeeping.
  2. By hh applied to PChar.of χ, L(s,χ∗)≠0L(s, \chi^*) \neq 0.
  3. The proof shows χ∗≠1\chi^* \neq 1 or s≠1s \neq 1. If χ≠1\chi \neq 1, suppose χ∗=1\chi^* = 1. The lemma changeLevel_primitiveCharacter says that χ\chi is the change of level of χ∗\chi^* from qq to NN. The lemma changeLevel_one says that the change of level of the trivial character is trivial. So χ=1\chi = 1, a contradiction. If s≠1s \neq 1, the claim is immediate.
  4. The Mathlib lemma DirichletCharacter.LFunction_changeLevel, applied to q∣Nq \mid N (conductor_dvd_level), to χ∗\chi^* and to the fact of part 3, gives the Euler product relation L(s,χ)=L(s,χ∗)∏p∣N(1−χ∗(p) p−s), L(s, \chi) = L(s, \chi^*) \prod_{p \mid N} \bigl(1 - \chi^*(p)\, p^{-s}\bigr), where pp runs over the prime factors of NN. The proof rewrites the change of level of χ∗\chi^* back to χ\chi with changeLevel_primitiveCharacter.
  5. By mul_ne_zero and Finset.prod_ne_zero_iff, it is enough to show that each factor 1−χ∗(p)p−s1 - \chi^*(p) p^{-s} is not zero. Let pp be a prime factor of NN, and suppose 1−χ∗(p)p−s=01 - \chi^*(p) p^{-s} = 0. Then χ∗(p)p−s=1\chi^*(p) p^{-s} = 1 (by linear_combination).
  6. By DirichletCharacter.norm_le_one, ∣χ∗(p)∣≤1|\chi^*(p)| \leq 1. By Complex.norm_natCast_cpow_of_pos, ∣p−s∣=p−Re⁡(s)|p^{-s}| = p^{-\operatorname{Re}(s)}. Since p>1p > 1 and −Re⁡(s)<0-\operatorname{Re}(s) < 0, Real.rpow_lt_one_of_one_lt_of_neg gives p−Re⁡(s)<1p^{-\operatorname{Re}(s)} < 1. So ∣χ∗(p)p−s∣≤∣p−s∣<1|\chi^*(p) p^{-s}| \leq |p^{-s}| < 1.
  7. With part 5, this gives 1=∣1∣<11 = |1| < 1, a contradiction.

Notes

The proof uses ZeroFreeAll only once, for the primitive character χ∗\chi^*. The hypothesis Re⁡(s)>12\operatorname{Re}(s) > \tfrac12 goes into that use and into part 6, where only Re⁡(s)>0\operatorname{Re}(s) > 0 is needed.

The proof never uses ZeroFreeAll at s=1s = 1 for χ∗=1\chi^* = 1. By part 3, if χ∗=1\chi^* = 1 then s≠1s \neq 1.

The user of this step is EveryCharacter from Green, VWin and HypsAlt, which applies it to ZeroFreeAll from Green, VWin and HypsAlt.

Uses

The proof also uses these declarations in a routine way, for example to unfold a definition or to pass an argument on: Formalism.HC.PChar.of.

The proof cites these declarations, but their steps are not written yet. The text above tells what each one gives: Formalism.HC.ZeroFreeAll.

Used by

Status

Drafted. The text follows the Lean code, but no person has checked it against the code with the rules of spec 05.7 yet. If you check it, tell us.

A model wrote the first draft (writer@claude-opus-5-5). A person checks it before its status goes up.

The source of this page. Markdown. Something is wrong? Report it.