An algorithm for determining torsion growth of elliptic curves
Enrique Gonz\'alez-Jim\'enez, Filip Najman

TL;DR
This paper introduces a fast algorithm to determine torsion growth of elliptic curves over number fields, applied to a large dataset of curves, revealing new sporadic points and expanding understanding of torsion structures.
Contribution
The paper presents a novel, efficient algorithm for analyzing torsion subgroup growth of elliptic curves over number fields, with extensive computational results.
Findings
Identified a degree 6 sporadic point on X_1(4,12)
Analyzed 2,483,649 elliptic curves of conductor < 400,000
Collected data on torsion subgroup behavior across various degrees
Abstract
We present a fast algorithm that takes as input an elliptic curve defined over and an integer and returns all the number fields of degree dividing such that contains as a proper subgroup, for all . We ran this algorithm on all elliptic curves of conductor less than 400.000 (a total of 2.483.649 curves) and all and collected various interesting data. In particular, we find a degree 6 sporadic point on , which is so far the lowest known degree a sporadic point on , for .
| 2 | 3-10,12,15,16 | 1-6 | 1,2 | 1 | - | - | - | - | - | ||||
| 3 |
|
1,3,7 | - | - | - | - | - | - | - | ||||
| 4 |
|
2-6,8 | 1,2 | 1,2 | 1 | 1 | - | - | - | ||||
| 5 | 5,10,11,25 | - | - | - | - | - | - | - | - | ||||
| 6 |
|
1,3,5-7,9 | 1-4 | 1,3 | - | 1 | - | - | - | ||||
| 7 | 7 | - | - | - | - | - | - | - | - | ||||
| 8 |
|
2-6,8,10,12 | 1,2,4 | 1-3 | 1 | 1 | - | - | - | ||||
| 9 |
|
3,7,9 | - | - | - | - | - | - | - | ||||
| 10 | 5,10,11,15,25 | 5 | - | - | - | - | - | - | - | ||||
| 12 |
|
|
1-5,7 | 1,3 | 2 | 1,2 | - | - | - | ||||
| 14 | 7 | - | - | - | - | - | - | - | - | ||||
| 15 | 10,22,50 | - | - | - | - | - | - | - | - | ||||
| 16 |
|
|
1,2,4,5 | 1-5 | 1,3 | 1,2 | - | 1 | - | ||||
| 18 |
|
3,7,9,13,18,21 | 2-4,6,7 | 3,7 | - | 1,3 | 1 | - | 1 | ||||
| 20 | 5,10,11,15,20,22,25,33 | 5,11 | - | - | 1-3 | - | - | - | - | ||||
| 21 | 7,14,21,43 | 7 | - | - | - | - | - | - | - |
| 9 | ||||||||||||
| 5 | 5 | 9 | 3 | 1 | 6 | 1 | 1 | 10 | 6 | 3 | 1 | |
| 18176 | 5184 | 223494 | 3969 | 150 | 18176 | 208 | 121 | 277440 | 254016 | 18176 | 1922 | |
| 104 | 88 | 200 | 20 | 7 | 134 | 1 | 3 | 336 | 101 | 26 | 6 |
| d | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 12 | 14 | 15 | 16 | 18 | 20 | 21 |
| Mode (s) | 0.06 | 0.06 | 0.06 | 0.06 | 0.09 | 0.06 | 0.08 | 0.06 | 0.06 | 0.23 | 0.06 | 0.06 | 0.08 | 0.09 | 0.06 | 0.06 |
| Median (s) | 0.07 | 0.06 | 0.07 | 0.06 | 0.13 | 0.06 | 0.10 | 0.06 | 0.07 | 4.7 | 0.07 | 0.06 | 0.10 | 0.13 | 0.07 | 0.06 |
| Mean (s) | 0.08 | 0.06 | 0.15 | 0.06 | 0.17 | 0.06 | 1.1 | 0.13 | 0.1 | 6.5 | 0.08 | 0.07 | 24 | 1.4 | 0.35 | 0.06 |
| Maximum (s) | 1.3 | 3.7 | 9.0 | 3.5 | 9.1 | 16 | 98 | 16 | 27 | 110 | 16 | 16 | 1200 | 440 | 470 | 17 |
| Total (h) | 54.4 | 43.5 | 106.4 | 42.2 | 119.6 | 41.6 | 774.7 | 88.2 | 66.8 | 4492.8 | 55.45 | 44.85 | 16339 | 1004 | 241.3 | 43.8 |
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
An algorithm for determining torsion growth of elliptic curves
Enrique González–Jiménez
Universidad Autónoma de Madrid, Departamento de Matemáticas, Madrid, Spain
and
Filip Najman
University of Zagreb, Bijenička cesta 30, 10000 Zagreb, Croatia
Abstract.
We present a fast algorithm that takes as input an elliptic curve defined over and an integer and returns all the number fields of degree dividing such that contains as a proper subgroup, for all . We ran this algorithm on all elliptic curves of conductor less than 400.000 (a total of 2.483.649 curves) and all and collected various interesting data. In particular, we find a degree 6 sporadic point on , which is so far the lowest known degree a sporadic point on , for .
Key words and phrases:
Elliptic curves, torsion over number fields
2010 Mathematics Subject Classification:
11G05
The first author was partially supported by the grant PGC2018–095392–B–I00 (MCIU/AEI/FEDER, UE). The second author gratefully acknowledges support from the QuantiXLie Center of Excellence, a project co-financed by the Croatian Government and European Union through the European Regional Development Fund - the Competitiveness and Cohesion Operational Programme (Grant KK.01.1.1.01.0004) and by the Croatian Science Foundation under the project no. IP-2018-01-1313.
1. Introduction
Let be an elliptic curve defined over a number field . The Mordell–Weil Theorem states that the set of -rational points is a finitely generated abelian group. Denote by the torsion subgroup of . One of the main goals in the theory of elliptic curves is to determine , or in more generality, all possible torsion groups of all elliptic curves over all number fields of a given degree.
Let a positive integer and be the set of groups, up to isomorphism, that occur as torsion groups of some elliptic curve defined over a number field of degree . Note that the set is finite thanks to Merel’s uniform boundedness theorem [32]. These sets have so far been determined for only***M. Derickx, A. Etropolski, M. van Hoeij, J. Morrow and D. Zureick-Brown have announced results for . [31, 25, 26]. For degree , each group in occurs for infinitely many -isomorphism classes of elliptic curves, but for this is not the case (see [33, Theorem 1] and [23, Theorem 3.4]). Therefore we define to be the set of groups that arise for infinitely many -isomorphism classes of elliptic curves. While is not completely known even for , is known for [23, 24, 9].
A slightly different approach is to consider only elliptic curves over under base change to number fields of a given degree. Let be a positive integer and be the set of groups, up to isomorphism, that occur as the torsion group of an elliptic curve defined over base changed to a number field of degree . Notice that does not have to be contained in , as the group shows†††The second author showed in [33] that the elliptic curve with LMFDB label 162.c3 has torsion subgroup defined over the cubic field where is a primitive -th root of unity. for , and does not have to be contained in as the group shows for (see [33, Theorem 1] and [26]).
Similarly, for a fixed , let be the subset of consisting of all possible torsion groups of an elliptic curve defined over such that base changed to , a number field of degree . The sets and , for any , have been completely determined for in a series of papers [33, 18, 19, 15, 4, 16, 12]. Moreover, in [16] it has been established that for any positive integer whose prime divisors are greater than .
Let be an elliptic curve defined over and let a number field. We say that there is torsion growth over if . One can easily work out that there is torsion growth (of the -primary torsion) in at least one number field of degree , , or . On the other hand, there is no torsion growth in number fields of degree only divisible by primes (cf. [16, Theorem 7.2(i)]).
The purpose of this paper is to develop a fast algorithm, usable in practice, which for a given elliptic curve defined over and a positive integer finds all the pairs where is a number field of degree dividing and . Of course, the set of such number fields can be infinite if there exists a number field of degree , where divides and such that ; then every number field of degree will have the desired property. To circumvent this problem, we will say that has primitive torsion growth over a number field if , for all subfields . For a prime we say that has primitive -power torsion growth if , for all subfields .
It is an easy corollary of Merel’s theorem [32] that for a given integer the list of number fields where primitive torsion growth occurs will be finite. The existence of such an algorithm is obvious: for every integer , by the aforementioned theorem of Merel, there exists an effective bound such that . So to determine the number fields where torsion growth occurs one does the following:
For all prime powers do:
factor the -th division polynomial and check whether there are any irreducible factors of degree dividing .
If no, move on to the next prime power. If yes, for all irreducible factors of degree do:
Construct the number field whose minimal polynomial is - this will be the field of definition of the -coordinate of a -torsion point of .
- -
Check whether is defined over , if yes add to the set that will be the output. If is not defined over , then check whether divides , if yes, then add (which will be obtained from by adjoining the -coordinate of to ) to the output set.
- -
If a point of order was constructed in the previous step, check whether the full -torsion of is defined over a number field of degree dividing , by checking whether the degree of the splitting field of or an appropriate degree 2 extension divides .
However, if implemented as stated above, this algorithm would not be very useful in practice. The main obstacle would be factoring division polynomials, as is a polynomial of degree for odd, and the values that need to be checked will grow exponentially in .
Our algorithm will use information that can be obtained from the images of mod Galois representations attached to to avoid factoring division polynomials wherever possible. To make the algorithm usable in practice we will add a number of if-then conditions that will rule out most of the integers that need to be checked using results from [16] and results that we develop for this purpose in Section 2.1.
One of the main motivations of this paper is to run the algorithm on all elliptic curves of conductor less than 400.000 (see [6, 29]) and for each curve within determine all the number fields of degree over which there is primitive torsion growth. In Section 4 we present the most interesting data coming out of these computations. The main results appear in Table 1. We obtain sets contained in for and our data motivates us to conjecture that we have in fact obtained all of for (see Conjecture 4.2). We can also see that there is much more torsion growth and it is much more complex when is divisible by powers of and especially . Moreover we find two elliptic curves defined over with torsion over a degree 6 number field and prove that these are the only two such curves. By [9], there are only finitely many elliptic curves over sextic fields (without supposing that they are defined over ) with this torsion group, so these curves give us examples of sporadic points of degree 6 on . This is the lowest known degree of a sporadic point on a modular curve , for and .
Notation
Specific elliptic curves mentioned in this paper will be referred to by their LMFDB label and a link to the corresponding LMFDB page [29] will be included for the ease of the reader. Conjugacy classes of subgroups of will be referred to by the labels introduced by Sutherland in [38, §6.4]. We write (or ) for the fact that is isomorphic to (or to a subgroup of resp.) without further detail on the precise isomorphism.
2. Auxiliary results
In this section, we prove a series of results that will make it possible to replace costly factorizations of division polynomials by simple if-then checks. This will be useful in the computations described in Section 4.
Let be an elliptic curve defined over a number field , a positive integer and a fixed algebraic closure of . The absolute Galois group acts on , inducing a mod Galois representation attached to
[TABLE]
Fixing a basis of , we identify with . Therefore we can view as a subgroup of , determined uniquely up to conjugacy in , and denoted by from now on.
For elliptic curves over , we conjecturally (see [38, Conjecture 1.1] and [40, Conjecture 1.12.]) know all the mod Galois representations attached to non-CM elliptic curves over .
Conjecture 2.1**.**
Let be a non-CM elliptic curve, a prime and not in the set
[TABLE]
then .
For a prime , will denote the -adic representation attached to (again we assume that we have fixed a basis for the Tate module ). We say that the -adic representation of is defined modulo if for all we have , where is the identity matrix.
Proposition 2.2**.**
Let be an elliptic curve defined over a number field such that its -adic representation is defined modulo . Then for any point of order , we have .
Proof.
We need to prove that acts transitively on the solutions of (where the action of on the -module of the solutions of is defined in the obvious way). The -module is isomorphic to , and we choose an isomorphism sending to and study the action of on the solutions of the equation . One easily sees that already the subgroup of generated by and acts transitively on the solutions of the equation . ∎
For easier reference we state and prove the following lemma which will follow from standard group-theoretic arguments.
Lemma 2.3**.**
Let be an elliptic curve without defined over a number field and a prime such that . Then the -adic Galois representation of is defined modulo for some .
Proof.
Define and . Let be the reduction mod map. Then .
We use the fact, as explained in the proof of [36, Lemma 3, IV-23], that if , then for all . It follows that if is defined modulo , then we have for all . So if , then for all .
This implies that if is defined modulo , then (and hence is of index for some in ), for all .
Suppose now that is not defined modulo for any . This implies that
[TABLE]
for all . This implies that , which is a contradiction.
∎
Lemma 2.4**.**
Let be a prime and an elliptic curve. Then if and is a point of order , then .
Proof.
If , then it follows from [36, Lemma 3, IV-24] that if , then is surjective. It follows that the -adic representation is defined modulo , so the lemma follows from Proposition 2.2. For , if , then the conclusion is the same as before, while if then it follows from [11] that , where is a (unique up to conjugacy) subgroup of generated by and . One easily checks that this group acts transitively on the 72 points of order 9 in , so the for all points of order 9 (using the same argumentation as in [16, Section 5]).
∎
Lemma 2.5**.**
Let be a prime, an elliptic curve defined over a number field , a point of order , and suppose for some and such that . Then .
Proof.
Obviously or . Suppose and let . Then we have , so and hence , as . But we have
[TABLE]
where the last equation follows from the fact that . Since by assumption is a point of order , this is a contradiction. ∎
The most time-consuming part of our algorithm is determining the existence of points of order for , and the fields over which such points live if they exist.
We now prove results that will prove the non-existence of points of certain orders over number fields of relatively small degree .
2.1. Points of order
Proposition 2.6**.**
Let be an elliptic curve and a number field of degree . Then does not have a point of order .
Proof.
Let be a point of order . First consider the case when has a -isogeny over . Let be the power of 5 in (note that this index is finite as elliptic curves with CM do not have -isogenies over ). By [20, Theorem 2], is at most , and we conclude by Lemma 2.3 that the -adic representation of is defined modulo . From here it follows by Proposition 2.2 that . Since there exist no points of order on elliptic curves over quadratic fields [25, 26], we have .
Suppose now that there is no isogeny of degree 5 over . Applying [30, Theorem 2.1] (with , , and ), we obtain that is divisible by . From [16, Table 1] we see that the field over which an elliptic curve without an isogeny gains a -torsion point is divisible by 2. So we conclude that is divisible by 50 and hence . ∎
2.2. Points of order
Lemma 2.7**.**
There are no points of order on an elliptic curve over any number field of degree .
Proof.
Let us split the proof in two cases depending if has a 7-isogeny or not. If has a 7-isogeny, then by the results of [21] the -adic representation is either as large as possible or the curve has or . If the representation is as large as possible, then by Proposition 2.2 we have , eliminating this case. If or , we explicitly check that .
Finally, suppose that does not have a -isogeny and let be a point of order of . By [30, Theorem 2.1], we get that is divisible by . So if , then it would follow that . By looking at [16, Table 1] we see that this is only possible when is a Borel subgroup, which is a contradiction, since then would have a -isogeny over .
∎
2.3. Points of order for
Lemma 2.8**.**
There are no points of order for on an elliptic curve over any number field of degree .
Proof.
We divide the proof into two cases: when has CM and when it doesn’t.
Suppose first that doesn’t have CM. Let be a point of order . If has a -isogeny over and does not have CM, by the results of [20], it follows that the -adic image is defined mod , from which it follows by Proposition 2.2 that is divisible by . On the other hand, if there are no -isogenies over , then we have that for by [16, Table 1], for by [16, Table 2] and for by [16, Theorems 3.2 and 5.6].
Suppose now that has CM by an order . Let , where is of order , , and let be the CM field of . If or it follows from [1, Theorem 6.2] that is of degree and hence .
Suppose from now on that . If and or , we have so we can apply [2, Therorem 4.8 c)] to show that is strictly contained in , from which it follows that .
Suppose . If , then [1, Theorem 6.2] gives us that . Finally, suppose . From [1, Theorem 6.2] it follows that for any elliptic curve with with a point of order over a number field containing , we have that . Suppose is such an elliptic curve; i.e. , has a point of order 169 and . We claim that cannot be a base change of an elliptic curve defined over . Since is a subfield of , by the theory of complex multiplication it is Abelian over and so . It follows by Galois theory that there exists a field where . We can write for some . Let be the quadratic twist of by . If was defined over , then we would have (see for example [28, Lemma 1.1])
[TABLE]
which now implies that there exists an elliptic curve with and a point of order over , contradicting [1, Theorem 6.2].
∎
2.4. Points of order
The following lemma allows us to deal with points of order over number fields of degree , which is the smallest degree over which an elliptic curve defined over can have a point of order .
Lemma 2.9**.**
Let be an elliptic curve. Then has a point of order over a degree number field if and only if . Moreover, has to be where , is such that is -isomorphic to the elliptic curve and is a root of the irreducible polynomial
[TABLE]
In particular, .
Proof.
From [16, Table 2] it follows that has a point of order 37 over a degree 12 field if and only if , which happens if and only if (see [40, Theorem 1.10. (ii)]). We note that the elliptic curve has and therefore there exists a number field of degree such that has a point of order over (see [33, Section 6]). We have that is an irreducible factor of the -division polynomial of . In particular where is a point of order in and . Now if is an elliptic curve with , it will be a quadratic twist of ; thus will have a model for some . In particular, is a point of order on . Then we obtain and get the desired result.
Let us prove . The curve cannot have full -torsion over by the Weil pairing and cannot have a point of order by Lemma 2.8. The set of non-surjective primes only depends on the -invariant of ([38, Lemma 5.27]). Therefore it is enough to compute this set for a single elliptic curve with that . We have that the elliptic curve of minimal conductor with has LMFDB label 1225.b2.
We see in the LMFDB‡‡‡Note that the data for non-CM elliptic curves over in the LMFDB provably includes all p for which the mod-p representation is non-surjective (this has been verified using Zywina’s algorithm [40], see https://www.lmfdb.org/EllipticCurve/Q/Reliability). (or alternatively explicitly compute) that is the only non-surjective prime for this elliptic curve. So if had a point of order , would have to be a subfield of and would have to divide . We see that the only possibility is that . But the field generated by a point of order will not be Galois over , since the mod representation is surjective, and hence cannot be a subfield of the cyclic field (we see that is cyclic as it is generated by a point lying in the kernel of an isogeny, see [8, Lemma 4.8]).
∎
2.5. Points of order
We obtain similar results as in Lemma 2.9, but for order and for number fields of degree , which is the smallest degree over which an elliptic curve defined over can have a point of order .
Lemma 2.10**.**
Let be an elliptic curve. Then has a point of order over a degree number field if and only if . Moreover, has to be where , is such that is -isomorphic to the elliptic curve and is a root the irreducible polynomial
[TABLE]
In particular .
Proof.
By the same arguments as in Lemma 2.9, we get that an elliptic curve such that gains a point of order over a number field of degree has (see [16, Table 2] and [40, Theorem 1.10. (i)]) and is the only surjective prime§§§This can be read off from LMFDB - see the footnote in Lemma 2.9. for all such curves. Note that in this case the quadratic twist with minimal conductor of has LMFDB label 14450.o2.
Let us prove . The curve cannot have full -torsion over by the Weil pairing and cannot have a point of order by Lemma 2.8. So if had a point of order , would have to be a subfield of and would have to divide . We see that the only possibility is that . But there cannot be any points of order over , as is cyclic (as it is generated by a point lying in the kernel of an isogeny, see [8, Lemma 4.8]) and will not be Galois over for any .
∎
2.6. Some special degrees
From the results proved in this section, we immediately obtain the following result.
Lemma 2.11**.**
Let or and an elliptic curve. Then there is no primitive torsion growth over any number field of degree .
Proof.
Suppose the opposite, in particular that for some , we have . Let . From [16, Theorem 5.8] we see that there is no primitive -torsion growth over for any prime . Moreover, we see that there can be no points of order over at all. It remains to check whether the -power torsion cannot grow from a subfield of to for . If is a point of order , then it would follow that for some . So in particular divides . Since is a subgroup of , it follows that divides . This is easily seen to be a contradiction for all . By the same argument, the extension over which a subgroup of the form is first defined cannot be of degree or . More generally, one can deduce the same result for a group of the form for integers and divisible by multiple primes. ∎
3. The algorithm
In this section we describe our algorithm. We always strive to make the algorithm useful in practice, and not to obtain an algorithm with small worst-case complexity. The reason for this is that in most cases, standard conjectures tell us that certain things will not happen, so we do not worry too much about the run-times of events that are conjecturally impossible. To give an explicit example, it is widely believed (see Conjecture 2.1) that for all and all non-CM elliptic curves over . Hence, we focus on trying to quickly prove that indeed , and not worry too much on the run-time of what happens if for , which, as already noted, conjecturally never happens.
We will use the following notation/definition in the algorithm.
Definition 1**.**
For an elliptic curve and a positive integer , we define to be the set of primes such that there exists a number field of degree such that there is primitive -power torsion growth over .
Recall that in [16] the set is defined to be the set of all primes such that there exists a point of order on some elliptic curve over some number field of degree . Note that is unconditionally known for all (and in the larger cases we know a set containing ), so for all values of in which one hopes to be able to run the algorithm.
The algorithm consists of 3 sub-algorithms.
Algorithm 1:
Input: An elliptic curve and integer .
Output: The set
- (1)
Set . 2. (2)
If the largest prime divisor of is larger than , exit this algorithm and return . 3. (3)
Compute using [16, Corollary 6.1]. 4. (4)
For compute . 5. (5)
For compute the degrees of number fields over which there is -torsion, depending on using [16, Table 1 2] and [16, Theorem 3.2] for non-CM curves and [16, Theorem 3.6 and 5.6 ] for CM curves. If any such divides , add to . 6. (6)
Return .
Remark 3.1*.*
Algorithm 1 is used to determine the (finite) set of primes such that there will be primitive -power torsion growth over number fields of degree dividing .
Remark 3.2*.*
Step (2) follows from [16, Theorem 7.1. (i)]. In step (4), we compute using the algorithm sketched in [40, 1.8.].
Algorithm 2: -primary torsion growth
In this algorithm we will store a point or points generating the torsion group of . These are necessary for computing the -power torsion, but will not be returned in the output of the algorithm (although they could be), as they will not be necessary. We will also store an auxiliary sequence of pairs , where and and generate the -torsion of and such that divides . In Algorithm 2, will always denote .
Input: An elliptic curve , , a prime
Output: A set of all pairs such that has primitive -power torsion growth over , the group and such that divides .
- (1)
and . 2. (2)
If : Set , where is a set of generators of . If divides , then factor , set ¶¶¶We have by [38, Lemma 5.17]. to be the field defined by an irreducible factor of degree and set and , where is a set of generators of . 3. (3)
If : Explicitly determine the triples for all by factoring the -division polynomial , keeping only one number field up to isomorphism. Add all these triples to . For all constructed, check whether for any ; if yes, change to and , where generates . 4. (4)
Set . Repeat: if ( or ) and ( or or ) and ( or )
- (i)
Compute the primitive -division polynomial , as a polynomial in , reduce it modulo small primes of good reduction different from , factor it over , and check whether there are any irreducible factors of degree dividing for each prime . If not, then exit the loop.
- (ii)
Now for each element that we have in , for each cyclic subgroup of of order (if it exists): select a generator . Factor over the polynomial
[TABLE]
where and are as defined in [39, Chapter 3.2. p.81] ∥∥∥We use [38, Corollary 5.18] where possible. By [39, Theorem 3.6] we have that for any such that . Using this step is crucial (instead of factoring -division polynomials) as one uses the polynomial (1) of degree (over number fields) instead of factoring (over ) the primitive -division polynomial, which is of degree .. Let be a point of order such that is a root of .
If divides , define by as follows: if was for some , then . Add the field , the subgroup and its generators into , where the generators of are obtained by taking the generators of and replacing by .
- (iii)
For each element in , check whether is of degree dividing for . If yes, add to and if furthermore , then remove the triple from .
- (iv)
Check whether is of degree dividing by checking whether in there exists an entry ; if yes, check whether the element of order is divisible by over . If yes, change the previous entry into , where is obtained from , where is of order and and add to .
- (v)
;
until the first occurrence that there are no points of order in A. 5. (5)
Return A.
Remark 3.3*.*
The conditions at the beginning of (4) come from Lemmas 2.6, 2.7 and 2.8, and make the algorithm much faster for "small" () degrees, i.e. in all the ones where it is feasible to use the algorithm in practice.
In ((iii)) (iii), if is not of degree dividing , then neither is , so we can stop for the smallest such is not of degree dividing .
In (5), the generators of the torsion groups can be deleted from , as they will not be used again later.
Algorithm 3: Combining different -primary torsion growths
Input: A positive integer , a set of all pairs such that has primitive -power torsion growth over for some prime , where divides , and the group .
Output: A set of all pairs where has primitive torsion growth over and such that divides , and where .
- (1)
To each pair previously obtained we adjoin the set where is a prime such that is an -group and . So we get triples . For a triple , where , we will denote by the set of all first coordinates of . 2. (2)
Set ; Repeat: new:=false;
- (i)
For each pair of triples and satisfying check whether the degree of divides . If yes put new:=true and construct the triple where
[TABLE]
and add it to the set.
- (ii)
If new=false, exit the loop and return the obtained results, forgetting the third element of the triples from , i.e returning just the values . If new=true, set .
Remark 3.4*.*
Note that in the previous algorithm the elements in and are the same only if both coordinates are the same.
Finally the whole algorithm:
Algorithm TorsionGrowth
Input: An elliptic curve and a positive integer .
Output: A sequence of all pairs of a number field of degree such that and that has primitive torsion growth over , together with the group .
- (1)
2. (2)
For :
\mbox{\,}\qquad\qquad A:=A\,\cup\,\texttt{Algorithm2(E,\ell,d)} 3. (3)
4. (4)
Check whether in there are pairs and such that and . If yes, remove from . 5. (5)
Return
4. Computational results
One of the main motivations for the development of our algorithm is to get computational evidence of how the torsion grows when we consider an elliptic curve defined over base change to a number field of fixed degree.
Our algorithm takes as input an elliptic curve defined over and a positive integer and outputs all the pairs (up to isomorphism) where is a number field of degree dividing , has primitive torsion growth over , and . We denote by the multiset formed by the groups obtained in the above computation. Note that we are allowing the possibility of two (or more) of the torsion subgroups being isomorphic if the corresponding number fields are not isomorphic. We call the set the set of torsion configurations of degree of the elliptic curve . We let denote the set of as runs over all elliptic curves defined over such that , that is has torsion growth over a number field of degree . For define to be the minimum conductor such that and we denote by the maximum******Note that the smallest integer such that for every torsion group possible over there exists an elliptic curve with and is . of for all . Note that if we denote the maximum of the cardinality of the sets when by , then gives the maximum number of field extension of degrees dividing where there is primitive torsion growth. The sets have been completely determined for and for any not divisible by a prime smaller than (see [19, 15, 12, 16]). From these results, one can read out the value of for (see [34] for a different approach to obtain ). For , exhaustive computations to obtain bounds on the above sets and values have been carried out (see [14, 7]).
As grows, all these problems become much more difficult, so it makes sense to obtain lower bounds on some of these sets, where possible. We will obtain such a lower bound for , by finding all the possible torsion groups of the elliptic curves of conductor less than over number fields of degree up to . We chose to stop at (although it could probably be feasible to do computations for a few more degrees), as this is the largest degree of number fields that have been included in the LMFDB at the moment of writing of this paper. The algorithm has been implemented in Magma [3] and can be found in the online supplement [17].
Table 1 gives a short overview of our computations. For the sake of simplicity we denote in Table 1 by and the groups and , respectively. The values in the table are:
- •
1st column: degree .
- •
2nd column: the set consisting of all the possible torsion subgroups such that there exists an elliptic curve and a number field of degree such that there is primitive torsion growth over and such that . Or in the other words, the subgroups in that do not appear in for any proper divisor .
- •
3rd column: a lower bound of (or the exact value, where it is known), the maximum number of field extension of degrees dividing where there is primitive torsion growth.
- •
4th column: a lower bound of , the minimum value such that there exist elliptic curves over of conductor less than with every possible torsion configuration over number fields of degree .
- •
5th column: a lower bound of , the number of torsion configurations over number fields of degree .
Remark 4.1*.*
In Table 1 the degrees over which we know that there is no primitive torsion growth () have been excluded. The fact that there is no primitive torsion growth over number fields of degree follows from Lemma 2.11.
Table 1 gives some useful information to conjecture upon. Note that any group in will also arise in for any [2, Theorem 2.1. a)]. We conjecture that the groups we found are all that are possible.
Conjecture 4.2**.**
Let and define to be the set of groups found in Table 1 for each . Then consists of the union of all such that .
Remark 4.3*.*
The 4th column in Table 1 gives a lower bound for . When this value is very far from (the bound for the conductor up to which we tested), this might suggest more strongly that the corresponding is as stated in Conjecture 4.2, and one should consider that the case for the conjecture stronger in these cases. This happens for . The 3rd and 5th columns and the values and give information about the complexity of the torsion growth and how often it happens over the given degree . The values seem to grow with the powers of and dividing , which is to be expected. The highest values correspond to in that order. In particular, when is divisible by a power of these values grow considerably.
In the online supplement [17] we give more data about our computations. For each degree we include the following:
- •
For any we include a table with a lower bound for the set .
- •
For each torsion configuration obtained, we provide the Cremona label [6] of the elliptic curve with minimal conductor such that .
Remark 4.4*.*
At the moment of writing this paper, each elliptic curve defined over with conductor less than and for any degree , the data obtained with our algorithm appears in LMFDB. We have in plan to include all the data for . Moreover, all our data is already at the Cremona’s Elliptic Curve Data [6] in Table Eleven: Torsion Growth.
4.1. Primitive torsion growth
An interesting question is to restrict our attention to the case of primitive torsion growth of exactly a fixed degree instead of the whole growth over number fields of degree dividing a fixed degree. For a positive integer , we denote by the set of groups, up to isomorphism, that appear as primitive torsion growth of an elliptic curve defined over over a number field of degree . In the same vein, we define , , , , analogously as we did , , , , , respectively.
In Table 2 we include a lower bound for the set for . In particular, in each line the first column is the degree , the second column includes the cyclic groups , denoted by , that we have obtained, and the rest of the columns , denoted by , for .
In Table 3 we show lower bounds for the values , and for non-prime.
Again, in the online supplement [17] we give more data which gives lower bounds on the sets and the Cremona labels of the elliptic curves with minimal conductor for each torsion configuration in that we have obtained.
Similarly to Conjecture 4.2 we can state the following conjecture in the case of primitive torsion growth:
Conjecture 4.5**.**
Let and define to be the set of groups found in Table 2 for each . Then .
Remark 4.6*.*
Similarly as with in Table 1, can be considered to be a measure of how strongly we should believe for a particular . The values and measure how often primitive torsion growth happens and how complex it can be over the given degree . As before, we get more primitive torsion growth and more torsion configurations when is divisible by , and especially .
4.2. Heuristical complexity
Here we give a heuristical complexity of our algorithm. By the results of [16], we can assume that for a large enough , the largest prime will be of size .
There are 2 parts in our algorithm that should heuristically have a worst case running time for a fixed elliptic curve . The first one is checking whether a point of order is divisible by in Algorithm , where is a prime of size , in case factorization of the reduction of the primitive -division polynomial modulo small primes in step in Algorithm always has factors of degree dividing . Then in the worst case, we will need to factor a polynomial of degree approximately over a number field of degree , which is of complexity (see [27]).
The other is checking whether 2 number fields of degree are isomorphic and similarly checking whether 2 number fields of degree approximately have compositum of degree dividing . The way we implemented both of these functions (as the built-in MAGMA functions were far too slow) is by factoring the defining polynomial of one field over the other, which again has complexity (as before, see [27]).
Each of these operations should be expected to occur times, which leads us to our expected complexity of .
In practice, for small values of , the only ones for which this problem can be solved in practice, one should expect that algorithm will be the bottleneck of the computations, as the primes can be larger than . In the computations we performed, Algorithm 2 took about of the total running time.
4.3. Timing
We ran our algorithm for all elliptic curves defined over of conductor less than and for degree on the Number Theory Warwick Grid, in particular at two computers (atkin and lehner) with 64 CPUs at 2.50 GHz and 128GB of memory RAM each. In Table 4 we show for each degree the total time of the whole computation, the maximum time taken for a single elliptic curve, and other statistics. Note that this project used roughly cpu-years of computing time.
5. On sporadic torsion
Another motivation for our computations are sporadic points on the modular curves .
Definition 2**.**
Let positive integers such that . We say that a degree non-cuspidal point on the modular curve is sporadic if there exists only finitely many degree points on .
Obviously there exists a non-cuspidal sporadic point on if and only if .
There exist no sporadic points on modular curves of degree , and hence the aforementioned elliptic curve with torsion over a cubic field provides the lowest possible degree of a sporadic point on . There are many examples of sporadic points on of degree , see [22] for a long list. The fact that many of these in fact correspond to sporadic points follows from [10, Table 1 and Lemma 1].
It is somewhat surprising that there is no (to our knowledge) known example of a sporadic point on for . Hence it is interesting to ask what is the lowest possible degree of a sporadic point on for . During our computation, we find a degree sporadic non-cuspidal point on about which we will say more in Section 5.1.
5.1. A degree 6 sporadic point on
As mentioned in the previous section, during our computations of torsion growth for elliptic curves of conductor less than 400.000, we found two elliptic curve with torsion over a sextic field. By [9, Theorem 1.1], there are only finitely many such curves over sextic fields, so these curves induce sporadic points on .
We prove a stronger result below.
Theorem 5.1**.**
Let be an elliptic curve defined over and such that . If then the LMFDB label of is 162.d2 or 1296.l2. In particular, .
Proof.
Let be an elliptic curve defined over and a sextic field such that . First notice that does not have CM by [5, §4.6]. Denote by and . Let (resp. ) denote the -primary part of (resp. ). Then by the classification of the possible growth of the -primary part of the torsion over sextic fields (cf. [7, Proposition 6 (b), Table 2]) we have that is trivial, , , , or . The first two cases occur: if has LMFDB label 162.d2 or 1296.l2 then , and or is trivial, respectively. Let us remove the other three cases:
since if then ; see the Remark below [14, Theorem 7].
since otherwise and . The first author together with Lozano-Robledo, based on the classification of all the possible 2-adic images of Galois representations attached to elliptic curves without CM defined over given by Rouse and Zureick-Brown [35], computed the degree of the field of definition of the torsion for (cf. [13, 2primary_Ss.txt]). Using the above data it would follow that the number field would have to have a quadratic subfield and that would have full -torsion over it. Then would have torsion over this quadratic field, which is impossible [26, 25].
. Using the same argument as above, we see that has full -torsion over a quadratic field. Since for , we have that the image of the mod representation is such that there does not exist a point such that or . On the other hand, by assumption, there exists a point such that divides . Checking for example [16, Table 1], we see that there is no mod Galois representation satisfying both these conditions.
Now if is trivial or we have that is trivial and . We check using [13] and [35] that this happens over a sextic number field if and only if the -adic image correspond to the modular curve X20b (using the notation of [35]), implying that there exists a such that is isomorphic to , where:
[TABLE]
In particular,
[TABLE]
Now we need a point of order on defined over a subfield of a sextic number field. Checking [16, Table 1] we obtain that this could happen when is 3Cs.1.1, 3B.1.1, 3Cs, 3B.1.2 or 3B. Then, thanks to the classification of mod Galois representation of [40, Theorem 1.2] we have that or for some , where:
[TABLE]
. Since is a cube we have to solve the following Diophantine equation over :
[TABLE]
This equation defines a curve of genus , which is birational to . The Jacobian of has rank [math] over , so it is easy to determine that the points on , from which it follows that . So there do not exist satisfying .
. In this case the equation defines a genus curve, which is birational to the elliptic curve 48.a3 which has Mordell-Weil group over isomorphic to . An easy computation shows that the possible are and . The following table shows for each the corresponding elliptic curve (by plugging in into the equation of ) and the torsion over :
[TABLE]
Note that for the elliptic curve 162.d2 we have already obtained that the torsion over some sextic field is . For the remaining curves we check that only 1296.l2 has torsion over a sextic field.
∎
Remark 5.2*.*
One might try to obtain more sporadic points by running a modification of our algorithm for a large number of elliptic curves with .
Acknowledgements. We would like to thank Jeremy Rouse and David Zureick–Brown for sharing some useful data. We also thank John Cremona for providing access to computer facilities on the Number Theory Warwick Grid at University of Warwick, where the main part of the computations were done and for doing a massive check of all our computations, in particular rechecking that all the curves have the torsion growth we claim. We are greatly indebted to the referee for a very careful and helpful report that significantly improved all aspects of this paper.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] A. Bourdon and P. Clark, Torsion points and Galois representations on CM elliptic curves , Pacific J. Math 305 (2020), 43–88.
- 2[2] A. Bourdon, P. Clark and J. Stankewicz, Torsion points on CM elliptic curves over real number fields , Trans. Amer. Math. Soc. 369 (2017), 8457–-8496.
- 3[3] W. Bosma, J. J. Cannon, C. Fieker, and A. Steel (eds.), Handbook of Magma functions, Edition 2.21 (2015).
- 4[4] M. Chou, Torsion of rational elliptic curves over quartic Galois number fields , J. Number Theory 160 (2016) 603–628.
- 5[5] P. L. Clark, P. Corn, A. Rice, and J. Stankewicz, Computation on elliptic curves with complex multiplication , LMS J. Comput. Math. 17 (2014), 509–539.
- 6[6] J. E. Cremona, ecdata: 2016-10-17 (Elliptic curve data for conductors up to 400.000) , available on http://johncremona.github.io/ecdata/ .
- 7[7] H. B. Daniels and E. González–Jiménez, On the torsion of rational elliptic curves over sextic fields , Math. Comp. 89 (2020), 411–439.
- 8[8] H. B. Daniels, A. Lozano-Robledo, F. Najman and A. V. Sutherland, Torsion subgroups of rational elliptic curves over the compositum of all cubic fields , Math. Comp. 87 (2018), 425–458.
