Algorithms for embedded monoids and base point free problems
Anne Fahrner

TL;DR
This paper introduces algorithms for computations with monoids in finitely generated abelian groups, enabling tests for base point freeness of divisors and related properties in Mori dream spaces.
Contribution
It provides new algorithms for monoid computations and applies them to problems in algebraic geometry, specifically Mori dream spaces.
Findings
Algorithms for monoid membership testing
Methods to compute the monoid of base point free divisor classes
Tools to verify Fujita's base point free conjecture
Abstract
We present algorithms for basic computations with monoids in finitely generated abelian groups such as monoid membership testing and computing an element of the conductor ideal. Applying them to Mori dream spaces, we obtain algorithms to test whether a Weil divisor class of a given Mori dream space is base point free, to compute generators of the monoid of base point free Cartier divisor classes and to test whether a Mori dream space with known canonical class fulfills Fujita's base point free conjecture or not.
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.
Algorithms for embedded monoids and base point free problems
Anne Fahrner
Mathematisches Institut, Universität Tübingen, Auf der Morgenstelle 10, 72076 Tübingen, Germany
Abstract.
We present algorithms for basic computations with monoids in finitely generated abelian groups such as monoid membership testing and computing an element of the conductor ideal. Applying them to Mori dream spaces, we obtain algorithms to test whether a Weil divisor class of a given Mori dream space is base point free, to compute generators of the monoid of base point free Cartier divisor classes and to test whether a -factorial Mori dream space with known canonical class fulfills Fujita’s base point free conjecture or not.
2010 Mathematics Subject Classification:
14Q15, 20M14
Supported by the Carl-Zeiss-Stiftung.
1. Introduction
A first part of this paper concerns embedded monoids, that means finitely generated monoids in finitely generated abelian groups, and thereby generalises ideas of the theory on affine semigroups [6, Chapter 2] to monoids with non-trivial torsion part. We further present algorithms for embedded monoids, among others for computing generators of intersections of embedded monoids and for computing an element of the conductor ideal; see Algorithms 2.6 – 2.12.
In the second part of the paper, we apply these algorithms to base point free questions for Mori dream spaces. Recall that Mori dream spaces, introduced by Hu and Keel [18], are characterized via their optimal behaviour with respect to the minimal model program. A particular interesting aspect of Mori dream spaces is their highly combinatorial structure [2] – in this regard they are a canonical generalisation of toric varieties. Further well-known example classes are spherical varieties [5], smooth Fano varieties [3] and all Calabi-Yau varieties of dimension at most three and with polyhedral effective cone [24]. The combinatorial framework developed in [2] allows algorithmic treatment of Mori dream spaces. Applying the aforementioned algorithms to Mori dream spaces, we provide algorithms for testing whether a given Weil divisor class is base point free and for computing generators of the base point free monoid, i.e. the monoid of base point free Cartier divisor classes; see Algorithms 3.3 and 3.4.
These algorithms, together with the non-emptyness of the conductor ideal of the base point free monoid, play an important role in our main algorithm, Algorithm 4.5, testing Fujita’s base point free conjecture [15]: this much studied conjecture claims that for a smooth projective variety with canonical class , the Weil divisor class is base point free for all ample Cartier divisor classes and for all . So far it is known to hold for smooth projective varieties up to dimension five [26, 10, 20, 27]. For toric varieties with arbitrary singularities, Fujino [14] presented a proof of Fujita’s base point free conjecture. Despite this substantial progress, Fujita’s base point free conjecture remains in general still open. With Algorithm 4.5, we provide a tool for its algorithmic testing for -factorial Mori dream spaces. Since our algorithm makes use of the canonical class , it applies to Mori dream spaces with known . This case appears quite often: for instance if is spherical or if its Cox ring is a complete intersection, see Remark 4.2 for details.
In [12], we provide an implementation of our algorithms building on the two Maple-based software packages convex [11] and MDSpackage [17]. Using this implementation, we prove Fujita’s base point free conjecture for a six-dimensional Mori dream space in Example 4.6, and in Example 4.7, we study a locally factorial Mori dream space that does not fulfill Fujita’s base point free conjecture. In addition, we study the more general question of the existence of semiample Cartier divisor classes that are not base point free. It is well-known that for Cartier divisors on complete toric varieties, semiampleness implies base point freeness. For smooth rational projective varieties with a torus action of complexity one and Picard number two, the same statement follows immediately from the classification done in [13]. In Example 3.5, we present a first example of a smooth surface of Picard number twelve admitting a semiample Cartier divisor with base points.
The author would like to thank Jürgen Hausen for valuable discussions and comments. In addition, the author is grateful to the referees for their detailed and thorough review of the paper and for their highly appreciated comments and corrections.
2. Embedded Monoids
Let be a finitely generated abelian group. We denote by the decomposition of into free and torsion part and we write for the associated rational vector space. Note that each can be represented as with unique elements and . Every defines an element , which we denote as well by for short. A cone in a rational vector space always refers to a convex, polyhedral cone. The relative interior of a cone is denoted by .
By an embedded monoid we mean a pair , where is a finitely generated submonoid of . For an embedded monoid , we denote by
[TABLE]
the (convex, polyhedral) cone generated by the elements of . An embedded monoid is spanning if generates as a group. The saturation of an embedded monoid is the embedded monoid
[TABLE]
Let be an embedded monoid. A non-empty set is called an -module if holds. We call an -module ideal if holds and finitely generated if there is a finite subset with the property that holds.
Definition 2.1**.**
Let be an embedded monoid. The conductor ideal of is the set
[TABLE]
Lemma 2.2**.**
Let be an embedded monoid. Consider elements such that is a set of generators for . Then the finite set
[TABLE]
where is the map , generates as an -module. In particular, is a finitely generated -module.
Proof.
In the case of a torsion free group , the statement on the finite generation of as an -module is Gordan’s Lemma [8, Proposition 1.2.17]. The proof extends easily to the case of finitely generated abelian groups. ∎
Proposition 2.3**.**
Let be an embedded monoid. If is spanning, then the conductor ideal is non-empty, i.e. it is in particular an -module.
Proof.
By definition, holds, i.e. we only have to show that is non-empty. In case of a torsion free group , one can find a proof in [6, Proposition 2.33]. For finitely generated abelian groups we may extend the proof as follows: According to Lemma 2.2, we have with some finite subset . By assumption, the embedded monoid is spanning. This yields representations with . We claim that is contained in the conductor ideal . Indeed
[TABLE]
holds for all , i.e. we have . ∎
Lemma 2.4**.**
Let be a finitely generated abelian group and consider two subgroups . Let be embedded monoids with saturations . Then the following holds for the intersection :
- (i)
The intersection is an embedded monoid. 2. (ii)
We have , where denotes the saturation of the embedded monoid . 3. (iii)
We have .
Proof.
For (i), only the finite generation of needs some explanation, see for instance [2, Proposition 1.1.2.2]. To prove the first inclusion of (ii), let . This means that we have and that there is such that holds. Clearly, this shows . To prove the second inclusion, let . Hence holds and there are such that hold. This means that is contained in , i.e. we have . For (iii), consider an element . This means that is contained in the intersection and that holds. With (ii), we conclude that is contained in , i.e. the conductor ideal of contains . ∎
Note that the following proposition is not true if we skip the condition that and intersect non-trivially: For instance, and define spanning embedded monoids, but the intersection is not spanning.
Proposition 2.5**.**
Let and be subgroups of a finitely generated abelian group and consider embedded monoids . If is non-empty and is spanning for , then is a spanning embedded monoid.
Proof.
We denote by the intersection of and . Note that is an embedded monoid by Lemma 2.4 (i). Clearly, the group generated by is contained in . It remains to show the opposite inclusion. We denote by and the maps defined by fitting into the following diagramm:
[TABLE]
Because of , the rank of and the dimension of coincide. Thus there are elements
[TABLE]
generating as a group. Furthermore implies that there is an element such that holds. Recall that are spanning monoids and thus Proposition 2.3 shows that their conductor ideals are non-empty. Since contains some shifted copy of , there are some , , such that the integer multiple is contained in , . Hence there is some positive integer such that contains the set of generators for . It follows that
[TABLE]
holds, where the inclusion in the middle was shown in Lemma 2.4 (iii) and the inclusion on the right-hand side follows since is non-empty by the same Lemma and thus contains some shifted copy of . ∎
In the following we describe some algorithms for monoids which, applied to Mori dream spaces, can be used for computing the base point free monoid , for testing whether a Cartier divisor class is base point free and for computing a point of the conductor ideal of .
Algorithm 2.6** (inMonoid).**
Input: A finitely generated abelian group , generators of an embedded monoid and an element .
Output: True if is contained in . Otherwise, false is returned.
- •
By excluding the generators that equal , we achieve a representation with a natural number and with non-zero elements .
- •
We compute a canonical representation of the embedded monoid :
- –
Compute such that there is an isomorphism of groups .
- –
Let , where we set .
- –
Set .
- •
Let denote the homomorphism mapping to the integer combination . Denote by the free part of , i.e. with the projection , we have .
- •
Compute the polyhedron .
- •
If is not bounded, then
- –
for all do
if holds, then let and
[TABLE]
- •
Compute the lattice points of the polytope , i.e. compute .
- •
Return true if there is a point such that holds. Otherwise, return false.
Proof.
We first show that in the end of the above algorithm, the polyhedron is a polytope. Note that is a tupel with integers , and elements . Via an isomorphism of abelian groups we may assume that is contained in , i.e. we have for all . Consider the polyhedron
[TABLE]
Note that contains exactly those lattice points with the property that
[TABLE]
holds. This means that the integer coefficient is smaller than for all with , where denotes the floor function. In particular, we have
[TABLE]
for all such that holds, i.e. is bounded with respect to these coordinate directions . For all other coordinate directions of , i.e. of those with , the above algorithm computes a bound , where
[TABLE]
Note that is non-empty since in the first step of the algorithm, we excluded the that are zero. We conclude that
[TABLE]
is indeed a polytope and thus is a finite set.
We now explain why the above algorithm has the claimed output. We need to show that holds if and only if the algorithm returns true. Clearly, holds if and only if is contained in . This in turn is the case if and only if there is an elment such that holds. If is a polytope, there is nothing to show. If is unbounded we showed above that there is an index such that holds. It remains to show that the following assertions are equivalent:
- (i)
There is an element such that holds. 2. (ii)
There is an element with .
Since holds, the direction “(ii)(i)” is obvious. For the other direction, recall that is the product of all , , with . Since holds, we thus obtain for all integers with . This means that it is sufficient to look at coefficient vectors with , i.e. (i) implies (ii). As argued above, this completes the proof. ∎
Example 2.7**.**
Consider the abelian group , its elements , , , and the monoid depicted in the picture below. Algorithm 2.6 applied to and to does the following:
- •
The map is defined by , where we set . Its free part is given by .
- •
The polyhedron is given by . Thus the algorithm starts with the polyhedron
[TABLE]
- •
Since is unbounded and is zero if and only holds, the algorithm then computes the polytope
[TABLE]
Now we have .
- •
In a next step, the algorithm computes the lattice points of :
[TABLE]
- •
Since holds, the algorithm returns true.
Algorithm 2.8** (generatorsIntMonoid).**
Input: Two subgroups of a finitely generated abelian group and generators of embedded monoids .
Output: A set of generators for the embedded monoid .
- •
Let be the homomorphism of abelian groups defined through , where the denote the canonical base vectors of . Furthermore, define the projection , where denotes the diagonal.
- •
Compute the kernel of .
- •
Consider the isomorphism of abelian groups and compute generators for .
- •
Define the projection on the first factor and return the set .
Proof.
According to Gordan’s lemma [8, Proposition 1.2.17], there are generators for the monoid . Let and consider the diagramm
[TABLE]
With the projection on the first factor, we obtain
[TABLE]
where the last equality is true since holds. We conclude that is a set of generators for . ∎
Example 2.9**.**
Consider the abelian group as well as its elements , , and . Algorithm 2.8 applied to the monoids and depicted in the figure below proceeds as follows:
- •
The map is given by , where holds. To be precise, is defined by the matrix
[TABLE]
- •
The kernel of is given by \ker(\beta)={\rm lin}_{{\mathbb{Z}}}\big{(}(1,2,4),(0,3,5)\big{)}\cong{\mathbb{Z}}^{2}.
- •
The isomorphism is defined by mapping the first canonical base vector of to and the second one to .
- •
We have . According to Gordan’s Lemma, computing the lattice points of the polytope
[TABLE]
gives the following generators for the monoid :
[TABLE]
- •
Applying to those generators gives the generators for . Note that this list is not a hilbert basis. To speed up the computation process in [12], some reduction mechanisms were implemented.
Algorithm 2.10** (inCondIdeal).**
Input: A finitely generated abelian group , generators of an embedded monoid and an element .
Output: True if is contained in . Otherwise, false is returned.
- •
Compute as defined in Lemma 2.2.
- •
Use Algorithm 2.6 to test whether contains . Return true if this is the case; otherwise return false.
Proof.
Let and consider as defined in Lemma 2.2. According to this lemma, generates as an -module. This means that the conductor ideal contains if and only if is contained in . ∎
Example 2.11**.**
Consider the abelian group as well as its elements , , and the monoid as in Example 2.7. The monoid and its conductor ideal are illustrated in the above picture. We apply algorithm 2.10 to and test whether is contained in .
- •
The maps and are as in Example 2.7.
- •
The algorithm computes as defined in Lemma 2.2. We obtain
[TABLE]
- •
In the next step the algorithm uses Algorithm 2.6 to test whether contains .
- •
Similarily as in Example 2.7, for with , Algorithm 2.6 computes and we obtain for all with . Since for all with , , there is some with , the algorithm returns true.
Algorithm 2.12** (pointCondIdeal).**
Input: A finitely generated abelian group , an element and generators of a spanning embedded monoid .
Output: A point of the conductor ideal .
- •
Compute that defines a point in the relative interior of .
- •
Use Algorithm 2.10 to compute the smallest integer such that is contained in . Return .
Proof.
This Algorithm terminates since is spanning. ∎
Example 2.13**.**
Consider the abelian group as well as its elements , , and the monoid as in Examples 2.7 and 2.11. We apply algorithm 2.12 to compute an element of .
- •
At first the algorithm computes the element defining an element in the relative interior of .
- •
For , Algorithm 2.10 returns that is not contained in .
- •
In the next step, Algorithm 2.10 shows that is an element of .
3. The base point free monoid of
Mori dream spaces
We turn to Mori dream spaces and recall the necessary background from [2]. In addition, we present a description of the monoid of base point free Cartier divisor classes of a Mori dream space in terms of combinatorial data, which will be crucial in Algorithm 4.5. We also present algorithms for computing generators of the base point free monoid and for testing whether a Weil divisor class is base point free or not.
Definition 3.1**.**
Let be a Weil divisor on an irreducible, normal variety and consider a non-zero section . We call the effective divisor
[TABLE]
the -divisor of . The base locus and the stable base locus of the class are defined as
[TABLE]
An element is called a base point of . We call or its class base point free if the base locus is empty and semiample if its stable base locus is empty. The embedded monoid of base point free Cartier divisor classes is called base point free monoid of . By and , we denote the cones of semiample and ample Weil divisor classes, respectively.
Recall that a Mori dream space is an irreducible normal projective variety over an algebraic closed field of characteristic zero with finitely generated divisor class group and finitely generated Cox ring
[TABLE]
where in case of torsion in the divisor class group some care is required in this definition, see [2, Section 1.4]. Recall that a non-zero non-unit is called -prime if it is homogeneous and if with homogeneous elements implies or . Let be a system of pairwise non-associated -prime generators of . Consider the homomorphism of abelian groups as well as the total coordinate space . A face of the positive orthant is called an -face, if there is a point with for all . The collection of relevant faces and the covering collection are
[TABLE]
[TABLE]
Note that an ample Weil divisor class together with and relations of fixes a Mori dream space up to isomorphism: one can reconstruct as GIT-quotient of the set of -semistable points regarding the action of on , see for instance [2, Section 3.1].
To any relevant face we associate as in [2, Construction 3.3.1.1] the set , where we have
[TABLE]
According to [2, Corollary 3.3.1.6.] and to [2, Proposition 3.3.2.8], the Picard group of and the base locus of an element are given by
[TABLE]
For projective varieties, any Cartier divisor is the difference of two very ample divisors [9, 1.20]. Thus, the base point free monoid of projective varieties is a spanning embedded monoid. By Proposition 2.3, this means in particular that its conductor ideal is non-empty. For Mori dream spaces, we retrieve the same result in the following Corollary. In addition, we give a description of in terms of the covering collection and the homomorphism .
Corollary 3.2**.**
In the above notation, the base point free monoid of a Mori dream space is a spanning embedded monoid given by
[TABLE]
Proof.
The representation of as an intersection of monoids is an immediate consequence of the above description of base loci. In addition, for each , the embedded monoid is spanning. Using the above description of together with Proposition 2.5, we obtain that is a spanning embedded monoid. ∎
Note that the following algorithms build on the maple-based software package MDSpackage [17]. A Mori dream space is entered and stored in terms of an ample class together with pairwise non-associated -prime generators and relations of . As explained above, this data fixes a Mori dream space up to isomorphism.
Algorithm 3.3** (generatorsBPF).**
Input: A Mori dream space.
Output: A set of generators for the embedded monoid .
- •
Use MDSpackage to compute the covering collection of .
- •
Use Algorithm 2.8 to compute generators of the intersection
[TABLE]
Algorithm 3.4** (isBasePointFree).**
Input: A Mori dream space and a Weil divisor class .
Output: True if is base point free. Otherwise, false is returned.
- •
Use Algorithm 3.3 to compute generators of .
- •
Apply Algorithm 2.6 to and .
Using the implementation given in [12], we study the question of the existence of semiample Cartier divisor classes that are not base point free. It is well-known that for Cartier divisors on complete toric varieties, semiampleness implies base point freeness, see for instance [8, Theorem 6.3.12.]. For smooth rational projective varieties with a torus action of complexity one and Picard number two, the same statement follows immediately from the classification done in [13]. Note that the discrepancy between semiampleness and base point freeness of divisors on varieties with a torus action of complexity one is already fairly well understood in the language of polyhedral divisors: A criterion for semiampleness is given in [25, Theorem 3.27] and a criterion for base point freeness was proved in [19, Theorem 3.2].
Example 3.5**.**
We give an example of a smooth Mori dream -surface that admits semiample Cartier divisor classes with base points.
Q matrix([[1,-1,-1,0,0,0,0,0,0,0,0,0,0,0,0],[0,1,-1,1,0,0,0,0,0,0,0,0,0,0,0], [0,1,0,-1,1,0,0,0,0,0,0,0,0,0,0],[0,1,0,0,-1,1,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,
-1,1,1,0,0,0,0,0,0],[0,-1,0,0,0,1,0,-1,1,0,0,0,0,0,0],[0,0,0,1,0,0,1,0,1,1,0,0,
0,0,0],[0,1,0,0,0,0,0,0,1,0,1,0,0,0,0],[1,0,0,-1,0,0,1,0,0,0,0,1,0,0,0],[0,1,0,
0,0,0,0,1,0,0,0,0,1,0,0],[0,1,0,0,0,-1,0,0,0,0,0,0,0,1,0],[0,-1,0,0,0,1,0,0,0,0, 0,0,0,0,1]]);
[TABLE] 2. >
RL := [T[1]^5T[2]T[3]^4T[4]^3T[5]^2T[6] +T[7]^2T[8]*T[9]
+T[10]^3*T[11]T[12]^2T[13]];
[TABLE] 3. >
R createGR(RL, vars(15), [Q]);
[TABLE] 4. >
X createMDS(R,relint(MDSmov(R)));
[TABLE] 5. >
MDSissmooth(X);
[TABLE] 6. >
w [-1,1,1,1,3,2,3,4,0,3,1,5];
[TABLE] 7. >
contains(MDSsample(X),w);
[TABLE] 8. >
isBasePointFree(X,w);
[TABLE]
The computation shows that is a semiample but not base point free Cartier divisor class.
For a geometric interpretation note that is obtained by blowing up ten times in the following way: One considers the -action on given by
[TABLE]
The fixed points lie on the two curves and . In order two obtain , one blows up the three fixed points , and . The resulting hyperbolic fixed points are again blown up: for , one repeats this four times, for , one repeats this two times and for just once. The resulting variety then is isomorphic to .
4. Fujita base point free test
In the end of the eighties, Takao Fujita conjectured the following:
Conjecture 4.1** (Fujita’s base point free conjecture [15]).**
Let be an n-dimensional smooth projective variety with canonical class and let be an ample Cartier divisor class. Then the following holds:
[TABLE]
In order to test whether a -factorial Mori dream space with known canonical class fulfills Fujita’s base point free conjecture, we need to test whether is an element of for all and for all ample Cartier divisor classes . Since we can only carry out finitely many tests, we encouter two problems: firstly, we need to bound and secondly, we need to find a finite validation set of Cartier divisor classes . In this section, we introduce our solution to these problems and also present some examples of applying our test algorithm.
Remark 4.2**.**
Algorithm 4.5 applies to Mori dream spaces with known canonical class. For instance, if is a complete intersection, there is a concrete formula for the canonical class in terms of generators and relations of [2, Proposition 3.3.3.2]. Note that all irreducible normal rational projective varieties with a torus action of complexity one have a complete intersection Cox ring [16, Proposition 1.2]. In addition, there are formulas for the canonical class of spherical varieties, see [4, 22].
Construction 4.3**.**
Let be a lattice. Consider an -dimensional cone with some facet . Let be an isomorphism of -modules such that and holds, where denote the canonical base vectors of the rational vector space . For any we call the k-th facet parallel of , where we set
[TABLE]
Setting 4.4**.**
Let be a -factorial Gorenstein Mori dream space and consider the base point free monoid . We denote by the facets of . Let and let be those elements such that is minimal with the property that is contained in a ray of . Consider the polytope
[TABLE]
as indicated in the figure below and let be the rays of that are not contained in . We denote by the k-th facet parallel of . For each facet parallel with , we denote by the point that is the intersection of and . With the canonical embedding , we define
[TABLE]
for all , where denotes the relative interior of . Consider the canonical class of . Since is spanning, there is an element . For let such that holds and set . Note that may be negative.
The above mentioned problems, namely bounding and finding a finite validation set of Cartier divisor classes, are tackled by computing a point of the conductor ideal of and by only considering the Cartier divisor classes defining a point in the polytopes of the first few facet parallels , , of each facet .
Algorithm 4.5** (fujitaBpf).**
Input: A -factorial Mori dream space and its canonical class .
Output: True if fulfills Fujita’s base point free conjecture, i.e. if is base point free for all and all ample Cartier divisor classes . Otherwise, false is returned.
- •
If is not Gorenstein return false.
- •
Use Algorithm 2.8 to compute generators of .
- •
Use Algorithm 2.12 to compute a point .
- •
Compute the facets of cone(S) and as well as as defined in Setting 4.4.
- •
For each do
- –
for each do
for each , where denotes the floor function, use Algorithm 2.6 to test whether holds.
- •
Return false if there is , , , and such that is not contained in . Otherwise, return true.
Before presenting a proof of Algorithm 4.5, we first give two examples of applying it to Mori dream spaces.
Example 4.6**.**
Here we give an example of a six-dimensional smooth Mori dream space that does fulfill Fujita’s base point free conjecture.
Q matrix([[1,1,2,0,1,1,1,-1,0,0],[0,0,-1,1,0,-1,-1,1,0,0],[0,36,36,0,18,49,49, -48,1,1]]);
[TABLE] 2. >
RL := [T[1]*T[2]+T[3]*T[4]+T[5]^2];
[TABLE] 3. >
R createGR(RL,vars(10),[Q]);
[TABLE] 4. >
X createMDS(R,[1,1,50]);
[TABLE] 5. >
MDSissmooth(X);
[TABLE]
Since is a complete intersection, we may use the formula presented in [2] to compute the canonical class of : we obtain .
fujitaBPF(X,[-4,1,-106]);
[TABLE]
To obtain this result the algorithm performs the following steps:
- •
First Algorithm 2.8 is used to compute the three generators of and of .
- •
Then Algorithm 2.12 computes the point .
- •
The faces of are given by , , . The algorithms then computes such that defines a point in . We obtain , and as well as . Note that is just the first coordinate of .
- •
Since holds, the algorithm returns true.
For a geometric description of , note that in the language of [7], admits three elementary contractions two of which are birational small. The other one is a birational divisorial contraction contracting the divisor corresponding to the variable of . The variety is a smooth intrinsic quadric with generator degrees, relation and semiample cone given by
[TABLE]
and . The center of is the intersection of and the toric prime divisors corresponding to the variables . Note that allows a closed embedding into the the projectivized split vector bundle
[TABLE]
Example 4.7**.**
Here we give an example of a locally factorial variety with a torus action of complexity one that does not fulfill Fujita’s base point free conjecture. Note that this represents a difference to the toric case, where Fujino [14] presented a proof of Fujita’s base point free conjecture for toric varieties with arbitrary singularities.
Q matrix([[0,0,1,0,0,1,1,0,1],[1,1,0,1,1,0,1,1,2]]);
[TABLE] 2. >
RL := [T[1]T[2]^7T[3]^8 +T[4]T[5]^7T[6]^8+T[7]^8];
[TABLE] 3. >
R createGR(RL,vars(9),[Q]);
[TABLE] 4. >
X createMDS(R,[1,3]);
[TABLE] 5. >
MDSisfact(X);
[TABLE] 6. >
MDSisquasismooth(X);
[TABLE]
Since is a complete intersection, we may use the formula presented in [2] to compute the canonical class of : we obtain .
fujitaBPF(X,[4,0]);
[TABLE] 2. >
isBasePointFree(X,[1,3]);
[TABLE]
Note that Algorithm 4.5 returns false, i.e. does not fulfill Fujita’s base point free conjecture. To obtain this result the algorithm performs the following steps:
- •
First Algorithm 2.8 is used to compute the generators and of .
- •
Then Algorithm 2.12 computes the point .
- •
The faces of are given by , . The algorithms then computes such that defines a point in . We obtain , and . Note that is just the first coordinate of .
- •
Then the algorithm performs the following steps:
- –
Since we have , the algorithm only needs to test the case .
For we have , i.e. only the case needs to be considered. The algorithm yields .
- *
Now Algorithm 2.6 is used to test whether holds. We have which is not contained in . Thus Algorithm 2.6 returns false.
- •
Hence the algorithm fujitaBPF returns false.
Note that the is not semiample and thus not nef. Maeda proved in [23, Proposition 2.1] that is nef for all and for all if is an irreducible normal projective variety with at most log terminal singularities. Nevertheless, this example does not contradict the result of Maeda since is not log terminal: To see this, one can look at the relevant face and the corresponding affine variety , where , , denotes the good quotient with respect to the -action on and where we set as in [2, Construction 3.2.1.3.]. By [1], is log terminal only if the exponents of different monomials are platonic triples. Since this is not the case, we conclude that is not log terminal.
Observe that the base point free monoid is saturated and thus the ample class is base point free. Although is not base point free on , a result of [21] implies that is very ample and thus base point free on .
For a geometric description of , note that admits an elementary contraction of fiber type in the sense of [7] with fibers isomorphic to a hypersurface of degree eight in . To be precise we have where denotes a point of in homogeneous coordinates and where denote the coordinates of . In addition, admits a closed embedding into the projectivized split vector bundle
[TABLE]
We now turn to the proof of Algorithm 4.5.
Lemma 4.8**.**
In the setting of 4.4, the following are equivalent:
- (i)
* holds for all and for all ample Cartier divisor classes , i.e. fulfills Fujita’s base point free conjecture.* 2. (ii)
* holds for all and for all ample Cartier divisor classes .*
Proof.
Only implication “(ii)(i)” needs to be proven. Let . If holds, then follows by (ii). Now assume that holds. Note that since defines a point in the relative interior of for all , the multiple is contained in a facet parallel with . Thus by definition of as maximum over all integers with , we obtain
[TABLE]
Thus, defines a point in Since is an element of the conductor ideal of , we conclude . ∎
Lemma 4.9**.**
In the setting of 4.4, the following are equivalent for
- (i)
* holds for all ample Cartier divisor classes .* 2. (ii)
For all and for all , where denotes the floor function, we have for all .
Proof.
Only implication “(ii)(i)” needs to be proven. Consider an ample Cartier divisor class , i.e.
[TABLE]
holds. Let such that holds. If holds for some , then follows by (ii). Now assume that holds for all . We obtain for all . Recall that holds for all . Thus for all shows that
[TABLE]
holds. Thus, defines a point in Since is an element of the conductor ideal of , we conclude . ∎
Lemma 4.10**.**
Recall that in the setting of 4.4, we defined by those elements such that is minimal with the property that is contained in a ray of . Let and consider an ample Cartier divisor class . Then there are and such that we have
[TABLE]
Proof.
Observe that holds. Hence there are rational numbers , such that the free part of is given by
[TABLE]
We obtain , where denotes the floor function and where the free and the torsion part of are defined as
[TABLE]
Note that is an element of since we have , where as well as the , , are elements of . If holds, is the required representation of . Now consider the case where is not contained in . This means that holds. Since is contained in , there is with . Without loss of generality we assume that and hold for some . Then we have
[TABLE]
holds. In order to show that formula is the required representation of , it remains to prove that holds. Note that holds since is an element of . In addition, since holds, defines a point in . It remains to show that defines a point in the relative interior of . Recall that is contained in the facet . Furthermore, since we are in the case , the point lies in a facet of . Since and hold, we conclude that is not contained in , i.e. there is no face with and . Thus the sum defines a point in the relative interior of . As argued above, this shows that is an element of , which completes the proof. ∎
Lemma 4.11**.**
In the setting of 4.4, let , and . Then the following are equivalent:
- (i)
* holds for all .* 2. (ii)
* holds for all .*
Proof.
Since holds, only implication “(ii)(i)” needs to be proven. Note that this is an immediate consequence of Lemma 4.10. ∎
Proof of Algorithm 4.5.
We need to show that fulfills Fujita’s base point free conjecture if and only if the above algorithm returns true. This can be seen as follows: if is not Gorenstein, then is not a Cartier divisor class; in particular, it is not base point free. Now assume that is Gorenstein. Since the embedded monoid is spanning, we can apply Algorithm 2.12 and compute a point of its conductor ideal. Lemma 4.8 shows that we can bound by ; Lemmata 4.9 and 4.11 prove that the sets , serve as validations sets of Cartier divisor classes. ∎
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] I. Arzhantsev, L. Braun, J. Hausen, M. Wrobel: Log terminal singularities, platonic tuples and iteration of Cox rings . European Journal of Mathematics, to appear.
- 2[2] I. Arzhantsev, U. Derenthal, J. Hausen, A. Laface: Cox rings . Cambridge Studies in Advanced Mathematics no. 144, Cambridge Univ. Press, Cambridge (2014).
- 3[3] C. Birkar, P. Cascini, C. Hacon, J. Mc Kernan: Existence of minimal models for varieties of log general type . J. Amer. Math. Soc. 23 (2010), 405–-468.
- 4[4] M. Brion: Curves and divisors in spherical varieties . In Algebraic groups and Lie groups, Austral. Math. Soc. Lect. Ser., vol. 9, Cambridge Univ. Press, Cambridge (1997), 21–34
- 5[5] M. Brion, F. Knop: Contractions and flips for varieties with group action of small complexity . J. Math. Sci. Univ. Tokyo vol. 1 (1994), no. 3, 641–655.
- 6[6] W. Bruns, J. Gubeladze: Polytopes, Rings, and K-Theory . Springer, Heidelberg (2009).
- 7[7] C. Casagrande: On the birational geometry of Fano 4-folds . Mathematische Annalen (2013), no. 355, 585–628.
- 8[8] D.A. Cox, J.B. Little, H.L. Schenck: Toric varieties . Graduate Studies in Mathematics, 124. American Mathematical Society, Providence, RI, 2011.
