
TL;DR
This paper characterizes varieties with a torus action of complexity one that can undergo multiple Cox ring iterations, advancing understanding of their algebraic structure.
Contribution
It provides a complete characterization of varieties allowing Cox ring iteration within the specified class, a novel contribution to algebraic geometry.
Findings
Identifies all varieties with complexity one torus action permitting Cox ring iteration
Establishes criteria for the iteration process to be possible
Enhances understanding of the structure of Cox rings in algebraic varieties
Abstract
We characterize all varieties with a torus action of complexity one that admit iteration of Cox rings.
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 iteration of Cox rings
Jürgen Hausen and Milena Wrobel
Mathematisches Institut, Universität Tübingen, Auf der Morgenstelle 10, 72076 Tübingen, Germany
Mathematisches Institut, Universität Tübingen, Auf der Morgenstelle 10, 72076 Tübingen, Germany
Abstract.
We characterize all varieties with a torus action of complexity one that admit iteration of Cox rings.
2010 Mathematics Subject Classification:
14L30, 13A05
1. Introduction
We consider normal algebraic varieties defined over the field of complex numbers. If has finitely generated divisor class group and only constant invertible global regular functions, then one defines the -graded Cox ring of as follows, see [2] for details:
[TABLE]
If the Cox ring is a finitely generated -algebra, then one has the total coordinate space . We say that admits iteration of Cox rings if there is a chain
[TABLE]
dominated by a factorial variety where in each step, is the total coordinate space of and the characteristic quasitorus of , having the divisor class group of as its character group. Note that if the divisor class group of is torsion free, then is a unique factorization domain and iteration of Cox rings is trivially possible. As soon as has torsion, it may happen that during the iteration process a total coordinate space with non-finitely generated divisor class group pops up and thus there is no chain of total coordinate spaces as above, see [1, Rem. 5.12].
In [1] we studied normal, rational, -varieties of complexity one, where the latter means that comes with an effective torus action such that holds. We showed that for affine with and at most log terminal singularities, the iteration of Cox rings is possible. In the present article, we characterize all varieties with a torus action of complexity one that admit iteration of Cox rings.
First consider the case . In order to have finitely generated divisor class group, must be rational and then the Cox ring of is of the form , with a polynomial ring in variables and modulo the ideal generated by the trinomial relations
[TABLE]
with . For each exponent vector set . We say that is hyperplatonic if holds. After reordering decreasingly, the latter condition precisely means that holds for all and is a platonic triple, i.e., a triple of the form
[TABLE]
Theorem 1.1**.**
Let be a normal -variety of complexity one with . Then the following statements are equivalent.
- (i)
The variety admits iteration of Cox rings. 2. (ii)
The variety is rational with hyperplatonic Cox ring.
We turn to the case . Here, and finite generation of the divisor class group of force . In this situation, we obtain the following simple characterization.
Theorem 1.2**.**
Let be a normal -variety of complexity one with . Then admits Cox ring iteration if and only if and its total coordinate space are rational. Moreover, if the latter holds, then the Cox ring iteration stops after at most one step.
As a consequence of the two theorems above, we obtain the following structural result, generalizing [1, Thm. 3], but using analogous ideas for the proof.
Corollary 1.3**.**
Let be a normal, rational variety with a torus action of complexity one admitting iteration of Cox rings. Then is a quotient of a factorial affine variety , where is a factorial ring and is a solvable reductive group.
On our way of proving Theorem 1.1, we give in Proposition 2.6 an explicit description of the Cox ring of a variety for a hyperplatonic ring . This allows to describe the possible Cox ring iteration chains more in detail. After reordering the numbers associated with decreasingly, we call the basic platonic triple of .
Corollary 1.4**.**
The possible sequences of basic platonic triples arising from Cox ring iterations of normal, rational varieties with a torus action of complexity one and hyperplatonic Cox ring are the following:
- (i)
, 2. (ii)
, 3. (iii)
, 4. (iv)
, where .
Contents
2. Proof of Theorem 1.1
We will work in the notation of [3, 5], where the Cox ring of a rational -variety of complexity one is encoded by a pair of defining matrices. Let us briefly recall the precise definitions we need from [5]; note that the setting will be slightly more flexible than the informal one given in the introduction.
Construction 2.1**.**
Fix integers , and a partition . For every , fix a tuple and define a monomial
[TABLE]
We will also write for the above polynomial ring. Let be a matrix with pairwise linearly independent columns . For every we define
[TABLE]
We build up an matrix from the exponent vectors of these polynomials:
[TABLE]
Denote by the transpose of and consider the projection
[TABLE]
Denote by the canonical basis vectors corresponding to the variables , . Define a -grading on by setting
[TABLE]
This is the finest possible grading of leaving the variables and the homogeneous. In particular, we have a -graded factor algebra
[TABLE]
By the results of [3, 5] the rings are normal complete intersections, admit only constant homogeneous units and we have unique factorization in the multiplicative monoid of -homogeneous elements of . Moreover, suitably downgrading the rings leads to the Cox rings of the normal rational -varieties of complexity one with , see [4, 3, 5].
In order to iterate a Cox ring , it is necessary that has finitely generated divisor class group. The latter turns out to be equivalent to rationality of . From [1, Cor. 5.8], we infer the following rationality criterion.
Remark 2.2**.**
Let be as in Construction 2.1 and set . Then is rational if and only if one of the following conditions holds:
- (i)
We have for all , in other words, is factorial. 2. (ii)
There are with and whenever . 3. (iii)
There are with and whenever .
Definition 2.3**.**
Let be as in Construction 2.1 such that is rational. We say that is -ordered if it satisfies the following two properties
- (i)
for all and , 2. (ii)
.
Observe that if is rational, then one can always achieve that is -ordered by suitably reordering . This does not affect the -graded algebra up to isomorphy.
Lemma 2.4**.**
Let be as in Construction 2.1 such that is rational and is -ordered. Then, with , the kernel of is generated by the rows of
[TABLE]
Proof.
The arguments are similar as for [1, Cor. 6.3]. The row lattice of is a sublattice of finite index of that of and thus there is a commutative diagram
[TABLE]
We have to show, that is torsion free. Suitable elementary column operations on reduce the problem to showing that for the matrix
[TABLE]
the -th determinantal divisor and therefore the product of the invariant factors equals one. Up to sign, the minors of the above matrix are
[TABLE]
Suppose that some prime divides all these minors. Then holds for all , because otherwise we find an with , contradicting -orderedness of . Thus, divides each of the numbers
[TABLE]
By the assumption of the lemma, equals . Consequently, we obtain
[TABLE]
We conclude ; a contradiction. Being the greatest common divisor of the above minors, the -th determinantal divisor equals one. ∎
Lemma 2.5**.**
Let be as in Construction 2.1 and be rational. Assume that is -ordered. Then the number of irreducible components of is given by
[TABLE]
Proof.
The assertion is a direct consequence of [1, Lemma 6.4]. ∎
We are ready for the main ingredience of the proof of Theorem 1.1, the explicit description of the iterated Cox ring.
Proposition 2.6**.**
Let be non-factorial with rational. Assume that is -ordered and let be as in Lemma 2.4. Define numbers and
[TABLE]
Then the vectors build up an matrix . With a suitable matrix , the affine variety is the total coordinate space of the affine variety .
Proof.
The idea is to work with the action of the torus on and to use the description of the Cox ring of a variety with torus action provided in [4]. For this, one has to look at the exceptional fibers of the map , where is the set of points with at most finite -isotropy and the curve is the separation of . Following the lines of the proof of [1, Prop. 6.6], one uses Lemma 2.5 to determine the number of components for each fiber of and Lemma 2.4 to determine the order of the general (finite) -isotropy groups on each component. The rest is application of [4]. ∎
If is a hyperplatonic ring, then holds. Thus, we find a (unique) platonic triple with pairwise different and all with different from equal one. We call the basic platonic triple (bpt) of .
Remark 2.7**.**
Let be non-factorial and hyperplatonic with basic platonic triple . Then Remark 2.2 ensures that is rational. Moreover, Lemma 2.5 and Proposition 2.6 yield that the exponent vectors of the defining relations of the Cox ring of are computed in terms of the exponent vectors of according to the table below, where “” means that the vector shows up times:
[TABLE]
Lemma 2.8**.**
Let , arising from Construction 2.1, be non-factorial and assume that is rational. If the total coordinate space of is rational as well, then holds for at most three .
Proof.
We may assume that is -ordered. Then Proposition 2.6 provides us with the exponent vectors of the Cox ring of . As is rational and non-factorial, Remark 2.2 leaves us with the following two cases.
Case 1. We have and whenever . This means in particular . Assume that there are with . According to Proposition 2.6, we find times the exponent vector and times the exponent vector in . Lemma 2.5 tells us . Thus, for the first two copies of and , we obtain and respectively. Remark 2.2 shows that is not rational; a contradiction.
Case 2. We have . Assume that there is an index with . Proposition 2.6 and Lemma 2.5 yield that the exponent vector occurs times in the matrix . As in the previous case we conclude via Remark 2.2 that the total coordinate space is not rational; a contradiction. ∎
Proof of Theorem 1.1.
We prove “(ii)(i)”. Then is a rational and has a hyperplatonic ring provided by Construction 2.1 as its Cox ring. If is factorial, then there is nothing to show. So, let be non-factorial. We may assume that is -ordered. Then is the basic platonic triple of . From Remark 2.7 we infer that is rational with hyperplatonic Cox ring . So, we can pass to and so forth. The table of possible basic platonic triples given in Remark 2.7 shows that the iteration process terminates at a factorial ring.
We prove “(i)(ii)”. Since has a Cox ring, must have finitely generated divisor class group. As for any -variety of complexity one, the latter is equivalent to being rational. The Cox ring of is a ring as provided by Construction 2.1. If is factorial, then we are done. So, let be non-factorial. Then we may assume that is -ordered and, moreover, . Since has a Cox ring , it must be rational. By Lemma 2.8 we have whenever holds. Remark 2.2 leaves us with the following cases.
Case 1. We have and whenever holds. Then we may assume .
1.1. Consider the case . By Lemma 2.5, the exponent vector occurs times in the defining relations of the Cox ring of . Since is rational, Remark 2.2 yields . We conclude that is platonic.
1.2. Assume . Then occurs times as exponent vector in the defining relations of . Remark 2.2 shows . Thus, is platonic.
1.3. Let . If holds, then is a platonic triple for any . So, assume . As we are in Case 1, the number must be odd. If holds, then is a platonic triple. By Proposition 2.6 and Lemma 2.5, we find the exponent vectors and as well as twice in . Since is rational and holds, Lemma 2.8 shows and the triple of non-trivial gcd’s of exponent vectors of is . After gcd-ordering , we can apply Case 1.1 and with we obtain and . In particular, is platonic.
Case 2: We have . Then we may assume . Proposition 2.6 and Lemma 2.5 tell us that each of the exponent vectors , and occurs twice in . Since is rational, Lemma 2.8 yields . Thus, is platonic. ∎
3. Proof of Theorem 1.2
As a first step we relate the total coordinate space of a rational variety with torus action of complexity one admitting non-constant invariant functions to the total coordinate space of one with only constant invariant functions; see Corollary 3.4. This allows us to characterize rationality of the total coordinate space using previous results; see Corollary 3.5. Then we determine in a similar manner as before, the iterated Cox ring; see Proposition 3.7. This finally allows us to prove Theorem 1.2. We begin with recalling the necessary notions from [5].
Construction 3.1**.**
Fix integers , and a partition . For each , fix a tuple and define a monomial
[TABLE]
Let be a list of pairwise different elements of . Define for every a polynomial
[TABLE]
We build up an matrix from the exponent vectors of these polynomials:
[TABLE]
Similar to the case in Construction 2.1 the matrix defines a grading of the group on the ring
[TABLE]
Following [5] we call a ring arising from Construction 3.1 of Type 1 and a ring as in Construction 2.1 of Type 2. According to [5], the suitable downgradings of the rings of Type 1 yield precisely the Cox rings of the normal rational -varieties of complexity one with .
Construction 3.2**.**
Consider a ring of Type 1. Set and . Then, writing for the column vector , we obtain a ring of Type 2 with defining matrices
[TABLE]
Proposition 3.3**.**
Let be a ring of Type 1 and the associated ring of Type 2 obtained via Construction 3.2. Fix with . Then one obtains an isomorphism of graded -algebras
[TABLE]
Proof.
By construction, is a factor algebra of and of . We have an isomorphism of -algebras
[TABLE]
Observe . We claim that is compatible with the gradings by on the l.h.s. and by on the r.h.s., where the latter grading is given by
[TABLE]
Indeed, because of , the kernels of the respective downgrading maps
[TABLE]
generated by the rows and , correspond to each other under . The defining ideal of is generated by the polynomials , where
[TABLE]
The above isomorphism sends to , where the are the generators of the defining ideal of , and thus induces the desired isomorphism. ∎
Corollary 3.4**.**
Let be the affine variety arising from a ring of Type 1 and the one arising from the associated ring of Type 2. Then is isomorphic to the principal open subset . In particular, is rational if and only if is so.
Corollary 3.5**.**
Let be a ring of Type 1. Then is rational if and only if one of the following conditions holds:
- (i)
One has for all , in other words, is factorial. 2. (ii)
There is exactly one with . 3. (iii)
There are with and whenever
Proof.
Combine Corollary 3.4 with the rationality criterion Remark 2.2. ∎
Lemma 3.6**.**
Let be of Type 1 with rational and assume that is decreasingly ordered. Then the number of irreducible components of is given as
[TABLE]
Proof.
Due to Corollary 3.4, we can realize as a principal open subset of the associated variety of Type 2. Then the irreducible components of are in one-to-one correspondence with the irreducible components . The assertions follows. ∎
Proposition 3.7**.**
Let be non-factorial of Type 1 with rational and decreasingly ordered. Define numbers and
[TABLE]
Then the vectors build up an matrix . With a suitable matrix the affine variety is the total coordinate space of the affine variety .
Proof.
First observe that the kernel of is generated by the rows of the following matrix:
[TABLE]
Now one determines the Cox ring of in the same manner as in the proof of [1, Prop. 6.6] by exchanging the matrix used there by the matrix above and applying Lemma 3.6. ∎
Proof of Theorem 1.2.
If is rational of Type 1, then Proposition 3.7 shows that the Cox ring of is factorial. Thus, Cox ring iteration is possible for if and only if the total coordinate space of is rational. Moreover, if the latter holds then the Cox ring iteration ends with at most one step. ∎
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] M. Arzhantsev, L. Braun, J. Hausen, M. Wrobel Log terminal singularities, platonic tuples and iteration of Cox rings. Preprint, ar Xiv:1703.03627 .
- 2[2] I. Arzhantsev, U. Derenthal, J. Hausen, A. Laface: Cox rings. Cambridge Studies in Advanced Mathematics, Vol. 144. Cambridge University Press, Cambridge, 2014.
- 3[3] J. Hausen, E. Herppich: Factorially graded rings of complexity one. Torsors, étale homotopy and applications to rational points, 414–428, London Math. Soc. Lecture Note Ser., 405, Cambridge Univ. Press, Cambridge, 2013.
- 4[4] J. Hausen, H. Süß: The Cox ring of an algebraic variety with torus action. Adv. Math. 225 (2010), no. 2, 977–1012.
- 5[5] J. Hausen, M. Wrobel: Non-complete rational T 𝑇 T -varieties of complexity one . Math. Nachr, to appear. DOI: 10.1002/mana.201600009
