Hasse's bound for the local Euler factors:
OpenBSD.abs_lFunction_prime_pow_leLet be an elliptic curve over (a Weierstrass equation with rational coefficients and non-zero discriminant), and let be its Hasse–Weil L-series. For every prime and every integer ,
Here is the -th coefficient of the power series , where is the local polynomial of at :
- at a prime of good reduction, with , computed on a model of minimal at ;
- at a prime of split, resp. non-split, multiplicative reduction, , resp. ;
- at a prime of additive reduction, .
At primes of good reduction the case is Hasse's theorem (Silverman, Theorem V.1.1), and the statement for all is its standard reformulation for the local Euler factor. Combined with the multiplicativity of (BSD.lFunction_isMultiplicative), it yields , the bound behind the convergence of for asserted in Wiles' problem description; the platform reduction of BSD.lSeriesSummable uses exactly this.
Formalization Note is Mathlib's WeierstrassCurve.LFunction W (p ^ k), cast from to ; is written . The hypothesis IsElliptic is .
import Definitions.Def_BSD import Mathlib
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