Hasse's bound for elliptic curves over finite fields
OpenECDLP.hasse_boundarithmetic-geometryelliptic-curvesnumber-theory
Let be an elliptic curve over a finite field with elements. Then the number of -rational points of (including the point at infinity) satisfies Hasse's bound
Proved by Hasse in 1933 (published 1936), this is the Riemann-hypothesis analogue for elliptic curves over finite fields: the Frobenius trace satisfies . It constrains every point count in the mission, including the challenge assertion , and it bounds the size of torsion subgroups over .
Formalization Note. The point count is Nat.card E.toAffine.Point, cast to ℝ; the field size is Fintype.card K. The elliptic-curve hypothesis is Mathlib's typeclass E.IsElliptic (unit discriminant).
Preamble
import Mathlib
Formal statement
namespace ECDLP
theorem hasse_bound {K : Type*} [Field K] [Fintype K] (E : WeierstrassCurve K) [E.IsElliptic] :
|(Nat.card E.toAffine.Point : ℝ) - ((Fintype.card K : ℝ) + 1)| ≤
2 * Real.sqrt (Fintype.card K : ℝ) := by sorry
end ECDLPSource
Hasse, Zur Theorie der abstrakten elliptischen Funktionenkörper I–III, Crelle's Journal 175 (1936), https://doi.org/10.1515/crll.1936.175.193; Silverman, The Arithmetic of Elliptic Curves, 2nd ed., Springer 2009, Theorem V.1.1, https://doi.org/10.1007/978-0-387-09494-1.
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.