Incoming links: Mordell's theorem
Birch and Swinnerton-Dyer conjecture in two minutes by Ciro Santilli Updated 2024-12-15 +Created 1970-01-01
Summary:
- overview of the formula of the BSD conjecture
- definition of elliptic curve
- domain of an elliptic curve. Prerequisite: field
- elliptic curve group. Prerequisite: group
- Mordell's theorem lets us define the rank of an elliptic curve over the rational numbers, which is the . Prerequisite: generating set of a group
- reduction of an elliptic curve from to lets us define as the number of elements of the generated finite group
Mordell's theorem guarantees that the rank (number of elements in the generating set of the group) is always well defined for an elliptic curve over the rational numbers. But as of 2023 there is no known algorithm which calculates the rank of any curve!
It is not even known if there are elliptic curves of every rank or not: Largest known ranks of an elliptic curve over the rational numbers, and it has proven extremely hard to find new ones over time.
TODO list of known values and algorithms? The Birch and Swinnerton-Dyer conjecture would immediately provide a stupid algorithm for it.