Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Borel–Dwork rationality criterion (Dwork's Theorem 2, ppp-adically meromorphic case)

Proved
FiniteFields.Dwork.borelDwork_rationalityCriterion

by Idealson · Oct 20, 2026 · Mathlib 0df444a (Lean v4.33.1)

dwork-rationalityp-adic-analysispower-seriesweil-conjectures

Setting. Let ppp be a prime and let KKK be a field of characteristic 000, complete for a nontrivial nonarchimedean (ultrametric) absolute value ∣⋅∣K|\cdot|_K∣⋅∣K​, normalized so that

p−1≤∣p∣K<1.p^{-1} \le |p|_K < 1 .p−1≤∣p∣K​<1.

A power series G=∑mgmXm∈K[[X]]G = \sum_m g_m X^m \in K[[X]]G=∑m​gm​Xm∈K[[X]] is called entire if ∣gm∣K Rm→0|g_m|_K\, R^m \to 0∣gm​∣K​Rm→0 as m→∞m \to \inftym→∞ for every real R≥0R \ge 0R≥0. A series F∈K[[X]]F \in K[[X]]F∈K[[X]] is called ppp-adically meromorphic if there are entire series G,H∈K[[X]]G, H \in K[[X]]G,H∈K[[X]] with H(0)=1H(0) = 1H(0)=1 and H⋅F=GH \cdot F = GH⋅F=G.

Statement. Let F=∑m≥0amXm∈Q[[X]]F = \sum_{m \ge 0} a_m X^m \in \mathbb{Q}[[X]]F=∑m≥0​am​Xm∈Q[[X]] and assume:

  1. (integrality) am∈Za_m \in \mathbb{Z}am​∈Z for every m≥0m \ge 0m≥0;
  2. (Archimedean growth) there are rational numbers CCC and B≥1B \ge 1B≥1 such that ∣am∣≤C Bm|a_m| \le C\, B^m∣am​∣≤CBm for every m≥0m \ge 0m≥0;
  3. (ppp-adic meromorphy) the image of FFF in K[[X]]K[[X]]K[[X]] is ppp-adically meromorphic.

Then FFF is rational: there exist polynomials P,Q∈Q[X]P, Q \in \mathbb{Q}[X]P,Q∈Q[X] with Q≠0Q \ne 0Q=0, Q(0)≠0Q(0) \ne 0Q(0)=0 and

Q(X) F(X)=P(X)in Q[[X]].Q(X)\, F(X) = P(X) \qquad \text{in } \mathbb{Q}[[X]].Q(X)F(X)=P(X)in Q[[X]].

This is the rationality criterion of Dwork's §4 (Theorem 2), in the case where FFF is meromorphic on the whole ppp-adic plane: condition 2 says that FFF converges in the complex disc of radius 1/B1/B1/B, and the condition Rr>1Rr > 1Rr>1 of Theorem 2 holds automatically since r=∞r = \inftyr=∞. Applied to zeta functions, it turns ppp-adic meromorphy into rationality over Q\mathbb{Q}Q.

Formalization Note. Integrality is expressed by an auxiliary sequence z:N→Zz : \mathbb{N} \to \mathbb{Z}z:N→Z with am=zma_m = z_mam​=zm​. The constant CCC is not assumed positive. The field KKK replaces Dwork's Ω\OmegaΩ (the completion of an algebraic closure of Qp\mathbb{Q}_pQp​); the hypothesis p−1≤∣p∣K<1p^{-1} \le |p|_K < 1p−1≤∣p∣K​<1 relates its absolute value to the standard ppp-adic one. Rationality is IsRationalPowerSeries, and meromorphy is the global predicate IsPadicMeromorphic described above.

Preamble
import Mathlib
import Definitions.Def_FiniteFields_Dwork_Meromorphy

open PowerSeries Finset
open scoped Polynomial
open FiniteFields.Dwork
variable {K : Type*} [NontriviallyNormedField K] [IsUltrametricDist K] [CompleteSpace K]
variable [CharZero K]
Formal statement
theorem FiniteFields.Dwork.borelDwork_rationalityCriterion {p : ℕ} (hp : p.Prime)
    (hpnorm : ((p : ℝ))⁻¹ ≤ ‖(p : K)‖) (hplt : ‖(p : K)‖ < 1)
    (F : ℚ⟦X⟧) (z : ℕ → ℤ) (hz : ∀ m, PowerSeries.coeff m F = (z m : ℚ))
    {C B : ℚ} (hB : 1 ≤ B) (hgrowth : ∀ m : ℕ, |PowerSeries.coeff m F| ≤ C * B ^ m)
    (hmero : IsPadicMeromorphic (PowerSeries.map (algebraMap ℚ K) F)) :
    IsRationalPowerSeries F := by sorry
Source
B. Dwork, *On the rationality of the zeta function of an algebraic variety*, Amer. J. Math. 82 (1960), 631–648, §4, Theorem 2, (28)–(31), building on the result of Borel and the Hankel-determinant criterion (27); stated here in the special case where the series is meromorphic on the whole ppp-adic plane (r=∞r = \inftyr=∞). Lean: ported from the `finite_fields` project (commit e8b5bf14), file `WeilConjectures/Dwork/BorelDworkCriterion/Criterion.lean`, declaration `WeilConjectures.Dwork.borelDwork_rationalityCriterion`

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me