Number theory Arithmetic geometry Theorem
Hasse's theorem on elliptic curves
Builds on Elliptic curveFinite field
Statement
Let be a finite field with elements, and let be an elliptic curve over . Let be the number of points of over , including the point at infinity. Then
Remarks
One proof uses the -power Frobenius endomorphism of . The points of form the kernel of , which is separable, so . The degree is a positive definite quadratic form on the endomorphism ring, with , and the Cauchy–Schwarz inequality for this form gives the bound. Example: over . The cubes modulo run through all residues, so takes each value once. The value gives one point, the squares and give two points each, and the non-squares give none. With the point at infinity, . The number is the trace of Frobenius, and the theorem says .
Going deeper
For a student
The theorem is the Riemann hypothesis for the zeta function of an elliptic curve over a finite field: the roots of have absolute value . Weil generalized it to curves of any genus , with bound , and Deligne to all smooth projective varieties. The bound defines the angles in the Sato–Tate conjecture and is used to estimate the running time of algorithms in elliptic curve cryptography.
Reading path
To understand this page from the ground up, read these 3 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Elliptic curve concept
- Finite field concept
- Hasse's theorem on elliptic curves statement
Where this leads
1 page builds on this one.
Further reading
About this page
| Tag | 7Y26317GJ0 |
|---|---|
| URI | m2://7Y26317GJ0 |
| Kind | statement, theorem |
| Writing | W0 stub |
| MSC | 11G20, 14H52, 11G05 |
| Status | This copy of the site has no build data. Run m2 status 7Y26317GJ0. |
| About | Elliptic curve |
| Uses | Elliptic curve, Finite field |
| Same as | |
| Changed | 2 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.