Dwork's rationality theorem: the zeta function of a separated scheme of finite type over is with and coprime
ProvedFiniteFields.dwork_rationality_explicitSetting. Let be a finite field with elements and characteristic , and for every fix an extension of of degree . Let be a scheme with a structure morphism , and assume that
- is of finite type (locally of finite type and quasi-compact), and
- is separated.
For let
be the number of -points of over , i.e. of morphisms of schemes with ; this number is finite. The zeta function of is the formal power series
Theorem. There exist polynomials such that
- ;
- and are coprime in : there are with ;
- is the zeta series of the counts , in the sense that its constant term is and
a condition that determines uniquely; 4.
In other words, is a rational function, written in lowest terms with denominator normalized by .
This is Dwork's theorem (1960) on the rationality of the zeta function, the first of the Weil conjectures to be proved. Dwork proves it for varieties by -adic analysis and the rationality criterion of §4, and extends it to abstract varieties through a finite affine cover and inclusion–exclusion (§5, Application 2). Here it is stated for every separated scheme of finite type over ; need not be affine, reduced, irreducible, smooth or proper.
Formalization Note. Lean indexes the degree by , and is mathlib's FiniteField.Extension k p (n+1). The count is pointCount_of_finiteType k p X π hπ n, the cardinality (Nat.card) of the type of -morphisms , finite by the finite-type hypothesis. The series is Dwork.separatedFiniteTypeZetaSeries k p π hπ, the formal exponential of ; part 3 is the predicate IsZetaSeries, whose counting series is . Finite type is Schemes.FiniteType π, i.e. LocallyOfFiniteType π ∧ QuasiCompact π. The prime is an explicit parameter with [Fact p.Prime] and [CharP k p], the field lives in Type (universe ), and IsCoprime P Q means .
import Mathlib
import Definitions.Def_FiniteFields_Dwork_Devissage
open FiniteFields
open CategoryTheory AlgebraicGeometry PowerSeries
variable (k : Type) [Field k] [Finite k]
variable (p : ℕ) [Fact p.Prime] [CharP k p]
variable {X : Scheme} (π : X ⟶ Spec (.of k))theorem FiniteFields.dwork_rationality_explicit (hπ : Schemes.FiniteType π) (hsep : IsSeparated π) :
∃ P Q : Polynomial ℚ,
Q.eval 0 = 1 ∧ IsCoprime P Q ∧
IsZetaSeries (fun n ↦ pointCount_of_finiteType k p X π hπ n)
(Dwork.separatedFiniteTypeZetaSeries k p π hπ) ∧
(Q : PowerSeries ℚ) * Dwork.separatedFiniteTypeZetaSeries k p π hπ = (P : PowerSeries ℚ) := by sorry