On Elkies' method for bounding the transitivity degree of Galois groups
Dominik Barth, Andreas Wenz

TL;DR
This paper explores Elkies' method for bounding Galois group transitivity, applying it to verify the monodromy group of a specific cover matches the sporadic Conway group Co3, demonstrating its practical utility.
Contribution
It extends Elkies' technique to new applications, notably confirming the isomorphism of a monodromy group with a sporadic simple group.
Findings
Successfully verified the monodromy group as Co3
Demonstrated the effectiveness of Elkies' method in complex cases
Provided new applications for bounding Galois group transitivity
Abstract
In 2013 Elkies described a method for bounding the transitivity degree of Galois groups. Our goal is to give additional applications of this technique, in particular verifying that the monodromy group of the degree-276 cover defined over a degree-12 number field computed by Monien is isomorphic to the sporadic Conway group Co3.
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.
On Elkies’ method for bounding the transitivity degree of Galois groups
Dominik Barth
and
Andreas Wenz
Institute of Mathematics
University of Würzburg
Emil-Fischer-Straße 30
97074 Würzburg, Germany
Abstract.
In 2013 Elkies described a method for bounding the transitivity degree of Galois groups. Our goal is to give additional applications of this technique, in particular verifying that the monodromy group of the degree- cover defined over a degree- number field computed by Monien is isomorphic to the sporadic Conway group .
1. Introduction
With the recent development of computing explicit polynomials of large degree with prescribed Galois groups the corresponding verification process poses new computational challenges.
While standard methods, for example Dedekind criterion for obtaining lower bounds for Galois groups, are still rather viable for polynomials of large degree, other techniques, such as the calculation of resolvents, are not expected to be feasible. In particular, the question whether a -transitive Galois group is a full symmetric or alternating group is generally difficult to answer.
In 2013 Elkies [4] described a method for bounding the transitivity degree of Galois groups of function field extensions by collecting the factorization patterns of many specialized polynomials and comparing them to an effective version of Chebotarev’s density theorem which arises from the Hasse-Weil bound. Elkies used this particular technique to verify that the Galois group of his computed polynomial is the sporadic -transitive Mathieu group .
Our goal is to give additional applications of this technique, in particular rigorously verifying that the monodromy group of the degree- cover defined over a degree- number field computed by Monien [6] is isomorphic to the sporadic -transitive Conway group .
This paper is structured as follows: section 2 introduces the objects of interest, section 3 depicts Elkies’ technique for bounding the transitivity degree of Galois groups. In the final section 4 we present several new applications of Elkies’ method dealing with the Galois groups , and .
2. Preliminaries
For a fixed number field let and be coprime polynomials in . The arithmetic monodromy group of the degree- cover is defined as
[TABLE]
where denotes the splitting field of over . Furthermore, the geometric monodromy group of is defined as
[TABLE]
Since is absolutely irreducible the natural (faithful) action of both and on the roots of in is transitive. Furthermore, it is well known that is normal in .
In order to study and , we will reduce the above polynomials modulo a suitable prime: The ring of integers of will be denoted by . For a fixed prime ideal in we write and for the reduction of and modulo . In the same fashion as before we define
[TABLE]
where denotes the splitting field of over . Again, is a normal subgroup of .
Thanks to a theorem of Beckmann [5, Proposition 10.9], among other considerations, if is chosen to be lying over a sufficiently large (rational) prime we may assume the following:
- (i)
The ramification locus of with respect to is -stable. 2. (ii)
The inseparability behaviour of both and specialized at ramified places with respect to coincides. 3. (iii)
.
3. A method by Elkies
The following technique described by Elkies (see [4]) bounds the transitivity degree of :
Assume, and therefore is -transitive and . Let and be the projective - and -lines over the finite field . By introducing the relation we obtain a cover ramified over exactly points with ramification structure . Its Galois closure will be denoted by .
Let be the stabilizer of a -element set in and . The corresponding cover is of degree with ramification structure induced by the natural action of on -element subsets. As acts faithfully on elements, it can be shown easily that the action on -element subsets is also faithful if . In particular, for . Additionally note that is an irreducible curve with full constant field due to .
The number of -rational points on , denoted by , has to obey the Hasse-Weil bound , in particular
[TABLE]
Here, denotes the genus of . In order to check if is indeed compatible with the above bound, we need to determine and .
We will use the following notation: For a permutation let be the number of invariant -element subsets of .
3.1. Counting -rational points on
Fix not contained in the ramification locus of . Note that -rational points on lying over correspond to degree- factors of the specialization .
If denotes the Frobenius permutation on the roots of the specialization then the number of -rational points on lying over is given by , therefore
[TABLE]
3.2. Computing the genus of
Since the degree- cover has ramification structure the Riemann-Hurwitz formula yields
[TABLE]
where .
If cannot be computed explicitly, one can deduce the upper bound
[TABLE]
Note that equality holds if the order of is prime.
3.3. Picking a sufficiently large prime
Note that the right hand side of (2) behaves differently if is not -transitive: Let be the number of orbits of acting on -element subsets, then it is reasonable to expect
[TABLE]
for large due to the orbit-counting theorem in combination with Chebotarev’s density theorem. By comparing (2) and (5) with the Hasse-Weil bound (1) we obtain , which leads to in the case .
This observation is a crucial ingredient in the verification process: If is picked such that its norm is sufficiently greater than , we are able to establish a contradiction to the Hasse-Weil bound. This, in particular, allows us to disprove the -transitivity of .
3.4. Elkies’ example:
The previously described technique was key for the proof that the degree- polynomial given in [4] where has geometric monodromy group .
With respect to the ramification locus of consists of exactly three points with ramification type . It is standard practice to show that the geometric monodromy group of is either the -transitive group or .
Assume , then for the prime ideal of norm we have and both and are -transitive. Since the discriminant of is a square, . This leads us to work with the curve : By explicitly computing we find using the Riemann-Hurwitz formula (3). In combination with the Hasse-Weil bound (1) this yields . Counting -rational points on according to (2) reveals the contradiction with a total computing time of approximately 12 hours using Magma [3]. We obtain .
4. New Applications
4.1. The sporadic Conway group
In this section we will refer to the polynomials and presented in [6, Proposition 1] of degree over a degree- number field where .
Theorem**.**
The polynomial defines a regular Galois extension of with Galois group isomorphic to the sporadic -transitive Conway group . With respect to the ramification locus is given by with corresponding ramification type .
Proof.
An easy computation shows that is ramified over 0, 1 and with the given ramification type. The ramification locus cannot be any larger, otherwise this would contradict the Riemann-Hurwitz formula.
Pick the prime ideal in of norm . Note that . Because is irreducible, must be -transitive. Additionally, the discriminant of is a square. Combining both results, we find by the classification of finite -transitive groups. In both cases we have because is normal in .
Under the assumption that is -transitive we study the curve : Combining and yields . Now, (2) gives us whereas by the Hasse-Weil bound (1). This is a contradiction, thus cannot be -transitive and we remain with .
Since is a prime of good reduction for , a theorem of Beckmann, see [5, Proposition 10.9], implies . Due to the fact that is normal in and we end up with . ∎
The most delicate part in the previous proof is the computation of the right hand side of . In the following we explain in greater detail this time consuming task (implementation in PARI/GP [7] with a total computing time of about 8 days using 550 threads simultaneously at the High Performance Computing Cluster at the University of Würzburg).
For the sake of simplicity we write for some . In the case the following holds: If has exactly irreducible -factors of degree for then . Note that if a specialization reduces the degree, we have to add 1 to .
In order to find we compute . Clearly, . Since is too large for an efficient computation, we replace with its reduction modulo , which can be determined by the exponentiation by squaring-method. In the same fashion we find and : For and we have and .
Partial results for the computation of the right hand side of (2) can be found in the ancillary Magma-readable file.
4.2. The symplectic group
In [1, Theorem 4.2, Theorem 5.2] both authors and Joachim König computed four-branch-point covers of degrees and with respective geometric monodromy group isomorphic to the -transitive symplectic group . In order to verify , standard techniques yield that is either or an alternating group. In contrast to the arguments given in [1] to rule out the last case we now apply Elkies’ method to give an alternative proof for . Assume, is -transitive, then for the above covers we get a contradiction regarding the Hasse-Weil bound:
[TABLE]
4.3. The linear group
In [2, Theorem 3.3] both authors calculated degree- four-branch-point covers with geometric monodromy group isomorphic to the -transitive group . Again, the main task in the verifying process boils down to deciding whether is either or a full alternating/symmetric group. By applying Elkies’ method we are able to give an alternative proof that cannot be -transitive:
[TABLE]
Computational remark
In the accompanying file we provide a Magma-program to illustrate the computation of the right hand side of (2) for , and .
The specified computing times for these examples refer to computers with an AMD Ryzen 7 3700X processor.
Acknowledgements
We would like to thank Stephan Elsenhans and Peter Müller for some helpful discussions.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Dominik Barth, Joachim König, and Andreas Wenz. An approach for computing families of multi-branch-point covers and applications for symplectic Galois groups. Journal of Symbolic Computation , 2019.
- 2[2] Dominik Barth and Andreas Wenz. A family of 4-branch-point covers with monodromy group PSL 6 ( 2 ) subscript PSL 6 2 \text{PSL}_{6}(2) , 2020, ar Xiv:2004.10997.
- 3[3] Wieb Bosma, John Cannon, and Catherine Playoust. The Magma algebra system. I. The user language. J. Symbolic Comput. , 24(3-4):235–265, 1997. Computational algebra and number theory (London, 1993).
- 4[4] Noam David Elkies. The complex polynomials P ( x ) 𝑃 𝑥 P(x) with Gal ( P ( x ) − t ) ≅ M 23 Gal 𝑃 𝑥 𝑡 subscript 𝑀 23 \mathrm{Gal}(P(x)-t)\cong M_{23} . In ANTS X. Proceedings of the tenth algorithmic number theory symposium, San Diego, CA, USA, July 9–13, 2012 , pages 359–367. Berkeley, CA: Mathematical Sciences Publishers (MSP), 2013.
- 5[5] Gunter Malle and Bernd Heinrich Matzat. Inverse Galois theory. 2nd edition. Berlin: Springer, 2nd edition edition, 2018.
- 6[6] Hartmut Monien. The sporadic group Co 3, Hauptmodul and Belyi map, 2018, ar Xiv:1802.06923.
- 7[7] The PARI Group, PARI/GP version 2.11.1 , Univ. Bordeaux, 2018, http://pari.math.u-bordeaux.fr/ .
