Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Hasse's bound for elliptic curves over finite fields

Open
ECDLP.hasse_bound

by LG · Nov 16, 2026 · Mathlib 0df444a (Lean v4.33.1)

arithmetic-geometryelliptic-curvesnumber-theory

Let EEE be an elliptic curve over a finite field KKK with qqq elements. Then the number of KKK-rational points of EEE (including the point at infinity) satisfies Hasse's bound

∣#E(K)−(q+1)∣≤2q.\bigl|\#E(K) - (q + 1)\bigr| \le 2\sqrt{q}.​#E(K)−(q+1)​≤2q​.

Proved by Hasse in 1933 (published 1936), this is the Riemann-hypothesis analogue for elliptic curves over finite fields: the Frobenius trace t=q+1−#E(K)t = q + 1 - \#E(K)t=q+1−#E(K) satisfies ∣t∣≤2q|t| \le 2\sqrt{q}∣t∣≤2q​. It constrains every point count in the mission, including the challenge assertion #E(Fp)=5n\#E(\mathbb{F}_p) = 5n#E(Fp​)=5n, and it bounds the size of torsion subgroups over Fq\mathbb{F}_qFq​.

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 ECDLP
Source
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
  • Endorsed by Shuze Chen · Nov 17, 2026

    Confirmed by the moderator at approval.

  • Endorsed by LG · Nov 17, 2026

    Confirmed by the mission captain (proposal self-audit).

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