Functional equation of a zeta series from a trace formula and Poincaré duality
ProvedWeilConjectures.zeta_functional_equation_of_trace_formula_of_poincare_dualityLet 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 ). Let be natural numbers and assume:
- Trace formula. For all ,
- Poincaré duality. For every there is a perfect pairing with
In matrices: there is a matrix with a two-sided inverse such that .
Let , and let be any polynomials with and in . For a polynomial of degree with write . Then there is a nonzero rational number such that
As , this is the functional equation
of the rational function : its divisor of zeros and poles is invariant under on inverse roots.
The statement is the formal part of Grothendieck's proof of the functional equation: the Lefschetz trace formula and Poincaré duality, for any cohomology theory with coefficients in a field of characteristic zero, imply the functional equation of the zeta function. It involves no geometry; is an arbitrary sequence.
Formalization Note is the platform's zetaOfCounts N. 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. The polynomial is A.reverse.comp (C (q ^ n) * X), and the conclusion has exactly the shape of the conclusion of FiniteFields.zeta_functional_equation. The presentation is not required to be reduced.
import Mathlib import Definitions.Def_WeilConjectures_zetaFunction open Polynomial open WeilConjectures
theorem WeilConjectures.zeta_functional_equation_of_trace_formula_of_poincare_duality
(N : ℕ → ℕ) (n q : ℕ) (hq : 0 < 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)
(A B : ℤ[X]) (hA : A.coeff 0 = 1) (hB : B.coeff 0 = 1)
(hZ : zetaOfCounts N * ((B.map (Int.castRingHom ℚ) : ℚ[X]) : PowerSeries ℚ) =
((A.map (Int.castRingHom ℚ) : ℚ[X]) : PowerSeries ℚ)) :
∃ c : ℚ, c ≠ 0 ∧
((A.reverse.comp (C ((q : ℤ) ^ n) * Polynomial.X)) * B).map (Int.castRingHom ℚ) =
C c * (A * (B.reverse.comp (C ((q : ℤ) ^ n) * Polynomial.X))).map
(Int.castRingHom ℚ) := by sorry