Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Elliptic curves with a prescribed point count over Fp\mathbb{F}_pFp​

Open
PrescribedPointCount.exists_isElliptic_natCard_point_eq

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

elliptic-curvesfinite-fieldsnumber-theory

Let ppp be a prime number and let NNN be a natural number lying strictly inside the Hasse interval,

∣N−(p+1)∣<2p.|N-(p+1)|<2\sqrt{p}.∣N−(p+1)∣<2p​.

Then there exists an elliptic curve EEE over Fp\mathbb{F}_pFp​ whose group of Fp\mathbb{F}_pFp​-rational points has exactly NNN elements:

#E(Fp)=N.\#E(\mathbb{F}_p)=N.#E(Fp​)=N.

Equivalently, every integer ttt with ∣t∣<2p|t|<2\sqrt{p}∣t∣<2p​ is the Frobenius trace p+1−#E(Fp)p+1-\#E(\mathbb{F}_p)p+1−#E(Fp​) of some elliptic curve over Fp\mathbb{F}_pFp​ (take t=p+1−Nt=p+1-Nt=p+1−N). This is Deuring's existence theorem (1941) over prime fields, and it is the mathematical core of the FrontierMath open problem Elliptic curves with a prescribed point count, which asks for an efficient construction of such a curve even when the CM discriminant D=(p+1−N)2−4pD=(p+1-N)^2-4pD=(p+1−N)2−4p has a large squarefree part. Since ppp is prime, 2p2\sqrt{p}2p​ is irrational, so for integer NNN the strict inequality is equivalent to the closed Hasse bound ∣N−(p+1)∣≤2p|N-(p+1)|\le 2\sqrt{p}∣N−(p+1)∣≤2p​; the hypothesis is non-vacuous for every prime ppp (e.g. N=p+1N=p+1N=p+1 always satisfies it) and forces N≥1N\ge 1N≥1.

Formalization Note. Curves are Mathlib's WeierstrassCurve (ZMod p); E.IsElliptic asserts that the discriminant is a unit, equivalently nonzero over a field. Nat.card E.toAffine.Point counts affine rational points together with the point at infinity, the same quantity as in the platform's BSD.hasse_bound. The benchmark's runtime budget and challenge-selection rule are properties of its verifier, not of the theorem, and are not formalized.

Preamble
import Mathlib
Formal statement
namespace PrescribedPointCount

theorem exists_isElliptic_natCard_point_eq (p : ℕ) [Fact p.Prime] (N : ℕ)
    (hN : |(N : ℝ) - ((p : ℝ) + 1)| < 2 * Real.sqrt (p : ℝ)) :
    ∃ E : WeierstrassCurve (ZMod p), E.IsElliptic ∧ Nat.card E.toAffine.Point = N := by sorry

end PrescribedPointCount
Source
Epoch AI, FrontierMath: Open Problems, 'Elliptic Curves with Prescribed Number of Points', https://epoch.ai/frontiermath/open-problems/elliptic-curve-point-count (Prompt: given prime p and N with |N-(p+1)|<2*sqrt(p), construct E/F_p with #E(F_p)=N). Mathematical content: M. Deuring, Die Typen der Multiplikatorenringe elliptischer Funktionenkörper, Abh. Math. Sem. Hansischen Univ. 14 (1941), 197-272, https://doi.org/10.1007/BF02940746; W. C. Waterhouse, Abelian varieties over finite fields, Ann. Sci. ÉNS (4) 2 (1969), 521-560, Theorem 4.1, https://www.numdam.org/item/ASENS_1969_4_2_4_521_0/
Human review
  • Endorsed by Shuze Chen · Nov 16, 2026

    Confirmed by the moderator at approval.

  • Endorsed by LG · Nov 16, 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