Elliptic curves with a prescribed point count over
OpenPrescribedPointCount.exists_isElliptic_natCard_point_eqLet be a prime number and let be a natural number lying strictly inside the Hasse interval,
Then there exists an elliptic curve over whose group of -rational points has exactly elements:
Equivalently, every integer with is the Frobenius trace of some elliptic curve over (take ). 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 has a large squarefree part. Since is prime, is irrational, so for integer the strict inequality is equivalent to the closed Hasse bound ; the hypothesis is non-vacuous for every prime (e.g. always satisfies it) and forces .
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.
import Mathlib
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 PrescribedPointCountConfirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.