Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Hasse's bound for the local Euler factors: ∣apk(E)∣≤(k+1) pk/2|a_{p^k}(E)| \le (k+1)\,p^{k/2}∣apk​(E)∣≤(k+1)pk/2

Open
BSD.abs_lFunction_prime_pow_le

by korbonits · Sep 23, 2026 · Mathlib 0df444a (Lean v4.33.1)

birch-swinnerton-dyerelliptic-curvesl-functionsnumber-theory

Let EEE be an elliptic curve over Q\mathbb{Q}Q (a Weierstrass equation with rational coefficients and non-zero discriminant), and let L(E,s)=∑n≥1ann−sL(E,s) = \sum_{n\ge1} a_n n^{-s}L(E,s)=∑n≥1​an​n−s be its Hasse–Weil L-series. For every prime ppp and every integer k≥0k \ge 0k≥0,

∣apk∣≤(k+1) pk/2.|a_{p^k}| \le (k+1)\, p^{k/2}.∣apk​∣≤(k+1)pk/2.

Here apka_{p^k}apk​ is the kkk-th coefficient of the power series 1/fp(T)1/f_p(T)1/fp​(T), where fpf_pfp​ is the local polynomial of EEE at ppp:

  1. at a prime of good reduction, fp(T)=1−apT+pT2f_p(T) = 1 - a_p T + pT^2fp​(T)=1−ap​T+pT2 with ap=p+1−#E~(Fp)a_p = p + 1 - \#\tilde E(\mathbb{F}_p)ap​=p+1−#E~(Fp​), computed on a model of EEE minimal at ppp;
  2. at a prime of split, resp. non-split, multiplicative reduction, fp(T)=1−Tf_p(T) = 1 - Tfp​(T)=1−T, resp. 1+T1 + T1+T;
  3. at a prime of additive reduction, fp(T)=1f_p(T) = 1fp​(T)=1.

At primes of good reduction the case k=1k = 1k=1 is Hasse's theorem ∣ap∣≤2p|a_p| \le 2\sqrt p∣ap​∣≤2p​ (Silverman, Theorem V.1.1), and the statement for all kkk is its standard reformulation for the local Euler factor. Combined with the multiplicativity of n↦ann \mapsto a_nn↦an​ (BSD.lFunction_isMultiplicative), it yields ∣an∣≤d(n)n|a_n| \le d(n)\sqrt n∣an​∣≤d(n)n​, the bound behind the convergence of L(E,s)L(E,s)L(E,s) for Re⁡s>3/2\operatorname{Re} s > 3/2Res>3/2 asserted in Wiles' problem description; the platform reduction of BSD.lSeriesSummable uses exactly this.

Formalization Note apka_{p^k}apk​ is Mathlib's WeierstrassCurve.LFunction W (p ^ k), cast from Z\mathbb{Z}Z to R\mathbb{R}R; pk/2p^{k/2}pk/2 is written (p)k(\sqrt p)^k(p​)k. The hypothesis IsElliptic is Δ≠0\Delta \ne 0Δ=0.

Preamble
import Definitions.Def_BSD
import Mathlib
Formal statement
namespace BSD
theorem abs_lFunction_prime_pow_le (W : WeierstrassCurve ℚ) [W.IsElliptic] (p k : ℕ)
    (hp : p.Prime) :
    |(W.LFunction (p ^ k) : ℝ)| ≤ (k + 1) * Real.sqrt p ^ k := by sorry
end BSD
Source
J. H. Silverman, The Arithmetic of Elliptic Curves, 2nd ed., GTM 106, Springer 2009, Theorem V.1.1 (Hasse: |#E(F_q) - q - 1| <= 2 sqrt q) and Appendix C, §16 (local factors of L(E/Q,s) at good and bad primes); A. Wiles, The Birch and Swinnerton-Dyer Conjecture (Clay Millennium Problem description, 2000), p. 2 (Hasse's bound and convergence of the Euler product for Re(s) > 3/2).

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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me