A software package to compute automorphisms of graded algebras
Simon Keicher

TL;DR
This paper introduces autgradalg.lib, a Singular library for computing automorphisms of graded algebras, with applications to Mori dream spaces and Fano varieties.
Contribution
It provides an implementation of algorithms for automorphism computation of graded algebras, extending their application to Mori dream spaces and Fano varieties.
Findings
Successfully computed automorphism groups of several Fano varieties.
Demonstrated the library's effectiveness on integral, finitely generated graded algebras.
Extended the applicability of automorphism algorithms to new classes of algebraic varieties.
Abstract
We present a library autgradalg.lib for the free computer algebra system Singular to compute automorphisms of integral, finitely generated -algebras that are graded pointedly by a finitely generated abelian group. It implements the algorithms developed in 'Computing automorphisms of Mori dream spaces'. We apply the algorithms to Mori dream spaces and investigate the automorphism groups of a series of Fano varieties.
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.
A software package to compute automorphisms of graded algebras
Simon Keicher
Mathematisches Institut, Universität Tübingen, Auf der Morgenstelle 10, 72076 Tübingen, Germany
Abstract.
We present a library autgradalg.lib for the free computer algebra system Singular to compute automorphisms of integral, finitely generated -algebras that are graded pointedly by a finitely generated abelian group. It implements the algorithms developed in [10]. We apply the algorithms to Mori dream spaces and investigate the automorphism groups of a series of Fano varieties.
2010 Mathematics Subject Classification:
13P10, 14Q15, 14J50, 13A02, 14L30, 13A50
1. Introduction and setting
Consider an integral, finitely generated -algebra that is graded by a finitely generated abelian group , i.e., we have a decomposition
[TABLE]
Let the grading to be effective, i.e., the monoid of all with generates as a group, and pointed: this means that we have and the polyhedral cone in generated by is pointed.
We are interested in the automorphism group : it consists of all pairs such that is an automorphism of -algebras, is an automorphism of groups and holds for all . Note that not only is an important invariant of the algebra , the methods to compute it can by applied to compute symmetries of homogenous ideals . Once given explicitely, the knowledge of the latter largely accelerates further computations involving , see [11, 5, 14] for examples.
This note presents an implementation autgradalg.lib of the algorithms from [10] to compute . It is written for the free computer algebra system Singular [7] and is available at [13]. In Section 2, we describe the algorithm [10] to compute and explain our implementation by a series of examples. In Section 3, we apply our implementation to Mori dream spaces. As a result, we determine in Proposition 3.1 information on the automorphism groups of a class of Fano threefolds listed in [3].
2. Automorphisms of graded algebras
Let us fix the assumptions on the algebra for our algorithms. Firstly, we assume the grading group to be of shape . In particular, and the list encode . The -grading is determined by the degree matrix which has the as its columns. Moreover, we expect to be given explicitly in term of generators and relations:
[TABLE]
As one can remove linear equations, it is no restriction to assume that is minimally presented, i.e., holds and the generating set for is minimal. From an implementation point of view, it is convenient to impose the following slight restrictions:
- •
the homogenous components are all trivial,
- •
the set of the free parts of the contains a lattice basis for .
Example 2.1** (autgradalg.lib I).**
Consider the following -graded -algebra from [9, 12, Example 2.1] where
[TABLE]
Then the -grading given by is effective and pointed as hinted in the following picture. To use autgradalg.lib, download it from [13] and start Singular in the same directory. We enter with the commands
LIB "gfanlib.so"; // for cones 2. >
LIB "new_autgradalg.lib"; 3. >
intmat Q[4][8] = 4. >
1,1,0,0,-1,-1,2,-2, 5. >
0,1,1,-1,-1,0,1,-1, 6. >
1,1,1,1,1,1,1,1, 7. >
1,0,1,0,1,0,1,0; 8. >
list TOR = 2; // torsion part of K 9. >
ring S = 0,T(1..8),dp; 10. >
setBaseMultigrading(Q); // grading
q_{1}$$q_{4}$$q_{5}$$q_{6}$$q_{7}$$q_{8}$$(0,0,0)$$q_{2}$$q_{3}
Let us recall shortly the steps of the algorithm to compute ; for details, we refer to [10]. The overall idea is to present as a stabilizer in the automorphism group of the -graded polynomial ring . In a first step, we will compute a presentation for some . The set of generator weights will play a major role. We make use of the following -action.
Construction 2.2**.**
See [10, Construction 3.3]. Write . Determine a -vector space basis for consisting of monomials. Then the concatenation is a basis for . With , in terms of , each defines a linear map . We obtain an algebraic action
[TABLE]
For the second step, the idea is to determine equations cutting out those matrices in that permute the homogeneous components of same dimension where . As must be fixed by each automorphism, it suffices to consider the finite set
[TABLE]
It can be computed by tracking a lattice basis among the set of free parts of the , see [10, Remark 3.1].
Algorithm 2.3** (Compute ).**
See [10, Algorithm 3.7]. *Input: * the -graded polynomial ring .
- •
Determine . Compute a basis as in Construction 2.2.
- •
Define the polynomial ring .
- •
Compute an ideal whose equations ensure for each the multiplicative condition where .
- •
Compute . Determine the subset of those , that map bijectively to where .
- •
For each , do
- –
compute an ideal ensuring that each matrix in maps the component to the component where .
- –
Redefine .
*Output: * the ideal . Then is an algebraic subgroup isomorphic to .
Remark 2.4**.**
- (i)
Note that the third step of Algorithm 2.3 is a finite one, see [10, Definition 3.4(i)] for the precise definition. 2. (ii)
The ring in Algorithm 2.3 is -graded by defining as the degree of the -the element of . 3. (iii)
The isomorphism given by is as in Construction 2.2; explictly, it is given by
Example 2.5** (autgradalg.lib II).**
Let us apply Algorithm 2.3 to Example 2.1. Here, and all bases are one-dimensional. Since no weight appears multiple times, . Next, the algorithm will compute . In our implemenation one can also trigger this step manually if desired:
list origs = autGenWeights(Q, TOR);
The result, origs, is a list of four integral matrices (intmats) standing for the automorphisms of the generator weights
[TABLE]
q_{1}$$q_{4}$$q_{5}$$q_{6}$$q_{7}$$q_{8}$$(0,0,0)$$q_{2}$$q_{3}
Note that is isomorphic to the symmetry group of a -dimensional rhombus. We now compute with the command
def Sprime = autKS(TOR); 2. >
setring Sprime;
A closer inspection shows that Sprime stands for the ring . Furthermore, a list listAutKS will be exported: each element is a triple where runs through the four elements of and is a formal matrix over Sprime that encodes isomorphisms of as in Remark 2.4(iii). For instance, for listAutKS[2], the sendond entry in the triple is the second matrix listed in (5) and the matrix is
print(listAutKS[2][1]);
[TABLE]
The equations obtained from the zero-entries in and its invertible-condition are stored in the ideal . The third entry is:
print(listAutKS[2][3]);
[TABLE]
Moreover, an ideal Iexported, called in in Algorithm 2.3, is being exported that is the product over all the ideals where runs through . This means is isomorphic to Sprime modulo Iexported; the degree matrix of Sprime can be obtained via getVariableWeights().
We come to . Restricting the group action of Construction 2.2 to , we have an algebraic subgroup given as stabilizer
[TABLE]
Provided holds for all , in [10] the authors have shown that we have an isomorphism
[TABLE]
The final step then is the following. Define the set of ideal generator degrees. The idea is to compute (linear) equations ensureing that the vector spaces , where , are mapped to one-another.
Algorithm 2.6** (Computing ).**
See [10, Algorithm 3.8]. Input: the -graded polynomial ring and the defining ideal of .
- •
Let be the output of Algorithm 2.3.
- •
Compute and form the -vector space .
- •
For the vector space , compute
- –
a -basis and
- –
a description with linear forms .
- •
With the -action from Construction 2.2 and , we obtain the ideal
[TABLE]
Output: the ideal . Then is an algebraic subgroup isomorphic to .
Remark 2.7**.**
- (i)
Algorithms 2.6 and 2.3 do not make use of Gröbner basis computations. However, in Singular, it usually is quicker to compute instead of . 2. (ii)
Computing with Algorithm 2.6 enables us to directly compute the number of irreducible components and the dimension of by Gröbner basis computations.
Example 2.8** (autgradalg.lib III).**
Continuing Example 2.5, let us compute . We first switch back to , enter the defining ideal for and start the computation of :
setring S; 2. >
ideal I = T(1)*T(6) + T(2)*T(5) + T(3)*T(4) + T(7)*T(8); 3. >
def Sres = autGradAlg(I, TOR); 4. >
setring Sres;
The resulting ring Sres is identical to Sprime. A list stabExported is being exported; the interpretation of the entries is identical to that of the list listAutKS from Example 2.5 with the difference, that the ideal part now contains additional equations describing the stabilizer: for example
stabExported[2][3]
[TABLE]
Moreover, an ideal Jexported is being exported that is the product over all as before. Then Sres modulo Jexported is isomorphic to . The grading is obtained as before with getVariableWeights().
3. Application: Mori Dream Spaces
In this section, we shortly recall from [10] how the algorithms from the last section can can be applied to a class of varieties in algebraic geometry.
To a normal algebraic variety over with finitely generated class group one can assign a -graded -algebra, its so-called Cox ring
[TABLE]
see e.g. [1] for details on this theory. If is finitely generated, is called a Mori dream space. For example, each toric variety or each smooth Fano variety is a Mori dream space [6, 4]. The Cox ring has strong implications on the underlying Mori dream space. More precisely, can be recovered as a good quotient
[TABLE]
of an open subset by the characteristic quasitorus . In fact, is determined by an ample class . This opens up a computer algebra based approach [9, 12] to Mori dream spaces. In [2], it has been shown that (17) translates to automorphisms of as follows:
[TABLE]
Here, by we mean the group of -equivariant automorphisms of ; these are pairs with being an automorphism of varieties and an automorphism of affine algebraic groups such that holds for all and . By (20), we directly can compute with Algorithm 2.6. In the next proposition, we investigate the symmetries of the list of Fano varieties [3].
Proposition 3.1**.**
Let be the non-toric terminal Fano threefold of Picard number one with an effective two-torus action from the classification [3, Theorem 1.1].
- (i)
For all , Algorithm 2.6 is able to compute a presentation of as an affine algebraic subgroup . 2. (ii)
Using (i), we list the dimensions and the number of components of the following :
Proof.
This is an application of Algorithm 2.6 and of the Singular commands to compute dimension and absolute components, see for example [8]. We performed the computations on an older machine (Intel celeron CPU, 4 GB Ram) and cancelled them after several seconds. The files are available at [13]. ∎
In [10], the authors have also presented algorithms to compute and generators for the Hopf algebra . Both algorithms are also implemented in our library. However, the case involves a Hilbert basis computation that usually renders the computation infeasible. We therefore finish this note with an example.
Example 3.2** (autgradalg.lib IV).**
In Example 2.8, the algebra is the Cox ring of a Mori dream space: fix an ample class, say , then and define a Mori dream space . The characteristic quasitorus is .
In 2.8, we have already computed . From it, we obtain as follows: first, defines a certain polyhedral cone, the GIT-cone . Then is obtained from by choosing only those elements of the list stabExported where fixes . In our library, you can compute it with (making use of gitfan.lib [5])
intvec w = 1,9,16,0; // drawn in blue 2. >
setring R; // from before 3. >
def RR = autXhat(I, w, TOR); 4. >
setring RR;
w$$q_{1}$$q_{2}$$q_{3}$$q_{4}$$q_{5}$$q_{6}$$q_{7}$$q_{8}$$\lambda(w)
Then a list RES will be exported; it is identical to the list stabExported from Example 2.8 with the difference, that it contains only the element stabExported[1] as the other matrices do not fix . The computation of generators for is not feasible here; in priciple, the command is autX(I, w, TOR).
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] I. Arzhantsev, U. Derenthal, J. Hausen, and A. Laface. Cox rings , volume 144 of Cambridge Studies in Advanced Mathematics . Cambridge University Press, Cambridge, 2014.
- 2[2] I. Arzhantsev, J. Hausen, E. Herppich, and A. Liendo. The automorphism group of a variety with torus action of complexity one. Mosc. Math. J. , 14:429–471, 2014.
- 3[3] B. Bechtold, J. Hausen, E. Huggenberger, and M. Nicolussi. On terminal Fano 3-folds with 2-torus action. International Mathematics Research Notices , 5:1563–1602, 2016.
- 4[4] C. Birkar, P. Cascini, C. D. Hacon, and J. Mc Kernan. Existence of minimal models for varieties of log general type. Journal of the American Mathematical Society , 23(2):405–468, 2010.
- 5[5] J. Böhm, S. Keicher, and Y. Ren. Computing GIT-fans with symmetry and the Mori chamber decomposition of M ¯ 0 , 6 subscript ¯ 𝑀 0 6 \overline{M}_{0,6} . 2016. Preprint. See ar Xiv:1603.09241.
- 6[6] D. A. Cox. The homogeneous coordinate ring of a toric variety. J. Algebraic Geom. , 4(1):17–50, 1995.
- 7[7] W. Decker, G.-M. Greuel, G. Pfister, and H. Schönemann. Singular 4-1-0 — A computer algebra system for polynomial computations. http://www.singular.uni-kl.de , 2016.
- 8[8] G.-M. Greuel and G. Pfister. A Singular Introduction to Commutative Algebra . Springer Publishing Company, Incorporated, 2nd edition, 2007.
