Elsevier

Journal of Symbolic Computation

Volume 104, May–June 2021, Pages 236-255
Journal of Symbolic Computation

Computing unit groups of curves

https://doi.org/10.1016/j.jsc.2020.05.002Get rights and content

Abstract

The group of units modulo constants of an affine variety over an algebraically closed field is free abelian of finite rank. Computing this group is difficult but of fundamental importance in tropical geometry, where it is necessary in order to realize intrinsic tropicalizations. We present practical algorithms for computing unit groups of smooth curves of low genus. Our approach is rooted in divisor theory, based on interpolation in the case of rational curves and on methods from algebraic number theory in the case of elliptic curves.

Introduction

Among the invariants of a commutative ring, the group of units is one of the most fundamental. However, explicit computation of this group is difficult, and even its structure remains mysterious in general (Fuchs, 1960). To date, most progress has centered on rings of integers of algebraic number fields, or localizations thereof, driven by a need for practical algorithms in computational number theory (Cohen, 1993). These results rely fundamentally on Dirichlet's unit theorem, which describes the group of units, modulo torsion, of a number field as a free abelian group of finite rank specified by simple invariants of the number field.

An analogous theorem, proved independently by Rosenlicht and Samuel (Rosenlicht, 1957; Samuel, 1966), states that for a finitely generated domain over an algebraically closed field, the group of units, modulo scalars, is free abelian of finite rank. In contrast to the number field case, no formula for the rank is known. However, there is still interest in understanding the unit group: for a very affine variety, generators for the unit group of the coordinate ring yield an embedding of the variety into its so-called intrinsic torus (Maclagan and Sturmfels, 2015). In tropical geometry, this embedding of a very affine variety into its intrinsic torus realizes its intrinsic tropicalization, from which all other tropicalizations can be recovered. Computing the intrinsic tropicalization is difficult, though, because one must first compute the unit group.

In this work we describe effective methods for computing unit groups of smooth very affine curves of low genus. Our methods rely on divisor theory for projective varieties: we embed the unit group of a very affine variety into the Weil divisor group of the projective closure, and study the cokernel of this embedding as a subgroup of the divisor class group. This allows us to give algorithms for computing unit groups of rational normal curves and elliptic curves:

Theorem 1.1

Let CPkn be a rational normal curve over an algebraically closed field k, given parametrically as the image of a map Pk1Pkn. Let C:=CTn be the corresponding very affine curve, with coordinate ring R. Then Algorithm 5.4 correctly computes a Z-basis of R/k.

Theorem 1.2

Let k=Q, let EPk2 be an elliptic curve, and let E:=ET2 be the corresponding very affine elliptic curve with coordinate ring R. Then Algorithm 6.11 correctly computes a Z-basis of R/k.

We briefly describe the structure of the paper. The basics of unit groups and intrinsic tropicalizations are discussed in Section 2. In Section 3 we interpret the problem of computing units via the geometry of boundary divisors, and give an algorithm for interpolating divisors of rational functions to Laurent polynomials. We consider two families of plane curves in Section 4, namely Fermat curves and conics. Section 5 deals with rational normal curves in parametric form. Finally, we discuss elliptic curves in Section 6.

Many of our algorithms have been implemented in Macaulay2 (Grayson and Stillman, 2018), Singular (Decker et al., 2018), or Sage (The Sage Developers, 2018). Our code for the examples in this paper can be found at: https://github.com/leonyz/unitgroups/.

Leon Zhang and Sameera Vemulapalli would like to thank the Max Planck Institute for Mathematics in the Sciences for its hospitality while working on this project. Leon Zhang was supported by a National Science Foundation Graduate Research Fellowship under Grant No. 1752814.

The authors thank Bernd Sturmfels for suggesting and advising this project. We would also like to thank Chris Eur and Martin Helmer for helpful discussions, Yue Ren for generous and thoughtful help in computing tropicalizations in Singular, and Bjorn Poonen and Ronald van Luijk for their expertise and guidance.

Section snippets

Background

We begin by stating the problem in a general setting. Let k be an algebraically closed field, and let R be a finitely generated k-algebra which is a domain. The inclusion kR induces a short exact sequence of multiplicative abelian groups1kRR/k1

Our goal is to compute, as explicitly as possible, the group R/k. Although this may seem to be a purely algebraic problem, the key to progress is to use insights from geometry, particularly divisor theory on projective varieties. Thus, writing R

General results on varieties

In this section we outline our approach to the problem of computing unit groups, via class groups. We retain the setup from the previous section: let X be a normal very affine variety over a field k=k, with coordinate ring R, projective closure XPkn, and boundary X=XX.

Definition 3.1

Define Cl0(X) to be the cokernel of the embedding

.

By definition, there is a short exact sequence of abelian groups1R/kϕDiv0(X)Cl0(X)0

Corollary 3.2

Let r be the number of divisorial components ofX. Then rankR/kr1,

Fermat curves and plane conics

We now consider two families of plane curves: Fermat curves and conics. These serve as our first two classes of examples for our general problem of computing unit groups.

Rational normal curves

We next consider rational normal curves in parametric form. Recall that for any n, a rational normal curve C of degree n is the image of P1 under an embedding

given by ν([S:T])=[f0(S,T)::fn(S,T)], where f0,,fn are k-linearly independent homogeneous polynomials of degree n. Let C:=CTn be the corresponding very affine curve, with coordinate ring R. Our goal in this section is to give an algorithm for computing a basis of R/k.

Remark 5.1

Plane conics are precisely the rational normal curves of

Elliptic curves

Fix k=Q, let EPk2 be an elliptic curve with a given base point O, and set EET2. Due to (3.1), computing the image of R/k in Div0(E) is equivalent to computing the relations between the closed points of E=:{P1,,Pn} in Cl0(E). As the group law on the elliptic curve coincides with the group law in the class group, it suffices to compute relations between the corresponding points on the elliptic curve, which can be done via canonical Néron–Tate heights.

Declaration of Competing Interest

The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.

References (24)

  • W. Bosma et al.

    The Magma algebra system. I. The user language

    Computational Algebra and Number Theory

    J. Symb. Comput.

    (1997)
  • D. Holmes

    Computing Néron–Tate heights of points on hyperelliptic jacobians

    J. Number Theory

    (2012)
  • J. Cassels et al.

    Prolegomena to a Middlebrow Arithmetic of Curves of Genus 2

    (1996)
  • M. Chan et al.

    Elliptic Curves in Honeycomb Form, in Algebraic and Combinatorial Aspects of Tropical Geometry

    (2013)
  • H. Cohen

    A Course in Computational Algebraic Number Theory

    (1993)
  • D. Cox et al.

    Ideals, Varieties, and Algorithms

    (2015)
  • W. Decker et al.

    Singular 4-1-1 — a computer algebra system for polynomial computations

  • D. Eisenbud

    Commutative Algebra with a View Towards Algebraic Geometry

    (1995)
  • E. Flynn et al.

    Canonical heights on the jacobians of curves of genus 2 and the infinite descent

    Acta Arith.

    (1997)
  • L. Fuchs

    Abelian Groups

    (1960)
  • D.R. Grayson et al.

    Macaulay2, a software system for research in algebraic geometry

  • A. Jensen et al.

    gfan.lib. A singular 4-1-2 interface to gfanlib and more

  • View full text