Lefschetz trace formula and Poincaré duality for Frobenius on the cohomology of a smooth projective variety over a finite field (Grothendieck)
OpenWeilConjectures.exists_frobenius_cohomology_poincare_dualityLet be a finite field of characteristic and let be a non-singular projective variety of dimension over : the structure morphism is smooth of relative dimension , geometrically irreducible and projective. For let .
Theorem. There exist a field of characteristic zero and finite-dimensional -vector spaces with endomorphisms such that:
- Lefschetz trace formula. For all ,
- Poincaré duality. For every there is a perfect bilinear pairing such that
With for a prime , and the action of the Frobenius endomorphism, item 1 is Grothendieck's Lefschetz trace formula and item 2 is Poincaré duality for -adic cohomology, where the cup product takes values in , on which Frobenius acts by .
These are the two cohomological inputs of Grothendieck's proof of the rationality and of the functional equation of the zeta function . The statement asks only for the existence of such data; it may be established with any cohomology theory with coefficients in a field of characteristic zero (-adic, crystalline, rigid).
Formalization Note The hypotheses are exactly those of WeilConjectures.rationality_functional_equation: SmoothOfRelativeDimension n f, GeometricallyIrreducible f and the platform's IsProjectiveOver k f; is pointCount p f m and is Nat.card k. The spaces are given in coordinates: is d i, and is a square matrix Φ i of size d i; the indices are not constrained. The pairing on is given by its Gram matrix G, a d i by d (2n - i) matrix with a two-sided inverse H, so that perfectness is G * H = 1 ∧ H * G = 1 and the compatibility with Frobenius reads . The field K lives in Type.
import Mathlib import Definitions.Def_WeilConjectures_projectiveSpace import Definitions.Def_WeilConjectures_zetaFunction open AlgebraicGeometry CategoryTheory Polynomial open WeilConjectures
theorem WeilConjectures.exists_frobenius_cohomology_poincare_duality (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) :
∃ (K : Type) (_ : Field K) (_ : CharZero K) (d : ℕ → ℕ)
(Φ : (i : ℕ) → Matrix (Fin (d i)) (Fin (d i)) K),
(∀ m : ℕ, 0 < m → (pointCount p f m : K) =
∑ i ∈ Finset.range (2 * n + 1), (-1 : K) ^ i * ((Φ i) ^ m).trace) ∧
(∀ 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) = (Nat.card k : K) ^ n • G) := by sorry