The Mathieu group is a Galois group over
Abstract: Researchers studying the inverse Galois problem realized 25 of the 26 sporadic finite simple groups as Galois groups over during 1984--1989. We complete this program by proving that the last remaining sporadic group, the Mathieu group , occurs as a Galois group over . In fact, we produce an explicit degree $23$ polynomial with rational coefficients whose splitting field has Galois group over . To accomplish this, we use a non-rigid triple of conjugacy classes of and compute Belyi maps to construct an explicit regular Galois extension of with Galois group . Essential for our computation is the numerical Belyi map algorithm developed and implemented by Klug, Musty, Schiavone, Sijsling, and Voight, inspired by ideas of Hejhal and Stark.
Paper Prompts
Sign up for free to create and run prompts on this paper.
Top Community Prompts
Explain it Like I'm 14
1. Main topic
This paper solves a famous problem in mathematics called the inverse Galois problem.
The problem asks:
Can every finite group be described as the symmetry group of the solutions of some polynomial equation with rational-number coefficients?
The paper proves that the answer is yes for the Mathieu group . This is especially important because was the last of the 26 unusual groups called sporadic finite simple groups that had not yet been shown to occur in this way over the rational numbers.
In simpler terms, the researchers found a polynomial whose roots have exactly the complicated pattern of symmetries described by .
2. Research goals
The researchers wanted to answer two main questions:
- Does there exist a polynomial over the rational numbers whose Galois group is ?
- Can they construct such a polynomial explicitly, rather than only proving that one must exist?
They aimed for an even stronger result first. Instead of working immediately with ordinary rational numbers, they studied polynomials involving a variable . They tried to construct a field extension of with symmetry group . Once this was done, they could substitute ordinary rational numbers for and obtain many examples over .
3. How the researchers worked
Understanding the symmetry group
The group is a very large and complicated collection of permutations of 23 objects. It has
elements and is highly symmetric: it can rearrange 23 objects in unusually powerful ways while preserving special patterns.
A Galois group measures how the roots of a polynomial can be rearranged without changing the relationships between them. For example, if a polynomial has several roots, its Galois group records which swaps and rearrangements of those roots are mathematically allowed.
Choosing special elements of
The authors searched for three special types of elements in :
- one behaving like a flip of order $2$;
- two behaving like rotations of order $23$.
These three elements had to multiply together in a particular way and generate the whole group. This is similar to finding three kinds of moves that, when combined, can produce every allowed motion in a puzzle.
The relevant types were called:
There were seven possible arrangements of these elements. This meant that the usual rigidity method, which works most easily when there is exactly one arrangement, did not apply directly.
Building a geometric object
The researchers then used a special kind of mathematical map called a Belyi map. A Belyi map can be thought of as a carefully designed map from one mathematical surface to another that is allowed to behave unusually at only three special points.
An everyday analogy is a map of a surface that is mostly smooth, except for three marked locations where stretching or folding can occur. The way the surface folds around those points records the chosen elements of .
The authors:
- built a mathematical curve associated with the chosen permutations;
- calculated it numerically using computer software;
- used the
PSLQalgorithm to recognize the numerical answers as exact algebraic numbers; - constructed an exact equation for the curve;
- found a degree-23 polynomial from that curve;
- checked the polynomial and its Galois group using the computer programs
MagmaandPARI/GP.
The curve they studied had genus 4, which is a measure of how complicated its shape is. A sphere has genus 0, while a doughnut has genus 1. A genus-4 curve is much more complicated.
Checking the answer
The researchers did not rely only on numerical approximations. Numerical calculations can contain tiny errors, so they eventually verified their result using exact algebra.
They also reduced the polynomial modulo a prime number and studied its behavior there. This is similar to testing a complicated machine using a simpler model. The tests confirmed that the geometric and arithmetic symmetry groups were both .
4. Main findings
The paper proves the following important facts.
An explicit polynomial was found
The authors produced a degree-23 polynomial with integer coefficients. Its splitting field—the smallest field containing all of its roots—has Galois group
The polynomial is too long to be useful to write out here, but its leading part begins like
1 |
x^23 + 46x^21 - 598x^20 + 1679x^19 - ... |
The missing term is simply because its coefficient is zero.
occurs over the rational numbers
The splitting field of this polynomial is a Galois extension of with group . This proves that really does occur as a Galois group over the rational numbers.
A stronger result over
The authors first proved that there is a regular Galois extension of with group .
“Regular” here means that the construction does not secretly contain extra algebraic numbers beyond those already in . This matters because it allows the variable to be replaced by many rational numbers, producing many different examples over .
The last missing sporadic group was completed
Before this paper, 25 of the 26 sporadic finite simple groups had already been realized as Galois groups over . The paper completes this list by realizing the final group, .
The result can be summarized as follows:
| Question | Answer |
|---|---|
| Is a finite simple group? | Yes |
| Does it occur as a Galois group over ? | Yes |
| Is there an explicit degree-23 polynomial? | Yes |
| Can the construction produce infinitely many examples? | Yes |
5. Why the result matters
This research is important because it completes a long-standing project in algebra and number theory. It shows that even one of the rarest and most complicated finite symmetry groups can arise from an ordinary polynomial with rational coefficients.
The methods are also valuable. The researchers combined:
- group theory, to understand the symmetries of ;
- geometry, to build the associated curves;
- numerical computation, to discover the equations;
- exact algebra, to prove that the equations really work.
Their work may help mathematicians construct other difficult Galois extensions and better understand the connection between polynomials, geometric shapes, and symmetry.
In short, the paper turns an extremely abstract symmetry group into something concrete: the symmetry group of the roots of an explicit polynomial.
Knowledge Gaps
The paper establishes the existence of an -extension over , but several computational, conceptual, and general-theoretical issues remain unresolved:
- No conceptual explanation is given for the -fixed point among the seven elements of the Nielsen class; the paper explicitly describes this phenomenon as “miraculous.”
- The arithmetic structure of the seven-point Hurwitz scheme is not determined explicitly. Beyond identifying one rational point, the paper does not describe its field of definition, Galois action, or the fields of definition of the remaining six covers in a systematic way.
- The numerical Belyi-map computation is not accompanied by certified error bounds. The authors rely on numerical approximations and PSLQ recognition, then verify the resulting equations algebraically, but do not provide a fully reproducible proof that the numerical data uniquely determine the claimed model.
- The complete equations of the intermediate genus-$4$ curve and the rational function are not included in the article. They are instead made available through an external code repository, limiting the self-contained nature of the construction.
- The omitted proof concerning the discriminant factor leaves the geometric meaning of the extraneous degree-$84$ factor insufficiently justified. The paper states that it arises from singularities of the plane model but does not establish this in detail.
- The computation of the arithmetic monodromy group modulo $31$ is delegated to Magma. The exact certificate, factorization data, or independently checkable group-theoretic argument proving is not presented.
- The claim that specialization preserves the desired Galois group is not quantified. Hilbert irreducibility guarantees infinitely many suitable specializations, but the paper does not identify an explicit exceptional set or provide a systematic criterion for selecting all valid rational values of .
- The specialization search is not optimized or analyzed statistically. The “lowest-height” polynomial found so far is presented without proving minimality under any specified height, coefficient, discriminant, or defining-field criterion.
- The ramification behavior and arithmetic invariants of the resulting number fields are only partially studied. Apart from the stated sets of ramified primes, the paper does not compute discriminants, inertia groups, decomposition groups, root discriminants, or ramification filtrations in detail.
- The relation between the two displayed degree-$23$ polynomials is not analyzed beyond their shared Galois group. It remains unclear whether they arise from the same regular family through different specializations, whether their splitting fields are isomorphic, or how their arithmetic properties compare.
- The construction does not determine whether occurs through other ramification types or lower-complexity covers over . The paper focuses on the non-rigid triple , leaving other Nielsen classes and possible braid or Hurwitz components unexplored.
- The non-rigidity of all -stable triples is established computationally but not structurally explained. A theoretical classification of why no rationally rigid triple exists for is absent.
- The field-of-moduli versus field-of-definition descent is invoked through general results but not made explicit. The paper does not construct the descent cocycle or exhibit the resulting -cover over directly from descent data.
- The regular -extension over is not compared with the previously known -families over number fields. It remains open how the new component relates geometrically or arithmetically to the degree-$4$ fields and conic constructions in earlier work.
- The existence of infinitely many mutually independent -extensions is deduced abstractly, without explicit examples or effective constructions. No algorithm is provided for producing such extensions with controlled ramification or disjointness.
- The paper does not address specialization over broader classes of fields or local conditions. In particular, it leaves open whether the family can be specialized to realize prescribed local behaviors, specified ramification sets, or -extensions linearly disjoint from given extensions in an effective manner.
- The computational workflow is not independently replicated using alternative software or exact symbolic methods. Independent verification would be useful, especially because several key stages depend on Magma, PARI/GP, numerical Belyi computations, and integer-relation algorithms.
- The manuscript itself contains notation and transcription inconsistencies in the supplied text, including missing symbols and malformed expressions; a polished version would need to clarify the definitions of the relevant fields, maps, and group actions to ensure complete reproducibility.
Practical Applications
Immediate Applications
The paper is a foundational result in pure mathematics rather than an application-oriented study. Its most realistic immediate uses are in computational number theory, mathematical research, and education.
- Explicit benchmark for computational algebra systems — software / academia
- The degree-23 polynomial supplied by the paper provides a demanding test case for systems such as Magma, PARI/GP, SageMath, and related algebra packages.
- Researchers can use it to benchmark workflows for:
- computing splitting fields;
- identifying Galois groups;
- factoring polynomials modulo primes;
- calculating discriminants and ramification;
- reducing polynomial coefficient heights.
- Dependency: Reliable use requires software implementations of permutation-group and algebraic-number algorithms, together with sufficient computational resources.
- Reproducible workflow for constructing Galois extensions — computational mathematics
- The paper’s combination of Nielsen classes, rigidity methods, numerical Belyi-map computation, PSLQ recognition, Riemann–Roch calculations, and exact verification can be reused as a practical workflow for constructing other explicit covers.
- The publicly available code repository can serve as a starting point for:
- reproducing the construction;
- testing alternative specializations;
- searching for lower-height defining polynomials;
- validating candidate sporadic-group extensions.
- Dependency: Numerical stages require careful error control; the paper itself notes that intermediate computations were initially numerical and that rigor was restored through algebraic certification.
- Reference example for inverse Galois research — academia
- The result completes the realization of the 26 sporadic finite simple groups as Galois groups over .
- It can therefore be used as a canonical example in research on:
- the inverse Galois problem;
- regular Galois extensions of ;
- specialization via Hilbert irreducibility;
- fields of moduli and fields of definition;
- non-rigid triples and Hurwitz spaces.
- Dependency: The result establishes existence and explicit examples, but does not provide a general construction for arbitrary finite groups.
- Advanced teaching materials — higher education
- The construction offers a concrete case study connecting several areas that are often taught separately:
- finite group theory;
- algebraic number theory;
- algebraic curves;
- fundamental groups and monodromy;
- computational algebra;
- complex analysis and hyperbolic geometry.
- An instructional workflow could ask students to specialize the regular polynomial, compute factorizations modulo primes, infer cycle types, and compare them with the action of on 23 points.
- Dependency: The material is appropriate for graduate-level courses and requires prior knowledge of Galois theory and computational algebra.
- Verification and certification of number-field data — research infrastructure
- The explicit fields unramified outside sets such as and can be added to databases of number fields, Galois groups, and ramification data.
- Such records can support:
- comparison of discriminants and ramification patterns;
- testing conjectures about number fields;
- searches for fields with prescribed local behavior;
- validation of algorithms for arithmetic invariants.
- Dependency: Database inclusion should preserve exact defining polynomials, group-action conventions, discriminants, and independently verified Galois-group certificates.
- Benchmarking numerical algebraic-geometry methods — software research
- The use of the BelyiDB algorithm, hyperbolic uniformization, numerical expansions of holomorphic differentials, and PSLQ provides a nontrivial benchmark for numerical-to-exact mathematics.
- Developers can use the example to evaluate:
- numerical precision requirements;
- algebraic-number recognition;
- robustness of curve reconstruction;
- automatic conversion from approximate Belyi maps to exact models.
- Dependency: Successful recognition depends strongly on precision, coefficient height, conditioning, and the availability of independent exact checks.
- Cryptographic and coding-theory experimentation — limited immediate relevance
- The Mathieu group and its 23-point permutation action are historically related to the binary Golay code and exceptional combinatorial structures.
- The explicit permutations and field data may be useful for theoretical experiments involving permutation groups, coding theory, or combinatorial designs.
- This is not a demonstrated cryptographic application: the paper does not establish a secure encryption, authentication, or key-generation scheme.
- Dependency: Any security use would require separate hardness assumptions, protocol design, implementation analysis, and resistance testing.
Long-Term Applications
The following possibilities would require substantial additional theory, engineering, or validation. They should be understood as research directions rather than current products.
- Automated discovery platform for explicit Galois extensions — software / symbolic AI
- The paper suggests a pipeline that could eventually automate:
- 1. enumeration of conjugacy-class triples;
- 2. computation of Nielsen classes;
- 3. selection of promising non-rigid cases;
- 4. numerical Belyi-map calculation;
- 5. exact coefficient recognition;
- 6. descent to the base field;
- 7. rigorous Galois-group certification.
- A future tool could search systematically for explicit realizations of additional finite groups or families of groups.
- Dependencies: Automation would require certified numerical algorithms, scalable Hurwitz-space computations, reliable field-descent procedures, and proof-producing algebra software.
- Scalable construction of families of number fields — number theory / mathematical databases
- Because a regular -extension of can be specialized at infinitely many rational values of , the method can generate many -extensions of .
- In the long term, this could support systematic studies of:
- discriminant growth;
- ramification statistics;
- local-global behavior;
- linear disjointness and mutual independence;
- distribution of Frobenius conjugacy classes.
- Dependencies: Hilbert irreducibility guarantees infinitude abstractly, but efficient generation of pairwise independent or computationally small fields requires additional algorithms and large-scale computation.
- General-purpose use of non-rigid triples in the inverse Galois problem — academia
- The work demonstrates that failure of classical rigidity does not prevent a rational realization: a seven-point Nielsen class contains a Galois-fixed point.
- This may motivate broader methods based on:
- Galois actions on Hurwitz spaces;
- rational points on moduli spaces;
- braid-group orbit computations;
- descent from fields of moduli.
- Dependencies: The fixed-point phenomenon is described as unexplained in the paper, so generalization requires conceptual results rather than merely repeating the computation.
- Proof-producing numerical mathematics — formal verification
- The numerical Belyi-map stage followed by exact algebraic certification could evolve into a formally verified workflow, potentially integrated with Lean, Coq, Isabelle, or proof-producing computer algebra systems.
- Such systems could output certificates for:
- curve equations;
- rational maps;
- monodromy groups;
- regularity;
- ramification and specialization claims.
- Dependencies: Formalizing the relevant algebraic geometry, analytic approximation bounds, and finite-group computations is technically demanding.
- Higher-performance algorithms for arithmetic geometry — computing industry / research infrastructure
- The paper’s approach could inspire optimized libraries for genus-4 curves, Riemann–Roch spaces, Belyi maps, and Galois covers.
- Potential products include cloud-based services that accept group-theoretic ramification data and return candidate algebraic curves or polynomials with certified properties.
- Dependencies: Such services would need efficient algorithms, exact arithmetic, reproducibility guarantees, and safeguards against numerical false positives.
- Applications to coding theory and combinatorial design — long-term mathematical research
- Further work could investigate whether explicit -extensions, their permutation representations, or associated geometric objects yield useful constructions in coding theory, design theory, or symmetry-aware combinatorial optimization.
- The connection is indirect: the paper constructs arithmetic realizations of , while practical coding applications would require translating that symmetry into codes, decoding algorithms, or error-tolerant structures.
- Dependencies: No coding-theoretic performance advantage is established; any benefit would need explicit constructions and empirical or provable comparisons.
- Security-related use of exceptional permutation structures — speculative
- Exceptional groups and their actions could potentially contribute to specialized combinatorial primitives, structured randomization, or protocol design.
- However, the existence of a polynomial with Galois group does not itself provide cryptographic hardness. The splitting field may be unsuitable for cryptography if its structure can be efficiently exploited.
- Dependencies: Any future security application would require rigorous hardness analyses, parameter selection, implementation studies, and resistance to quantum and classical attacks.
- Daily-life applications — none directly supported
- The paper does not provide a practical intervention for healthcare, transportation, energy, finance, consumer technology, or ordinary personal decision-making.
- Any such application would be indirect, arising only if future research converts the computational methods or exceptional-group structures into useful algorithms for another domain.
Glossary
- Arithmetic monodromy group: The monodromy group obtained when both geometric and arithmetic field information are included. “Let and be the geometric and arithmetic monodromy groups of .”
- Belyi map: A map of algebraic curves branched over at most three points, typically normalized to $0$, $1$, and . “we compute Belyi maps to construct an explicit regular Galois extension of ”
- BelyiDB: A computational database and software package for calculating Belyi maps. “We compute these seven curves numerically using the BelyiDB package”
- Branch cycle argument: A method relating Galois actions on branch points to actions on conjugacy classes of a group. “This is the branch cycle argument of Fried.”
- Branch locus: The set of points over which a morphism or covering map is ramified. “Suppose that is a -cover with branch locus .”
- Canonical divisor: A divisor associated with the differential forms on an algebraic curve. “Let be a canonical divisor on the -model .”
- Canonical model: The projective realization of a curve determined by its complete system of canonical differential forms. “The canonical model of a non-hyperelliptic curve of genus~$4$ is a complete intersection in ”
- Chinese remainder theorem: A theorem allowing compatible congruences modulo pairwise coprime integers to be combined into one congruence. “reconstruct coefficients using the Chinese remainder theorem.”
- Cyclotomic character: The Galois action on roots of unity, represented as a homomorphism into a group of units modulo an integer. “Let $\epsilon \colon G_k \to \Aut \mu_n (Z/nZ)^\times$ be the cyclotomic character”
- Conjugacy class: The set of group elements related to one another by conjugation. “The group has $17$ conjugacy classes”
- Discriminant: An algebraic quantity detecting repeated roots and ramification in a polynomial or field extension. “We calculate that the discriminant of factors as ”
- Étale scheme: A scheme whose morphism has no ramification or infinitesimal degeneracy; finite étale schemes behave like finite sets over a field. “Let be the finite etale -scheme”
- Field of moduli: The smallest field over which the isomorphism class of an object is invariant under Galois action, not necessarily a field over which the object is defined. “The fixed point represents an -cover with field of moduli .”
- Fine moduli space: A moduli space that represents a classification functor and carries a universal family of objects. “Because has trivial center, is a fine moduli space.”
- Finite simple group: A finite group with no nontrivial proper normal subgroups. “In particular, one can ask the question for finite simple groups”
- Function field: The field of rational functions on an algebraic variety or curve. “Then the minimal polynomial of over is the degree~$23$ polynomial”
- Galois closure: The smallest normal extension containing a given field extension. “its Galois closure is .”
- Galois extension: A field extension whose automorphism group has size equal to the extension degree and acts transitively on embeddings. “There exists a Galois extension of with Galois group .”
- Geometric monodromy group: The monodromy group computed after extending the constant field to an algebraic closure. “We have .”
- Hurwitz scheme: A parameter space classifying branched covers with prescribed group and local monodromy data. “Let be the $0$-dimensional Hurwitz scheme over parameterizing -covers”
- Hyperbolic triangle group: A group generated by rotations associated with the angles of a hyperbolic triangle. “Let be the triangle group generated by counterclockwise hyperbolic rotations”
- Inertia group: The subgroup describing the local Galois action at a ramified point. “a generator of the local monodromy group (inertia group) at .”
- Inverse Galois problem: The question of whether every finite group occurs as the Galois group of a field extension of a given field. “The inverse Galois problem asks whether or not every finite group occurs as the Galois group”
- Linearly disjoint extensions: Field extensions whose intersection is only the base field, so their compositum has the expected degree. “There exists a -extension of linearly disjoint from .”
- Local monodromy: The conjugacy class describing how a covering behaves around an individual branch point. “which we call the {local monodromy}.”
- Mathieu group: One of a family of exceptional finite simple permutation groups; here, acts on 23 points. “The Mathieu group is a finite simple group”
- Monodromy group: The permutation group generated by analytic continuation around branch points of a covering. “with monodromy given by .”
- Mutually independent extensions: Extensions whose finite subcollections generate direct-product Galois groups. “Call a collection of -extensions of {mutually independent}”
- Nielsen class: The set of generating tuples of prescribed conjugacy classes, modulo simultaneous conjugation. “The set $\Ni_c$ is called the {Nielsen class}.”
- Non-hyperelliptic curve: A curve that cannot be represented as a double cover of the projective line. “The genus~$4$ curve is non-hyperelliptic.”
- Number field: A finite extension of the rational numbers. “Since $\lvert \Ni_c \rvert = 7$, the cover associated to is defined over a number field ”
- One-point stabilizer: The subgroup of a permutation group fixing a specified point. “the one-point stabilizer”
- PSLQ algorithm: An algorithm for discovering integer relations among numerical real or complex values. “Using the PSLQ algorithm”
- Projective line: The algebraic curve obtained by adding a point at infinity to the affine line. “There exists a regular Galois extension ”
- Ramification: The failure of a map or field extension to be locally one-to-one, measured by ramification indices. “There are three ramified fibers of ”
- Ramification divisor: A divisor recording the ramification contributions of a morphism between curves. “The degree of the ramification divisor of is $8(2-1) + 2(23-1)$”
- Ramification index: The local multiplicity with which a map covers a point. “with ramification index $23$ above .”
- Regular extension: A field extension of containing no nontrivial algebraic extension of the constant field . “A finite extension of is {regular} if it contains no nontrivial algebraic extension of .”
- Rigidity method: A technique for constructing Galois extensions from uniquely determined tuples of conjugacy classes. “The rigidity method”
- Riemann existence theorem: A theorem connecting finite branched covers of complex curves with finite-index subgroups or monodromy representations of fundamental groups. “The Riemann existence theorem, together with a calculation in ”
- Riemann–Hurwitz formula: A formula relating the genera of curves under a finite morphism and its ramification. “so the genus of is $4$ by the Riemann--Hurwitz formula.”
- Riemann–Roch space: The vector space of rational functions satisfying prescribed bounds on their poles. “A Riemann--Roch space computation produces ”
- Sporadic group: An exceptional finite simple group not belonging to an infinite family. “the $26$ ``sporadic'' groups”
- Specialization: The process of assigning a particular value to a parameter in a family of algebraic objects. “Finally, we specialize to rational numbers”
- Splitting field: The smallest field over which a polynomial factors completely into linear factors. “The splitting field of ”
- Tame extension: A field extension whose ramification indices are not divisible by the residue characteristic. “ defines a tame extension of ”
- Transitive subgroup: A subgroup whose action can send any point of the underlying set to any other point. “The classification of transitive groups of degree $23$”
- Uniformizer: A local parameter generating the maximal ideal at a point of a curve or discrete valuation ring. “Thus corresponds to an analytic uniformizer at .”
- Weierstrass point: A point on an algebraic curve where the behavior of holomorphic differentials is unusually special. “ is not a Weierstrass point.”