Finding endomorphisms of Drinfeld modules

Nikolas Kuhn, Richard PinkJournal of Number Theory 2021 · DOI · arXiv

TL;DR

This paper presents the first effective algorithms for determining the endomorphism ring of Drinfeld modules, a fundamental object in arithmetic geometry. The authors provide a complete algorithmic solution for computing these rings and related structures, which has implications for understanding the arithmetic of function fields.

What Problem Does This Paper Address?

Drinfeld modules are analogues of elliptic curves over function fields, playing a crucial role in the Langlands program and number theory. A key aspect of studying these objects is understanding their endomorphism ring – the set of "structure-preserving maps" within the module. Knowing this ring is essential for many deeper arithmetic questions, such as determining the structure of associated Galois representations.

While the existence of endomorphisms and their basic properties are known, effectively computing the endomorphism ring and related structures (like the image of Galois representations) has been a significant challenge. This paper tackles this problem by developing concrete algorithms that can be implemented computationally.

Methods

The authors employ a combination of theoretical machinery and algorithmic techniques from computational algebra. Key methods include:

  • Drinfeld Module Theory: Leveraging established results on the structure of Drinfeld modules, their endomorphism rings, and their connection to Galois representations.
  • Computational Commutative Algebra: Utilizing tools like Gröbner bases for polynomial equation solving, ideal computations, and field extension analysis. This is crucial for performing explicit calculations within the coefficient rings.
  • Tate Module and Galois Representations: The algorithms heavily rely on the properties of the p-adic Tate module of a Drinfeld module and its connection to the Galois group of the base field.
  • Isogenies and Module Theory: The algorithms often involve constructing isogenies (structure-preserving maps between Drinfeld modules) to simplify the problem or reduce it to cases with smaller ranks or simpler structures. They also use techniques from module theory over polynomial rings.
  • Recursive and Parallel Algorithms: The core algorithms are designed in a way that allows for parallel execution of sub-processes, which is essential for handling the complexity of the problem and ensuring termination.

Datasets

Not discussed in the paper.

Key Insights and Ideas

  • Algorithmic Decidability: The paper demonstrates that fundamental questions about Drinfeld modules, such as determining their endomorphism ring and isogeny class, are algorithmically decidable. This is a significant theoretical advance.
  • Bridging Theory and Computation: The work provides a concrete bridge between abstract number theory (Drinfeld modules, Galois representations) and practical computation, paving the way for explicit computations in this area.
  • Role of Characteristic Polynomials: The characteristic polynomials of Frobenius elements play a central role in characterizing endomorphisms and Galois actions, providing a computational handle.
  • Handling Special vs. Generic Characteristic: The paper distinguishes between generic and special characteristic cases, developing tailored algorithmic strategies for each. Special characteristic, where endomorphism rings can be non-commutative, presents additional challenges.
  • Effective Construction of Key Structures: The algorithms not only decide the existence of certain structures (like admissible coefficient rings) but also provide effective methods for their construction.

Key Results

  • Effective Determination of Endomorphism Rings: The paper provides algorithms to effectively determine the endomorphism ring of a Drinfeld module over its field of definition and over its separable/algebraic closure.
  • Effective Description of Galois Images: Algorithms are given to determine the image of the adelic Galois representation associated with a Drinfeld module, up to commensurability.
  • Effective Isogeny Decision: An algorithm is presented to decide whether two Drinfeld modules are isogenous.
  • Computational Tools: The paper outlines the computational prerequisites and techniques needed to implement these algorithms, drawing from computational commutative algebra.

Limitations and Future Work

  • Computational Efficiency: The authors explicitly state that they have not focused on computational efficiency, aiming for clarity and organization. An actual implementation would require further optimization.
  • Implementation: The paper proposes algorithms but does not include an implementation or examples of their use.
  • Bounds on Rank and Discriminant: The paper acknowledges that it does not provide a priori bounds on the rank or discriminant of endomorphism rings, a question that remains open.
  • Future Directions: The authors suggest that exploring bounds on endomorphism ring properties is an interesting avenue for future research. The development of practical implementations is also a natural next step.

Summary updated

BibTeX
@article{kuhn2021finding,
  author = {Nikolas Kuhn and Richard Pink},
  title = {{Finding endomorphisms of Drinfeld modules}},
  journal = {Journal of Number Theory},
  year = {2021},
  doi = {10.1016/j.jnt.2021.02.013},
}
Figure