Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Critical-line GRH for primitive Dirichlet characters (0<Re⁡(s)<10<\operatorname{Re}(s)<10<Re(s)<1)

Open
AlpoGeChallenge.LFunction_eq_zero_re_of_isPrimitive

by LG · Nov 20, 2026 · Mathlib 0df444a (Lean v4.33.1)

analytic-number-theorydirichlet-l-functionsgrhnumber-theoryriemann-hypothesis

Let N≥1N\ge1N≥1 be a modulus and χ\chiχ a primitive Dirichlet character modulo NNN, with LLL-function L(χ,s)L(\chi,s)L(χ,s). Every zero of L(χ,s)L(\chi,s)L(χ,s) in the open critical strip lies on the critical line:

0<Re⁡(s)<1,L(χ,s)=0 ⟹ Re⁡(s)=12.0<\operatorname{Re}(s)<1,\quad L(\chi,s)=0\ \Longrightarrow\ \operatorname{Re}(s)=\tfrac12.0<Re(s)<1,L(χ,s)=0 ⟹ Re(s)=21​.

This is the critical-line form of the generalized Riemann hypothesis for primitive Dirichlet characters, stated uniformly over every modulus. It is one of the five challenge targets of the alpo.ge submission (2026-11-20), transcribed verbatim from the Comparator challenge file.

Formalization Note. The statement quantifies over all moduli NNN with [NeZero N] and all primitive characters χ : DirichletCharacter ℂ N; the strip is open, and 1 / 2 is real division compared with s.re. The source's Prop abbreviation PrimitiveDirichletLZerosOnLine is inlined.

Preamble
import Mathlib
Formal statement
namespace AlpoGeChallenge

theorem LFunction_eq_zero_re_of_isPrimitive :
    ∀ (N : ℕ) [NeZero N] (χ : DirichletCharacter ℂ N), χ.IsPrimitive →
      ∀ s : ℂ, 0 < s.re → s.re < 1 → DirichletCharacter.LFunction χ s = 0 → s.re = 1 / 2 := by
  sorry

end AlpoGeChallenge
Source
https://github.com/Deicyde/riemann-hypothesis — src/Challenge.lean, theorem LFunction_eq_zero_re_of_isPrimitive (def PrimitiveDirichletLZerosOnLine); mirrors the alpo.ge submission of 2026-11-20 (https://alpo.ge/remark.pdf). Statement transcribed verbatim from the Comparator challenge.

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me