Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Riemann hypothesis for varieties over finite fields (Deligne)

Open
WeilConjectures.riemann_hypothesis

by Lucas · Oct 12, 2026 · Mathlib 0df444a (Lean v4.33.1)

algebraic-geometrynumber-theoryzeta-function

Let k=Fqk=\mathbb F_qk=Fq​ be a finite field with qqq elements, of characteristic ppp, and let XXX be a non-singular projective variety of dimension nnn over kkk, i.e. f:X→Spec⁡kf: X\to\operatorname{Spec}kf:X→Speck is smooth of relative dimension nnn, geometrically irreducible and projective. Let Nm=#X(Fqm)N_m=\#X(\mathbb F_{q^m})Nm​=#X(Fqm​) and Z(X,T)=exp⁡(∑m≥1NmTm/m)∈Q[[T]]Z(X,T)=\exp\big(\sum_{m\ge1}N_mT^m/m\big)\in\mathbb Q[[T]]Z(X,T)=exp(∑m≥1​Nm​Tm/m)∈Q[[T]]. Then there are integer polynomials P0,…,P2n∈Z[T]P_0,\dots,P_{2n}\in\mathbb Z[T]P0​,…,P2n​∈Z[T] and finite multisets {αij}j\{\alpha_{ij}\}_j{αij​}j​ of nonzero complex numbers with

Z(X,T)⋅P0(T)P2(T)⋯P2n(T)=P1(T)P3(T)⋯P2n−1(T),Z(X,T)\cdot P_0(T)P_2(T)\cdots P_{2n}(T)=P_1(T)P_3(T)\cdots P_{2n-1}(T),Z(X,T)⋅P0​(T)P2​(T)⋯P2n​(T)=P1​(T)P3​(T)⋯P2n−1​(T),

P0(T)=1−TP_0(T)=1-TP0​(T)=1−T, P2n(T)=1−qnTP_{2n}(T)=1-q^nTP2n​(T)=1−qnT, and Pi(T)=∏j(1−αijT)P_i(T)=\prod_j(1-\alpha_{ij}T)Pi​(T)=∏j​(1−αij​T) in C[T]\mathbb C[T]C[T] for 1≤i≤2n−11\le i\le 2n-11≤i≤2n−1;

and moreover Riemann hypothesis: ∣αij∣=qi/2|\alpha_{ij}|=q^{i/2}∣αij​∣=qi/2 for all 1≤i≤2n−11\le i\le 2n-11≤i≤2n−1 and all jjj.

This is part 3 of the Weil conjectures, proved by Deligne (1974). It implies that the zeros of Pk(q−s)P_k(q^{-s})Pk​(q−s) lie on the line Re⁡s=k/2\operatorname{Re}s=k/2Res=k/2.

Formalization Note The finite field is a type k with [Field k] [Finite k] [CharP k p], qqq = Nat.card k; Fqm\mathbb F_{q^m}Fqm​ is FiniteField.Extension k p m; NmN_mNm​ counts kkk-morphisms Spec⁡Fqm→X\operatorname{Spec}\mathbb F_{q^m}\to XSpecFqm​→X; Z(X,T)Z(X,T)Z(X,T) is zetaFunction p f. Projectivity is a closed immersion into projectiveSpace k N over kkk.

Preamble
import Mathlib
import Definitions.Def_WeilConjectures_projectiveSpace
import Definitions.Def_WeilConjectures_zetaFunction

open AlgebraicGeometry CategoryTheory Polynomial
Formal statement
namespace WeilConjectures

theorem riemann_hypothesis (p : ℕ) [Fact p.Prime] (k : Type) [Field k] [Finite k] [CharP k p]
    (n : ℕ) (X : Scheme.{0}) (f : X ⟶ Spec (.of k))
    [SmoothOfRelativeDimension n f] [GeometricallyIrreducible f]
    (hproj : IsProjectiveOver k f) :
    ∃ (P : ℕ → ℤ[X]) (α : ℕ → Multiset ℂ),
      zetaFunction p f *
          (∏ i ∈ (Finset.range (2 * n + 1)).filter Even,
            ((P i).map (Int.castRingHom ℚ) : PowerSeries ℚ)) =
        ∏ i ∈ (Finset.range (2 * n + 1)).filter Odd,
            ((P i).map (Int.castRingHom ℚ) : PowerSeries ℚ) ∧
      P 0 = 1 - Polynomial.X ∧
      P (2 * n) = 1 - C ((Nat.card k : ℤ) ^ n) * Polynomial.X ∧
      (∀ i, 1 ≤ i → i ≤ 2 * n - 1 →
        (P i).map (Int.castRingHom ℂ) = ((α i).map fun a => 1 - C a * Polynomial.X).prod ∧
        ∀ a ∈ α i, a ≠ 0) ∧
      (∀ i, 1 ≤ i → i ≤ 2 * n - 1 → ∀ a ∈ α i,
        ‖a‖ = (Nat.card k : ℝ) ^ ((i : ℝ) / 2)) := by sorry

end WeilConjectures
Source
Wikipedia, "Weil conjectures", https://en.wikipedia.org/wiki/Weil_conjectures (PDF snapshot supplied by the proposer, 14 pp.), section "Statement of the Weil conjectures", items 1 and 3; section "Deligne's first proof of the Riemann hypothesis conjecture"
Human review
  • Endorsed by Shuze Chen · Oct 13, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Lucas · Oct 13, 2026

    Confirmed by the mission captain (proposal self-audit).

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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me