mathoverflow.net/questions/20112/interesting-results-in-algebraic-geometry-accessible-to-3rd-year-undergraduates Interesting results in algebraic geometry accessible to 3rd year undergraduates

An elliptic curve is defined by numbers $a$ and $b$. The curve is the set of all points $(x,y)$ of the real plane that satisfy the Equation 1. "Definition of the elliptic curves"

$y_{2}=x_{3}+ax+b$

Equation 1. "Definition of the elliptic curves" definies elliptic curves over any field, it doesn't have to the real numbers. Notably, the definition also works for finite fields, leading to elliptic curve over a finite fields, which are the ones used in Elliptic-curve Diffie-Hellman cyprotgraphy.

The elliptic curve group of an elliptic curve is a group in which the elements of the group are points on an elliptic curve.

The group operation is called elliptic curve point addition.

Elliptic curve point addition is the group operation of an elliptic curve group, i.e. it is a function that takes two points of an elliptic curve as input, and returns a third point of the elliptic curve as its output, while obeying the group axioms.

The operation is defined e.g. at en.wikipedia.org/w/index.php?title=Elliptic_curve_point_multiplication&oldid=1168754060#Point_operations. For example, consider the most common case for two different points different. If the two points are given in coordinates:
then the addition is defined in the general case as:
with some slightly different definitions for point doubling $P+P$ and the identity point.

$P(x_{p},y_{p}) +Q+(x_{q},y_{q}) =R=(x_{r},y_{r}) $

$λx_{r}y_{r} =x_{q}−x_{p}y_{q}−y_{p} =λ_{2}−x_{p}−x_{q}=λ(x_{p}−x_{r})−y_{p} $

This definition relies only on operations that we know how to do on arbitrary fields:and it therefore works for elliptic curves defined over any field.

- addition $+$
- multiplication $×$

Just remember that:
means:
and that $y_{−1}$ always exists because it is the inverse element, which is guaranteed to exist for multiplication due to the group axioms it obeys.

$x/y$

$x×y_{−1}$

The group function is usually called elliptic curve point addition, and repeated addition as done for DHKE is called elliptic curve point multiplication.

One major difference between the elliptic curve over a finite field or the elliptic curve over the rational numbers the elliptic curve over the real numbers is that not every possible $x$ generates a member of the curve.

This is because on the Equation "Definition of the elliptic curves" we see that given an $x$, we calculate $x_{3}+ax+b$, which always produces an element $y_{2}$.

But then we are not necessarily able to find an $y$ for the $y_{2}$, because not all fields are not quadratically closed fields.

For example: with $a=1$ and $b=1$, taking $x=1$ gives:
and therefore there is no $y∈Q$ that satisfies the equation. So $x=1$ is not on the curve if we consider this elliptic curve over the rational numbers.

$y_{2}=1_{3}+1×1+1=3$

That $x$ would also not belong to Elliptic curve over the finite field $F_{4}$, because doing everything $mod4$ we have:
Therefore, there is no element $y∈F_{4}$ such that $y×y=2$ or $y×y=3$, i.e. $2$ and $3$ don't have a multiplicative inverse.

$0∗01∗12∗23∗3 =0=1=4=9 =0=1 mod4mod4mod4mod4 $

For the real numbers, it would work however, because the real numbers are a quadratically closed field, and $3 ∈R$.

For this reason, it is not necessarily trivial to determine the number of elements of an elliptic curve.

Can be finite or infinite! TODO examples. But it is always a finitely generated group.

The elliptic curve group of all elliptic curve over the rational numbers is always a finitely generated group.

The number of points may be either finite or infinite. But when infinite, it is still a finitely generated group.

For this reason, the rank of an elliptic curve over the rational numbers is always defined.

TODO example.

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!

TODO list of known values and algorithms? The Birch and Swinnerton-Dyer conjecture would immediately provide a stupid algorithm for it.

web.math.pmf.unizg.hr/~duje/tors/rankhist.html gives a list with Elkies (2006) on top with:
TODO why this non standard formluation?

$y_{2}+xy+y=x_{3}−x_{2}−20067762415575526585033208209338542750930230312178956502x+34481611795030556467032985690390720374855944359319180361266008296291939448732243429$

This construction taks as input:and it produces an elliptic curve over a finite field of order $p$ as output.

- elliptic curve over the rational numbers
- a prime number $p$

The constructions is used in the Birch and Swinnerton-Dyer conjecture.

To do it, we just convert the coefficients $a$ and $b$ from the Equation "Definition of the elliptic curves" from rational numbers to elements of the finite field.

For example, suppose we have $a=3/4$ and we are using $p=11$.

For the denominator $4$, we just use the multiplicative inverse, e.g. supposing we have
where $4_{−1}=3mod11$ because $4×3=1mod11$, related: math.stackexchange.com/questions/1204034/elliptic-curve-reduction-modulo-p

$43 →3×4_{−1}mod11=3×3mod11=9mod11$

The BSD conjecture states that if your name is long enough, it will always count as two letters on a famous conejcture.

Maybe also insert a joke about BSD Operating Systems if you're into that kind of stuff.

The conjecture states that Equation 1. "BSD Conjecture" holds for every elliptic curve over the rational numbers (which is defined by its constants $a$ and $b$)

$lim_{x→∞}∏_{p≤x}pN_{p} =Cg(x)_{r}$

The conjecture, if true, provides a (possibly inefficient) way to calculate the rank of an elliptic curve over the rational numbers, since we can calculate the number of elements of an elliptic curve over a finite field by Schoof's algorithm in polynomial time. So it is just a matter of calculating $N_{p}$ like that up to some point at which we are quite certain about $r$.

The Wikipedia page of the this conecture is the perfect example of why it is not possible to teach natural sciences on Wikipedia. A million dollar problem, and the page is thoroughly incomprehensible unless you already know everything!

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 $r$. Prerequisite: generating set of a group
- reduction of an elliptic curve from $E(Q)$ to $E(F_{p})modp$ lets us define $N_{r}$ as the number of elements of the generated finite group

The paper that states the BSD Conjecture.

Likely paywalled at: www.degruyter.com/document/doi/10.1515/crll.1965.218.79/html. One illegal upload at: virtualmath1.stanford.edu/~conrad/BSDseminar/refs/BSDorigin.pdf.

The Equation "Definition of the elliptic curves" and definitions on elliptic curve point addition both hold directly.