Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Hasse's theorem: point counts of elliptic curves

Proved
WeilConjectures.hasse_elliptic_curve

by Lucas · Oct 12, 2026 · Mathlib 0df444a (Lean v4.33.1)

algebraic-geometryelliptic-curvesnumber-theory

Let EEE be an elliptic curve over a finite field k=Fqk=\mathbb F_qk=Fq​, given by a Weierstrass equation with nonzero discriminant. Then there are complex numbers α,β\alpha,\betaα,β with β=αˉ\beta=\bar\alphaβ=αˉ and ∣α∣=∣β∣=q|\alpha|=|\beta|=\sqrt q∣α∣=∣β∣=q​ such that for every m≥1m\ge1m≥1

#E(Fqm)=1−αm−βm+qm.\#E(\mathbb F_{q^m})=1-\alpha^m-\beta^m+q^m.#E(Fqm​)=1−αm−βm+qm.

Equivalently ζ(E,s)=(1−αq−s)(1−βq−s)(1−q−s)(1−q1−s)\zeta(E,s)=\dfrac{(1-\alpha q^{-s})(1-\beta q^{-s})}{(1-q^{-s})(1-q^{1-s})}ζ(E,s)=(1−q−s)(1−q1−s)(1−αq−s)(1−βq−s)​. This is the first non-trivial case of the Weil conjectures, proved by Hasse.

Formalization Note EEE is a WeierstrassCurve k with [E.IsElliptic]; E(Fqm)E(\mathbb F_{q^m})E(Fqm​) is the type of points (affine points together with the point at infinity) of the base change of EEE to FiniteField.Extension k p m.

Preamble
import Mathlib
import Definitions.Def_WeilConjectures_projectiveSpace
import Definitions.Def_WeilConjectures_zetaFunction

open AlgebraicGeometry CategoryTheory Polynomial
Formal statement
namespace WeilConjectures

theorem hasse_elliptic_curve (p : ℕ) [Fact p.Prime] (k : Type) [Field k] [Finite k] [CharP k p]
    (E : WeierstrassCurve k) [E.IsElliptic] :
    ∃ α β : ℂ, β = (starRingEnd ℂ) α ∧ ‖α‖ = Real.sqrt (Nat.card k) ∧ ‖β‖ = Real.sqrt (Nat.card k) ∧
      ∀ (m : ℕ) [NeZero m],
        (Nat.card (E.baseChange (FiniteField.Extension k p m)).toAffine.Point : ℂ) =
          1 - α ^ m - β ^ m + (Nat.card k : ℂ) ^ m := by sorry

end WeilConjectures
Source
Wikipedia, "Weil conjectures", https://en.wikipedia.org/wiki/Weil_conjectures (PDF snapshot supplied by the proposer, 14 pp.), section "Examples", subsection "Elliptic curves"
Human review
  • Endorsed by Shuze Chen · Oct 13, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Lucas · Oct 13, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me