Identifying central endomorphisms of an abelian variety via Frobenius endomorphisms
Edgar Costa, Davide Lombardo, John Voight

TL;DR
Under the assumption of the Mumford-Tate conjecture, the paper demonstrates how to determine the center of an abelian variety's endomorphism ring using Frobenius endomorphisms and provides an algorithm for its computation.
Contribution
The paper establishes a method to recover the center of the endomorphism ring from Frobenius data assuming the Mumford-Tate conjecture and introduces a practical algorithm for this purpose.
Findings
The center can be recovered from Frobenius endomorphisms under the Mumford-Tate conjecture.
An explicit algorithm for computing the center of the endomorphism ring is provided.
The approach links Frobenius data to the algebraic structure of abelian varieties.
Abstract
Assuming the Mumford-Tate conjecture, we show that the center of the endomorphism ring of an abelian variety defined over a number field can be recovered from an appropriate intersection of the fields obtained from its Frobenius endomorphisms. We then apply this result to exhibit a practical algorithm to compute this center.
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.
Identifying central endomorphisms of an abelian variety via Frobenius endomorphisms
Edgar Costa
Department of Mathematics
Massachusetts Institute of Technology
Cambridge, MA 02139, USA
ORCiD: 0000-0003-1367-7785
[email protected] https://edgarcosta.org ,
Davide Lombardo
Dipartimento di Matematica
Università di Pisa
Largo Bruno Pontecorvo 5
56127, Pisa, Italy
ORCiD: 0000-0002-1069-3379
[email protected] http://people.dm.unipi.it/lombardo/ and
John Voight
Department of Mathematics
Dartmouth College
6188 Kemeny Hall
Hanover, NH 03755, USA
ORCiD: 0000-0001-7494-8732
[email protected] http://www.math.dartmouth.edu/~jvoight/
Abstract.
Assuming the Mumford–Tate conjecture, we show that the center of the endomorphism ring of an abelian variety defined over a number field can be recovered from an appropriate intersection of the fields obtained from its Frobenius endomorphisms. We then apply this result to exhibit a practical algorithm to compute this center.
1. Introduction
Let be a number field with algebraic closure . Let be an abelian variety over and let be its base change to . For a prime of (i.e., a nonzero prime ideal of its ring of integers), we write for its residue field, and when has good reduction at we let denote the reduction of modulo .
In this article, we seek to recover the center of the geometric endomorphism algebra of from the action of the Frobenius endomorphisms on its reductions . Our main result is the following theorem.
Theorem 1.1**.**
Let be an abelian variety over a number field such that is isogenous to a power of a simple abelian variety. Let be the geometric endomorphism algebra of , let be its center, and let be such that . Suppose that the Mumford–Tate conjecture (Conjecture 3.2) for holds. Then the following statements hold.
- (a)
There exists a set of primes of of positive density such that for each :
- (i)
* has good reduction at , and the reduction is isogenous (over ) to the *th power of a geometrically simple abelian variety over ; and 2. (ii)
The -algebra is a field, generated by the -Frobenius endomorphism, and there is an embedding of number fields. 2. (b)
For any , and for all outside of a set of density [math] (depending on ), if is a number field that embeds in and in , then embeds in .
Theorem 1.1 relies crucially on work of Zywina [15]. By an explicit argument, the result was proven for an abelian surface by Lombardo [8, Theorem 6.10]. This theorem may be thought of as a kind of local-global principle for the center of the endomorphism algebra: roughly speaking, the center of the geometric endomorphism algebra of is the largest number field that embeds in the center of the geometric endomorphism algebra in a relevant set of reductions over finite fields.
The set in Theorem 1.1 may be taken as in Definition 3.4. If and a model for are given, then there is an effectively computable subset with finite (see Lemma 3.5). The value of is effectively computable given a model for (see Lemma 3.6), and in fact it is easy in practice to guess (see Remark 3.7).
The primary motivation for this theorem is an algorithmic application. A result of Costa–Mascot–Sijsling–Voight [2, Proposition 7.4.7] gives a conditional way to rigorously certify that a numerical calculation [2, §2.2] of the endomorphism ring of a Jacobian is correct. This result is conditioned on a hypothesis [2, Hypothesis 7.4.6] that is directly implied by Theorem 1.1(b). In this way, Theorem 1.1 allows us to determine a sharp upper bound on , conditional on the Mumford–Tate conjecture holding for , and thereby compute in practice whenever the abelian variety is explicitly given as a Jacobian of a curve over or, more generally, as an isogeny factor of one (hence in principle all abelian varieties, see e.g. Milne [9, § III-10]).
Going a bit further in this direction, we present here an alternative method to compute the center of the geometric endomorphism algebra of in Algorithm 5.1, again conditional on the Mumford–Tate conjecture, using the notion of normic polynomials (see Section 2). This algorithm has the advantage of avoiding potentially impractical field intersections suggested by Theorem 1.1(b).
One expects to have correctly identified the center as in the conclusion of Theorem 1.1 after testing pairs of primes , where is the smallest extension of for which all the -adic monodromy groups associated to are connected—but Algorithm 5.1 does not compute the field directly. In particular, we prove the correctness of Algorithm 5.1 without establishing if the density zero set of primes in Theorem 1.1(b) can be computed effectively. Finally, even without assuming the Mumford–Tate conjecture for , Algorithm 5.1 still yields an upper bound on the center of the geometric endomorphism algebra of —we just have no guarantee that this upper bound is sharp.
We conclude with a result refining Theorem 1.1 to obtain another arithmetically interesting field attached to , namely the splitting field of the Mumford–Tate group (see Section 3 for a precise definition). Keeping notation as in Theorem 1.1, for let be a normal closure of the extension generated by the -Frobenius endomorphism.
Theorem 1.2**.**
Let be an abelian variety over a number field such that is isogenous to a power of a simple abelian variety, and suppose that the Mumford–Tate conjecture for holds. Let be the splitting field of the Mumford–Tate group of . Then the following statements hold.
- (a)
There exists a subset , of the same density as , such that for each , conditions (i)–(ii)* of Theorem 1.1(a) hold and moreover:*
- (iii)
There is an embedding . 2. (b)
For any , and for all outside of a set of density [math] (depending on ), we have .
In Theorem 1.2, the intersection is well-defined up to isomorphism since both fields are normal extensions of , and so this intersection can be computed without to resorting to normic polynomials.
For further work in this direction, see also the recent paper of Zywina [16], giving an algorithmic approach to the computation of the Mumford–Tate group itself up to isomorphism using the data of Frobenius polynomials.
Organization
This article is organized as follows. In section 2 we set up some basic Galois theory. Then in section 3 we review what is needed from work of Zywina [15] and Costa–Mascot–Sijsling–Voight [2] and prove Theorem 1.1. Then in section 4 we prove Theorem 1.2. We conclude in section 5 with an algorithmic application (Algorithm 5.1).
Acknowledgements
The authors would like to thank Andrea Maffei for an enlightening discussion about the Steiner section for reductive groups, the anonymous referees for their critical feedback, Claus Fieker, Mark van Hoeij, Tommy Hofmann, and Jeroen Sijsling for pointers, and David Zywina for helpful guiding discussions. Costa was supported by a Simons Collaboration Grant (550033). Voight was supported by an NSF CAREER Award (DMS-1151047) and a Simons Collaboration Grant (550029).
2. Galois theory
In this section, we relate field embeddings to normic factors of a minimal polynomial using some basic Galois theory: see also Klüners [7], van Heoij–Klüners–Novocin [14, Definition 5], and Szutkoski–van Hoeij [12, Theorem 4]. Throughout this section, let be a field with separable closure . For a field homomorphism and a polynomial , we define
[TABLE]
to be the polynomial obtained by applying to the coefficients of .
Definition 2.1**.**
Let be a separable field extension of finite degree. For a polynomial , define the norm from to of to be
[TABLE]
where the product runs over the distinct -embeddings .
Since permutes the embeddings , by Galois theory we have . Accordingly, we may also define the norm as the product over the embeddings for any Galois extension that has at least one such embedding.
Example 2.2**.**
If is monic, irreducible, and separable, and is the field obtained by adjoining a root of , then .
Proposition 2.3**.**
Let be monic, irreducible, and separable, and let be a root of . Let be a finite separable extension and let be monic. Then the following conditions are equivalent:
- (i)
; 2. (ii)
There exists a -embedding such that is the minimal polynomial of over ; and 3. (iii)
* is an irreducible factor of in and .*
Moreover, if satisfies these equivalent conditions, then is generated over by the coefficients of .
Proof.
Throughout, let be a splitting field of over .
We start with (i) (ii). Suppose that with . We first claim that is irreducible in : if with monic of positive degree, then with ; but is irreducible in , so equality holds; and then by comparison of degrees we conclude that . Next, let . Since and , there exists such that . Since is irreducible in , we conclude is irreducible in and so is the minimal polynomial of over . Thus
[TABLE]
since , by (2.4) we have so , and we may take in (ii).
We now prove (ii) (iii). Since is the minimal polynomial of over and is the minimal polynomial of over we have in so since is a -embedding. Moreover,
[TABLE]
To conclude, we show (iii) (i). We are given , so every root of is a root of . The field contains all roots of hence all roots of . Let be a root of , hence also of ; since is irreducible we conclude is the minimal polynomial of over . Let . Then , so . But , so since both are monic.
For the final statement, we may suppose (ii) holds and identify with its image in under . Let be the subfield of generated by the coefficients of ; then since is irreducible, so . ∎
Definition 2.6**.**
Let be a finite separable extension, and let be monic. We say a polynomial is normic for over if all of the following conditions hold:
- (i)
is monic; 2. (ii)
; and 3. (iii)
, where is generated over by the coefficients of .
Example 2.7**.**
If is normic for over , with the subfield generated by the coefficients of , and , then is also normic for over .
Remark 2.8*.*
If is normic for over and further , then van Heoij–Klüners–Novocin call the subfield polynomial of [14, Definition 5]; they state a version of Proposition 2.3 in their setting [14, Remark 6]. More recently, Szutkoski–van Hoeij [12, Theorem 4] have developed further equivalent conditions for subfield polynomials. We will soon find ourselves in a situation that would be a very simple case of these algorithms, so we will not need to employ these more advanced techniques.
We apply the previous bit of Galois theory as follows.
Proposition 2.9**.**
Let be monic, irreducible, and separable. Let be a finite separable extension. Then the following statements hold.
- (a)
The set of normic polynomials for over is a nonempty, partially ordered set under divisibility. 2. (b)
Let be normic polynomials for over , and let be the subfields generated over by the coefficients of , respectively. Then .
Proof.
For part (a), the set is nonempty by taking (and ), and divisibility clearly gives a partial ordering.
Now part (b). Let be a splitting field for over , let and for . Let . Since is normic for and is separable, is coprime to . But since , we have
[TABLE]
a contradiction. So and by the Galois correspondence . ∎
Remark 2.10*.*
Proposition 2.9(a) does not assure the existence of an irreducible normic factor over . For example, let have degree and Galois group . Let be the splitting field of over and let be the subfield of of degree fixed by the subgroup . The polynomial factors over as a product of two irreducible degree-2 polynomials. By Proposition 2.3(iii), we conclude that neither factor can be normic, as does not have an intermediate field of degree 2. Indeed, the field generated by the coefficients of either factor is itself.
Remark 2.11*.*
In Proposition 2.9(b), the converse need not hold. For example, suppose that is Galois, where is a root of . Then splits in and any linear factor generates .
3. Splitting of reductions of abelian varieties
In this section, we set up some notation and describe some results from Zywina [15] concerning splitting of reductions of abelian varieties. See also Costa–Mascot–Sijsling–Voight [2] for a summary in an algorithmic context.
We begin with a bit of notation. Let be a number field with algebraic closure and let . Let be an abelian variety over of dimension and let denote the base change of to . Suppose that is isogenous to a power of a simple abelian variety (over —ultimately, in algorithmic applications we will reduce to this case [2, Remark 7.4.10]). We write for the ring of endomorphisms of defined over and ; if is an extension, we will write for the ring of endomorphisms defined over . Let be the geometric endomorphism algebra of , and let be the center of . Then is a number field and is a central simple algebra over . Let with , so that .
For a prime of , write for its residue field and , let be the algebraic closure of , and let be the Frobenius automorphism of fixing . For a prime of good reduction for , write for the reduction of over the residue field and for the base change of to .
Let be a prime number. Let be the -adic Tate module of , a free -module of rank . Let ; then there is a continuous homomorphism
[TABLE]
For a prime of good reduction of that is coprime to , let
[TABLE]
be the inverse characteristic polynomial of the Frobenius . Then is independent of . Indeed, is the factor of the zeta function of whose reciprocal roots have complex absolute value . Thereby, can be recovered from the point counts for [6, §8]; when is isogenous to the Jacobian of a curve , one can also recover from for .
Let be the -algebraic group of (-linear) automorphisms of . The absolute Galois group acts by linear automorphisms on , hence we have . Let be the Zariski closure of in . Then is an algebraic subgroup called the -adic monodromy group of . Let be the identity component of . Let be the fixed field in of . Then is a finite Galois extension of , independent of by a result of Serre [11, p. 17]. The field is the smallest extension of for which the -adic monodromy groups are connected for all primes .
Choose an embedding . Let ; then has a Hodge decomposition of type . Let be the cocharacter such that acts as multiplication by on and as the identity of for all . The Mumford–Tate group of , denoted , is the smallest algebraic subgroup of defined over such that contains ; then is a reductive group over that is independent of the choice of embedding of into .
Conjecture 3.2** (Mumford–Tate).**
The comparison isomorphism identifies with .
Let be a maximal torus and be its character group. We write for the rank of (i.e., the dimension of ). The absolute Weyl group of with respect to is the (finite) group
[TABLE]
where is the normalizer of in . For an element , the map given by is an isomorphism of groups that depends only on the image of in ; this induces a faithful action of on , so that we can identify with a subgroup of and hence also of .
Any element acts on , and , where is the set of weights of appearing in the representation and the are the corresponding multiplicities. As acts on stabilizing , in particular we obtain an action of on , hence on the roots of the characteristic polynomial of .
We also recall the definition of the splitting field of .
Definition 3.3**.**
The splitting field of , denoted , is the intersection of all fields such that is split as a reductive group.
The field is a finite Galois extension of . With this notation in hand, we now introduce our set of primes.
Definition 3.4**.**
Let be the set of primes of with the following properties:
- (i)
The prime is a prime of good reduction for ; 2. (ii)
is prime, i.e., the residue field has prime cardinality; 3. (iii)
is defined over ; 4. (iv)
We have an isogeny over , with simple; and 5. (v)
The algebra is a field, generated by the Frobenius endomorphism.
Let be the set of primes satisfying (i)–(v) and
- (vi)
The roots of (defined in (3.1)) generate a free subgroup of rank equal to .
We have . Given a model for (provided by equations in projective space), we consider the property:
- (i*′*)
The prime is a prime of good reduction for the model of .
Let be the set of primes satisfying (i*′) and (ii)–(v) in Definition 3.4. The sets and differ in only finitely many primes. We define similarly, satisfying (i′*) and (ii)–(vi).
Lemma 3.5**.**
Given and a model for , the set is effectively computable. If is also given, then is effectively computable.
Proof.
Condition (i*′*) can be checked by ensuring the model is smooth. We can check (ii) using standard algorithms, and we let . For such , we compute using a model of by counting as above. (A finite list of primes containing those of bad reduction and the ability to compute for each good prime are all we need from a model.) We can check conditions (iii), (iv), and (v) as follows.
For properties (iii)–(iv), we refer to Costa–Mascot–Sijsling–Voight [2, Lemma 7.2.7] and Zywina [15, Lemma 2.1] for details; we indicate only the key points here. To verify (iii) we use the (proven) Tate conjecture: letting be the characteristic polynomial of , we verify that the only reciprocal roots of of the form with a root of unity in fact have . For (iv), we recall from Honda–Tate theory that an abelian variety over a prime finite field whose characteristic polynomial of Frobenius has no real roots is simple if and only if this polynomial is irreducible if and only if its endomorphism algebra is a field, generated by the Frobenius endomorphism. With (iii) established, it follows that has no real roots: indeed, otherwise it would be divisible by , but then would be a root of . We then verify (iv) and (v) by checking that is the th power of an irreducible polynomial (in ) — this is where we use .
To conclude, we claim that condition (vi) can be checked effectively if is known. Let be a splitting field for ; then the reciprocal roots of are algebraic integers that are -units in , i.e., their valuation at any prime that does not lie above is [math]. The unit group is a finitely generated abelian group. Moreover, there is an effectively computable isomorphism from the set of elements of that belong to to an abstract finitely generated abelian group defined by a minimal set of generators and relations (see e.g. Cohen [3, §7.4]). We then apply this isomorphism to the reciprocal roots of , and by linear algebra over (Smith normal form) we compute a minimal presentation for the subgroup they generate and thereby check if this subgroup is free of the correct rank. ∎
Lemma 3.6**.**
Suppose that the Mumford-Tate conjecture holds for . Then given a model for , the rank of the Mumford–Tate group and are effectively computable.
Proof.
The algorithm runs using a day-and-night strategy.
By day, we pick up from Lemma 3.5. In showing that is effectively computable, we showed that is effectively computable for ; then necessarily . On the assumption of the Mumford–Tate conjecture for , this lower bound is sharp for a set of primes of positive density [15, Proposition 2.4]. In a similar way, we may obtain an upper bound for : we have for if is an th power of an irreducible element of . On Mumford–Tate, this upper bound is sharp for a set of primes of positive density [15, Theorem 1.2]. (Again, we only need access to the polynomials for these bounds, not the model.)
By night, we complement these bounds by a (hopelessly slow) search for nontrivial algebraic cycles in powers of . Since every algebraic cycle is an eigenvector for the action of the Mumford–Tate group on homology (see for example Deligne [4, Article I, Proposition 3.4] or van Geemen [13, Theorem 3.5]), this gives an (eventually sharp) upper bound on the rank of . Similarly, one can also search for endomorphisms of again represented as algebraic cycles, which eventually gives a sharp lower bound for . The algorithm halts when the lower and upper bounds for and meet, which will happen eventually (under the hypothesis of the Mumford–Tate conjecture). ∎
Remark 3.7*.*
The upper bound for in Lemma 3.6 only needs the characteristic polynomial of Frobenius for primes ; this upper bound is unconditional. The upper bound is tight if the Mumford–Tate conjecture holds for , and then in practice one can quickly guess .
We now record two important properties about primes in .
Proposition 3.8**.**
The following statements hold.
- (a)
For all , there exists a unique monic irreducible such that
[TABLE] 2. (b)
Let and let . Then there exists an embedding . 3. (c)
For all primes , there exists an irreducible such that
[TABLE]
and such that the coefficients of generate (over ). 4. (d)
Suppose that the Mumford–Tate conjecture for holds. Then the sets have positive density, equal to .
Proof.
Part (a) was proven in Lemma 3.5 (following from property (iv)). Part (b), that the center embeds in each Frobenius field, follows from the (proven) Tate conjecture [2, Corollary 7.4.4]. For part (c), using part (b) we have an embedding , so is normic over by Proposition 2.3 applied to the monic reciprocal polynomial , where .
Finally, part (d) is a slight refinement of fundamental work of Zywina [15]: the proof of [2, Proposition 7.3.25] gives the result for , and the statement for then follows using the fact that the set of primes satisfying (vi) has full density when [15, Proposition 2.4(ii)]. ∎
Proposition 3.9**.**
Let and let . Suppose that the Mumford–Tate conjecture holds for . Then there exists an embedding , and an extension , normal over , such that for all outside of a set of density zero (depending on ), the following hold:
- (a)
The polynomial factors over into exactly irreducible factors conjugate under . 2. (b)
Any such irreducible factor is normic for over , and the subfield of generated by its coefficients is conjugate to (over ).
Proof.
We prove part (a) relying on work of Zywina [15] and comparing the action of Galois groups and the Weyl group. Let be a finite normal extension containing the fields , , and .
Let . By Proposition 3.8(d), the sets and have the same density, so avoiding a set of density zero we may suppose . Further avoiding a zero-density set depending on , the orbits of the natural action of on the roots of are the same as the orbits the action of the absolute Weyl group [15, Proposition 6.6]. (In fact, there is a natural homomorphism depending on whose image lies in and which is an isomorphism for all primes of above a prime outside a set of density zero.)
We claim that there are such orbits by making a second comparison to the action on the weights. The group also acts on the set of weights of . By Zywina [15, Lemma 6.1(ii)], this action has orbits. Using property (vi) of , there is an element whose characteristic polynomial agrees with : see Noot [10, Theorem 1.8] or Zywina [15, §4.2]. On the assumption the Mumford–Tate conjecture for , the set is in natural bijection with the roots of (equivalently, of ) by [15, Lemma 6.2] applied to . The claim follows.
From the claim, the polynomial factors into irreducible factors in . Since is irreducible, the irreducible factors of in are conjugate under , so these factors are distinct and of common degree , proving (a).
Next, part (b). Let be a prime not among the set of exceptions in the previous paragraph. Let be such an irreducible factor of and the number field generated by its coefficients. As acts transitively on the irreducible factors of with stabilizer , by the orbit-stabilizer lemma we have
[TABLE]
Therefore condition (iii) in Proposition 2.3 is satisfied, so is normic for , which is to say, . Thus, the minimal degree of a normic factor for over is .
On the other hand, by Proposition 3.8(b), there exists an embedding . Then by Proposition 3.8(c), there exists a normic factor for . With Proposition 2.3(iii) again satisfied, we conclude , so achieves the minimal degree of a normic factor of over . It follows that is one of the irreducible factors of in , hence is conjugate to in . The coefficients of generate (as a subfield of ), and so each is isomorphic and therefore Galois conjugate to in . ∎
We now prove our first theorem.
Proof of Theorem 1.1.
Let be the set defined in Definition 3.4. The set has positive density by Proposition 3.8(d). Properties (iii) and (iv) together imply that is geometrically simple; then properties (i), (iii), (iv), and (v) of and Proposition 3.8(b) give properties (i) and (ii) in the theorem.
We turn to the final statement of the theorem. Let be fixed, let , let be as in Proposition 3.9, and let be a prime not in the exceptional set in this proposition. Let be a number field that embeds in ; we show embeds in the center . Let be an embedding and let be a root of . Then, by Proposition 2.3, the minimal polynomial of over pulls back under to a normic polynomial for over whose coefficients generate . On the other hand, by Proposition 3.9(b), there exists a normic factor of over that is irreducible in and whose coefficients generate , so after conjugating there exists conjugate to and normic for over such that . Then by Proposition 2.9(b), since the coefficients of generate we conclude that . ∎
4. The splitting field of the Mumford–Tate group
In this section we prove Theorem 1.2. We start with the following lemma on algebraic groups, which is similar in spirit to results of Jouve–Kowalski–Zywina [5, Lemma 2.3].
Lemma 4.1**.**
Let be a (linear) reductive group over a perfect field , let be a maximal torus, and let be any element. Let be the set of eigenvalues of and let . Let be the subgroup of generated by .
Suppose that is a free abelian group of rank equal to the dimension of . Then is a splitting field for .
Proof.
Let be the -subgroup of generated by . As is contained in a torus, it is a semisimple element, and this implies that is a group of multiplicative type (the identity component of is a torus). By Borel [1, §8.4], we have that is a splitting field of , so it suffices to show that . Clearly , so it is enough to prove that is a torus of the same dimension as . The group can be identified with the image of the group homomorphism
[TABLE]
where is the character group of . Notice that is an abelian group of finite type, but not necessarily free. We obtain
[TABLE]
which concludes the proof. ∎
Lemma 4.2**.**
Let and let be the set of roots of . Then the Mumford–Tate group is split over the field .
Proof.
Let be a maximal torus of . As explained by Zywina [15, §6.2], there exists such that , so the eigenvalues of are precisely the roots of (equivalently, of ). By definition of , the group generated by is free of rank equal to the rank of , so we can apply Lemma 4.1. ∎
We are now ready to prove Theorem 1.2.
Proof of Theorem 1.2.
Let be the set of Definition 3.4. Since , we have already shown property (i) in Theorem 1.1(a), and have the same density by Proposition 3.8. For , let the set of roots of in , so . By Lemma 4.2, for every , the Mumford–Tate group is split over , which proves (a).
Suppose now that . Applying a result of Zywina [15, Proposition 6.6] (with ), there is a set of primes of density zero such that for every , we have . Let . Since , by Lemma 4.2, we have . Applying the result of Zywina [15, Proposition 6.6] again (now with ), there is a set (depending on ) of primes of density zero such that for every we have and . This means precisely that the two fields and are linearly disjoint over , hence . This proves (b) in the case .
The general case follows by extension to , taking the set of primes of that lie below the set of primes of constructed in the previous paragraph. ∎
5. Algorithm
In this section, we exhibit how Theorem 1.1 can be used effectively to compute the center of a geometric endomorphism algebra. We keep notation as introduced in section 3.
Algorithm 5.1**.**
Input:
- •
such that ,
- •
, and
- •
as in (3.1) for all good primes with .
Output:
- •
a boolean; if this boolean is true, then further
- •
such that , and
- •
, a set of number fields such that for some there exists an embedding of number fields.
Steps:
Using Lemma 3.5, compute the set of primes . If , return false. 2. 2.
Choose and initialize where . 3. 3.
For each prime with :
- a.
Let be such that . 2. b.
Factor into irreducibles in . 3. c.
Compute the set of normic factors by checking condition (iii) of Proposition 2.3 for each divisor of (using the factorization in Step 2). If no factor is normic, remove from the set and continue with the next prime. 4. d.
For each normic divisor , compute the subfield generated over by its coefficients. 5. e.
Reduce to a subset of representatives up to isomorphism of number fields. 6. f.
Let and let . 4. 4.
If now , return false. 5. 5.
Let minimize first then . For any such minimal prime , return true, and the set of subfields .
Proof of correctness.
By Proposition 3.8(b), for each good there is an embedding . By finiteness, there exists a maximal subextension with an embedding , which we may take as extending . By (ii) (iii) of Proposition 2.3, there exists a normic factor such that . Therefore the algorithm gives correct output for any prime selected in Step 5. ∎
Remark 5.2*.*
In step 3c we cannot limit ourselves to testing irreducible factors, because a polynomial may in general have no irreducible normic factors in , see Remark 2.10.
Proposition 5.3**.**
Suppose that the Mumford–Tate conjecture for holds. Then for large enough , Algorithm 5.1 returns true, , and a singleton , such that and .
Proof.
By Proposition 3.9, there exists an embedding and an extension , with normal over , such that factors over with exactly irreducible factors for all outside a set of density zero. Moreover, each such irreducible factor is normic, and the number field generated by its coefficients is conjugate to (over ) by an element of . For large enough, in the course of the algorithm we will eventually find which is not in this density zero set of exceptions.
We first claim that such a prime does not get discarded in Step 3. Indeed, let be any irreducible factor of in . Then is normic. Moreover, its field of coefficients is isomorphic to , so after Galois conjugation we may suppose it is equal to . Then , so it is an irreducible factor of in , and still normic, so for some , passing Step 3c.
Next, we claim that for such a prime we have , , and (up to isomorphism). Indeed, let be another normic factor of from Step 3c with and field of coefficients . From the earlier factorization of over into normic irreducibles, there exists a normic factor of over whose field of coefficients is Galois conjugate to . By Proposition 2.9(b), we conclude that is contained in this field of coefficients, thus with equality if and only if if and only if .
To conclude, suppose that is a prime such that and . Then so by degrees and the desired conclusion holds. ∎
Remark 5.4*.*
In particular, the quantity in Algorithm 5.1 is only used when is not yet large enough for Proposition 5.3 to apply, and is used only to possibly reduce the size of the output (without affecting its correctness).
Example 5.5**.**
For a very simple example of the algorithm, consider the elliptic curve with LMFDB label 11.a2 a model for the modular curve . One can easily verify that and that and . Thus by Theorem 1.1, and therefore .
Example 5.6**.**
Let be the curve defined in by the equations
[TABLE]
Then is a canonically embedded curve of genus . This curve arises in the classification of elliptic curves over with constrained -adic Galois image (in upcoming work of Jeremy Rouse, Drew Sutherland, and David Zureick-Brown): it can obtained as the image of a -rational basis of modular forms attached to the newspace with LMFDB label 81.2.c.b of level . We use this example as a test case for our algorithm, ignoring its modular provenance. Let be the Jacobian of .
With a Gröbner basis computation one can show that has good reduction away from and , and hence also . By point counting on the reduction of modulo one can compute , for which is feasible for small primes. By employing Lemma 3.6, we guess and under that assumption we have that the first two primes in are and . Furthermore, we have
[TABLE]
We conclude that . In fact, we can indeed verify [2] that is of -type over , and geometrically we have an isogeny where is an elliptic curve whose -invariant satisfies .
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1Bor [91] Armand Borel. Linear algebraic groups , volume 126 of Graduate Texts in Mathematics . Springer-Verlag, New York, second edition, 1991.
- 2CMSV [19] Edgar Costa, Nicolas Mascot, Jeroen Sijsling, and John Voight. Rigorous computation of the endomorphism ring of a Jacobian. Math. Comp. , 88(317):1303–1339, 2019.
- 3Coh [00] Henri Cohen. Advanced topics in computational number theory , volume 193 of Graduate Texts in Mathematics . Springer-Verlag, New York, 2000.
- 4DMOS [82] Pierre Deligne, James S. Milne, Arthur Ogus, and Kuang-yen Shih. Hodge cycles, motives, and Shimura varieties , volume 900 of Lecture Notes in Mathematics . Springer-Verlag, Berlin-New York, 1982.
- 5JKZ [13] Florent Jouve, Emmanuel Kowalski, and David Zywina. Splitting fields of characteristic polynomials of random elements in arithmetic groups. Israel J. Math. , 193(1):263–307, 2013.
- 6Ked [06] Kiran S. Kedlaya. Quantum computation of zeta functions of curves. Comput. Complexity , 15(1):1–19, 2006.
- 7Klü [99] Jürgen Klüners. On polynomial decompositions. J. Symbolic Comput. , 27(3):261–269, 1999.
- 8Lom [19] Davide Lombardo. Computing the geometric endomorphism ring of a genus-2 Jacobian. Math. Comp. , 88(316):889–929, 2019.
