An Algorithm For Checking Injectivity Of Specialization Maps From Elliptic Surfaces
Abstract
Let be an elliptic curve and let be a rational number for which the specialization is an elliptic curve. Given a subgroup of with mild conditions and coming from a relatively large subset , we provide an algorithm that can show that the specialization map is injective when restricted to . The set is effectively computable in certain cases, and we carry out this computation for some explicit examples where is given by a Weierstrass equation.
keywords:
MSC:
[2020]11G05 , Elliptic curves , Elliptic surfaces , Specialization , Sage1 Introduction
Let be a (complete nonsingular) curve defined over a number field with function field . Let be an elliptic curve defined by the Weierstrass equation
For any such that the discriminant of does not vanish or have a pole at , we define the elliptic curve using the Weierstrass equation . The specialization map at is the map
which takes the point to . It is in fact a group homomorphism; that is, it respects the standard chord-and-tangent group laws on the domain and codomain. It is natural to ask what information can be extracted about the relationship between and through this homomorphism.
In 1952, Néron proved a theorem regarding specialization of which the following result is a special case.
Theorem 1.
[4] Let be a number field and let be an elliptic curve. Then for infinitely many the specialization map
is injective.
Thirty years later, Silverman [11] improved on Néron’s result by proving that all but finitely many maps are injective by showing that the set of for which injectivity fails is a set of bounded height.
While Silverman’s result is effective, it might not give a practical way to find this finite set. So the aim of this article is to examine the injectivity of specialization homomorphisms in a different way. In particular, given an elliptic curve given by a Weierstrass equation as above, how might one go about effectively determining the subset of containing those ’s for which the corresponding specialization maps are injective? We will focus on the case for concreteness. Gusić and Tadić [2] gave a method based on 2-descent which addresses this problem for curves with nontrivial -rational 2-torsion, but as they remark in their article the method does not immediately generalize to curves with trivial -rational 2-torsion.
We consider a different method to find ’s for which the specialization map is injective. More specifically, we will discuss an approach to answering the following two questions.
-
1.
Given some , how can we effectively determine whether or not the specialization map at is injective?
-
2.
What is the set of such that the specialization map at is injective?
We will approach these questions from the perspective of irreducibility. We review the classical Néron specialization theorem to relate the above questions to the question of irreducibility of polynomials after specialization, and we give an algorithm that can be used to find a Hilbert set which intersects in an infinite set . The approach taken here was inspired by a mathoverflow post by Silverman [8]. The algorithm is effective in certain cases, and we carry out the algorithm on some examples. In doing so, the elliptic curve packages in Sage [15] and Magma [1] were indispensible. They will be named wherever they were used.
2 Preliminaries
We begin by reviewing the basics on division polynomials and Hilbert sets that are used in the proof of Néron’s specialization theorem.
Let be a field of characteristic zero. Given a -rational point on some elliptic curve , finding a point with requires solving polynomial equations over . The polynomials which appear in this way are called division polynomials. Fix with and define
that is, is the coordinate ring of the elliptic curve
defined over . Define the following sequence of polynomials in .
We have the following standard facts about the polynomials above, which we state without proof.
-
1.
The polynomials , and depend only on .
-
2.
For , the set of roots of is the set of -coordinates of the nonzero -torsion points.
-
3.
For , the set of roots of is the set of -coordinates of the nonzero -torsion points which are not 2-torsion. Additionally, the set of roots of is the set of -coordinates of nonzero 2-torsion points. Since , we see that the set of roots of is the set of -coordinates of all nonzero -torsion points. However, it is worth noting that this polynomial is not separable.
-
4.
Combining the previous two statements, for we have that the set of roots of is the set of -coordinates of the nonzero -torsion points.
-
5.
If we additionally define
then for any we have that
(1) Note that, if , by the above discussion we must have .
-
6.
The polynomials and have degrees and , respectively.
Using Equation (1), the point is divisible by in if and only if there exists a point such that
Focusing on the equation for , we must have that
Thus -coordinates of points with satisfy the polynomial
(2) |
We call the -division polynomial of the point .
Lemma 2.
Let be the -division polynomial of a point . Then has a root in if and only if is divisible by in .
Proof.
If is divisible by in , say , use Equation (1) and repeat the above derivation to show that has a root in which is the -coordinate of the point . Conversely, suppose for some . Since is a polynomial of degree and there are -division points of in all with distinct -coordinates (since is not 2-torsion), we have some such that the point has the property that . Now, for any , we have that
with . Using the Weierstrass equation we then have , so . Since is not 2-torsion we have that . Therefore we cannot have , because otherwise . Hence for every . Thus .
Remark 3.
It is possible that and has -rational roots, but is not divisible by in . For example, let and . Set
Then with
but neither nor are -coordinates of points in (but they are -coordinates of points with ).
∎
We now mention some basic facts regarding Hilbert sets. For more details about Hilbert sets and Hilbert’s irreducibility theorem in greater generality, see Lang [3].
Definition 4.
Let be irreducible polynomials over . The Hilbert subset of corresponding to the ’s is the set of all such that each is irreducible over . That is, the Hilbert subset is the set of ’s for which all the polynomials remain irreducible upon specialization at .
Notice that the intersection of any two Hilbert sets is a Hilbert set - it corresponds to the union of the sets of polynomials defining the two Hilbert sets. Additionally, note that the preceding definition varies slightly from that in [3], where a Hilbert set is also allowed to intersect finitely many Zariski open sets of - that is, they might differ from a Hilbert set as above by finitely many points. Although we will have a use for such a set later, we prefer to use the term “Hilbert set” for sets precisely corresponding to irreducible specializations.
Theorem 5 (Hilbert’s Irreducibility Theorem).
Every Hilbert subset of is infinite.
Proof.
[3, Chapter 9 §2 Corollary 2.5]. ∎
Recall that the natural density of a subset of is the limit
Proposition 6.
For any Hilbert subset of , has natural density 1.
Proof.
Lang [3, Chapter 9 §2 Corollary 2.3] states that, for large enough,
for some fixed with independent of . Hence for large enough, we have
so
∎
3 Néron’s Specialization Theorem
Néron’s specialization theorem (for elliptic curves) is the result of applying Hilbert’s irreducibility theorem to division polynomials. Following Serre [7, Chapter 11], we start by recalling a completely group-theoretic fact.
Proposition 7.
Let be a positive integer and let be a homomorphism of abelian groups with the following properties.
-
1.
is finitely generated.
-
2.
The induced map is injective.
-
3.
gives an isomorphism .
-
4.
is injective.
Then is injective.
Fix an elliptic curve over , and set the specialization homomorphism for a fixed , , and a positive integer . Then conditions 1 and 4 above are always true; indeed, condition 1 is the function field version of the Mordell-Weil Theorem [12, Chapter III §6], and condition 4 follows from basic results on formal groups of elliptic curves and their relationship to reduction mod found in Silverman [13, Chapter VII §3]. It is true that conditions 2 and 3 hold inside of a Hilbert set, but instead of proving this fact directly we will replace with specific subgroups (which will include itself) and prove a more general statement.
First, notice that condition 2 is equivalent to the following statement.
(3) |
Now suppose and . If we have some with divisible by , then even if we are able to conclude that is divisible by in , say for some , in order to verify (3) we would be required to check that . Unfortunately, this is a difficult problem. To avoid this, we will restrict ourselves to subgroups in which whenever has the property that for some , we always know that . That is, condition 2 of Proposition 7 is satisfied for the inclusion . Of course, this isn’t always true; for example, if a subgroup contains an element of infinite order then always fails to have this property (recall that is finitely generated). Regarding condition 3, since specialization is always injective on torsion, note that if is a proper subgroup of , then is also always a proper subgroup of . Hence we also make the minor additional assumption that . Thus we will assume all hypotheses of Proposition 7 for the inclusion .
Now suppose that we have with the inclusion satisfying the hypotheses of Proposition 7, and . In our goal of finding a Hilbert set on which conditions 2 and 3 of Proposition 7 hold for these very specific , one might hope that we could discard either condition 2 or 3 and still maintain the conclusion of Proposition 7. Unfortunately neither condition implies the other, as the following two examples illustrate. We first look at an example where condition 2 holds but condition 3 does not.
Example 8.
Let , , , and . In [10], this elliptic curve is shown to have Mordell-Weil rank 4 and to have no nontrivial torsion points over . The Mordell-Weil group is generated by the four points and , so a complete set of representatives for the nonidentity cosets of in is
One can check (for instance, using the EllipticCurve method division_points(2) in Sage) that for the specialization of each of these 15 points is not divisible by 2 in . Thus is injective. However, the Mordell-Weil group of is , so cannot be injective. In particular, condition 3 of Proposition 7 does not hold, but condition 2 does hold.
Next, we consider an example where condition 3 holds but condition 2 does not.
Example 9.
Let , , and . One can check that with generators
see §4. Then, using Sage, one can check that the specialization has . Hence is a map from a group of order 4 to a group of order 2, so cannot be injective.
Thus we will need to check both of the conditions as part of the following proof of Néron’s specialization theorem for subgroups. For a more general version of this theorem, see [3].
Theorem 10.
Let be a nonconstant elliptic curve given by the Weierstrass equation
and let be a subgroup of rank at least 1 such that the inclusion satisfies the hypotheses of Proposition 7. Then there exists a set which differs from a Hilbert set by finitely many elements such that for each the specialization map is injective.
Proof.
By the preceding comments, it suffices to show that the set of for which satisfies conditions 2 and 3 of Proposition 7 differs from a Hilbert set by finitely many elements. Let and suppose are a set of representatives for the nonzero elements of . Since has rank at least 1, by possibly changing some of the ’s by an element of we may assume that no is 2-torsion. Let be the -division polynomial of (§2). After clearing denominators, we may assume . Because condition 2 of Proposition 7 holds for the inclusion , no is divisible by in and thus, by Lemma 2 each has no roots in as a polynomial in - that is, the irreducible factorization of in has no factors with (-)degree 1. Let be the Hilbert set corresponding to all irreducible factors of all the ’s, then remove any rational number from which appears as a zero of a coefficient in an irreducible factor; call this set . So for any each irreducible factor of each remains irreducible upon specialization, and since none of the coefficients vanish the -degree is preserved. Thus has no roots in . Since the roots of this polynomial are -coordinates of points such that , is not divisible by in , and thus condition 2 is satisfied.
Next, using notation from §2, consider the polynomial . Recall that this polynomial has the set of -coordinates of the -torsion points of as its roots. Clearing denominators, we assume that . Let be the -rational roots of which do not correspond to -rational -torsion points (by Remark 3 this is a possibility when is even), and let be the polynomials obtained by clearing the denominators in the expressions
Notice that, since each is not the -coordinate of a point in , we have that each is irreducible over . Let be the Hilbert set corresponding to the irreducible factors of of degree at least 2 and the polynomials , and then remove any rational number from which appears as a zero of a coefficient; call this set . Then, upon specialization at each irreducible factor of degree at least 2 remains irreducible of degree at least 2, and the fact that the polynomials remain irreducible of -degree 2 means that is not a square in so that is not the -coordinate of a point in . Because of this, gains no new -rational -torsion points, so condition 3 is satisfied. Recall that specialization is injective on torsion.
Finally, remove from the poles of , the poles of and all such that is not smooth; call this set . Then has the required property.
∎
Remark 11.
The choice of in the proof of Theorem 10 has no impact on the proof - any value of works. However, as becomes larger so does , so choosing to be smaller can help when working with examples.
Corollary 12.
Let and be as in Theorem 10. Then the set of all such that the specialization map is injective has density 1.
Proof.
Proposition 6. ∎
We conclude the section with a summary of how the previous proof yields an algorithm that can often be used to check when a specialization map is injective.
Algorithm 13.
Let be an elliptic curve given by a Weierstrass equation and let be a subgroup as in Theorem 10. Fix , though in the examples to follow we always choose .
-
1.
Let be a set of representatives of the nonzero cosets of in , taking care not to choose a -torsion point.
-
2.
For each , compute and clear denominators to assume that
-
3.
Compute the collection of polynomials as in Theorem 10 and the non-linear irreducible factors of the division polynomial
-
4.
Compute the Hilbert set corresponding to the irreducible factors of the polynomials above, then compute the set as in Theorem 10 by removing the poles of , the poles of and those ’s for which coefficients of at least one of the above polynomials vanish or is not smooth.
Remark 14.
In practice, one only needs that the specialized polynomials have no roots, which is weaker than asking that all irreducible factors remain irreducible.
Remark 15.
Notice that step 4 requires checking that various irreducible factors remain irreducible upon specialization; for a fixed , this can often be done by inspection or with computer software such as Sage.
Remark 16.
Let be an elliptic curve in Weierstrass form defined over the function field of a curve defined over a number field , and suppose the curve is given by an explicit equation. While Algorithm 13 was written specifically for elliptic curves over , the above algorithm can be adjusted to work for specializing at -rational points of the curve. In particular, it can be used to check injectivity of a specific specialization map, as in Remark 15.
4 Examples Using the Irreducibility Algorithm
In this section, we discuss some explicit examples of utilizing Algorithm 13 with the modification mentioned in Remark 14. We consider two examples, one with a full Mordell-Weil group of rank 2 and another with a subgroup of rank 2.
We first consider
Our goal is to find an infinite set of rational numbers for which the corresponding specialization maps (on all of ) are injective. First, we need generators of in order to use Algorithm 13. Set and . One can check (using Magma) that the determinant of the canonical height matrix of and is nonzero, and thus and are linearly independent in . In addition, using Magma’s implementation of Tate’s algorithm [12, Chapter IV §9] and combining the resulting information with the Shioda-Tate formula [9], the Mordell-Weil rank of is 2. Hence the rank of is 2. In order to show that and generate , we will use specialization in a way that is motivated by (but different from) the method outlined in [14]. First, we show that has trivial torsion. Since specialization is injective on torsion, it suffices to show that a single specialization has trivial torsion. To see this, consider the following example, which (at the same time) highlights Remark 15 and shows how injectivity of the specialization map for an individual can often be checked directly using a computer algebra system such as Sage.
Example 17.
Let and let . Consider the specialized curve
Note that
Run the following code in a Sage worksheet.
t = 5 Espec = EllipticCurve([-t^2,t^2]) Pspec = Espec(t,t) Qspec = Espec(0,t) print("The 2-division points of Pspec are: " Ψ + str(Pspec.division_points(2))) print("The 2-division points of Qspec are: " Ψ + str(Qspec.division_points(2))) print("The 2-division points of Pspec+Qspec are: " Ψ + str((Pspec+Qspec).division_points(2))) print("The torsion points of Espec are: " Ψ + str(Espec.torsion_points()))
The output is the following.
The 2-division points of Pspec are: [] The 2-division points of Qspec are: [] The 2-division points of Pspec+Qspec are: [] The torsion points of Espec are: [(0 : 1 : 0)]
We interpret the output as follows. In the context of Proposition 7, set , , and use as already defined. First, since has no torsion and specialization is injective on torsion, we see that (and thus ) also has no torsion. Thus condition 3 holds. Condition 2 is equivalent to the generators of not being divisible by 2 in upon specialization, which is shown by the above output. Hence condition 2 holds. Finally, we need to show that conditions 2 and 3 hold for the inclusion . Clearly condition 3 holds since we’ve shown that has no torsion, and we can show condition 2 by using Sage to show that and have no 2-division points in using similar commands to those above. Thus the specialization map is injective.
It remains to show that and generate . Consider the specialization at as in Example 17. Sage yields that has Mordell-Weil group over with generators and . Since we may instead use and as generators. Fix the bases for , respectively. After fixing some basis for (which has 2 elements), we let the matrix represent the inclusion and the matrix represent the specialization map . We then have a sequence
The composition is the specialization map . Since this maps generators of to generators of , is the identity matrix. Hence is invertible, so the inclusion is surjective. Hence with generators and .
Before moving forward with using Algorithm 13 to find injective specialization maps, it is important to notice that success of this method for a fixed is not equivalent to injectivity of the specialization map. We can’t hope for this to be true since it succeeds on (most of) a Hilbert set and Hilbert sets often have infinite complements, whereas Silverman’s specialization theorem states that the specialization map fails to be injective for only finitely many rational numbers. The next example illustrates the failure of this equivalence.
Example 18.
Let . On the elliptic curve , notice that
so our criterion (for ) cannot conclude that is injective because condition 2 of Proposition 7 fails. A check using Sage shows that with generators and . Now and , meaning the matrix of the specialization map with respect to the ordered bases and is
The determinant of this matrix is , so is injective.
We now carry out Algorithm 13 for . As in §2, we find the the polynomials in steps 3 and 4 to be
where . Notice that all four polynomials are irreducible over . As in Remark 14, we need to find ’s for which the specialized polynomials have no roots in . Equivalently, we need to find ’s for which the curves defined by the polynomials have no rational points of the form . Set
Using Sage, all of the curves are rational over and have rational points, hence they have infinitely many rational points. Because of this, we will restrict to and examine the case of specializing at natural numbers, which similarly reduces to looking at integral points on the curves (since each polynomial is monic in ). We first prove, using elementary methods, that the only obstruction to success of the method for comes from . We begin with an algebraic lemma which will make analyzing easy.
Lemma 19.
[6] Consider a (depressed) quartic polynomial
with discriminant . If and then has four distinct roots in .
Proposition 20.
The curves and each have no integral points with .
Proof.
: Notice that the discriminant of as a polynomial in is
This is positive for . The corresponding depressed quartic (in ) is
By Lemma 19, this quartic has no real roots in for .
: Fix and suppose is an integral point on . We make 3 cases based on possible values of .
-
Case 1: If , each nonzero term of is positive. Thus is not a point on .
-
Case 2: Let . Note that
so is not a point on .
-
Case 3: Suppose . We have the following three polynomials in :
The only one with a root is with as a root, yielding the integral point .
: Notice that is an integral point on if and only if
Noting that there are no solutions with , we see that Since and share no prime factors, we must have that is . So we have two possibilities for the ordered pair
In the first case we have , yielding no integral (or rational) solutions. In the second, we must have . Hence the only integral point on is .
∎
Note that the restriction is required because has the point .
Corollary 21.
Let be a natural number. If the curve has no integral points of the form , then the specialization map is injective.
In order to work directly with the integral points of , we will utilize the algorithm of Poulakis and Voskos [5]. This relates finding integral points on genus zero curves to solving Pell-like equations. The algorithm requires that the number of “valuations at infinity” (henceforth called points at infinity) of the curve is less than three; that is, there are at most two points defined over lying in the closure of in but not on itself. Homogenizing then setting the new variable to zero, we obtain the equation
(4) |
Setting , we have
On the other hand, setting we similarly obtain
So if is a root of and is a root of , the points at infinity are
However, notice that is a root of : indeed,
Hence of the four points listed above only two are distinct. Thus has two points at infinity. Poulakis and Voskos now proceed as follows.
-
1.
We first need to determine the singularities of the projective closure of . Sage quickly yields as the only singular point.
-
2.
Using Sage, we obtain the rational parameterization
Notice that the third component comes from Equation (4); in particular,
-
3.
Set and . Then and . After this change of variables, our birational map becomes
Equivalently, we have
Set and
-
4.
The resultant of and is , and the resultant of and is . Thus we set .
-
5.
Every integral point on is then obtained in the following way. Let be a solution to an equation of the form for some with and . Then we have
(5)
So the specialization map is injective for any which cannot be written in the form as given in (5). We will now make this even more explicit by solving the Pell-like equations given above. Many of the equations have no solutions of the required form, so we identify those first.
Lemma 22.
Let with or and let with . The equations and have no solutions of the form with and gcd. In addition, the three equations
have no integer solutions at all.
Proof.
Let . Suppose with . Then , so necessarily . Write for some . We then have
where . Hence , so and thus gcd, so no solutions of the required form exist. Similarly, if for some we also find that gcd. If , writing we have that
Thus , so or . Thus is odd, so and are both even. Hence , so again. Thus the equations and have no solutions with gcd. For the remaining three equations, reducing mod 4 tells us that is congruent to either 2 or 3 mod 4, which is impossible. Thus these three equations have no integer solutions at all. ∎
Next, we show that, for the remaining equations, requiring that is an extraneous condition.
Lemma 23.
All integer solutions to the equations for have gcd.
Proof.
Notice that gcd, so gcd is either 1 or 2. If gcd = 2, then setting and we find that . If then isn’t an integer. For we have and for we have mod 4. But 0 or 1 mod 4, so no allows the equality to hold mod 4. So we can’t have gcd = 2, and thus gcd. ∎
Combining what we have shown in the previous two lemmas with step 5 from the Poulakis and Voskos algorithm, we see that the -coordinates of integral points of have the form
where is an integral solution of any of the equations where and . Before going any further, we use this formula for to extract a simple subset of of density 1/4 for which the specialization map is injective.
Theorem 24.
Let with and suppose mod . Then the specialization map for at is injective.
Proof.
Suppose that is an integral point on so that we have
where satisfies for some . Note that if or , then is even. If is odd, we must have , so that for some satisfying . Hence , so that , and since we require that gcd we have that is odd. Thus
Now assume that we have with and mod 4. Then we’ve just shown that is not an integral point on for any , so by Corollary 21 the specialization map at is injective. ∎
Using some elementary algebraic number theory, we now solve the remaining four equations.
-
1.
: The integer solutions to this equation correspond to units of of the form with . Recall that
If we write , note that if and only if . Hence the integer solutions of correspond to for . The solutions with correspond to choosing .
-
2.
: Suppose is an integral solution. Noting that is even, set
Then are integers such that
that is, has -norm 1. Note that every unit of that is an even power of must have norm 1 because it’s either a square or minus a square (and has norm 1). Additionally, every unit of that is an odd power of must have norm because it’s times (plus or minus) a square, and has norm . Hence
for some
Thus
Multiplying both sides by gives
Thus the solution set of corresponds to the set
As before, the solutions with correspond to choosing .
-
3.
: If is an integral solution, notice that . Writing , we see that
Hence
Multiplying both sides by , we have
So the solution set of corresponds to the set
The solutions with correspond to choosing .
-
4.
: As with the case, writing we have
Using a similar argument, we find that the solution set of corresponds to the set
For the solutions with correspond to choosing , and for the solutions with correspond to choosing ; notice that the choice is sgn.
We summarize the above discussion with the following formula that gives the -coordinates of the integral points on .
Proposition 25.
If is the -coordinate of an integral point on , then is given by one of the following four formulas.
-
1.
where
for some .
-
2.
where
for some .
-
3.
where
for some .
-
4.
where
for some .
Proof.
Let , so that for a solution of we have that Let , so that Adding and subtracting the equations gives
Solving for the left hand sides gives the first formula, and the other 3 formulas are obtained in the exact same way. Finally, note that for formula 4, we do not need to include a sgn factor as discussed when solving the corresponding equation above since it cancels out in the expression for . ∎
To summarize, we have shown the following.
Theorem 26.
Let be the set of integers which fail to satisfy the conditions of Proposition 25. Then is a subset of density 1 and for each the specialization map is injective.
Proof.
Corollary 27.
Let be as in Theorem 26. For each , the Mordell-Weil group of the elliptic curve
has a torsion-free subgroup of rank 2 generated by and . In particular,
For our second example, we consider
This example comes from Shioda’s list of rational elliptic surfaces with specified Mordell-Weil rank [10]. As indicated there, has rank 4 with generators
Instead of considering specialization of the entire Mordell-Weil group, we will focus on the subgroup generated by the two points and in order to show the utility of Algorithm 13 for proper subgroups.
As in the previous example, we obtain the four relevant polynomials.
Notice that the curves , and have rational points
respectively. Using Sage, the curves also have genus 1, so they are elliptic curves defined over (despite the fact that these curves are defined by quartic polynomials, there is still an embedding of their normalizations into as a cubic where we move our selected rational point to infinity), and thus the methods used for the previous examples will not work. However, using Magma and Sage, we find that the curves and have Mordell-Weil rank zero (over ) and have the following finite lists of rational points.
Hence we obtain the following.
Theorem 28.
Let be a rational number such that
and the polynomial has no rational roots. Then the specialization map is injective.
5 Acknowledgements
I would like to thank Edray Goins and Donu Arapura for their insightful discussions regarding the contents of this paper. I also would like to thank Kenji Matsuki for contributing significant revisions and clarifications for an early draft.
This research did not receive any specific grant from funding agencies in the public, commercial, or not-for-profit sectors.
6 Appendix
In this appendix, we provide a Sage function HIT_spec_check
that utilizes a variant of Algorithm 13 to find places where the algorithm doesn’t provide useful information. The code can be directly copy-pasted into a Sage worksheet to begin computing. The code does not compute the Hilbert set as in Algorithm 13, but instead iterates through a set test_interval
of rational numbers and checks if the sufficient conditions outlined in §3 are all satisfied (for ). More specifically, the inputs are the constants and of short Weierstrass equation of an elliptic curve , the test_interval
, free generators of the subgroup (as in Theorem 10) one would like to specialize, and the points in the torsion subgroup of .
def list_powerset(lst): #A powerset subroutine result = [[]] for x in lst: result.extend([subset + [x] for subset in result]) return result def HIT_spec_check(A,B,test_interval,free_gens,torsion_points): #check for injectivity of the specialization map using Algorithm 12 for n = 2. #A, B Weierstrass coefficients of elliptic curve E over Q[t] #test_interval = list of numbers to specialize at #free_gens = list of generators of free part of Mordell-Weil group of E #torsion_points = list of 2-torsion points of E. #-These need to have 3 coordinates. print("The HIT criterion fails at:") for t_0 in test_interval: if 4*A.numerator().subs(t=t_0)^3+27*B.numerator().subs(t=t_0)^2 == 0: print(str(t_0) + " (not elliptic)") continue #specialized curve E = EllipticCurve(QQ,[A.numerator().subs(t=t_0),\ B.numerator().subs(t=t_0)]) #the test fails if the specialized curve gains additional 2-torsion. #(note: this just checks for any additional torsion currently) if len(E.torsion_points()) > (len(torsion_points)): print(str(t_0) + " (gained torsion)") continue Mmod2M_elements = [] free_gens_spec = [] torsion_points_spec = [] points_to_divide = [] for P in free_gens: #specialize the free generators free_gens_spec.append(E(P[0].numerator().subs(t=t_0),\ P[1].numerator().subs(t=t_0))) #specialize the torsion for P in torsion_points: Ψ#if P is the identity, we need to append the identity if P[2] == 0: torsion_points_spec.append(E(0)) #otherwise, we specialize it else: torsion_points_spec.append(E(P[0].numerator()\ .subs(t=t_0),P[1].numerator().subs(t=t_0))) #each nonempty subset corresponds to one point in Mmod2M powerset_free_gens = list_powerset(free_gens_spec) for S in powerset_free_gens: #skip the empty subset if S == []: continue #otherwise, add up everything in the subset & #put it in Mmod2M_elements else: sum = E(0) for P in S: sum = sum + P Mmod2M_elements.append(sum) #if there’s no torsion, we just need to divide things in Mmod2M by 2 if len(torsion_points) == 1: points_to_divide = Mmod2M_elements else: #we have to check the torsion points for divisors points_to_divide = torsion_points_spec #this for loop adds all the other points that we have to check for P in torsion_points_spec: for Q in Mmod2M_elements: points_to_divide.append(P+Q) #check if any relevant points are divisible by 2 for P in points_to_divide: if P.division_points(2) != []: print(str(t_0) + " (" + str(P) + " is divisible by 2)")
As an example, we can obtain information about the example . After defining the functions above, run the code below.
R.<t> = QQ[] K.<t> = FunctionField(QQ) A = -t^2 B = t^2 E = EllipticCurve([A,B]) P = E(t,t) Q = E(0,t) interval = QQ.range_by_height(50) free_gens = [P,Q] torsion_points = [(0,1,0)] HIT_spec_check(A,B,interval,free_gens,torsion_points)
The output generated is shown below.
The HIT criterion fails at: 0 (not elliptic) 1 ((-1 : -1 : 1) is divisible by 2) -1 ((-1 : -1 : 1) is divisible by 2) 2 ((0 : 2 : 1) is divisible by 2) -2 ((0 : -2 : 1) is divisible by 2) 3 (gained torsion) -3 (gained torsion) 4 ((4 : 4 : 1) is divisible by 2) -4 ((4 : 4 : 1) is divisible by 2) 1/6 (gained torsion) -1/6 (gained torsion) 7 ((7 : 7 : 1) is divisible by 2) -7 ((7 : 7 : 1) is divisible by 2) 8/3 (gained torsion) -8/3 (gained torsion) 8/15 (gained torsion) -8/15 (gained torsion) 20 ((20 : 20 : 1) is divisible by 2) -20 ((20 : 20 : 1) is divisible by 2) 1/24 (gained torsion) -1/24 (gained torsion) 6/25 ((0 : 6/25 : 1) is divisible by 2) -6/25 ((0 : -6/25 : 1) is divisible by 2) 16/25 ((0 : 16/25 : 1) is divisible by 2) -16/25 ((0 : -16/25 : 1) is divisible by 2) 27 ((27 : 27 : 1) is divisible by 2) -27 ((27 : 27 : 1) is divisible by 2) 27/8 (gained torsion) -27/8 (gained torsion) 27/10 (gained torsion) -27/10 (gained torsion) 27/28 (gained torsion) -27/28 (gained torsion) 5/49 ((-5/49 : -5/49 : 1) is divisible by 2) -5/49 ((-5/49 : -5/49 : 1) is divisible by 2) 11/49 ((11/49 : 11/49 : 1) is divisible by 2) -11/49 ((11/49 : 11/49 : 1) is divisible by 2) 12/49 ((-12/49 : -12/49 : 1) is divisible by 2) -12/49 ((-12/49 : -12/49 : 1) is divisible by 2) 36/49 ((36/49 : 36/49 : 1) is divisible by 2) -36/49 ((36/49 : 36/49 : 1) is divisible by 2)
The output shows every rational number of height less than 50 at which Algorithm 13 fails to decide whether or not specialization is injective. Note, for instance, the appearance of 27 above; this is how the author discovered Example 18.
Since the code relies on finding rational points on curves defined by the 2-division polynomials of , if these curves have finitely many such points (such as when they have genus larger than 1) this code can be used to conjecture the value of the constant appearing in Silverman’s Specialization Theorem; that is, the “cutoff” so that all rational numbers of height larger than have injective specialization maps.
Note that the code above could be immediately improved by readers more proficient than the author in Python and Sage. The author hopes that the code nonetheless will assist in the search for the failure of specialization maps to be injective.
References
- BCP [97] W. Bosma, J. Cannon, and C. Playoust, The Magma algebra system. I. The user language, J. Symbolic Comput. 24 (1997), no. 3-4, 235–265, Computational algebra and number theory (London, 1993). MR MR1484478
- GT [15] I. Gusić and P. Tadić, Injectivity of the specialization homomorphism of elliptic curves, Journal of Number Theory 148 (2015), 137–152.
- Lan [83] S. Lang, Diophantine geometry, 2nd ed., Springer-Verlag, 1983.
- Nér [52] A. Néron, Problèmes arithmétique et géométriques rattachés à la notion de rang d’une courbe algébrique dans un corps, Bulletin de la Société Mathématique de France 80 (1952), 101–166.
- PV [02] D. Poulakis and E. Voskos, Solving genus zero diophantine equations with at most two infinite valuations, J. Symbolic Computation. 33 (2002), 479–491.
- Ree [22] E. L. Rees, Graphical discussion of the roots of a quartic equation, The American Mathematical Monthly 29 (1922), no. 2.
- Ser [97] J. P. Serre, Lectures on the mordell-weil theorem, 3rd ed., Aspects of mathematics, vol. E 15, Springer, Wiesbaden, 1997 (eng).
- [8] J. H. Silverman (https://mathoverflow.net/users/11926/joe-silverman), Exceptional specializations of Galois groups in the Hilbert irreducibility theorem, MathOverflow, URL:https://mathoverflow.net/q/226379 (version: 2015-12-17).
- Shi [90] T. Shioda, On the Mordell-Weil lattices, Comment. Math. Univ. St. Pauli 39 (1990).
- Shi [91] , Construction of elliptic curves with high rank via the invariants of the Weyl groups, J. Math. Soc. Japan 43 (1991), no. 4.
- Sil [83] J. H. Silverman, Heights and the specialization map for families of abelian varieties, J. Reine Angew. Math. 342 (1983), 197–211.
- Sil [94] , Advanced topics in the arithmetic of elliptic curves, Springer-Verlag, 1994.
- Sil [09] , The arithmetic of elliptic curves, 2nd ed., Springer-Verlag, 2009.
- Sto [19] M. Stoll, Diagonal genus 5 curves, elliptic curves over , and rational diophantine quintuples, Acta Arithmetica 190 (2019), no. 3, 239–261.
- The [19] The Sage Developers, Sagemath, the Sage Mathematics Software System (Version 8.9), 2019, https://www.sagemath.org.