Under the Riemann hypothesis, the polynomials of the Weil conjectures are determined by the zeta series
ProvedFiniteFields.weil_polynomials_uniqueLet and be integers and let be a formal power series. Say that a family of polynomials , together with finite multisets of complex numbers, is a weight decomposition of if:
- in ;
- and ;
- for , in , and every is nonzero;
- for and every , .
If and are two weight decompositions of the same series , then
These are exactly the conclusions of the rationality and Riemann hypothesis parts of the Weil conjectures for a smooth projective variety of dimension over , with its zeta function. The statement says that the polynomials (and their inverse roots) are intrinsic to the zeta function: the absolute values of the inverse roots separate the factors. Consequently the Betti number statement of the Weil conjectures refers to well-defined polynomials.
Formalization Note Multisets are Lean Multiset ℂ, and are mapped to and through the canonical ring maps. The degree uses truncated subtraction, so for the conditions 3 and 4 are empty.
import Mathlib open Polynomial
theorem FiniteFields.weil_polynomials_unique (q n : ℕ) (hq : 1 < q) (Z : PowerSeries ℚ)
(P P' : ℕ → ℤ[X]) (α α' : ℕ → Multiset ℂ)
(h : Z * (∏ 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)))
(h' : Z * (∏ 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))) :
(∀ i ≤ 2 * n, P i = P' i) ∧ (∀ i, 1 ≤ i → i ≤ 2 * n - 1 → α i = α' i) := by sorry