The Weil factorization with the Riemann hypothesis from a trace formula, Poincaré duality and upper bounds on Frobenius eigenvalues
ProvedWeilConjectures.weil_riemann_hypothesis_of_cohomology_weight_boundLet and be natural numbers and let be a field of characteristic zero. For let be a square matrix over of size (the matrix of an endomorphism of a -vector space of dimension ), and let be natural numbers. Assume:
- Trace formula. in for all .
- Poincaré duality. For every there is a perfect pairing with ; in matrices, an invertible with .
- . and .
- Upper bound on the weights. For every there is a nonzero such that the characteristic polynomial divides in , and every complex root of satisfies
In other words, every eigenvalue of is algebraic over and all its complex conjugates have absolute value at most .
Let , and let be coprime in with and .
Theorem. There are polynomials and finite multisets of nonzero complex numbers such that
, , in for , and
In fact : the statement includes that these polynomials have integer coefficients.
This is the formal part of the deduction of the Riemann hypothesis for varieties over finite fields from Deligne's estimate. Poincaré duality turns the upper bound on and on into the equality ; the weights then separate the factors of the zeta function, which forces them to have rational, hence integral, coefficients. It involves no geometry; is an arbitrary sequence.
Formalization Note is the platform's zetaOfCounts N; the conclusion has exactly the shape of the conclusion of WeilConjectures.riemann_hypothesis, with in place of Nat.card k. The matrices Φ i are indexed by all natural numbers , but only is used. The pairing is given by its Gram matrix G with an explicit inverse H. "Complex root of " is aeval z W = 0 for z : ℂ, and is the real power (q : ℝ) ^ ((i : ℝ) / 2). The hypothesis is 1 < q; it is needed to separate the weights.
import Mathlib import Definitions.Def_WeilConjectures_zetaFunction open Polynomial open WeilConjectures
theorem WeilConjectures.weil_riemann_hypothesis_of_cohomology_weight_bound
(N : ℕ → ℕ) (n q : ℕ) (hq : 1 < q) {K : Type*} [Field K] [CharZero K] (d : ℕ → ℕ)
(Φ : (i : ℕ) → Matrix (Fin (d i)) (Fin (d i)) K)
(htr : ∀ m : ℕ, 0 < m →
(N m : K) = ∑ i ∈ Finset.range (2 * n + 1), (-1 : K) ^ i * ((Φ i) ^ m).trace)
(hPD : ∀ i ≤ 2 * n, ∃ (G : Matrix (Fin (d i)) (Fin (d (2 * n - i))) K)
(H : Matrix (Fin (d (2 * n - i))) (Fin (d i)) K),
G * H = 1 ∧ H * G = 1 ∧ (Φ i).transpose * G * Φ (2 * n - i) = (q : K) ^ n • G)
(hd0 : d 0 = 1) (hΦ0 : Φ 0 = 1)
(hW : ∀ i ≤ 2 * n, ∃ W : ℚ[X], W ≠ 0 ∧ (Φ i).charpoly ∣ W.map (algebraMap ℚ K) ∧
∀ z : ℂ, aeval z W = 0 → ‖z‖ ≤ (q : ℝ) ^ ((i : ℝ) / 2))
(A B : ℤ[X]) (hA : A.coeff 0 = 1) (hB : B.coeff 0 = 1)
(hcop : IsCoprime (A.map (Int.castRingHom ℚ)) (B.map (Int.castRingHom ℚ)))
(hZ : zetaOfCounts N * ((B.map (Int.castRingHom ℚ) : ℚ[X]) : PowerSeries ℚ) =
((A.map (Int.castRingHom ℚ) : ℚ[X]) : PowerSeries ℚ)) :
∃ (P : ℕ → ℤ[X]) (α : ℕ → Multiset ℂ),
zetaOfCounts N *
(∏ 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 ((q : ℤ) ^ 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‖ = (q : ℝ) ^ ((i : ℝ) / 2)) := by sorry