### Completeness of the collection

All elliptic curves defined over \(\mathbb{Q}\) are known to be modular, and hence arise (up to isogeny) via the Eichler-Shimura construction from classical modular forms of weight \(2\), trivial character, level \(N\) equal to the conductor of the curve, and having rational Fourier coefficients.

- For conductors less than 500000, where modular symbol methods were used to determine the curves (see [Cremona97]), the reliability of the completeness of the data thus relies on the rigour and correct implementation of the modular symbol algorithms used to compute them, together with the correctness of the algorithms used to compute complete isogeny classes from any one elliptic curve.
- For smooth conductors, completeness relies on the work of Matschke and Von Kahnel [arXiv:1605.06079] and Matschke and Best [arXiv:2007.10535].
- For prime conductors, completeness relies on the work of Bennett, Gherga and Rechnitzer [BGR2019].

### Individual curve data

#### Equation

The \(c_4\) and \(c_6\)-invariants of the optimal curve in each isogeny class were computed from numerical approximations obtained using modular symbols. See J. E. Cremona Algorithms for modular elliptic curves, 2nd edn., Cambridge 1997.

For additional justification that the equations obtained are rigorously correct, see J. E. Cremona, Appendix to a paper by Amod Agashe, Ken Ribet and William Stein: *The Manin Constant*, Pure and Applied Mathematics Quarterly, Vol. 2 no.2 (2006), pp. 617-636, supplemented for conductors over $130000$ by updated notes. Note that for conductors greater than $270000$ we have not always identified the optimal curve in each class rigorously, but expect that it is always the curve whose Cremona label number is 1.

#### Conductor , local data and basic invariants

These are rigorously computed.

#### Mordell-Weil group and generators, and BSD invariants

The analytic rank \(r_{an}\) is computed using modular symbols and is rigorous for \(r_{an}\le3\). When \(r_{an}\le1\), it is a theorem that \(r_{an}\) equals the Mordell-Weil rank \(r\) of the curve. When \(r=1\) the generator is obtained from `mwrank` or using Heegner points. When \(r_{an}\ge2\), the Mordell-Weil rank and generators are obtained from `mwrank`. The torsion subgroup and generators are obtained using standard rigorous algorithms, based on Mazur's classification. When \(r_{an}\ge4\) we cannot compute the exact value, and when we claim that \(r_{an}=4\) we only know rigorously that \(r_{an}\in\{2,4\}\).

The heights of generators of infinite order are given approximately; currently we do not guarantee the precision. Similarly for the regulator, the real period and the special L-value. The analytic order of Ш was computed exactly for curves of rank $0$ (where the quotient of the special L-value and the real period is a rational number computable using modular symbols); for curves of positive rank the analytic order of Ш was computed approximately and rounded. Note that for rank $1$ curves, while it is possible in principal to compute the analytic order of Ш exactly, this has only been done for conductors less than $5000$

#### Integral points

These were computed rigorously, using independent implementations in Magma and SageMath which were compared as a consistency check.

#### Galois representations

The images of the mod-$\ell$ and $\ell$-adic Galois representations were computed rigorously. In particular, for the mod-$\ell$ representations a variant of Sutherland's algorithm [10.1017/fms.2015.33, arXiv:1504.07618] was used to rigorously compute the image of the mod-$\ell$ representation for all primes $\ell<1000$, and for elliptic curves over $\Q$ without complex multiplication Zywina's algorithm [arXiv:1508.07661] was used to verify the surjectivity of the mod $\ell$ representation for all primes $\ell \ge 1000$.

#### Iwasawa invariants

These were computed rigorously.

#### Torsion growth

The torsion growth data was computed rigorously.

**Authors:**

**Knowl status:**

- Review status: reviewed
- Last edited by Andrew Sutherland on 2021-07-19 11:52:22

**Referred to by:**

**History:**(expand/hide all)

- 2021-07-19 11:52:22 by Andrew Sutherland (Reviewed)
- 2021-07-19 11:50:42 by Andrew Sutherland
- 2021-07-19 11:50:42 by Andrew Sutherland
- 2021-07-19 11:47:02 by Andrew Sutherland
- 2021-04-17 09:08:18 by Andrew Sutherland (Reviewed)

**Differences**(show/hide)