A gap theorem for minimal log discrepancies of non-canonical singularities in dimension three
Chen Jiang
Shanghai Center for Mathematical Sciences, Fudan University, Jiangwan Campus, 2005 Songhu Road, Shanghai, 200438, China
[email protected]
(Date: June 7, 2019)
Abstract.
We show that there exists a positive real number δ>0 such that for any normal quasi-projective Q-Gorenstein 3-fold X, if X has worse than canonical singularities, that is, the minimal log discrepancy of X is less than 1, then the minimal log discrepancy of X is not greater than 1−δ. As applications, we show that the set of all non-canonical klt Calabi–Yau 3-folds are bounded modulo flops, and the global indices of all klt Calabi–Yau 3-folds are bounded from above.
2000 Mathematics Subject Classification:
Primary 14J17; Secondary 14J30, 14E30
Contents
-
1 Introduction
-
2 Preliminaries
-
2.1 Residues of integers
-
2.2 Pairs, singularities, and minimal log discrepancies
-
2.3 Log Calabi–Yau pairs
-
2.4 Bounded pairs
-
2.5 Extremely non-canonical singularities
-
2.6 Cyclic quotient singularities and hyperquotient singularities
-
2.7 ACC for minimal log discrepancies of cyclic quotient singularities
-
2.8 The terminal lemma and the non-canonical lemma
-
3 Reduction to extremely non-canonical singularities
-
4 The 1-gap theorem for 3-dimensional extremely non-canonical singularities: the hyperquotient case
-
4.1 Settings and rules
-
4.2 Reduction to the terminal lemma
-
4.3 The cA case
-
4.4 The odd case
-
4.5 The cD-E case
-
5 The 1-gap theorem for 3-dimensional non-canonical singularities: the general case
-
6 Boundedness of global indices of klt Calabi–Yau 3-folds
1. Introduction
Throughout this paper, we work over the complex number field C.
Canonical and terminal singularities, introduced by Reid, appear naturally in the minimal model program and play important roles in the birational classification of higher dimensional algebraic varieties. Such singularities are well-understood in dimension 3, while the property of non-canonical singularities is still mysterious. In this paper, we investigate the difference between canonical and non-canonical singularities via minimal log discrepancies.
The minimal log discrepancy (mld) of a normal quasi-projective Q-Gorenstein variety X, introduced by Shokurov, is defined to be the infimum of log discrepancies of all prime divisors on all birational models of X. It is an important invariant for singularities in the minimal model program, and is known to be related to the termination of flips and other topics of interest, see [46, 9].
Here we recall the following deep conjecture regarding the behavior of minimal log discrepancies proposed by Shokurov.
Conjecture 1.1** (ACC for minimal log discrepancies, cf. [42, Problem 5], [45, Conjecture 4.2]).**
Fix a positive integer d and a DCC set I⊂[0,1]. Then the set
[TABLE]
satisfies the ACC.
Here ACC stands for the ascending chain condition whilst DCC stands for the descending chain condition.
Conjecture 1.1 is proved in dimension 2 by Alexeev [1] and Shokurov [43], and
for toric pairs by Borisov [11] and Ambro [4]. Although some partial results are known [24, 39, 38, 25, 32, 34, 22], Conjecture 1.1 still remains open in its full generality in dimensions 3 and higher.
Recall that for a normal quasi-projective Q-Gorenstein variety X, mld(X)≥1 if and only if X has canonical singularities. Hence in this paper, we are only interested in the following special case of Conjecture 1.1.
Conjecture 1.2** (1-gap conjecture for minimal log discrepancies).**
Fix a positive integer d.
Then 1 is not an accumulation point from below for the set of minimal log discrepancies of all normal quasi-projective Q-Gorenstein varieties of dimension d.
Conjecture 1.2 asserts that there is a gap for minimal log discrepancies between canonical and non-canonical singularities, and it already has interesting applications related to the boundedness of Calabi–Yau varieties (see [13]). Note that in Conjecture 1.2, we are interested in the global minimal log discrepancies rather than the local ones at closed points. Although it is much weaker than Conjecture 1.1, Conjecture 1.2 was still open even in dimension 3.
As the main result of this paper, we give an affirmative answer to Conjecture 1.2 in dimension 3.
Theorem 1.3**.**
There exists a positive real number δ>0 with the following property: if X is a normal quasi-projective Q-Gorenstein 3-fold with mld(X)<1, then mld(X)≤1−δ.
Remark 1.4*.*
We explain the strategy of proving Theorem 1.3 briefly. The goal is to show that there is no 3-fold X with 1−δ<mld(X)<1 for a sufficiently small δ>0. The first step is to reduce to the case that all but one exceptional divisors over X have log discrepancies greater than 1, in which case X is called extremely non-canonical (see Section 3). Also it is easy to reduce to the case that X is an isolated singularity which is a hyperquotient of an isolated cDV singularity in A4. To deal with this case, we replay the game for the classification of 3-dimensional terminal singularities by Mori [35] as explained by Reid [41], and show that such a singularity does not exist. Of course in our situation rules are changed which makes the game more complicated, but it will be in control after some essential modifications (see Section 4 for more explanations).
Remark 1.5*.*
In many applications, it suffices to know the existence of such a positive number δ. But by our method, it is possible to determine the number δ in Theorem 1.3 effectively.
In fact, by the proof of Theorem 1.3, we can take δ=δ0, where δ0 is a positive constant given in Lemma 2.12 which is related to the gap of minimal log discrepancies of isolated cyclic quotient singularities in dimensions 3
and 5.
After the first version of this paper appeared on arXiv, the author was informed by Liu and Xiao [33] that they computed that δ0=191 in Lemma 2.12, which then gives an optimal value δ=131 for Theorem 1.3 after some extra effort.
Next we explain the applications of Theorem 1.3 to boundedness problem for singular Calabi–Yau 3-folds.
A normal projective variety X is a Calabi–Yau variety if KX≡0. According to the minimal model program, Calabi–Yau varieties form a fundamental class in birational geometry as building blocks of algebraic varieties. Calabi–Yau varieties are also interesting objects in differential geometry and mathematical physics.
Hence, it is interesting to ask whether such kind of varieties satisfies any finiteness properties, namely, whether some invariants of them are in a finite set, or they can be parametrized by finitely many families. For recent developments on this direction in birational geometry, see [2, 3, 14, 13, 7]. We recall that Alexeev [2, Theorem 6.9] showed that all
Calabi–Yau varieties in dimension 2 with worse than du Val singularities form a bounded family. Motivated by Alexeev’s result, [13] considers rationally connected klt Calabi–Yau 3-folds and showed their boundedness modulo flops assuming Theorem 1.3.
As an application of Theorem 1.3, we show that the set of all non-canonical klt Calabi–Yau 3-folds are bounded modulo flops, which is a weak version of the analogue of Alexeev’s result in dimension 3.
Theorem 1.6** (=Theorem 6.1).**
The set of non-canonical klt Calabi–Yau 3-folds forms a bounded family modulo flops.
Note that [13] only considers Theorem 1.6 for rationally connected klt Calabi–Yau 3-folds, but we are able to remove the rational connectedness condition in this paper.
As a consequence, the global indices of all klt Calabi–Yau 3-folds are bounded from above.
Corollary 1.7** (=Corollary 6.2).**
There exists a positive integer m such that for any klt Calabi–Yau 3-fold X, mKX∼0.
Here we remark that Theorem 1.7 was known for canonical Calabi–Yau 3-folds by Kawamata [26] and Morrison [36]. So we only need to deal with the case of non-canonical klt Calabi–Yau 3-folds, which follows from Theorem 1.6.
Also we recall that Blache and Zhang [10, 47, 48] studied klt Calabi–Yau surfaces
(also known as log Enriques surfaces) and showed that for any such surface S, mKS∼0 for some m≤21. So Corollary 1.7 is a generalization of their results in dimension 3.
Of course it is very interesting to ask for an effective bound of the global indices, but our method can not give an effective bound.
It is worthwhile to mention that Jingjun Han brought our attention to another application of Theorem 1.3, which is the termination of log twists (introduced by Birkar and Shokurov) in dimension 3. See [9, Proposition 3.4] for details.
This paper is organized as follows. In Section 2, we recall basic definitions and make preparation for the proof. In Section 3, we reduce Conjecture 1.2 to the case of extremely non-canonical singularities.
In Section 4, we prove Theorem 1.3 for 3-dimensional isolated hyperquotient extremely non-canonical singularities, using the method from classification of 3-dimensional terminal singularities. In Section 5, we prove Theorem 1.3 for the general case. In Section 6, we prove Theorem 1.6 and Corollary 1.7.
2. Preliminaries
We adopt the standard notation and definitions in [28]
and [30], and will freely use them. We work over C.
2.1. Residues of integers
For a positive integer r, (n)r denotes the smallest non-negative residue modulo r, i.e., the number m such that 0≤m<r and n≡mmodr. Usually r is clear in the context, so we simply write n instead of (n)r.
We will often use the following easy fact:
n+−n={r0 if n≡0modr; if n≡0modr.
2.2. Pairs, singularities, and minimal log discrepancies
A log pair (X,B) consists of a normal quasi-projective variety X
and an effective R-divisor B on X such that KX+B is R-Cartier.
Let f:Y→X be a log
resolution of the log pair (X,B). Write
[TABLE]
where {Fi} are distinct prime divisors.
For a non-negative real number ϵ, the log pair (X,B) is called
kawamata log terminal (klt
for short) if ai>−1 for all i;
ϵ-log canonical (ϵ-lc for
short) if ai≥−1+ϵ for all i;
terminal if ai>0 for all f-exceptional divisors Fi and all f;
canonical if ai≥0 for all f-exceptional divisors Fi and all f;
purely log terminal (plt
for short) if ai≥0 for all f-exceptional divisors Fi and all f.
Usually we write X instead of (X,0) in the case when B=0. In this case, when we talk about singularities as above, we automatically assume that X is Q-Gorenstein, that is, KX is Q-Cartier.
Note that we usually use lc instead of [math]-lc.
Also note that
ϵ-lc singularities only make sense if ϵ∈[0,1].
The log discrepancy of the divisor Fi is defined to be
[TABLE]
It does not depend on the choice of the log resolution f. Here we identify divisors on different birational models by its divisorial valuation.
When B=0, we simply write a(Fi;X) instead of a(Fi;X,B).
Let (X,B) be a log pair and Z⊂X an irreducible closed subset with ηZ the generic point of Z.
The minimal log discrepancy of (X,B) over Z is defined as
[TABLE]
and the minimal log discrepancy of (X,B) at ηZ is defined as
[TABLE]
Moreover, we write ld(X,B) instead of mldX(X,B), and call it the total log discrepancy of (X,B).
We define the the minimal log discrepancy of (X,B) to be mld(X,B)=infZmldZ(X,B) where Z runs over all subvarieties of codimension 2. Note that the difference between total log discrepancy and minimal log discrepancy is just whether codimension 1 points (or prime divisors) on X are considered or not. If B=0, we simply write ld(X) and mld(X).
Note that if mld(X)≤1, then ld(X)=mld(X).
Note that ld(X,B)≥ϵ (resp. >0) if and only if (X,B) is ϵ-lc (resp. klt), and
mld(X,B)≥1 (resp. >0) if and only if (X,B) is canonical (resp. terminal). So X is non-canonical if and only if
mld(X)<1.
2.3. Log Calabi–Yau pairs
A normal projective variety X is a Calabi–Yau variety if KX≡0. If KX∼Q0, then the global index of X is the minimal positive integer m such that mKX∼0.
A log pair (X,B) is called a
log Calabi–Yau pair if X is projective and KX+B≡0.
Recall that if (X,B) is lc, this is equivalent
to KX+B∼R0 by [17].
2.4. Bounded pairs
A collection of projective varieties D is
said to be bounded (resp., bounded in codimension one)
if there exists a projective morphism
h:Z→S
between schemes of finite type such that
each X∈D is isomorphic (resp., isomorphic in codimension one) to Zs
for some closed point s∈S where Zs=h−1(s).
We say that a collection of projective log pairs D is log bounded (resp., log bounded in codimension one)
if there is a quasi-projective scheme Z, a
reduced divisor E on Z, and a
projective morphism h:Z→S, where
S is of finite type and E does not contain
any fiber, such that for every (X,B)∈D,
there is a closed point s∈S and a birational
map f:Zs⇢X which is isomorphic
(resp., isomorphic in codimension one)
such that Es:=E∣Zs
coincides with the support of f∗−1B.
Moreover, if D is a set of klt Calabi–Yau
varieties (resp., klt log Calabi–Yau pairs), then it is
said to be bounded modulo flops (resp., log
bounded modulo flops) if it is (log) bounded in
codimension one, each fiber Zs
corresponding to X in the definition is normal projective,
and KZs is Q-Cartier (resp., KZs+f∗−1B is R-Cartier).
Note that if D is a set of klt log Calabi–Yau
pairs which is log bounded modulo flops, and
(X,B)∈D with a birational
map f:Zs⇢X
isomorphic in codimension one as in the definition,
then (Zs,f∗−1B) is also a klt log
Calabi–Yau pair by the negativity lemma.
Moreover, (X,B) is ϵ-lc if and only
if (Zs,f∗−1B) is ϵ-lc. A similar statement
holds when D is a set of klt Calabi–Yau varieties.
Here the name “modulo flops” comes from the fact that, if we assume that X and Zs are both Q-factorial, then they are connected by flops by running a (KX+B+δf∗H)-MMP where H is an ample divisor on Zs and δ is a sufficiently small positive number ([8, 27]).
2.5. Extremely non-canonical singularities
As we are interested in non-canonical singularities, we introduce the concept of extremely non-canonical singularities, which are the closest to terminal singularities among all non-canonical singularities.
Definition 2.1**.**
Let X be a normal quasi-projective variety.
We say that X is extremely non-canonical if X has Q-factorial klt singularities and
- (1)
there exists exactly one prime divisor E0 over X such that a(E0;X)<1;
2. (2)
there is no divisor E over X with a(E;X)=1.
Remark 2.2*.*
Suppose that X is extremely non-canonical, then it is easy to see that a(E0;X)=mld(X), and X has terminal singularities outside the center of E0 on X.
2.6. Cyclic quotient singularities and hyperquotient singularities
We recall the concept of hyperquotient singularities and the toric method which are useful in the classification of 3-dimensional terminal singularities. Most of the contents come from [41, Section 4] except for Theorem 2.4.
Let r be a positive integer. Let μr denote the cyclic group of r-th roots of unity in C. A cyclic quotient singularity is of the form An+1/μr, where the action of μr is given by
[TABLE]
for certain a0,…,an∈Z/r. Note that we may always assume that the action of μr on An+1 is small, that is, it contains no reflection ([23, Definition 7.4.6, Theorem 7.4.8]). We say that An+1/μr is of type r1(a0,…,an). Recall that this singularity is isolated if and only if gcd(ai,r)=1 for every 0≤i≤n by [15, Remark 1].
The toric geometry interpretation of cyclic quotient singularities is as following ([41, (4.3)]):
let M≃Zn+1 be the lattice of monomials on An+1, and N its dual. Define N by N=N+Z⋅r1(a0,…,an) and M⊂M the dual sublattice. Let σ=R≥0n+1⊂NR be the positive quadrant and σ∨⊂MR the dual quadrant. Then in toric geometry,
[TABLE]
and its quotient
[TABLE]
where Δ is the fan corresponding to σ.
Now we are interested in the hypersurface singularity (Q∈Y):(f=0)⊂An+1 with an action of μr which is free outside Q and its quotient (P∈X)=Y/μr. It is known that the action of μr extends to a small μr-action of An+1 ([23, Lemma 8.3.8]). We still assume that the action of μr on An+1 is given by
[TABLE]
As Y=(f=0) is fixed by the action of μr, we may write
[TABLE]
for certain e∈Z/r. Such (P∈X) is called a hyperquotient singularity of type r1(a0,…,an;e). Note that the action of μr on the generator
[TABLE]
is given by
[TABLE]
Let α=(b0,…,bn)∈N∩σ be a vector, that is, α is a weighting such that α(xi)=bi∈Q on monomials such that
- (1)
α∈N, that is, α≡r1(ja0,…,jan)modZn+1 for some j=0,1,…,r−1;
2. (2)
α∈σ, that is, bi≥0 for all i.
This weighting can be extended to C[x0,…,xn] in the following way:
for xm=x0m0⋯xnmn, α(xm)=∑i=0nmiα(xi)=∑i=0nmibi; and for a polynomial f∈C[x0,…,xn],
[TABLE]
Here xm∈f means that the monomial xm appears in f with non-zero coefficient.
Proposition 2.3**.**
Consider (Q∈Y):(f=0)⊂An+1 with an action of μr which is free outside Q and its quotient (P∈X)=Y/μr. Keep the above notation. Let α∈N∩σ be a primitive vector and Δ(α) be the star-shaped subdivision of Δ by α, then the toric morphism ϕα:TN(Δ(α))→TN(Δ)=An+1/μr extracts an exceptional divisor Eα. Denote Zα=TN(Δ(α)) and Z=TN(Δ), and let Xα⊂Zα be the strict transform of X on Zα. Then
- (1)
KZα=ϕα∗KZ+(α(x0⋯xn)−1)Eα;
2. (2)
Xα=ϕα∗X−α(f)Eα.
Proof.
This is standard, see [41, (4.8)] or [23, Proposition 8.3.11].
∎
In the classification of 3-dimensional terminal singularities, Proposition 2.3 is used to provide a necessary condition for a hyperquotient singularity being terminal (see [41, (4.6) Theorem]). As we are considering non-canonical singularities, in the following theorem we provide a necessary condition for an isolated hyperquotient singularity being extremely non-canonical by the toric method, which plays an essential role in the proof in Section 4.
Theorem 2.4**.**
Fix 0<δ≤21. Consider (Q∈Y):(f=0)⊂An+1 with an action of μr which is free outside Q and its quotient (P∈X)=Y/μr.
Assume further that (P∈X) is an isolated extremely non-canonical singularity with mld(X)>1−δ. Keep the above notation. Then
- (1)
there exists at most one primitive vector β∈N∩σ such that
[TABLE]
2. (2)
for any primitive vector α∈N∩σ such that α=β,
[TABLE]
Furthermore, for any vector α′∈N∩σ such that α′=β,
[TABLE]
Proof.
Assume that there exists a primitive vector β∈N∩σ such that β(x0⋯xn)−β(f)≤1. To see the first two statements, it suffices to show that such β is unique and
[TABLE]
Keep the notation in Proposition 2.3, we have
[TABLE]
which can be rewritten as
[TABLE]
where t=1+β(f)−β(x0⋯xn)≥0.
Since X has an isolated klt singularity, the pair (Z,X) is plt by inversion of adjunction, which implies that (Zβ,Xβ+tEβ) is also plt. By the subadjunction formula ([29, 16.6 Proposition, 16.7 Corollary]), there is a boundary Bβ on Xβ such that
[TABLE]
and the coefficients of Bβ are of the form 1−l1+lkt for some positive integers l,k, here k>0 since Eβ intersects Xβ. By the assumption that X is extremely non-canonical, coefficients of Bβ are positive since there is no exceptional divisor over X with log discrepancy 1, and in fact Bβ has exactly one component Fβ with coefficient 1−l1+lkt>0.
Since mld(X)>1−δ, 1−l1+lkt<δ≤21. In particular, l=1 and 0<t<δ. This shows that
[TABLE]
To see the uniqueness of β, we look at the divisorial valuation vFβ on C(X), and the following proof is suggested by Jungkai Chen. Since l=1, from the subadjunction formula, we get Eβ∣Xβ=Bβ=kFβ. Hence vFβ(xm)=kβ(xm) for any monomial xm (m∈M). By the assumption that X is extremely non-canonical, vFβ is unique. Hence such β is unique by the primitivity.
For the last statement, for any non-primitive vector α′∈N∩σ, we may write α′=mα where m≥2 is an integer and α∈N∩σ is primitive. Then
[TABLE]
∎
2.7. ACC for minimal log discrepancies of cyclic quotient singularities
Recall that the ACC for minimal log discrepancies is proved for toric varieties [11, 4], in this paper we only need the following special case for cyclic quotient singularities:
Theorem 2.5** ([11]).**
Conjecture 1.1 holds for cyclic quotient singularities. In particular, fix a positive integer d,
then the set of minimal log discrepancies of d-dimensional cyclic quotient singularities (0∈W) at [math] satisfies the ascending chain condition.
As corollaries, 2 and 1 are not accumulation points of these sets from below, and we will only use this fact in dimensions 3 and 5.
Corollary 2.6**.**
There exists a positive constant δ3>0 such that for any isolated cyclic quotient singularity (0∈W) in dimension 3, if mld0(W)<1, then mld0(W)≤1−δ3.
Corollary 2.7**.**
There exists a positive constant δ5>0 such that for any cyclic quotient singularity (0∈W) in dimension 5, if mld0(W)<2, then mld0(W)≤2−δ5.
Note that in Corollary 2.6 we are only interested in isolated singularities, but in Corollary
2.7 the singularities are not necessarily isolated.
The following example is suggested by Alexeev:
Example 2.8**.**
Consider (0∈W) to be a 3-dimensional isolated cyclic quotient singularity of type 131(3,4,5), then mld(W)=mld0(W)=1312. In particular, δ3≤131.
Here for the computation of minimal log discrepancies of toric varieties, we refer to [4] (see also the proof of Lemma 2.12).
Remark 2.9*.*
In fact, it is not difficult to show that Example 2.8 is optimal, that is, we can take δ3=131 in Corollary 2.6. This can be done after some tedious but elementary calculation by hand. We will not give the proof nor use this fact in this paper.
The value of δ5, on the other hand, seems to be more subtle as the dimension is higher and the singularities are not necessarily isolated.
2.8. The terminal lemma and the non-canonical lemma
In this subsection, we recall the terminal lemma by Morrison and Stevens [37] which plays an important role in the classification of 3-dimensional terminal singularities. Here we only recall a special version for our application, for the full version we refer to [41, (5.4) Theorem]. Recall that n denotes the smallest non-negative residue modulo r.
Theorem 2.10** ([41, (5.4) Theorem, (5.6) Corollary]).**
Let r1(a1,⋯,a4;e,1) be a 6-tuple of rational numbers with denominator r such that
q=gcd(e,r)=gcd(a4,r), and a1,a2,a3 are coprime to r.
Assume that for k=1,…,r−1,
[TABLE]
If q>1, then a4≡emodr, and the remaining 4 elements can be paired together as a1≡1,a2+a3≡0modr (or permutations); if q=1, then {a1,a2,a3,a4,−e,−1} can be split up into 3 disjoint pairs which add to 0modr (for example, a1+a2≡a3+a4≡−e−1≡0modr).
Remark 2.11*.*
Note that in the statement of [41, (5.6) Corollary], the q=1 case is missing, but it can be easily derived from [41, (5.4) Theorem].
In order to study extremely non-canonical singularities by the toric method, we change the condition of the above terminal lemma and introduce the following “non-canonical” lemma.
Lemma 2.12**.**
*There exists a positive real number δ0≤δ3<1 with the following property.
Let r1(a1,⋯,a4;e) be a 5-tuple of rational numbers with denominator r such that
q=gcd(e,r)=gcd(a4,r), and a1,a2,a3 are coprime to r. Assume
one of the following holds:
*
- (✩1)
a1+a2≡emodr;
2. (✩2)
2a4≡emodr;
3. (✩3)
2a1≡emodr* and q≤2.*
Moreover, assume that
- (1)
there exists a positive integer k0 such that 1≤k0≤r−1 and
[TABLE]
2. (2)
for every integer k such that 1≤k≤r−1 and k=k0,
[TABLE]
Then rk0≤1−δ0. Here δ3 is the constant from Corollary 2.6.
Proof.
We will show that we can take δ0=min{δ3,δ5}>0. Here δ3 and δ5 are constants from Corollaries 2.6 and 2.7.
Since a1,a2,a3 are coprime to r, we know that a1k0,a2k0,a3k0 are not [math]. Since gcd(e,r)=gcd(a4,r), a4k0=0 if and only if ek0=0.
First assume that a4k0=0 and ek0=0.
Consider Z=A5/μr to be a cyclic quotient singularity of type r1(a1,⋯,a4,−e).
It suffices to show that mld0(Z)=1+rk0<2. Keep the notation in Subsection 2.6.
By the existence of log resolutions in toric category, we can compute the minimal log discrepancy by torus invariant divisors over Z. Recall that for the exceptional divisor Eα corresponding to a primitive vector α∈N∩σ, its log discrepancy is computed by a(Eα;Z)=α(x0⋯x4) (Proposition 2.3). This means that ([4])
[TABLE]
where relin(σ) is the relative interior of σ.
By the assumption, we can consider
[TABLE]
Assumption (1) gives
[TABLE]
On the other hand, take any α∈N∩relin(σ) such that α=β,
recall that we can write α=(b0,…,b4) such that α≡r1(a1j,…,a4j,−ej)modZ5 for some j=0,1,…,r−1 and bi>0 for all i. If j=0, then α(x0⋯x4)≥5. If j=k0, then α(x0⋯x4)≥β(x0⋯x4)+1≥2. If 1≤j≤r−1 and j=k0, then since b4>0, we know that b4≥r1(r−je), and by assumption (2),
[TABLE]
Hence mld0(Z)=1+rk0<2. By Corollary 2.7, rk0≤1−δ5.
Then assume that a4k0=ek0=0. Denote q=gcd(e,r)=gcd(a4,r) and r=pq. Then p divides k0 and we can write k0=pk0′. Now let (n)q be the smallest non-negative residue of n modulo q, then p(n)q=pn. Hence we get new relations for q1(a1,a2,a3) and k0′ as the following:
for every integer k′ such that 1≤k′≤q−1 and k′=k0′,
[TABLE]
on the other hand,
[TABLE]
Now we can consider Z′=A3/μq to be a cyclic quotient singularity of type q1(a1,a2,a3). It is isolated since a1,a2,a3 are coprime to r.
By the same calculation as above, mld0(Z′)=qk0′=rk0<1. To be more precise,
we can consider
[TABLE]
here N is the lattice corresponding to Z′ by abusing the notation.
Then
[TABLE]
On the other hand, take any α∈N∩relin(σ) such that α=β′,
recall that we can write α=(b0,b1,b2) such that α≡r1(a1j,a2j,a3j)modZ3 for some j=0,1,…,q−1 and bi>0 for all i. We may assume that bi<1 for all i, otherwise α(x0x1x2)≥1. Hence
α=q1((a1j)q,(a2j)q,(a3j)q) with 1≤j≤q−1 and j=k0′. In this case,
[TABLE]
Hence mld0(Z′)=qk0′<1.
By Corollary 2.6, rk0≤1−δ3.
∎
Remark 2.13*.*
In the proof of Lemma 2.12, assumptions (✩1–3) are not used. But we keep these assumptions for two reasons. For one thing, we always get one of (✩1–3) in our applications (see Propositions 4.3 and 4.4). For the other, these assumptions will be helpful when one tries to find an optimal or effective value for δ0 (and δ in Theorem 1.3).
In fact, in a recent preprint by Liu and Xiao [33], they show that δ0=191 in Lemma 2.12 by some clever arguments with a help of computer program.
3. Reduction to extremely non-canonical singularities
In this section, we reduce the 1-gap conjecture to the case of extremely non-canonical singularities. During the preparation of this paper, we are informed by Jingjun Han and Jihao Liu that they also got similar result as Theorem 3.1 independently.
Theorem 3.1**.**
Let X be a normal quasi-projective variety with klt singularities such that mld(X)<1. Then there exists a projective birational morphism Y→X such that Y is extremely non-canonical and mld(X)≤mld(Y)<1.
Proof.
Let X be a normal quasi-projective variety with klt singularities such that mld(X)<1.
Take E to be the set of all exceptional prime divisors E over X with a(E;X)≤1, which is a finite set by [30, Proposition 2.36].
By [8, Corollary 1.4.3], there exists a projective birational morphism π:W→X with W Q-factorial such that E is the set of exceptional divisors of π.
We may write
[TABLE]
where Δ is a non-zero effective Q-divisor as mld(X)<1. Note that (W,Δ) is canonical by the construction.
For a sufficiently small ϵ>0, by [8], we can run a (W,(1+ϵ)Δ)-MMP over X, which terminates and reaches a minimal model over X contracting Supp(Δ). Denote W′→X to be the model obtained by the first divisorial contraction in this MMP. We will show that W′ satisfies the requirement of the theorem.
Denote E1 to be the prime divisor on W contracted on W′, and denote Δ′ to be the strict transform of Δ on W′. Take a common resolution p:Z→W, p′:Z→W′. As this MMP is also a Δ-MMP over X,
we can write
[TABLE]
where F is an effective Q-divisor and multE1(p∗F)>0.
On the other hand, we have
[TABLE]
as KW+Δ≡X0.
Hence
[TABLE]
Here E1Z is the strict transform of E1 on Z.
Take any exceptional prime divisor E=E1 over W′, then E is also exceptional over W, and hence
[TABLE]
Note that W′ is Q-factorial, so we conclude that W′ is extremely non-canonical. The fact that mld(X)≤mld(W′) follows easily from
mld(W′)=ld(W′)≥ld(W′,Δ′)=mld(X).
∎
4. The 1-gap theorem for 3-dimensional extremely non-canonical singularities: the hyperquotient case
In this section, we treat a special case of Theorem 1.3, where X is an isolated extremely non-canonical singularity whose index 1 cover is an isolated cDV singularity.
This is the most technical part of this paper. In the proof, we mimic the classification of 3-dimensional terminal singularities following the explanation given by Reid [41, Sections 6 and 7] case by case. Of course our situation is more complicated than the case of terminal singularities, but the strategy of [41, Sections 6 and 7] still works after some modifications. The essential differences in our proof are that we replace the criterion for a hyperquotient singularity to be terminal ([41, (4.6) Theorem]) by our new criterion for a hyperquotient singularity to be extremely non-canonical (Theorem 2.4), which leads to more non-trivial discussions in each case; and in order to apply the terminal lemma as in [41, Section 7], we need to first apply our new “non-canonical” lemma (Lemma 2.12) to exclude certain cases to guarantee the condition of the terminal lemma.
We try to write down all the details to make the proof convincible and friendly to readers not familiar with [41].
The following is the main theorem of this section.
Theorem 4.1**.**
There exists a positive real number δ>0 such that there is no 3-dimensional hyperquotient singularity (P∈X)=(Q∈Y)/μr satisfying the followings:
- (1)
(Q∈Y)* is the canonical index 1 cover of (P∈X);*
2. (2)
(Q∈Y)⊂A4* is an isolated cDV singularity;*
3. (3)
(P∈X)* is an isolated extremely non-canonical singularity with mld(X)>1−δ.*
In fact, we can take δ=δ0, where δ0 is the constant from Lemma 2.12.
Outline of the proof.
To the contrary, assume that such a 3-dimensional hyperquotient singularity (P∈X)=(Q∈Y)/μr exists. Suppose that Y=(f=0)⊂A4 and the hyperquotient is of type r1(a,b,c,d;e).
In Subsection 4.1, we introduce basic settings and restrictions on f and r1(a,b,c,d;e), and roughly splits the possible f into 5 cases: cA, odd, cD4, cDn, cE.
In Subsection 4.2, using Lemma 2.12, we check that r1(a,b,c,d;e,1) satisfies the assumption of the terminal lemma (Theorem 2.10).
By applying the terminal lemma, we can get all possible values for r1(a,b,c,d;e) in each case.
In Subsection 4.3, we exclude the cA case.
In Subsection 4.4, we exclude the odd case.
In Subsection 4.5, we exclude the cD4, cDn, cE cases.
Then the nonexistence is proved.
∎
4.1. Settings and rules
In this subsection we introduce the settings and rules.
Throughout the remaining part of this section,
we take δ=δ0, where δ0 is the constant from Lemma 2.12. Recall that δ≤δ3, where δ3 is the constant from Corollary 2.6.
We assume that such a 3-dimensional hyperquotient singularity (P∈X)=(Q∈Y)/μr as in Theorem 4.1 exists, and we will exclude all the possibilities to get a contradiction.
As the index of X is r and mld(X)<1, it is obvious that mld(X)≤1−r1.
Since δ≤δ3≤131 by Example 2.8, we always have r>13.
We will freely and frequently use the notation in Subsection 2.6.
Set (x,y,z,t)=(x1,x2,x3,x4) to be the local analytic coordinates on A4, Y=(f=0)⊂A4, and the action of μr is given by
[TABLE]
We also identify (a,b,c,d)=(a1,a2,a3,a4), and recall that these weights are viewed as elements in Z/r. Note that all monomials in f shall have the same weight emodr as f(ξx,ξy,ξz,ξt)=ξef(x,y,z,t) by the setting.
We will always assume the following rules in the proof, which are similar to that of [41, (6.6)] except that Rule I is changed according to our assumption:
Rule I: (i) There exists at most one primitive vector β∈N∩σ such that
[TABLE]
(ii) for any vector α∈N∩σ such that α=β,
[TABLE]
Rule II: (i) If gcd(ai,r)=1, then ai divides e, that is, gcd(ai,r) divides gcd(e,r);
(ii) gcd(ai,aj,r)=1 for all i=j;
(iii) a+b+c+d−e=1.
Rule III:
(i) After a μr-equivariant analytic change of coordinates, we may assume that f=q(x1,…,xk)+f′(xk+1,…,x4) with q a nondegenerate quadratic form in x1,…,xk;
(ii) if the 3-jet of f is x2+y2z then
[TABLE]
or if the 3-jet is x2+y3 then
[TABLE]
Here Rule I is the conclusion of Theorem 2.4. Rules II and III are exactly the same with that in [41, Page 394]. As explained in [41], Rule II(i)(ii) are consequences of the fact that
μr acts freely on Y outside Q; Rule II(iii) comes from the following: μr acts on the generator s∈ωY by μr∋ξ:s↦ξa+b+c+d−es, and the index of KX is r, which means that a+b+c+d−e is coprime to r, so we may assume that a+b+c+d−e=1 by changing the choice of primitive root; Rule III is standard in singularity theory by taking analytic change of coordinates (see [41, Page 394–395]).
In fact, by Rule III, we can divide the possible f into 5 cases by [41, (6.7)] as the following:
Proposition 4.2** ([41, (6.7) Proposition]).**
By making a μr-equivariant analytic change of coordinates and possibly permuting the coordinates, f can be only in the following 5 cases:
cA* case: f=xy+g(z,t) with g∈m2;*
odd case: f=x2+y2+g(z,t) with g∈m3 and a≡bmodr;
cD4* case: f=x2+g(y,z,t) with g∈m3 and g3 is a reduced cubic;*
cDn* case: f=x2+y2z+g(z,t) with g∈m4;*
cE* case: f=x2+y3+yg(z,t)+h(z,t) with g∈m3 and h∈m4.*
Here m is the maximal ideal of C[x,y,z,t] and g3 is the cubic part of g.
For the proof we refer to that in [41] and we remark that the proof only uses Rule III.
4.2. Reduction to the terminal lemma
In this subsection, we check that r1(a,b,c,d;e,1) satisfies the assumption of the terminal lemma (Theorem 2.10), similar to [41, (7.2)]. But in our setting
the existence of β∈N∩σ makes the situation more complicated. Usually β and β′=(1,…,1)−β should be considered separately from other vectors. Note that the coprimeness is not treated in [41, (7.2)] but later case by case, while in our situation, we should check the coprimeness in the middle of the proof before dealing with β. This is because we need to apply Lemma 2.12 to exclude certain cases of β, where the coprimeness is already needed.
We denote by □ the unit cube of NR removing 16 vertices, i.e., □=[0,1]4∖{0,1}4⊂R4.
For any α∈N∩□, we will always use α′ to denote the vector α′=(1,…,1)−α.
For k=1,…,r−1, denote αk=r1(ak,bk,ck,dk)∈N∩□, where n is the smallest non-negative residue modulo r. Note that αk′=αr−k if and only if none of ak,bk,ck,dk is [math]. Also note that for any α∈N∩□, there exists
some k=1,…,r−1, such that α≡αkmodZ4, and α=αk holds if and only if none of α(x),α(y),α(z),α(t) is 1.
Proposition 4.3**.**
Suppose that xy∈f. Then the followings hold.
- (1)
For any α∈N∩□ such that α=β,β′, one of the followings holds:
- (i)
α(f)=α(xy)≤1* and α(zt)>1, moreover, if α(xy)=1, then one of α(z),α(t) is 1;*
2. (ii)
α(f)=α(xy)−1* and α(zt)<1, moreover, if α(xy)=1, then one of α(z),α(t) is [math].*
The alternative cases are interchanged by the symmetry α↦α′=(1,…,1)−α.
In particular, for k=1,…,r−1, if αk=β,β′, then these two cases imply
[TABLE]
or
[TABLE]
respectively.
2. (2)
Denote q=gcd(e,r). Then q=gcd(d,r), and a,b,c are coprime to r (after possibly interchanging z and t).
3. (3)
If β∈N∩□, then there exists an integer 1≤k0≤r−1 such that β=αk0. Moreover, β(xy)≥1 and 1−δ<β(zt)<1. In particular,
1−δ<rk0<1 and
[TABLE]
4. (4)
For any k=1,…,r−1,
[TABLE]
Proof.
(1) As xy∈f, a+b≡e, and c+d≡1modr by Rule II(iii).
Since a+b≡emodr, it is easy to see that a and b are coprime to r by Rule II(i)(ii).
By a+b≡emodr, α(f)≡α(xy)modZ for all α∈N∩σ. Fix any α∈N∩□. Since 0≤α(f)≤α(xy)<2, either α(f)=α(xy) or α(f)=α(xy)−1.
Note that α(xy)<2 because otherwise α(x)=α(y)=1, which contradicts the fact that gcd(a,b,r)=1 by Rule II(ii). By Rule I, if α(f)=α(xy) and α=β, then α(zt)>1.
Suppose that α=β,β′, certainly α′=β,β′. There are two cases: (i) α(f)=α(xy); (ii) α(f)=α(xy)−1.
Case (ii): Assume that α(f)=α(xy)−1, then α(xy)≥1.
If α(xy)=1, then α(f)=0 and there is a monomial in f with weight [math]. None of α(x),α(y) is [math] since a and b are coprime to r, so one of α(z),α(t) is [math], and in this case α(zt)<1 holds.
If α(xy)>1, then α′(xy)<1, and hence α′(f)=α′(xy). This implies that α′(zt)>1 by Rule I and hence α(zt)<1. This proves (ii).
Case (i): Assume that α(f)=α(xy), then α(zt)>1 by Rule I.
Suppose that α(xy)>1, then α′(xy)<1 which implies that α′(f)=α′(xy) and α′(zt)>1, which contradicts α(zt)>1. Hence α(xy)≤1.
On the other hand, if α(xy)=1, then the same argument implies that α′(xy)=1 and α′(f)=0. By case (ii), one of α′(z),α′(t) is [math], which implies that one of α(z),α(t) is 1. This proves (i).
Therefore, the former part of statement (1) is proved. Note that α(zt)<1 if and only if α′(zt)>1, so the alternative cases are interchanged by the symmetry.
For the latter part, note that αk(xy)=r1(ak+bk)≡r1ekmodZ and
αk(zt)=r1(ck+dk)≡rkmodZ.
If αk is in case (i), then αk(xy)=1 since αk(z),αk(t)<1, therefore αk(xy)<1 and 1<αk(zt)<2, which gives the first equation. If αk is in case (ii), then 1≤αk(xy)<2 and αk(zt)<1, which gives the second equation.
Before proving (2), we note that if β∈N∩□, then β(f)=β(xy), because otherwise β(f)=β(xy)−1, and β(zt)<0 by Rule I, which is absurd. It follows that 1−δ<β(zt)<1 by Rule I.
(2) Since a+b≡emodr, it is easy to see that a and b are coprime to r by Rule II(i)(ii). By Rule II(i), gcd(c,r) and gcd(d,r) divide q=gcd(e,r). So by Rule II(ii), it suffices to show that q divides either c or d. We may assume that q>1, and set k1=r/q≤r/2. If either ck1=0 or dk1=0, then q divides
either c or d, and we are done. So we may assume that ck1=0,dk1=0 and try to get a contradiction. In particular this means that αr−k1=αk1′. We need to consider 3 cases: αk1=β,β′; αk1=β; αk1=β′.
If αk1=β,β′, then also αr−k1=β,β′. Hence by ek1=e(r−k1)=0, we are in the second case of (1), that is,
[TABLE]
but this is absurd, since the sum of the left hand sides of the equations above should be 2r as ck1=0,dk1=0.
If αk1=β, then 1−δ<β(zt)<1 implies that
[TABLE]
But this contradicts k1≤r/2.
If αk1=β′, then αr−k1=β, and 1−δ<β(zt)<1 implies that
[TABLE]
This means that k1/r<δ≤61 and hence q>6. For j=2,3,5, we may consider jk1=jr/q<r and consider the weighting αjk1. Note that by the construction, k1<jk1<r−k1, hence αjk1=β,β′ for j=2,3,5 (same holds for αr−jk1). Hence by ejk1=0, we are in the second case of (1), that is,
[TABLE]
Since the sum of right hand sides of the equations above is r, either cjk1=0 or djk1=0 for each j=2,3,5. After possibly interchanging z,t, we may assume that djk1=0 holds for at least two j∈{2,3,5}, but this implies that dk1=0, a contradiction.
(3) Now suppose that β∈N∩□. Recall that
β(f)=β(xy) and 1−δ<β(zt)<1.
First we show that there exists an integer 1≤k0≤r−1 such that β=αk0.
Note that by definition there exists an integer 1≤k0≤r−1 such that β≡αk0modZ. Since a,b are coprime to r by (2), β(x),β(y) are not 1, which means that β=αk0. Note that in this case
[TABLE]
Then we will show that β(xy)≥1.
Suppose that β(xy)<1, then we know that
ak0+bk0=ek0. Hence
[TABLE]
On the other hand, for any 1≤k≤r−1 such that k=k0, if αk=β′, then by (1),
[TABLE]
if αk=β′, then
[TABLE]
Hence r1(a,b,c,d;e) and k0 satisfy the assumption of Lemma 2.12, which implies that k0/r≤1−δ, a contradiction.
Here the coprimeness follows from (2) and (✩1) of Lemma 2.12 is satisfied.
This concludes (3).
(4) For any k=1,…,r−1, if αk=β′, then the statement follows from (1) and (3).
If αk=β′=αk0′, then k=r−k0; also we know that ek0=0, because otherwise dk0=0 by (2), which contradicts αk=αk0′; therefore,
[TABLE]
This concludes (4).
∎
Proposition 4.4**.**
Suppose that x2∈f. Then the followings hold.
- (1)
For any α∈N∩□ such that α=β,β′,
one of the followings holds:
- (i)
α(f)=2α(x)≤1* and α(yzt)>1+α(x), moreover, if 2α(x)=1, then (α(y),α(z),α(t)) is a permutation of (21,21,1);*
2. (ii)
α(f)=2α(x)−1* and α(yzt)<1+α(x), moreover, if 2α(x)=1, then (α(y),α(z),α(t)) is a permutation of (21,21,0).*
The alternative cases are interchanged by the symmetry α↦α′=(1,…,1)−α.
In particular, for k=1,…,r−1, if αk=β,β′, then these two cases imply
[TABLE]
or
[TABLE]
respectively.
2. (2)
One of the followings holds (after possibly interchanging y,z,t):
- (a)
a≡e≡0modr* and b,c,d are coprime to r;*
2. (b)
r* is odd and a,b,c,d,e are coprime to r;*
3. (c)
q=2=gcd(d,r)=gcd(e,r)* and a,b,c are coprime to r.*
3. (3)
If β∈N∩□, then there exists an integer 1≤k0≤r−1 such that β≡αk0modZ4. Moreover, 1−δ<rk0<1 and
[TABLE]
4. (4)
For any k=1,…,r−1,
[TABLE]
Proof.
(1) As x2∈f, 2a≡emodr, and b+c+d≡1+amodr by Rule II(iii). From the former one, α(f)≡2α(x)modZ for all α∈N∩σ. Fix any α∈N∩□. Since 0≤α(f)≤2α(x)≤2, either α(f)=2α(x) or α(f)=2α(x)−1. Note that here α(f)=2α(x)−2 is impossible since otherwise α(f)=0 and α(x)=1, but α(f)=0 implies that at least one of α(y),α(z),α(t) is 0, and hence x and one of y,z,t have a common factor with r, which contradicts Rule II(ii).
By Rule I, if α(f)=2α(x) and α=β, then α(yzt)>1+α(x).
Suppose that α=β,β′, then α′=β,β′. There are two cases:
(i) α(f)=2α(x); (ii) α(f)=2α(x)−1.
Case (ii): Assume that α(f)=2α(x)−1, then 2α(x)≥1.
If 2α(x)=1, then α(f)=0 and hence one of α(y),α(z),α(t) is 0, say α(t). Recall that there exists an integer 1≤k≤r−1 such that α≡αkmodZ4. Then 2α(x)=1 and α(t)=0 implies that 2ak=dk=0. Since gcd(a,d,r)=1, this implies that d and r are even and k=2r.
Since gcd(b,d,r)=gcd(c,d,r)=1, bk=ck=21. This means that (α(y),α(z),α(t))=(21,21,0), and in this case α(yzt)<1+α(x) holds.
If 2α(x)>1, then 2α′(x)<1 and hence α′(f)=2α′(x). This implies that α′(yzt)>1+α′(x) by Rule I and hence α(yzt)<1+α(x). This proves (ii).
Case (i): Assume that α(f)=2α(x), then
α(yzt)>1+α(x) by Rule I.
Suppose that 2α(x)>1, then 2α′(x)<1 which implies that α′(f)=2α′(x), and α′(yzt)>1+α′(x) by Rule I, but this contradicts α(yzt)>1+α(x). Hence 2α(x)≤1. On the other hand, if 2α(x)=1, then the same argument implies that
α′(f)=0 and 2α′(x)=1. By case (ii), (α′(y),α′(z),α′(t))=(21,21,0) after permutation, and this proves (i).
Hence the former part of statement (1) is proved. Note that α(yzt)>1+α(x) if and only if α′(yzt)<1+α′(x), so the alternative cases are interchanged by the symmetry.
The latter part follows easily by the fact that 2αk(x)=r1(2ak)≡r1ekmodZ and
αk(yzt)=r1(bk+ck+dk)≡r1(k+ak)modZ. To be more precise, if αk is in case (i), we get that
2αk(x)=rek<1, and αk(yzt)=r1(k+ak)+1 or r1(k+ak)+2. We need to show that αk(yzt)=r1(k+ak)+2 can not happen. Suppose that it happens, then αk′(yzt)=1−r1(k+ak), αk′(x)=1−rak, and αk′(f)=2αk′(x)−1=1−r2ak, but this contradicts Rule I.
So this case we get the first equation. If αk is in case (ii), we get that
2>2αk(x)≥1, and αk(yzt)=r1(k+ak) or r1(k+ak)−1. Hence 2αk(x)=rek+1. Here note that αk(yzt)=r1(k+ak)−1 can not happen because it contradicts the fact that
αk(f)=r2ak−1 and Rule I. So this case we get the second equation.
Note that if β∈N∩□, then we also have either β(f)=2β(x) and 1−δ<β(yzt)−β(x)<1; or β(f)=2β(x)−1, and −δ<β(yzt)−β(x)<0 by Rule I. In particular, if β≡αkmodZ4, then β(yzt)−β(x)≡rkmodZ, which implies that 1−δ<rk<1 in both cases.
(2) First we show that if gcd(a,r)=1, then gcd(e,r)=gcd(a,r) and b,c,d are coprime to r.
Suppose that gcd(a,r)=q1>1 and gcd(e,r)=gcd(a,r), then since e≡2amodr, we know that gcd(e,r)=2q1. In particular, r is even. Take k1=2q1r, then ek1=0 and ak1=a(r−k1)=2r. Note that by Rule II(ii), q1 does not divide b,c,d, hence bk1,ck1,dk1 can not be [math] or 2r. In particular, αk1′=αr−k1.
We need to consider 3 cases: αk1=β,β′; αk1=β; αk1=β′.
If αk1=β,β′, then αr−k1=β,β′, and we are in the second case of (1), which gives
[TABLE]
and
[TABLE]
But this is absurd since the sum of the left hand sides of the equations above is 3r.
If αk1=β, we get 1−δ<rk1<1. But this implies that δ>43 since k1≤4r, which is a contradiction.
If αk1=β′, then αr−k1=β, and 1−δ<rr−k1<1.
In particular, rk1<δ≤121 and hence 2q1>12. For j=3,5,7,11, we may consider jk1=2q1jr<r and consider the weighting αjk1. Note that by the construction, k1<jk1<r−k1, hence αjk1=β,β′ for j=3,5,7,11 (same holds for αr−jk1). Hence by ajk1=2r and ejk1=0, we are in the second case of (1), that is,
[TABLE]
and
[TABLE]
Since the sum of the right hand sides of the equations above is 2r, one of bjk1, cjk1, djk1 is 0 for each j=3,5,7,11. After possibly interchanging y,z,t, we may assume that bjk1=0 for at least two j∈{3,5,7,11}. But as these two j’s are coprime, this implies that bk1=0, a contradiction.
Therefore we showed that if gcd(a,r)=1, then gcd(e,r)=gcd(a,r). In this case b,c,d are coprime to r by Rule II(i)(ii).
Now assume that gcd(a,r)=1. Since e≡2amodr, it follows that gcd(e,r)=1 if r is odd, and gcd(e,r)=2 if r is even. Moreover, in the first case, a,b,c,d are coprime to r by Rule II(i).
Now consider r is even and gcd(e,r)=2. Note that at most one of b,c,d is even by Rule II(ii).
Suppose that none of them is even.
Set k2=2r. Then ek2=0 and ak2=bk2=ck2=dk2=2r. That is, αk2=(21,21,21,21). Note that αk2=β,β′, otherwise β=β′, β(xyzt)=2, and 2β(f)∈Z, which contradicts Rule I and δ<21. Then we get a contradiction since αk2(yzt)=αk2(x)+1, which violates both situations in (1).
Hence exactly one of b,c,d is even, say d, and in this case gcd(d,r)=gcd(e,r)=2.
In summary, we showed that one of the followings holds:
- (a’)
gcd(e,r)=gcd(a,r)=1 and b,c,d are coprime to r;
2. (b)
r is odd and a,b,c,d,e are coprime to r;
3. (c)
q=2=gcd(d,r)=gcd(e,r) and a,b,c are coprime to r.
To conclude statement (2), we only need to prove that if gcd(a,r)=1 then a≡0modr. But we will come back to this after proving (3) and (4).
(3) Now suppose that β∈N∩□. Recall that either β(f)=2β(x) and 1−δ<β(yzt)−β(x)<1; or β(f)=2β(x)−1, and −δ<β(yzt)−β(x)<0 by Rule I.
Note that there exists an integer 1≤k0≤r−1 such that β≡αk0modZ.
If αk0=β,β′, then we get the desired equality by (1).
If αk0=β′, then β≡β′modZ4, which implies that β(x),β(y),β(z),β(t)∈{0,21,1}, and 2(β(yzt)−β(x)) is an integer, but contradicts δ<21.
Hence we may assume that αk0=β. Recall that rk0≡β(yzt)−β(x)modZ and 1−δ<rk0<1.
Suppose that β(f)=2β(x)−1, and −δ<β(yzt)−β(x)<0. Then 2β(x)≥1 and this implies that
[TABLE]
This gives
[TABLE]
On the other hand, for any 1≤k≤r−1 such that k=k0, if αk=β′, then by (1),
[TABLE]
if αk=β′, then
[TABLE]
Hence r1(a,b,c,d;e) and k0 satisfy the assumption of Lemma 2.12 after possibly relabeling a,b,c,d properly, which implies that k0/r≤1−δ, a contradiction. Here the coprimeness is guaranteed by one of (a’)(b)(c) in the part of (2) we just proved; (✩2) of Lemma 2.12 is satisfied in case (a’) by labeling a=a4; (✩3) of Lemma 2.12 is satisfied in cases (b)(c).
Suppose that β(f)=2β(x), and 1−δ<β(yzt)−β(x)<1. Note that in this case, β(yzt)−β(x)=rk0, and hence
[TABLE]
Then we will show that 2β(x)≥1.
Suppose that 2β(x)<1, then we know that
2ak0=ek0 and
[TABLE]
On the other hand, for any 1≤k≤r−1 such that k=k0, if αk=β′, then by (1),
[TABLE]
if αk=β′, then
[TABLE]
Hence r1(a,b,c,d;e) and k0 satisfy the assumption of Lemma 2.12 after possibly relabeling a,b,c,d properly, which implies that k0/r≤1−δ, a contradiction. Here the coprimeness is guaranteed by one of (a’)(b)(c) in the part of (2) we just proved; (✩2) of Lemma 2.12 is satisfied in case (a’) by labeling a=a4; (✩3) of Lemma 2.12 is satisfied in cases (b)(c).
Hence 2β(x)≥1 and we have
2ak0=ek0+r. This concludes (3).
(4) For any k=1,…,r−1, if αk=β′, then the statement follows from (1) and (3).
If αk=β′=αk0′, then k=r−k0; also we know that ek0=0, because otherwise ak0=0 or dk0=0 by case (a’) or (c) of (2), which contradicts αk=αk0′; therefore,
[TABLE]
This concludes (4).
(2) (continued) Now we are ready to show that if gcd(a,r)=1 then a≡0modr. If gcd(a,r)=1, then we are in case (a’) of (2), and by (4), the assumption of Theorem 2.10 is satisfied. Hence we get a≡emodr. On the other hand, 2a≡emodr. Hence a≡e≡0modr.
∎
Remark 4.5*.*
Before discussing case by case, we explain the strategy again.
By Proposition 4.3(2)(4) or 4.4(2)(4), we checked that the 6-tuple r1(a,b,c,d;e,1) satisfies the terminal lemma (Theorem 2.10). So we can list all possible values for r1(a,b,c,d;e) in each case. Then we can apply Proposition 4.3(1) or 4.4(1) to some special αk1 to get more restrictions on monomials in f, which leads to the final conclusion. For the smart choice of αk1 we just follow [41, Section 7], but again the existence of β gets in the way. So we have to consider the case that αk1=β or β′, in which we can not apply Proposition 4.3(1) or 4.4(1). In this case, we should consider to choose other special αk2, αk3, etc., and make more discussions.
4.3. The cA case
In this subsection, we consider case cA in Proposition 4.2: f=xy+g(z,t) with g∈m2.
By Proposition 4.3(2), q=gcd(d,r)=gcd(e,r), and c is coprime to r, this means that
q divides the degree of z in each monomial in g, that is, we may write g=g(zq,t) by abusing the notation.
By Proposition 4.3(2)(4), we can list all possible types by Theorem 2.10, and one of the followings holds (after possibly interchanging x,y or z,t):
If q>1,
- (A)
a+b≡0,c≡1,d≡emodr; that is, r1(a,−a,1,0;0);
2. (B)
a≡1,b+c≡0,d≡emodr; that is, r1(1,b,−b,b+1;b+1).
If q=1,
- (C)
r1(a,1,−a,a+1;a+1);
2. (D)
r1(a,−a−1,−a,a+1;−1).
This list can be easily derived from Theorem 2.10 and for the proof we refer to [41, (7.7)]. In each case, we may always assume that 0<a<r or 0<b<r accordingly.
We will discuss case by case.
Case (A): This gives an isolated hyperquotient singularity of type r1(a,−a,1,0;0) and f=xy+g(zr,t)
(note that q=r in this case), where g∈m2 and a,r are coprime. But such a singularity is terminal by [31, Theorem 6.5], so this case can be excluded.
Case (C): Since a, a+1 are coprime to r, we can take an integer 1<k1<r such that k1(a+1)=1. Consider
[TABLE]
Then αk1(zt)=rk1<1.
There are 3 cases: (C.1) αk1=β,β′; (C.2) αk1=β; (C.3) αk1=β′.
Case (C.1): If αk1=β,β′, then by Proposition 4.3(1), αk1(f)=αk1(xy)−1=r1. So there is a monomial xm∈g∈(z,t)2 with αk1(xm)=r1, but this is absurd.
Case (C.2): If αk1=β, then by Proposition 4.3(3), k1=k0 and 43<1−δ<rk1<1.
Then 2k1>23r>r+3. Note that r−k1<2k1−r<k1. Consider
[TABLE]
Then α2k1−r(zt)=r2k1−r<1 and α2k1−r=β,β′.
By Proposition 4.3(1), α2k1−r(f)=α2k1−r(xy)−1=r2. So there is a monomial xm∈g∈(z,t)2 with α2k1−r(xm)=r2, but this is absurd since by definition α2k1−r(z)≥α2k1−r(t)=r2. Therefore, this case can be excluded.
Case (C.3): If αk1=β′, then αr−k1=αk1′=β, which implies that k1=r−k0 and 1−δ<rr−k1<1 by Proposition 4.3(3). Hence rk1<δ≤31 and k1<2k1<r−k1. Consider
[TABLE]
In particular, α2k1(zt)=r2k1<1 and α2k1=β,β′. So by Proposition 4.3(1), α2k1(f)=α2k1(xy)−1=r2. So there is a monomial xm∈g∈(z,t)2 with α2k1(xm)=r2, but this is absurd since by definition α2k1(z)≥α2k1(t)=r2. Therefore, this case can be excluded.
Case (D): We can take the integer k1=r−1. Then αk1(zt)=rk1<1. There are 3 cases: (D.1) αk1=β,β′; (D.2) αk1=β′; (D.3) αk1=β.
Case (D.1): If αk1=β,β′, then by Proposition 4.3(1), αk1(f)=αk1(xy)−1=r1. So there is a monomial xm∈g∈(z,t)2 with αk1(xm)=r1, but this is absurd.
Case (D.2): If αk1=β′, then αr−k1=αk1′=β, which implies that k0=r−k1=1 and 1−δ<r1<1 by Proposition 4.3(3), but this is absurd as δ<21.
Case (D.3): If αk1=β, then by Proposition 4.3(3), k1=k0=r−1. Now consider αr−2, then it is easy to see that αr−2=β,β′ as r>3. Note that αr−2(zt)≡rr−2modZ.
If αr−2(zt)<1, then αr−2(zt)=rr−2 and by Proposition 4.3(1), αr−2(f)=αr−2(xy)−1=r2. So there is a monomial xm∈g∈(z,t)2 with αr−2(xm)=r2. As r>4, either z2∈g, αr−2(z)=r1, αr−2(t)=rr−3; or t2∈g, αr−2(z)=rr−3, αr−2(t)=r1. We only deal with the former case, the latter one can be reduced to the former one by symmetry by interchanging x with y, z with t, and a with −a−1. The former case implies that 2a≡1modr, which means that 2a=r+1.
The type becomes
[TABLE]
Now consider
[TABLE]
as r>9. Recall that k0=r−1, hence
αr−3=β,β′. Since αr−3(zt)=rr−3, by Proposition 4.3(1), αr−3(f)=αr−3(xy)−1=r3. So there is a monomial xm∈g∈(z,t)2 with αr−3(xm)=r3. But this is absurd since αr−3(z)>αr−3(t)=2rr−9>2r3 as r>12.
If αr−2(zt)>1, then αr−2(zt)=r2r−2 and 2a+−2a−2=2r−2. Since a,a+1 are coprime to r, the only solution to this equation is a≡2r−1modr. The type becomes
[TABLE]
Now consider
[TABLE]
Recall that k0=r−1, hence
αr−3=β,β′. Since αr−3(zt)=rr−3, by Proposition 4.3(1), αr−3(f)=αr−3(xy)−1=r3. So there is a monomial xm∈g∈(z,t)2 with αr−3(xm)=r3. But this is absurd since αr−3(z)=αr−3(t)=2rr−3>2r3 as r>6.
Case (B): Consider r1(1,b,−b,b+1;b+1) with b coprime to r and q=gcd(b+1,r)>0. If b+1≡0modr, then we get type r1(1,−1,1,0;0) which is in case (A), and we already excluded this case.
Hence from now on we assume 1≤b<b+1<r.
Consider
[TABLE]
Note that αr−1(zt)=rr−1<1.
We consider 3 cases: (B.1) αr−1=β′; (B.2) αr−1=β,β′; (B.3) αr−1=β.
Case (B.1): If αr−1=β′, then α1=β and k0=1, which contradicts rk0>1−δ.
Case (B.2): If αr−1=β,β′, then by Proposition 4.3(1), αr−1(f)=αr−1(xy)−1=rr−b−1. Hence there is a monomial xm∈g(zq,t)∈(z,t)2 with αr−1(xm)=rr−b−1. Obviously no multiple of t will work, so this monomial has to be zn with nb=r−b−1 for some n≥2. In particular, r≥3b+1≥2b+2.
We should further consider
[TABLE]
with αr−2(zt)=rr−2<1. Again, there are 3 cases: (B.2.1) αr−2=β′; (B.2.2) αr−2=β,β′; (B.2.3) αr−2=β.
Case (B.2.1): If αr−2=β′, then α2=β and k0=2, which contradicts rk0>1−δ.
Case (B.2.2): If αr−2=β,β′, then by
Proposition 4.3(1), αr−2(f)=αr−2(xy)−1=rr−2b−2. Hence there is a monomial xm∈g(zq,t)∈(z,t)2 with αr−2(xm)=rr−2b−2. This time zn can not work (because 2nb>r−2b−2), nor can any multiple of zt, so this monomial has to be tn′ with n′(r−2b−2)=r−2b−2 for some n′≥2. This implies that r=2b+2. Combining with r≥3b+1, this implies that r=4, a contradiction.
Case (B.2.3): If αr−2=β, then we should further consider αr−3. Recall that r≥3b+1. Note that r=3b+2 as gcd(r,b+1)>1. Hence there are two cases:
[TABLE]
if r≥3b+3, or
[TABLE]
if r=3b+1.
In the first case, we have αr−3(zt)=rr−3<1 and αr−3=β,β′ as r>5. Then by
Proposition 4.3(1), αr−3(f)=αr−3(xy)−1=rr−3b−3 and there is a monomial xm∈g(zq,t)∈(z,t)2 with αr−3(xm)=rr−3b−3.
This time zn can not work, nor can any multiple of zt, so this monomial has to be tn′ with n′(r−3b−3)=r−3b−3 for some n′≥2. This implies that r=3b+3. Combining with nb=r−b−1 for some n≥2, this implies that n≥3 and r≤9, a contradiction.
In the second case, we consider further
[TABLE]
(this holds since b≥3). We have αr−5(zt)=rr−5<1 and αr−5=β,β′ as r>7. Then by
Proposition 4.3(1), αr−5(f)=αr−5(xy)−1=r2r−5b−5 and there is a monomial xm∈g(zq,t)∈(z,t)2 with αr−5(xm)=r2r−5b−5.
This time zn can not work, nor can any multiple of zt, so this monomial has to be tn′ with n′(2r−5b−5)=2r−5b−5 for some n′≥2. This implies that 2r=5b+5. Combining with r=3b+1, this implies that r=10, a contradiction. Therefore case (B.2) is excluded.
Case (B.3): If αr−1=β, then k0=r−1. We consider further αr−2=β,β′ as r>3. Note that r=2b,2b+1 as gcd(r,b)=1 and gcd(r,b+1)>1. Hence there are 2 cases:
[TABLE]
if r≥2b+2; or
[TABLE]
if r≤2b−1.
Case (B.3.1): In this case, αr−2(zt)=rr−2<1 and by
Proposition 4.3(1), αr−2(f)=αr−2(xy)−1=rr−2b−2. Hence there is a monomial xm∈g(zq,t)∈(z,t)2 with αr−2(xm)=rr−2b−2. Arguing as before, either r=2b+2, or this monomial is zn with 2nb=r−2b−2 and n≥2.
In the first case, we further consider
[TABLE]
(this holds since b≥2). Then αr−3(zt)=rr−3<1 and αr−3=β,β′ as r>4. Then by
Proposition 4.3(1), αr−3(f)=αr−3(xy)−1=r2r−3b−3 and there is a monomial xm∈g(zq,t)∈(z,t)2 with αr−3(xm)=r2r−3b−3. As 2r−3b−3>0, this monomial has to be zn′ with n′(3b−r)=2r−3b−3 for some n′≥2. Combing with r=2b+2, this implies that b≤5 and r≤12, a contradiction.
In the second case, r≥6b+2. We further consider
[TABLE]
Then αr−3(zt)=rr−3<1 and αr−3=β,β′ as r>4. Then by
Proposition 4.3(1), αr−3(f)=αr−3(xy)−1=rr−3b−3 and there is a monomial xm∈g(zq,t)∈(z,t)2 with αr−3(xm)=rr−3b−3.
But zn will not work, nor any multiple of t as r≥6b+2, a contradiction.
Case (B.3.2): In this case, αr−2(zt)=rr−2<1 and by
Proposition 4.3(1), αr−2(f)=αr−2(xy)−1=r2r−2b−2. Hence there is a monomial xm∈g(zq,t)∈(z,t)2 with αr−2(xm)=r2r−2b−2. Since r>b+1, this monomial is zn with n(2b−r)=2r−2b−2 and n≥2. This implies that 2r≥3b+1. Note that 2r=3b+2 as gcd(r,b+1)>1. Hence there are two cases for αr−3:
[TABLE]
if 2r≥3b+3; or
[TABLE]
if 2r=3b+1.
In the first case, αr−3(zt)=rr−3<1 and αr−3=β,β′ as r>4. Then by
Proposition 4.3(1), αr−3(f)=αr−3(xy)−1=r2r−3b−3 and there is a monomial xm∈g(zq,t)∈(z,t)2 with αr−3(xm)=r2r−3b−3. But zn or any multiple of zt can not work, hence this monomial is tn′ for some n′≥2 which implies that 2r=3b+3. Combining with n(2b−r)=2r−2b−2 for n≥2, this implies that n≥3. If n≥4, then it is easy to show that r≤12 by this two equations, a contradiction. If n=3, then (r,b+1)=(18,12). But recall that q=gcd(b+1,r) divides n by construction as zn∈g(zq,t), this is also absurd.
In the second case, further consider
[TABLE]
(since b≥5). Since αr−4(zt)=rr−4<1 and αr−4=β,β′ as r>5, then by
Proposition 4.3(1), αr−4(f)=αr−4(xy)−1=r3r−4b−4 and there is a monomial xm∈g(zq,t)∈(z,t)2 with αr−4(xm)=r3r−4b−4.
If 3r−4b−4=0, then any multiple of t2 or zt can not work, hence this monomial is zn′ for some n′≥2 which implies that
3r−4b−4≥2(4b−2r). In conclusion, 3r−4b−4=0 or 3r−4b−4≥2(4b−2r) holds. Combining with 2r=3b+1, it is easy to see that r≤8, a contradiction.
Therefore, the cA case is excluded.
4.4. The odd case
In this subsection, we consider the odd case in Proposition 4.2: f=x2+y2+g(z,t) with g∈m3 and a=b.
By Proposition 4.4(2)(4), we can list all possible types by Theorem 2.10, and one of the followings holds:
21(0,1,1,1;0); or r1(1,2r+2,2r−2,2;2) with 4∣r.
For the proof we refer to [41, (7.10)].
Here we only need to exclude the second case. Recall that r>12. Consider
αr−2=r1(r−2,r−2,2,r−4). We need to consider 2 cases: (1) αr−2=β,β′; (2) αr−2=β or β′.
Case (1): If αr−2=β,β′, then since αr−2(yzt)=r2r−4<αr−2(x)+1=r2r−2, by
Proposition 4.4(1), αr−2(f)=2αr−2(x)−1=rr−4 and there is a monomial xm∈g∈(z,t)2 with αr−2(xm)=rr−4. Note that the only possible monomial with weight rr−4 is z2r−4, but it is not in the same eigenspace as f since 2r−4c=2r−4⋅2r−2≡2−2r≡2≡emodr.
Case (2): If αr−2=β or β′, then we further
consider αr−4=r1(r−4,r−4,4,r−8). Note that αr−4=β,β′ as r>6, and
αr−4(yzt)=r2r−8<αr−4(x)+1=r2r−4. Then by
Proposition 4.4(1), αr−4(f)=2αr−4(x)−1=rr−8 and there is a monomial xm∈g∈(z,t)2 with αr−4(xm)=rr−8. Note that the only possible monomial with weight rr−8 is z4r−8, but it is not in the same eigenspace as f since 4r−8c≡2≡emodr. This can be seen by 4r−8c=4r−8⋅2r−2=2−r+8r2−2r where 8r−2 is not an integer.
Therefore, the odd case is excluded.
4.5. The cD-E case
In this subsection, we consider the remaining cases in Proposition 4.2: f=x2+g(y,z,t) with g∈m3.
By Proposition 4.4(2)(4), we can list all possible types by Theorem 2.10, and one of the followings holds (after possibly interchanging y,z,t):
If a≡e≡0modr and b,c,d are coprime to r, then
- (a)
r1(0,b,−b,1;0) with b coprime to r.
If q=2=gcd(d,r)=gcd(e,r) and a,b,c are coprime to r, then
- (b)
r1(a,−a,1,2a;2a) with r even and a coprime to r;
2. (c)
r1(1,b,−b,2;2) with r even and b coprime to r.
If r is odd and a,b,c,d,e are coprime to r, then
- (d)
r1(2r−1,2r+1,c,−c;−1) with r odd and c coprime to r;
2. (e)
r1(a,−a,2a,1;2a) with r odd and a coprime to r;
3. (f)
r1(1,b,−b,2;2) with r odd and b coprime to r.
In each case, we may always assume that 0<a,b,c<r accordingly.
We will discuss case by case.
Case (b): Take 0<k1<r such that k1a=2r+2<r, then αk1=r1(2r+2,2r−2,k1,2). We need to consider 2 cases: (b.1) αk1=β,β′; (b.2) αk1=β or β′.
Case (b.1): If αk1=β,β′, since
αk1(yzt)<αk1(x)+1, by Proposition 4.4(1), αk1(f)=2αk1(x)−1=r2, but no monomial in m3 has weight ≤r2, a contradiction.
Case (b.2): If αk1=β or β′, then we consider further 0<k2<r such that k2a=2r+4<r, then αk2=r1(2r+4,2r−4,k2,4).
Note that αk2=β,β′, otherwise k1+k2≡0modr, which implies that 2r+2+2r+4≡0modr, a contradiction.
Since
αk2(yzt)<αk2(x)+1, by Proposition 4.4(1), αk2(f)=2αk2(x)−1=r4, but the only possible monomial in m3 has weight ≤r4 is z4 with k2=1 (recall that r>12). In this case, a≡2r+4modr and hence k12r+4≡2r+2modr. This implies that r∣4k1−2. r>12 implies that k1≥4. Note that r>k1 and r is even, so either r=4k1−2 or 3r=4k1−2, in particular, in both case, 3r≥4k1−2≥27k1. Recall that αk1=β or β′ implies that k1=k0 or r−k0. If k1=r−k0, then rk0>1−δ implies that r>4k1, a contradiction. If k1=k0, then rk0≤76 by the above calculation, again a contradiction.
Case (c): This case is similar to case (b). Take k1=2r+2 and consider αk1=r1(2r+2,k1b,r−k1b,2). We need to consider 2 cases: (c.1) αk1=β,β′; (c.2) αk1=β or β′.
Case (c.1): In this case the argument is the same as case (b.1). If αk1=β,β′, since
αk1(yzt)<αk1(x)+1, by Proposition 4.4(1), αk1(f)=2αk1(x)−1=r2, but no monomial in m3 has weight ≤r2, a contradiction.
Case (c.2): If αk1=β or β′, then k1=k0 or r−k0. Recall that k1=2r+2, so rk0≤2rr+2≤65 as r>2, and get a contradiction by rk0>1−δ.
Case (d): Take k1=r−1, then αk1=r1(2r+1,2r−1,k1c,r−k1c). We need to consider 2 cases: (d.1) αk1=β,β′; (d.2) αk1=β or β′.
Case (d.1): If αk1=β,β′, since
αk1(yzt)<αk1(x)+1, by Proposition 4.4(1), αk1(f)=2αk1(x)−1=r1, but no monomial in m3 has weight ≤r1, a contradiction.
Case (d.2): If αk1=β or β′,
then we consider 0<k2,k3<r such that k2a=2r+3<r
and k3a=2r+5<r.
Then
αk2=r1(2r+3,2r−3,k2c,r−k2c) and
αk3=r1(2r+5,2r−5,k3c,r−k3c).
Note that αk2=β or β′, otherwise k1+k2≡0 and ak1+ak2=2≡0modr, which is absurd. Since
αk2(yzt)<αk2(x)+1, by Proposition 4.4(1), αk2(f)=2αk2(x)−1=r3, but the only possible monomial in m3 has weight r3 is z3 with k2c=1 (after possibly interchanging z,t).
Similarly, αk3=β or β′, otherwise k1+k3≡0 and ak1+ak3=3≡0modr, which is absurd. Since
αk3(yzt)<αk3(x)+1, by Proposition 4.4(1), αk3(f)=2αk3(x)−1=r5. In order to have a monomial in m3 with weight r5, one of k3c and r−k3c is 1. Therefore k2±k3≡0modr and this implies that 2r+3±2r+5≡0modr, a contradiction.
Case (e): Take 0<k1<r such that k1a=2r+1, then αk1=r1(2r+1,2r−1,1,k1). We need to consider 2 cases: (e.1) αk1=β,β′; (e.2) αk1=β or β′.
Case (e.1): In this case the argument is the same as case (d.1). If αk1=β,β′, since
αk1(yzt)<αk1(x)+1, by Proposition 4.4(1), αk1(f)=2αk1(x)−1=r1, but no monomial in m3 has weight ≤r1, a contradiction.
Case (e.2): If αk1=β or β′,
then we consider 0<k2,k3<r such that k2a=2r+3<r
and k3a=2r+5<r.
Then
αk2=r1(2r+3,2r−3,3,k2) and
αk3=r1(2r+5,2r−5,5,k3).
We can get a contradiction similarly as case (d.2).
Note that αk2=β or β′, otherwise k1+k2≡0 and ak1+ak2=2≡0modr, which is absurd. Since
αk2(yzt)<αk2(x)+1, by Proposition 4.4(1), αk2(f)=2αk2(x)−1=r3, but the only possible monomial in m3 has weight r3 is t3 with k2=1.
Similarly, αk3=β or β′, otherwise k1+k3≡0 and ak1+ak3=3≡0modr, which is absurd. Since
αk3(yzt)<αk3(x)+1, by Proposition 4.4(1), αk3(f)=2αk3(x)−1=r5, but the only possible monomial in m3 has weight r5 is t5 with k3=1. This is absurd as k2=k3.
Case (f): Take k1=2r+1, then αk1=r1(2r+1,k1b,r−k1b,1). We need to consider 2 cases: (f.1) αk1=β,β′; (f.2) αk1=β or β′.
Case (f.1): In this case the argument is the same as case (d.1). If αk1=β,β′, since
αk1(yzt)<αk1(x)+1, by Proposition 4.4(1), αk1(f)=2αk1(x)−1=r1, but no monomial in m3 has weight ≤r1, a contradiction.
Case (f.2): If αk1=β or β′,
then we consider 0<k2,k3<r such that k2a=2r+3<r
and k3a=2r+5<r.
Then
αk2=r1(2r+3,k2b,r−k2b,3) and
αk3=r1(2r+5,k3b,r−k3b,5). We can get a contradiction similarly as case (d.2).
Note that αk2=β or β′, otherwise k1+k2≡0 and ak1+ak2=2≡0modr, which is absurd. Since
αk2(yzt)<αk2(x)+1, by Proposition 4.4(1), αk2(f)=2αk2(x)−1=r3, but the only possible monomial in m3 has weight r3 is z3 with r−k2b=1.
Similarly, αk3=β or β′, otherwise k1+k3≡0 and ak1+ak3=3≡0modr, which is absurd. Since
αk3(yzt)<αk3(x)+1, by Proposition 4.4(1), αk3(f)=2αk3(x)−1=r5, but the only possible monomial in m3 has weight r5 is z5 with r−k3b=1. This is absurd as k2=k3.
Case (a): Finally we consider case (a), r1(0,b,−b,1;0) with b coprime to r. Note that αk=r1(0,bk,r−bk,k) for 1≤k≤r−1 and αk(g)≡2αk(x)=0modZ. So αk(g)∈Z>0. In this case we can get the following condition for g(y,z,t).
Claim 4.6**.**
In case (a), for 1≤k≤r−1 such that αk≡βmodZ4, αk(g)=1.
Proof.
Take i=2αk(g) or 2αk(g)+1 respectively if αk(g) is even or odd. Consider γ=αk+(i,0,0,0). Then γ(f)=min{αk(g),2i}=αk(g)
and γ(xyzt)=αk(xyzt)+i=rr+k+i.
By the assumption, γ=β, hence by Rule I, γ(xyzt)>γ(f)+1, which implies that αk(g)<rk+i<1+i. Writing out the definition of i, it is easy to see that αk(g)=1 is the only solution.
∎
Now come back to case (a).
Take 0<k1<r such that k1b=2r−1. We may assume that k1≥2r by possibly interchanging z,t. Consider αk1=r1(0,2r−1,2r+1,k1).
If αk1≡βmodZ4, then by Claim 4.6, αk1(g)=1, which means that there is a monomial in (y,z,t)3 with weight 1. But all monomials in (y,z,t)3 have weights ≥2r3(r−1)>1, a contradiction.
If αk1≡βmodZ4, then take 0<k2<r such that k2b=2r−3. Consider αk2=r1(0,2r−3,2r+3,k2) and αr−k2=r1(0,2r+3,2r−3,r−k2). It is easy to see that αk2,αr−k2≡βmodZ4 as 2r−3±2r−1≡0modr.
Hence by Claim 4.6, αk2(g)=αr−k2(g)=1. If k2≥2r, then all monomials in (y,z,t)3 have αk2-weights ≥2r3(r−3)>1; if k2<2r, then all monomials in (y,z,t)3 have αr−k2-weights ≥2r3(r−3)>1 as r>9. So this case is excluded.
Therefore, the cD-E case is excluded.
5. The 1-gap theorem for 3-dimensional non-canonical singularities: the general case
Firstly we prove the 1-gap theorem for surfaces, which may be well-known to experts.
Lemma 5.1**.**
Let S be a normal quasi-projective Q-Gorenstein surface. Assume that mld(S)<1, then mld(S)≤32.
Proof.
We may assume that S has klt singularities. Take π:S′→S to be the minimal resolution of S and write KS′+∑iaiCi=π∗KS where Ci are distinct exceptional curves and 1>ai≥0.
Since mld(S)<1, it has worse than du Val singularities, and hence there exists an exceptional curve C with C2≤−3. We may assume that C1=C. Then by the genus formula,
[TABLE]
This implies that a(C;S)=1−a1≤32.
∎
Remark 5.2*.*
The number 32 is optimal in Lemma 5.1. In fact, the minimal log discrepancy of a cyclic quotient singularity of type 31(1,1) is 32.
Now we are ready to prove Theorem 1.3, the 1-gap theorem for 3-dimensional non-canonical singularities.
Proof of Theorem 1.3.
Take δ=δ0 as in Theorem 4.1, where δ0 is the constant from Lemma 2.12. Recall that δ≤δ3, where δ3 is the constant from Corollary 2.6.
Assume that there is a normal quasi-projective Q-Gorenstein 3-fold X with 1−δ<mld(X)<1, in particular, X is klt.
By Theorem 3.1, after replacing X, we may assume that X is extremely non-canonical. Let E0 be the unique exceptional divisor over X such that a(E0;X)<1. Let cE0(X) denote the center of E0 on X. By definition, X is terminal outside cE0(X). As 3-dimensional terminal singularities are isolated, by shrinking X, we may assume that X is smooth outside cE0(X).
If the center cE0(X)=C is a curve, we can take a general hyperplane section H⊂X intersecting C. Here H is a normal quasi-projective Q-Gorenstein surface and mld(H)≥mld(X) by the Bertini theorem ([30, Lemma 5.17]). On the other hand, by the inversion of adjucntion ([8, Corollary 1.4.5]), mld(H)≤a(E0;X,H)=a(E0;X)=mld(X). Hence 1−δ<mld(H)<1. But this contradicts Lemma 5.1.
So we may assume that cE0(X)=P and (P∈X) is an isolated extremely non-canonical klt singularity with mld(X)>1−δ. Denote r to be the minimal positive integer such that rKX is Cartier and take (Q∈Y) to be the canonical index 1 cover of (P∈X). Then (Q∈Y) is an isolated index one canonical singularity. By the classification of 3-dimensional index one canonical singularities (see [40] or [30, 5.3]), there are 3 cases: (Q∈Y) is smooth; (Q∈Y) is an isolated cDV singularity; (Q∈Y) is an isolated non-cDV singularity.
If (Q∈Y) is an isolated non-cDV singularity, then there exists an exceptional divisor E′ over Y centered at Q such that a(E′;Y)=1. Hence by the ramification formula (see, for example, the calculation in [29, (20.3) Proposition] or [30, Proposition 5.20]), there exists an exceptional divisor E over X such that n⋅a(E;X)=a(E′;Y)=1 for some positive integer n. Since X is extremely non-canonical, n>1. Therefore mld(X)≤a(E;X)≤21, a contradiction.
If (Q∈Y) is smooth, then (P∈X) is an isolated cyclic quotient singularity and this contradicts Corollary 2.6.
If (Q∈Y) is an isolated cDV singularity, then we get a contradiction by Theorem 4.1.
In summary, such a normal quasi-projective Q-Gorenstein 3-fold X with 1−δ<mld(X)<1 does not exist, and the theorem is proved.
∎
6. Boundedness of global indices of klt Calabi–Yau 3-folds
In this section, we give applications for Theorem 1.3. We show that the set of all non-canonical klt Calabi–Yau 3-folds are bounded modulo flops, and the global indices of all klt Calabi–Yau 3-folds are bounded from above. To be more precise, we show the followings:
Theorem 6.1**.**
The set of non-canonical klt Calabi–Yau 3-folds forms a bounded family modulo flops.
Corollary 6.2**.**
There exists a positive integer m such that for any klt Calabi–Yau 3-fold X, mKX∼0.
Recall that a variety is uniruled if it is covered by rational curves. The following lemma may be well-known to experts.
Lemma 6.3**.**
Let X be a klt Calabi–Yau variety. Then X is non-canonical if and only if X is uniruled.
Proof.
Suppose that X is uniruled. Then by taking a resolution ϕ:Y→X, Y is again uniruled, which implies that KY is not pseudo-effective. Assume, to the contrary, that X is canonical, then KY≥ϕ∗KX, and therefore KX is not psuedo-effective, which contradicts KX≡0.
Suppose that X is non-canonical, then there exists an exceptional divisor E over X with log discrepancy <1. By [8, Corollary 1.4.3], there is a projective birational morphism ϕ:Y→X extracting E. We can write KY+aE=ϕ∗KX≡0 with a>0, which means that KY is not psuedo-effective. But this implies that Y is uniruled by [12], and so is X.
∎
The key is to show the following proposition (comparing with [13, Corollary 4.2]).
Proposition 6.4**.**
Fix positive real numbers ϵ, δ.
Then, the set of log pairs (X,B) satisfying
- (1)
(X,B)* is an ϵ-lc log Calabi–Yau
pair of dimension 3,
*
2. (2)
there is a component of SuppB which is uniruled, and
3. (3)
the non-zero coefficients of B are at least δ,
forms a log bounded family modulo flops.
Proof.
We may replace X by its small Q-factorialization (by [8, Corollary 1.4.3]) and assume that X is Q-factorial.
We may write B=B′+dD, where D is a uniruled component of B and d>0.
We can run a (KX+B′)-MMP
with scaling of an ample divisor
which ends with a Mori fiber space f:Y→Z.
Denote by BY, DY the strict transforms of B, D on Y.
Since KX+B′+dD≡0, and we are running a (KX+B′)-MMP,
it follows that DY is uniruled and dominates Z. Also note that (Y,BY) is again
an ϵ-lc log Calabi–Yau pair, and coefficients of BY are at least δ.
We claim that Z is in a bounded family. If Z is a point, then there is nothing to prove. If dimZ=1, then according to Ambro’s canonical bundle formula (see [16, Theorem 3.1]), −KZ is pseudo-effective, which means that Z is either P1 or an elliptic curve, which is in a bounded family. If dimZ=2, then by [5, Corollary 1.7], there exists an effective
R-divisor Δ such that (Z,Δ) is ϵ′-klt and
KZ+Δ∼R0, where ϵ′ is a positive number depending only on ϵ.
Since DY dominates Z, Z is also uniruled. In particular, by Lemma 6.3, we are not in the case that KZ≡0, Δ=0, and Z has canonical singularities. Therefore, by [2, Theorem 6.9], such Z is in a bounded family.
As Z is in a bounded family, we may find a very ample divisor A on Z, and a positive integer r independent of X such that AdimZ≤r. Here if Z is a point, we just formally define
AdimZ=1.
Therefore, (Y,BY)→Z is a (3,r,ϵ)-Fano type log Calabi–Yau fibration in the sense of [7, Definition 1.1]. Hence by [7, Theorem 1.2], such Y is in a bounded family.
Here instead of using [7, Theorem 1.2], we can also use [6, Theorem 1.4] and [13, Theorem 4.6] to conclude the boundedness of Y.
As the coefficients of BY are at least δ, it is easy to see that the pair
(Y,BY) is in a log bounded family. In fact, as Y is bounded, we can find a very ample divisor H on Y such that H3≤r′ and H2⋅(−KY)≤r′ for some positive integer r′ independent of Y, then H2⋅Supp(BY)≤δ1H2⋅BY=δ1H2⋅(−KY)≤δr′, and we can use [6, Lemma 2.20] to conclude the log boundedness. For any prime divisor E on X which is exceptional over Y, we have
[TABLE]
Hence, (X,B) is in a log bounded family modulo flops by [13, Proposition 4.8] by extracting all such E simultaneously in the log bounded family of (Y,BY).
∎
Now we are ready to present the proof of Theorem 6.1. It is almost the same as that of [13, Theorem 5.1], the essential modifications are that we remove the condition on minimal log discrepancies by Theorem 1.3, and remove the rational connectedness condition by Proposition 6.4.
Proof of Theorem 6.1.
Consider a non-canonical klt Calabi–Yau 3-fold X. By Theorem 1.3, there exists a constant 0<δ<1 independent of X such that mld(X)≤1−δ.
By [8, Corollary 1.4.3], we may take a projective birational morphism π:Y→X extracting only one exceptional divisor E with log discrepancy a=a(E;X)≤1−δ. We can write
[TABLE]
Also by Global ACC [19, Theorem 1.5] (see [13, Lemma 3.12]), there exists a constant ϵ∈(0,21) such that X is (2ϵ)-lc, and therefore (Y,(1−a)E) is a (2ϵ)-lc log Calabi–Yau pair with 1−a≥δ>0.
Here E is uniruled by [18].
Now we can apply Proposition 6.4 to see that the pairs (Y,(1−a)E) are log bounded modulo flops.
That is, there are finitely many quasi-projective normal varieties Wi, a reduced divisor Ei on Wi, and a projective morphism Wi→Si, where Si is a normal variety of finite type and Ei does not contain any fiber, such that
for every (Y,(1−a)E), there is an index i, a closed point s∈Si, and a small birational
map f:Wi,s⇢Y
such that Ei,s=f∗−1E. We may assume that the set of points s corresponding to such Y is dense in each Si.
We may just consider a fixed index i and ignore the index in the following argument.
Now we are going to prove that X is bounded modulo flops by contracting E simultaneously in the bounded family (W,E). The argument is exactly the same as the latter half of [13, Theorem 5.1].
For the point s corresponding to (Y,(1−a)E),
[TABLE]
and therefore (Ws,(1−a)f∗−1E) is a (2ϵ)-lc log Calabi–Yau pair.
Now consider a log resolution g:W′→W of (W,E) and denote by E′ the strict transform of E and the sum of all g-exceptional reduced divisors on W′. Consider the log pair (W′,(1−ϵ)E′).
There exists an open dense set U⊂S such that for the point s∈U corresponding to (Y,(1−a)E),
gs:Ws′→Ws is a log resolution and we can write
[TABLE]
where the coefficients of Bs are ≤1−2ϵ and its support is contained in Es′=E′∣Ws′. We have
[TABLE]
Note that the support of (1−ϵ)Es′−Bs coincides with that of Es′ which are precisely the divisors on Ws′ exceptional over X. Hence (KW′+(1−ϵ)E′) is of Kodaira dimension zero on the fiber Ws′ and we can run a (KW′+(1−ϵ)E′)-MMP with scaling of an ample divisor over S to get a relative minimal model W~ over S. Such MMP terminates by [21, Corollary 2.9, Theorem 2.12]. Note that for the point s∈U corresponding to (Y,(1−a)E), Es′ is contracted by this MMP and hence W~s is isomorphic to X in codimension one. This gives a bounded family modulo flops, over U.
Applying Noetherian induction on S, the family of all such X is bounded modulo flops.
∎
Before proving Corollary 6.2, we show the boundedness of global indices in a bounded family.
Lemma 6.5**.**
Let D
be a bounded family of projective varieties.
Then there exists a positive integer m such that if Y∈D is a klt Calabi–Yau variety, then mKY∼0.
Proof.
Without loss of generality, we may assume that all varieties in D is of dimension d for some positive integer d.
Note that by Global ACC [19, Theorem 1.5] (see [13, Lemma 3.12]), there exists a constant ϵ∈(0,1) such that Y is ϵ-lc for any klt Calabi–Yau variety Y in D.
By definition, there is a quasi-projective scheme Z and a projective morphism h:Z→T, where T is of finite type, such that
for every X∈D, there is a closed point t∈T and an isomorphism f:Zt→X.
Replacing T by disjoint union of locally closed subsets while taking log resolutions of Z, we may assume that there are finitely many smooth varieties Ti and projective morphisms (Wi,Ei)→Zi→Ti such that (Wi,Ei) is log smooth over Ti and for every t∈Ti, the fiber
(Wi,t,Ei,t) is a log resolution of Zi,t with Ei,t the reduced exceptional divisor, and every X∈D is isomorphic to a fiber of Zi→Ti for some i.
Note that for any t∈Ti such that the fiber Zi,t is an ϵ-lc Calabi–Yau variety, and for any positive integer m, we have
[TABLE]
By [20, Theorem 4.2], the left hand side is independent of t for fixed i and m.
On the other hand, h0(Zi,t,mKZi,t)=1 if and only if mKZi,t∼0. Hence for each i, the global index of Zi,t, where Zi,t is an ϵ-lc Calabi–Yau variety, is independent of t∈Ti. As there are only finitely many such families, there exists a uniform positive integer m such that if Y∈D is a klt Calabi–Yau variety, then mKY∼0.
∎
Proof of Corollary 6.2.
Consider a klt Calabi–Yau 3-fold X.
If X has canonical singularities, then we can take a terminalization π:X′→X such that X′ has terminal singularities and KX′=π∗KX. By [26, 36], there exists a positive integer m1 independent of X′ such that m1KX′∼0, which implies that m1KX∼0.
If X has worse than canonical singularities, then by Theorem 6.1, X is bounded modulo flops, that is, there exists a bounded family of varieties D such that there is a normal projective variety Y∈D isomorphic to X in codimension one. Moreover, Y is also a Calabi–Yau 3-fold. Hence by Lemma 6.5, there exists a uniform positive integer m2 such that m2KY∼0, which implies that m2KX∼0 as X and Y are isomorphic in codimension one.
∎
Acknowledgment
The author is grateful to Valery Alexeev for fruitful discussions. This paper (especially Section 4) could never be finished without his warm encouragement and support. The author would like to thank Jungkai Alfred Chen, Jingjun Han, Yujiro Kawamata, James McKernan, Jihao Liu, Miles Reid, Vyacheslav Shokurov, and Chenyang Xu for discussions and comments during the preparation of this paper.
Part of this paper was written during the author’s visit to Johns Hopkins University in April 2019, and the author appreciates the support and hospitality.
This work was supported by the National Science Foundation under Grant No. DMS-1440140 while the author
were in residence at the Mathematical Sciences Research Institute in Berkeley, California,
during the Spring 2019 semester. The author also thanks Jihao Liu for discussions on [33].
The author thanks the referees for carefully checking the details and many useful suggestions.