A trace formula gives the cohomological expression of the zeta series:
ProvedWeilConjectures.zetaOfCounts_mul_prod_charpolyRev_of_trace_formulaLet be a field of characteristic zero, let be a finite set of natural numbers and, for every , let be a square matrix over of size . Let be a sequence of natural numbers that satisfies the trace formula
and let
Then, in ,
Equivalently, . It rests on the identity .
This is the formal step from a Lefschetz trace formula for Frobenius to the rationality of the zeta function: if is the number of -points of a variety and is the matrix of Frobenius on its -th cohomology group, the statement expresses as the alternating product of the polynomials .
Formalization Note is the platform's zetaOfCounts N (the value is ignored), viewed in through PowerSeries.map (algebraMap ℚ K). The polynomial is Mathlib's Matrix.charpolyRev (Φ i), coerced to a power series. The index set s is an arbitrary finite set of natural numbers; for a variety of dimension it is .
import Mathlib import Definitions.Def_WeilConjectures_zetaFunction open WeilConjectures
theorem WeilConjectures.zetaOfCounts_mul_prod_charpolyRev_of_trace_formula {K : Type*} [Field K]
[CharZero K] (N : ℕ → ℕ) (s : Finset ℕ) (d : ℕ → ℕ)
(Φ : (i : ℕ) → Matrix (Fin (d i)) (Fin (d i)) K)
(htr : ∀ m : ℕ, 0 < m → (N m : K) = ∑ i ∈ s, (-1 : K) ^ i * ((Φ i) ^ m).trace) :
PowerSeries.map (algebraMap ℚ K) (zetaOfCounts N) *
∏ i ∈ s.filter Even, (((Φ i).charpolyRev : Polynomial K) : PowerSeries K) =
∏ i ∈ s.filter Odd, (((Φ i).charpolyRev : Polynomial K) : PowerSeries K) := by sorry