This paper characterizes the space of Bridgeland stability conditions for certain 3-fold flopping contractions, revealing that the Stringy K"ahler Moduli Space (SKMS) is always a sphere with a specific number of points removed, depending on the curve length.
Contribution
It provides the first description of the SKMS for all smooth irreducible 3-fold flops, linking stability conditions to hyperplane arrangements and covering spaces.
Findings
01
Connected components of stability conditions relate to hyperplane arrangements.
02
The SKMS is a sphere with 3, 4, 6, 8, 12, or 14 points removed.
03
The arrangements are not Coxeter in general.
Abstract
Let f:X→SpecR be a 3-fold flopping contraction, where X has at worst Gorenstein terminal singularities and R is complete local. We describe the space of Bridgeland stability conditions on the null subcategory C of the bounded derived category of X, which consists of those complexes that derive pushforward to zero, and also on the affine subcategory D, which consists of complexes supported on the exceptional locus. We show that a connected component of stability conditions on C is the universal cover of the complexified complement of the real hyperplane arrangement associated to X via the Homological MMP, and more generally that a connected component of normalised stability conditions on D is a regular covering space of the infinite hyperplane arrangement constructed in Iyama-Wemyss [IW9]. Neither arrangement…
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.
Taxonomy
TopicsAlgebraic structures and combinatorial models · Advanced Algebra and Geometry · Algebraic Geometry and Number Theory
Full text
Stability Conditions for 3-fold Flops
Yuki Hirano
Y. Hirano, Department of Mathematics, Kyoto University, Kitashirakawa-Oiwake-cho, Sakyo-ku, Kyoto, 606-8502, Japan.
Let f:X→SpecR be a 3-fold flopping contraction, where X has at worst Gorenstein terminal singularities and R is complete local. We describe the space of Bridgeland stability conditions on the null subcategory C of Db(cohX), which consists of those complexes that derive pushforward to zero, and also on the affine subcategory D, which consists of complexes supported on the exceptional locus. We show that a connected component Stab∘C of StabC is the universal cover of the complexified complement of the real hyperplane arrangement associated to X via the Homological MMP, and more generally that Stabn∘D is a regular covering space of the infinite hyperplane arrangement constructed in [IW2]. Neither arrangement is Coxeter in general. As a consequence, we give the first description of the Stringy Kähler Moduli Space (SKMS) for all smooth irreducible 3-fold flops. The answer is surprising: we prove that the SKMS is always a sphere, minus either 3,4,6,8,12 or 14 points, depending on the length of the curve.
YH was supported by JSPS KAKENHI 19K14502 and The Max Planck Institute for Mathematics, and MW by EPSRC grants EP/R009325/1 and EP/R034826/1.
1. Introduction
Our setting is 3-fold flopping contractions, namely f:X→SpecR, where (R,m) is a three-dimensional complete local Gorenstein C-algebra with at worst terminal singularities. We allow X to be singular, with X having at worst terminal singularities. Consider the fibre C:=f−1(m), which with its reduced scheme structure is well-known to decompose into a union of n irreducible curves, each isomorphic to P1.
Given this setup, consider the following two subcategories of Db(cohX)
[TABLE]
It is a fundamental question to describe the spaces of stability conditions on C and D, and to use this to help describe the autoequivalence group of Db(cohX). Both C and D have finite length hearts, and it is well-known from surfaces [B6] that stability conditions on C should exhibit ‘finite-type’ ADE behaviour, whilst D should be the ‘affine’ version.
One of the problems is that traditional finite and affine Coxeter groups do not suffice in this setting. On one hand, it is possible that C is controlled by a Coxeter arrangement that does not have an associated affine Coxeter group. On the other hand, the category D predicts that such an affine object ‘exists’. Even worse, it is possible that C is controlled by a simplicial hyperplane arrangement that is not Coxeter. In that case, the affine object that controls D is even less clear. Making precise statements about both C and D is in fact one of the main outcomes of this paper.
1.1. Hidden t-structures
Our approach to this problem is noncommutative, and necessarily so. One of our new insights is that many of the t-structures that arise in the stability manifold of D are ‘hidden’, in the sense that they are not obviously part of the birational geometry, nor are they translations of the birational geometry by line bundle twists. However, they do have very conceptual noncommutative interpretations. To describe this in more detail, it is helpful to first briefly review the known cases.
The first partial solution to describing stability conditions on C and D in this 3-fold setting is due to Toda [T], who worked under two additional assumptions: (1) X is smooth, and (2) for a generic hyperplane section H↪SpecR, the pullback X×RH is smooth. Both conditions are restrictive for different reasons, with the second being the least natural, and by far the most problematic to remove. The crucial point is that, under these additional assumptions, the dual graph is an ADE Dynkin diagram. When this happens, the traditional language of finite and affine Weyl groups suffice, and the relevant t-structures are all described by perverse sheaves and their tensors by line bundles. Toda [T] packages this together to describe a component of normalised stability conditions on D as a regular covering of the complexified complement of the associated affine root hyperplane arrangement. Furthermore, the Galois group has a very satisfying geometric description, as those compositions of flop functors and line bundle twists that act trivially on K-theory.
Alas, these satisfyingly geometric statements all fail without assumption (2). Perhaps counter-intuitively, the hardest case turns out to be the most elementary one: that of a single-curve flop. In this case, the flopping curve has an associated length invariant ℓ, which is some number between one and six. The assumption (2) holds if and only if the curve has length one. Evidently, this is quite restrictive.
One of our key observations is that, in the general situation of a 3-fold flop X→SpecR, tracking under flop functors and line bundle twists does not suffice. To illustrate this visually in the case of a two curve flop, we will show below that stability conditions on D are controlled by infinite hyperplane arrangements Haff⊆Rn such as that shown in Figure 1.
In general the hyperplane arrangements are quite complicated, and there are many more chambers than one might naively expect. The above example has an obvious Z2 action, given by tensoring by the line bundles corresponding to the two curves. However, this action jumps the central chamber over many intermediate t-structures. These all turn out to be hearts of noncommutative resolutions, and their variants.
To circumvent this problem, which occurs even in the case of a single curve flop, we appeal to recent advances in noncommutative resolutions and their mutation theory. In the process, we will recover a conceptual understanding of the hidden t-structures, give a full description of (a component of) normalised stability conditions on D, and for the first time compute the Stringy Kähler Moduli Space.
1.2. Main Stability Results
Describing stability conditions on C turns out to be quite easy. Working in our most general setup f:X→SpecR, we first prove the following, which is entirely parallel to [T, Section 6, ArXiv v2]. Below the hyperplane arrangement H⊂Rn need not be ADE, or even Coxeter, but nevertheless tracking under the Flop functors still produces the chambers of the stability manifold for the category C. As notation, consider the set Flop(X) consisting of all those pairs (F,Y) where Y→SpecR is obtained from X through an iterated chain of simple flops, and F is a composition of flop functors and their inverses, from Db(cohY) to Db(cohX).
where U is defined in Notation 6.1, and furthermore the natural map
[TABLE]
is the universal cover of the complexified complement of H.
The hyperplane arrangement H can be described in various ways, and this is explained in Section 3. The main content of the above theorem is to establish that the map is a regular covering map; our previous work [HW] on the faithfulness of the action then establishes that the cover is universal. From this, the seminal work of Deligne [D1] on the K(\uppi,1) conjecture for simplicial hyperplane arrangements immediately confirms the following.
However, the main content in this paper is our description of stability conditions on the category D, which is much harder. Passing to a more noncommutative viewpoint, by the HomMMP [W1, 4.2] we first observe that the union in Theorem 1.1 can be reindexed using instead those pairs (\Upphi,L) where \Upphi is a chain of mutation functors and their inverses, and L belongs to the mutation class Mut0(N) of N described in (2.C), where mutation at the submodule R is not allowed. Disregarding this last restriction, and thus allowing mutation at all summands, gives an infinite set Mut(N). Via [IW2], this turns out to index the chambers in a corresponding infinite hyperplane arrangement Haff.
The following is our main result. The Galois group PBrD is by definition all compositions of mutation functors and their inverses that start and finish at our fixed EndR(N).
where \mathdsNL is defined in Notation 6.1, and \Upphi are compositions of mutation functors and their inverses. Furthermore, the natural forgetful map
[TABLE]
is a regular covering map, with Galois group PBrD.
Whilst passing to noncommutative resolutions (and their variants) provides the conceptual framework to tackle the above problem, and to understand the extra t-structures, their appearance comes at a significant cost. Namely, it becomes much harder to argue when functors are the identity, and thus to establish that Z is a regular covering map. The following is one of our main technical results, which heavily uses the isolated cDV assumption.
Suppose that Γ is an arbitrary modifying algebra (or noncommutative crepant resolution) of R, where R is isolated cDV. Consider an equivalence
[TABLE]
obtained as an arbitrarily long sequence of mutation functors and their inverses. If G restricts to an equivalence modΓ→modΓ, then G≅Id.
There are additional variants to the above, summarised in Theorem 5.6, which may be of independent interest.
1.3. Autoequivalence and SKMS results
Aside from producing new invariants for 3-fold flops, linking to classification problems, autoequivalences, noncommutative resolutions and deformation theory, one of our main motivations for establishing Theorem 1.3 is that it provides the first mechanism to compute the fabled stringy Kähler moduli space (SKMS). To do this requires some additional work, since following and generalising [T] we view the SKMS as the quotient of Stabn∘D by a certain group Aut∘D.
The definition of the group Aut∘D is a rather subtle point, since in this local model everything is relative to the base SpecR, and so everything should respect this structure. In particular, Aut∘D should not contain isomorphisms between flopping contractions unless they preserve the R-scheme structure. We achieve this by defining Aut∘D to be the group of R-linear Fourier–Mukai equivalences D→D that preserve Stabn∘D. Even for a single curve flop with ℓ=1, the restriction to R-linear functors is necessary for the mathematically defined SKMS [T, p6169] to coincide with the physical version [A, Figure 1].
The intrinsically defined group Aut∘D has the following more concrete description.
Combining Theorem 1.3 with Proposition 1.5 and an elementary hyperplane calculation allows us to finally compute the SKMS, as Stabn∘D/Aut∘D, for smooth irreducible flops, generalising [T, p6169] and [A, Figure 1]. There does not appear to be any predictions or conjectures in the literature for what the SKMS should be for higher lengths. Perhaps this is just as well, since the result is quite surprising.
For a smooth irreducible flop X→SpecR of length ℓ, the SKMS is always a 2-sphere, with holes removed at both the north and south pole, together with the following number of holes removed from the equator.
[TABLE]
For example, when ℓ=4, it follows that the SKMS is
[TABLE]
where we refer the reader to Theorem 7.12 for more details, including an explanation of the numerics, and the labelling of the holes on the equator.
We thank Jenny August for comments and suggestions on Appendix A, Will Donovan for many helpful remarks, Greg Stevenson for vanquishing minimal projective resolutions from an early version of the proof of Lemma 5.7, and Yukinobu Toda for conversations regarding [T].
2. Flops via Noncommutative Methods
In this section, we recall the basics of modification algebras, tilting, mutations of modifying modules, and the relationship to flops, mainly to set notation. Throughout R is a three dimensional complete local Gorenstein normal C-algebra, and f:X→SpecR is a flopping contraction as in the introduction. Furthermore, write C for f−1(m) endowed with reduced scheme structure. It is well known that C=⋃i=1nCi is a union of nP1s.
2.1. Tilting and Modification Modules
Since R is complete local, there exist line bundles L1,…,Ln∈Pic(X) such that Li⋅Cj=\updeltaij. Set V0:=OX, and write Vi for the vector bundle arising as the universal extension
[TABLE]
associated to a minimal set of ri−1 generators of the R-module H1(X,Li∗). Then by [VdB, 3.5.5] the vector bundle VX:=⨁i=0nVi∗ is tilting, and so after setting
[TABLE]
the functor
[TABLE]
is an equivalence. Our approach to stability conditions will be through noncommutative methods. Recall that CMR denotes the category of (maximal) Cohen–Macaulay R-modules, and refR denotes the category of reflexive R-modules. A reflexive R-module L∈refR is called modifying if EndR(L)∈CMR.
In the flops setting, for the fixed f:X→SpecR, consider the underived direct image Ni:=f∗(Vi∗)∈modR. Note that N0≅R. Throughout, we set
[TABLE]
It is known that N∈CMR, and N is a modifying R-module [VdB, 3.2.10].
2.2. Mutations and Equivalences
Given any modifying R-module L=⨁j=0nLj with each Lj indecomposable, there is an operation, called mutation at Li, that gives a new modifying R-module written \upnuiL. We briefly recall the construction here. Set
[TABLE]
so that L=Li⊕Lic, and consider the minimal right add(Lic)∗-approximation
[TABLE]
of Li∗, which by definition means that
(1)
Ui∈add(Lic)∗ and ai∘(−):HomR((Lic)∗,Ui)→HomR((Lic)∗,Li∗) is surjective,
2. (2)
If b∈EndR(Ui) satisfies ai=ai∘b, then b is an isomorphism.
Since R is complete, such an ai exists and is unique up to isomorphism. The (left) mutation of L at Li is then defined to be
[TABLE]
The following properties are known.
Proposition 2.1**.**
With notation as above, in particular R is isolated cDV, the following statements hold.
(1)
The mutation \upnuiL is a modifying R-module.
2. (2)
There is an isomorphism \upnui\upnuiL≅L.
Proof.
The first part is general; see e.g. [IW1, §6]. The second part is specific to isolated cDV singularities [IW2, 9.28].
∎
Definition 2.2**.**
Fix the modifying module N from (2.C). Write Mut(N) for the set of isomorphism classes of all iterated mutations of N, and Mut0(N) for the subset consisting of those iterated mutations of N at only the (i=0)-th summands. The exchange graph EG(N) is the graph whose vertices are the elements of Mut(N), and two vertices in EG(N) are joined by an edge if and only if the corresponding modifying modules are related by a mutation at an indecomposable summand. The exchange graph EG0(N) is the full subgraph whose vertices are the elements of Mut0(N).
Alternatively, the exchange graph EG0(N) is the full subgraph whose vertices correspond to CM modules. We once and for all fix a decomposition N=R⊕N1⊕…⊕Nn, where N0=R. Via the Coxeter-style combinatorics in Section 3, this fixed decomposition induces an ordering on the summands of all other elements L of Mut0(N), such that locally crossing a wall locally labelled si always corresponds to replacing the ith summand. In this way, there is a global labelling on the edges of both EG0(N) and EG(N) using the sets {s1,…,sn} and {s0,s1,…,sn} respectively.
The mutation of a modifying R-module L gives rise to a derived equivalence between Γ:=EndR(L) and \upnuiΓ:=EndR(\upnuiL), induced by a tilting bimodule Ti. Since R is isolated, in fact Ti=HomR(L,\upnuiL) by [IW1, 6.14], and the following functor is an equivalence:
[TABLE]
The functor \Upphii is called the mutation functor at the summand i.
2.3. Flops and Mutation
Recall that the exceptional locus of f, given reduced scheme structure, decomposes into n copies of P1, namely C=⋃i=1nCi. For each Ci there exists a flopping contraction gi:X→Yi which contracts only Ci, and the flopping contraction f:X→SpecR factors through gi. Furthermore, there exists a flop gi+:Xi+→Yi of gi such that the following diagram commutes
[TABLE]
where fi+:=hi∘gi+. Then (fi+)−1(m), with reduced scheme structure, is the union of n irreducible curves ⋃j=1nCj+, where for j=i each Cj+ is the proper transformation of Cj, and if j=i then Ci+ is the flopped curve.
There is an isomorphism of R-modules H0(Xi+,VXi+)≅\upnuiN.
2. (2)
The following diagram of equivalences is functorially commutative
[TABLE]
where Flopi:Db(cohX)→Db(cohXi+) is the quasi-inverse of the Bridgeland–Chen flop functor **[B3, C]**.
2.4. R-linear equivalences
In our flops setup f:X→SpecR, the category cohX is R-linear, and thus so too is Db(cohX). Autoequivalences that preserve this structure will be particularly important later. Here we briefly recall the R-linear structure, and give some preliminary results.
Since SpecR is an affine scheme, there is a bijection
[TABLE]
Given g:X→SpecR, we will write g:R→OX(X) for the corresponding morphism.
For a∈HomcohX(F,G) and \uplambda∈OX(X), consider \uplambda⋅a∈HomcohX(F,G) defined by
[TABLE]
for all x∈F(U). Under this action, cohX is an OX(X)-linear category. The morphism f:X→SpecR then gives cohX the structure of an R-linear category, via f:R→OX(X).
The following two results are general, and are not specific to our flops setup. Both are well-known, but for lack of reference we provide the proof.
Proposition 2.4**.**
Consider R-schemes f:X→SpecR, g:Y→SpecR, and a morphism h:X→Y. Writing h:OY(Y)→OX(X) for the corresponding morphism, then the following are equivalent.
(1)
g∘h=f.
2. (2)
h∘g=f.
3. (3)
h∗:cohY→cohX* is an R-linear functor.*
If h is an isomorphism, the last condition is equivalent to h∗:cohX→cohY being an R-linear functor.
Proof.
Note first that for y∈OY(Y), a∈HomY(F,G) and x⊗\uplambda∈h∗(F)=F⊗YOX,
[TABLE]
Hence by linearity h∗(y⋅a)=h(y)⋅h∗(a) for all y∈OY(Y) and all a∈HomY(F,G).
(1)⇔(2) This is an immediate consequence of the bijection (2.F).
(2)⇒(3) Assuming (2), then for any r∈R and a∈HomY(F,G),
[TABLE]
and so (3) holds.
(3)⇒(2) There is a commutative diagram
[TABLE]
where the vertical arrows are R-linear isomorphisms. Since h∗ is R-linear by assumption, it follows that so too is h. But then
[TABLE]
for all r∈R, and thus h∘g=f.
The last statement holds since the inverse of an R-linear functor is R-linear.
∎
Lemma 2.5**.**
Consider an R-scheme X→SpecR, and a line bundle L on X. Then the functor −⊗L:cohX→cohX is OX(X)-linear, and in particular, is R-linear.
Proof.
For any \uplambda∈OX(X), a∈HomX(F,G) and x⊗ℓ∈F⊗L, we have
[TABLE]
and so by linearity the result follows.
∎
3. Hyperplane Arrangements via K-theory
When the generic hyperplane section of X is not smooth, it will turn out that stability conditions on C and D will not, in general, be the regular covering of a space constructed using global rules. The space will instead be constructed using iterated local rules, which we outline here. This section is largely a summary of [IW2] suitable for our needs, with the exception of some new results in Sections 3.4 and 3.5.
3.1. General Elephants
Slicing the flopping contraction X→SpecR gives rise to combinatorial data, in the form of a labelled ADE Dynkin diagram \Updelta, vertices \Updelta0, and a subset J⊆\Updelta0. We briefly recall this here.
Pulling back X→SpecR along the map SpecR/g→SpecR for a generic element g∈R, gives a morphism S→SpecR/g, say. By [R], R/g is an ADE surface singularity, and S is a partial crepant resolution. As such, S is obtained by blowing down curves in the minimal resolution S, and so by McKay correspondence we can describe S combinatorially via a Dynkin diagram \Updelta, together with the subset J⊆\Updelta0 of those vertices that are blown down to obtain S. Thus, by convention, J corresponds to the curves that have been contracted by S→S.
This data can be extended into the affine setting as follows. Consider the corresponding extended Dynkin diagram \Updeltaaff, and denote the extending vertex by ⋆. Set Jaff:=J, considered as a subset of the vertices of \Updeltaaff.
From this data, consider R∣\Updelta∣ and R∣\Updeltaaff∣ based by the duals \upalphai∗, where the i are indexed over the vertices of \Updelta (respectively, \Updeltaaff). Inside these spaces, consider the Weyl chamber C+, where all coordinates are positive, and set
[TABLE]
where W\Updelta is the finite Weyl group, and W\Updeltaaff the affine Weyl group.
There are subspaces DJ⊂R∣\Updelta∣ and DJaff⊂R∣\Updeltaaff∣ defined as
[TABLE]
These are based by \upalphai∗ for i∈\Updelta−J, respectively i∈\Updeltaaff−Jaff. As such, dimDJ=n, the number of curves in the flopping contraction, and dimDJaff=n+1.
TCone(J):=TCone(\Updelta)∩DJ is called the J-finite hyperplane arrangement.
2. (2)
TCone(Jaff):=TCone(\Updeltaaff)∩DJaff
is called the J-affine arrangement.
3.2. Affine Hyperplanes via K-theory
The combinatorics of the previous section can also be constructed via K-theory, which is more useful for stability conditions later. Recall from (2.C) that the flopping contraction f:X→SpecR associates a modifying R-module N, with summands R=N0,N1,…,Nn. Set Λ:=EndR(N) and Pi:=HomR(N,Ni), so that {Pi}0≤i≤n is the set of all indecomposable projective Λ-modules. It is well-known that
[TABLE]
For every L∈MutN, this process can be repeated: indeed each ΛL:=EndR(L) has K-theory of the same rank as above, and to avoid confusion write KL:=K0(PerfΛL). Since the given flopping contraction f, and its associated modification algebra Λ is fixed, throughout we will refer to the distinguished object
[TABLE]
Every mutation functor \Upphii:Db(modΛL)→Db(modΛ\upnuiL) restricts to an equivalence on perfect complexes, and so write
[TABLE]
for the induced isomorphism of K0-groups. This map can be represented by an invertible (n+1)×(n+1) matrix over Z, which is described as follows.
Lemma 3.2**.**
Suppose that L is modifying, and consider the exchange sequence [IW1, (6.I)] obtained as the dual of (2.D), namely
[TABLE]
Write Pj=HomR(L,Lj) for the projectives in ΛL, and Qj for the correspondingly ordered projectives in Λ\upnuiL. Then \upphii−1:K\upnuiL→KL sends
[TABLE]
Proof.
Being induced by the tilting bimodule Ti from (2.E), it is clear that \Upphii sends Ti to Λ\upnuiL. Since Ti only differs from ΛL at the summand Pi, it is obvious that \Upphii sends Pj to Qj whenever j=i; see e.g. [W1, 4.15(1)]. Hence \Upphii−1 sends Qj to Pj.
When j=i, under \Upphii−1, the projective Qi gets mapped to the ith summand of Ti, which by definition is HomR(L,Ki). But by [IW1, (6.Q)], applying HomR(L,−) to (3.A) gives an exact sequence
[TABLE]
From this, the identification in K-theory clearly follows.
∎
For L∈Mut(N), consider the shortest sequence of mutations
[TABLE]
and define \UpphiL to be the composition of the corresponding mutation functors
[TABLE]
We write \upphiL:KL→K for the induced map on K-theory. Throughout, whenever Z⊆\mathdsk, we will abuse notation and also write \upphiL:KL⊗\mathdsk→K⊗\mathdsk. The following result is mainly combinatorial, and it mirrors the corresponding Coxeter statement. We identify the basis element \upalphai∗∈TCone(Jaff) with [Pi]∈K to allow for the comparison.
Theorem 3.3**.**
[IW2, 9.8]**
Suppose that f:X→SpecR is a 3-fold flopping contraction, such that X has only terminal singularities. Then there is a decomposition
[TABLE]
In particular, the following statements hold.
(1)
The open decomposition ⋃\upphiL(C+) gives the chambers of the J-affine arrangement.
2. (2)
If L≆M, then \upphiL(C+) and \upphiM(C+) do not intersect.
3. (3)
\upphiL(C+)* and \upphiM(C+) share a codimension one wall ⟺L and M differ by the mutation of an indecomposable summand.*
We remark that TCone(Jaff) does not fill R∣\Updeltaaff∣, as can be seen in Example 3.5 below. Because of this, all information is contained in a slice.
Definition 3.4**.**
The real level is defined to be
[TABLE]
The walls of the open decomposition ⋃\upphiL(C+) partition Level=LevelN into open regions
[TABLE]
which by Theorem 3.3 are still in bijection with Mut(N). We call these open regions the J-alcoves, and consider the infinite hyperplane arrangement
[TABLE]
Example 3.5**.**
Consider \Updelta=E6, and J the following choice of unshaded vertices:
[TABLE]
Then, either by tracking the C+ region directly over the labelling set in [IW2, 1.12], or by iterating the wall crossing rule in [IW2, 1.20(1)(2)], or by intersecting the full Tits cone of affine E6 with the subspace R2 based by the shaded vertex and the extended vertex, it follows that TCone(Jaff) is the shaded region in the following picture. Further, Level is illustrated by the dotted blue line \upvartheta0+3\upvartheta1=1.
[TABLE]
The circles on the blue line are, reading top left to bottom right, at \upvartheta1=1,32,21,31,0,−31,−21. Thus basing Level by [P1], the level is the infinite hyperplane arrangement
[TABLE]
The J-alcoves are the open intervals on the blue line between two adjacent dots, and Haff is the infinite collection of dots.
3.3. Finite Hyperplanes by K-theory
For the finite version of the above combinatorics, with notation as in Lemma 3.2 consider
[TABLE]
Again, since X→SpecR and N are fixed from (2.C), there is a distinguished object \Uptheta:=\UpthetaN. If i=0, then since \upphii sends P0 to Q0 by Lemma 3.2, \upphii induces an isomorphism
[TABLE]
For L∈Mut0(N), consider the shortest sequence of mutations
[TABLE]
where each step does not mutate the vertex R. As before, write \UpphiL for the composition of the corresponding mutation functors, but now write \upvarphiL:\UpthetaL→\Uptheta for the induced map on K-theory. Again, whenever Z⊆\mathdsk, we will abuse notation and also write \upvarphiL:\UpthetaL⊗\mathdsk→\Uptheta⊗\mathdsk.
The following was established first in [W1] when X is Q-factorial, using King stability. The Q-factorial can now be dropped, following [IW2].
Theorem 3.6**.**
[W1, IW2]**
Suppose that f:X→SpecR is a 3-fold flopping contraction, such that X has only terminal singularities.
Then there is a finite decomposition
[TABLE]
In particular, the following statements hold.
(1)
The open decomposition ⋃\upvarphiL(C+) gives the chambers of the J-finite hyperplane arrangement.
2. (2)
If L≆M, then \upvarphiL(C+) and \upvarphiM(C+) do not intersect.
3. (3)
\upvarphiL(C+)* and \upvarphiM(C+) share a codimension one wall ⟺L and M differ by the mutation of an indecomposable summand.*
For L∈Mut0(N), write CL:=\upvarphiL(C+) and set
[TABLE]
By Theorem 3.6(1), H is a finite simplicial hyperplane arrangement, which by definition means that ⋂H∈HH={0} and all chambers in Rn\H are open simplicial cones.
3.4. The Tracking Rules of Mutation
Given a modifying R-module L and any summand Li, \upnui\upnuiL≅L by Proposition 2.1(2). We will abuse notation and write
[TABLE]
These, and their inverses, induce the following isomorphisms on K-theory
[TABLE]
Lemma 3.7**.**
All four isomorphisms in (3.F) are given by the same matrix, and this matrix squares to the identity. If i=0, then the same statement holds for \upvarphii,\upvarphii−1 and \UpthetaL,\Uptheta\upnuiL.
Proof.
By (3.B), the matrices for the inverses are controlled by numbers appearing in the relevant approximation sequences. Suppose that the top \upphii−1 is controlled by numbers bij, and the bottom \upphii−1 is controlled by numbers cij. That the two matrices labelled \upphii−1 are the same is simply the statement that bij=cij, which is precisely the proof of [W1, 5.22] when X is \mathdsQ-factorial, or [IW2, 9.28] generally. Given the fact that bij=cij, the statement that \upphii−1\upphii−1=Id can then simply be seen directly. Applying \upphii to each side then gives \upphii−1=\upphii. All the statements on \upvarphii follow.
∎
3.5. Complexified Actions
Via (3.D) and (3.E), associated to X→SpecR is an infinite real hyperplane arrangement Haff, and also a finite simplicial real hyperplane arrangement H. Stability conditions will require the complexified versions of these.
By a slight abuse of notation, consider
[TABLE]
where H={rei\uppi\upvartheta∈C∣r∈R>0,0<\upvartheta≤1}⊂C is the semi-closed upper half plane. The regions H+ and H+′ technically depend on L, since they are subsets of (\UpthetaL)C and (KL)C respectively, but we drop this from the notation.
For L∈Mut0(N), recall from §3.3 that after choosing a mutation path L→…→N that does not involve mutating R, there is a corresponding linear map \upvarphiL:(\UpthetaL)C→\UpthetaC.
We require the following result, where as usual HC denotes the complexification of the real hyperplane arrangement H. The result is folklore when the arrangement H is Coxeter. Given our setting here is just mildly more general, and the proof is combinatorial in nature, we give a self-contained proof in Appendix A.
Proposition 3.8**.**
There is an equality
[TABLE]
where the union on the right hand side is disjoint.
On the other hand, the affine version of Proposition 3.8 is a little bit more involved. We first pass to the complexified level, defined to be
[TABLE]
and inside (LevelL)C consider the region
[TABLE]
Example 3.9**.**
In the case of any one-curve flop, writing z=x+iy, then C\HC=C\{0} decomposes into the disjoint union
[TABLE]
On the other hand, as in Example 3.5, for any one-curve flop HCaff consists of infinitely many points on the real axis. To exhibit the region E+, note first that (z0,z1)∈LevelC if and only if we can write
[TABLE]
where ℓ is the length of the curve.
To belong to E+ is equivalent to both factors being in H. If the second factor is in H then y1≥0, so the first factor being in H implies that 0≤y1≤ℓ1. In fact, it is elementary to check that E+ forms the following region:
[TABLE]
The non-standard way of drawing the x and y axis is justified by Example 3.5. The co-ordinate y1 should be viewed as the original Level seen in Example 3.5, which naturally points to the left, and x1 should be viewed as the ‘complexified co-ordinate’. The other regions \upvarphiL(E+) have the same shape as the above, sandwiched between the two adjacent dots, and so give a disjoint union that covers (LevelL)C.
Set W to be the set of full hyperplanes in K⊗R that separate the open chambers \upphiL(C+) of TCone(Jaff) (see e.g. Example A.1). We then consider the complexification of Haff in LevelC, defined to be
[TABLE]
where WC:=W⊕iW. As in Example 3.9, HCaff can be viewed as the complexification of hyperplanes in the real level, provided that we swap the roles of x and y. Indeed, if we set HW:=W∩Level, then Haff=⋃W∈WHW, and the linear bijection LevelC→Level⊕iLevel defined by x+iy↦(x+y)+iy maps HCaff to ⋃W∈W(HW⊕iHW).
The following two results are evident, by inspection, for any one-curve flops using Example 3.9 above. The more general case requires a more involved combinatorial argument, so again the proofs are postponed until Appendix A.
where the union on the right hand side is disjoint.
4. Arrangement Groupoids
In this subsection we briefly recall the basics of the arrangement (=Deligne) groupoid of a locally finite real hyperplane arrangement, mainly to set notation. Some first results specific to the flops setting are presented in Subsection 4.2.
4.1. Arrangements groupoids
Throughout, let H be either the finite real hyperplane arrangement H from (3.E), or the infinite version Haff from (3.D). Both are locally finite arrangements, i.e. every point of Rn is contained in at most finitely many hyperplanes, and essential arrangements, i.e. the minimal intersections of hyperplanes are points.
Definition 4.1**.**
The graph ΓH of oriented arrows is defined as follows. The vertices of ΓH are the chambers (i.e. the connected components) of Rn\H. There is a unique arrow a:v1→v2 from chamber v1 to chamber v2 if the chambers are adjacent, otherwise there is no arrow. For an arrow a:v1→v2, we set s(a):=v1 and t(a):=v2. By definition, if there is an arrow a:v1→v2, there is a unique arrow b:v2→v1 with the opposite direction of a.
A positive path of length n in ΓH is defined to be a formal symbol
[TABLE]
whenever there exists a sequence of vertices v0,…,vn of ΓH and exist arrows ai:vi−1→vi in ΓH. Set s(p):=v0, t(p):=vn, and ℓ(p):=n, and write p:s(p)→t(p). The notation ∘ should remind us of composition, but we will often drop the ∘’s in future. If
q=bm∘…∘b2∘b1 is another positive path with t(p)=s(q), we consider the formal symbol
[TABLE]
and call it the composition of p and q.
Definition 4.2**.**
A positive path is called reduced if it does not cross any hyperplane twice.
In our setting where H is H or Haff, reduced positive paths coincide with shortest positive paths. In the finite setting this can be found in e.g. [P1, 4.2], and in the infinite case see e.g. [S, Lemma 2] or [IM, §I.5].
Following [D2, p7], let ∼ denote the smallest equivalence relation, compatible with morphism composition, that identifies all morphisms that arise as positive reduced paths with same source and target. Then consider the free category Free(ΓH) on the graph ΓH, where morphisms are directed paths, and the quotient category
[TABLE]
called the category of positive paths.
Definition 4.3**.**
The arrangement (=Deligne) groupoidGH is the groupoid defined as the groupoid completion of GH+, that is, a formal inverse is added for every morphism in GH+.
Notation 4.4**.**
When H=H from (3.E), we denote the arrangement groupoid by \mathdsG, and when H=Haff from (3.D), we denote the arrangement groupoid by \mathdsGaff.
The following is well-known [D1, P1, P2, S]; in the level of generality here with H locally finite and essential, the statement below is [D2, p9].
Theorem 4.5**.**
For any vertex v in the arrangement groupoid, End\mathdsG(v)≅\uppi1(Cn\HC), and End\mathdsGaff(v)≅\uppi1(LevelC\HCaff).
4.2. First Results for Flops
This section proves that in our flops setting, pure braids act as the identity on K-theory. This will be crucial in showing that they act as deck transformations later in Section 6. Throughout this subsection, H is either H or Haff, and CL denotes the chamber in the complement of H corresponding to either \upvarphiL(C+) or AlcoveL, when H=H or H=Haff respectively. The following two lemmas are elementary.
Lemma 4.6**.**
Suppose that \upalpha:A→B is a reduced positive path for H, and that si is a simple wall crossing separating B and C, so by definition there are morphisms si:B→C and si:C→B in ΓH. If si∘\upalpha:A→C is not reduced, then there exists some reduced positive path \upgamma:A→C such that si∘\upgamma:A→B is reduced.
Suppose that \upalpha=sit∘…∘si1 is a reduced positive path for H, namely
[TABLE]
where each sij crosses a hyperplane Hj, say. Then for all j=1,…,t−1, the chambers C1 and Cj are on the same side of Hj.
Proof.
There is nothing to prove in the case j=1. If C1 and Cj are on opposite sides of Hj for some j>1, then clearly \upbeta:=sij−1∘…∘si1:C1→Cj must at some point cross Hj. But then sij∘\upbeta, and hence \upalpha, must cross Hj twice, which is a contradiction.
∎
With respect to our applications, part (2) of the following proposition is crucial. For any positive \upalpha∈ΓHaff, say \upalpha=sit∘…∘si1 we associate the functor
[TABLE]
Now there is an order ≥ defined on tilting modules (see e.g. [HW, §3]). By Lemma 4.7, this order decreases along reduced paths, and so exactly as in [HW, 4.6] (see Remark 4.10 below), we see that \Upphi\upalpha≅\Upphi\upbeta for any two reduced positive paths with the same start and end points. Hence the association \upalpha↦\Upphi\upalpha descends to a functor
from (\mathdsGaff)+. As \Upphi\upalpha is already invertible, this in turn formally descends to a functor from \mathdsGaff.
The same analysis holds for the finite situation \mathdsG. In both cases, for any \upalpha in the arrangement groupoid, we thus have an associated functor \Upphi\upalpha, and its image \upphi\upalpha on K-theory K, respectively \upvarphi\upalpha on \Uptheta.
Proposition 4.8**.**
Choose a reduced positive path \upbeta:CL→CM for Haff.
(1)
If \upalpha:CL→CM is any positive path in ΓHaff, then \upphi\upalpha=\upphi\upbeta.
2. (2)
If p∈End\mathdsGaff(CL), then \upphip=IdKL.
3. (3)
If p,q∈Hom\mathdsGaff(CL,CM), then \upphip=\upphiq.
The same statements hold for H, replacing \mathdsGaff by \mathdsG, and \upphi by \upvarphi.
Proof.
We will establish all statements over Z, as then all the statements over \mathdsk follow.
(1) By the discussion above the Proposition, we know that if \upalpha is furthermore reduced, then \Upphi\upalpha≅\Upphi\upbeta, and so in particular \upphi\upalpha=\upphi\upbeta holds. Hence we can assume that \upalpha is not reduced.
Consider the first time that \upalpha=sit∘…∘si1 crosses a hyperplane twice. So, say \upbeta:=sim−1∘…∘si1 is reduced, but sim∘…∘si1 is not. Pictorially
[TABLE]
By Lemma 4.6 we can find a positive reduced path \upgamma:C1→Cm such that the composition C1\upgammaCmsimCm−1 is reduced. As \upbeta and sim∘\upgamma are reduced paths with the same start and end points, functorially they are the same, so
[TABLE]
Passing to K-theory, using the fact that \upphiim\upphiim=Id by Lemma 3.7, we see
[TABLE]
Consider next the first time that sit∘…∘sim+1∘\upgamma crosses a hyperplane twice. Since \upgamma is reduced, we move further to the left. Applying the above argument repeatedly, by induction we end up in the case of a reduced path, and hence \upphi\upalpha=\upphi\upbeta.
(2) Say \upphip=\upphiin±1∘…∘\upphii1±1 for some choice of superscripts ±1. By Lemma 3.7, \upphip=\upphiq, where q:=sin∘…∘si1. This is a positive path, with start and end CL, so by part (1) it follows that \upphip=\upphiq=Id.
(3) This follows by applying (2) to q−1p∈End\mathdsGH(CL).
∎
Remark 4.9**.**
Proposition 4.8 also implies that Theorems 3.3 and 3.6, and also Propositions 3.8 and 3.11, can be indexed over reduced positive paths terminating at C+.
Remark 4.10**.**
Implicit in the above analysis is the fact, proved in [HW, 4.6] in the finite case and [IW2, 9.34] in the infinite case, that if \upalpha:L→M is a positive minimal path, then \Upphi\upalpha≅RHomΛL(HomR(L,M),−). Hence any two positive minimal paths give rise to isomorphic functors.
5. Stability Conditions, Tilting and t-structure Transfer
5.1. Generalities on stability conditions
We will not give a full summary of stability conditions here; see for example [B4] or the survey [B1]. For our purposes, the following suffices.
Throughout this subsection, T denotes a triangulated category for which the Grothendieck group K0(T) is a finitely generated free Z-module.
To specify a stability condition on T is equivalent to specifying a bounded t-structure on T with heart A, together with a stability function Z on A that satisfies the Harder-Narasimhan property.
As usual, in fact we will only study locally finite stability conditions, and we let StabT denote the set of locally finite stability conditions on T. There is a topology on StabT, induced by a natural metric.
The space StabT has the structure of a complex manifold, and the forgetful map
[TABLE]
is a local isomorphism onto an open subspace of HomZ(K0(T),C).
Remark 5.3**.**
In the components Stab∘C and Stab∘D we study in the flops setting below, all stability conditions will automatically be full, in the sense that they are always modelled on the whole of HomZ(K0(T),C). In particular, our stability conditions will automatically satisfy the support property, see e.g. [BM, Appendix B]. We will freely use this throughout.
An exact equivalence of triangulated categories Φ:T→T′ induces a natural map
[TABLE]
defined by Φ∗(Z,A):=(Z∘\upphi−1,Φ(A)), where as before \upphi−1 denotes the isomorphism on K-theory K0(T′)∼K0(T) induced by the functor Φ−1, and Φ(A) denotes its essential image. As usual, if two exact equivalences Φ:T→T′ and Ψ:T→T′ are naturally isomorphic, then Φ∗(Z,A)=Ψ∗(Z,A) for any (Z,A)∈StabT, and thus the group Auteq(T) of isomorphism classes of autoequivalences of T acts on StabT.
5.2. Stability, Normalisation and Mutations
We return to the setting where f:X→SpecR is the flopping contraction as in the introduction, with distinguished R-module N from (2.C), Λ:=EndR(N), and K-theory K and \Uptheta from Sections 3.2 and 3.3 respectively.
For any L=⨁i=0nLi∈Mut(N), with the ordering on summands induced from N as explained under Definition 2.2, let Si be the simple ΛL-module corresponding to the projective Pi=Hom(L,Li). Write BL for the subcategory of modΛL consisting of finite-length modules. If L∈Mut0(N), then we further write AL for the full subcategory of BL of those finite-length modules whose simple factors are not isomorphic to S0.
Consider the triangulated subcategories
[TABLE]
Since AL and BL are extension closed abelian subcategories of modΛL, the standard t-structure on Db(modΛL) restricts to a bounded t-structure on DL with heart BL, and a bounded t-structure on CL with heart AL.
The categories AL and BL have finitely many simple objects, and so
[TABLE]
There are canonical isomorphisms
[TABLE]
given by \upgamma↦∑\upgamma([Si])[Pi]. Composing these with the local homeomorphism in Theorem 5.2 defines local homeomorphisms
[TABLE]
Write StabAL for the stability functions on AL which satisfy the Harder–Narasimhan property, then by Proposition 5.1StabAL can be regarded as a subspace of StabCL. Similarly for StabBL, which is a subspace of StabDL. It follows from [B4, 5.2] that the above local homeomorphisms restrict to isomorphisms
[TABLE]
Applying all of the above to N∈Mut(N), it will be convenient to suppress N from the notation, so write D:=DN, B:=BN, Z:=ZN, etc.
There is a C-action on StabD, which later we will avoid. As such, following [B6], for any L=⨁i=0nLi∈Mut(N), consider StabnDL to be those stability conditions in StabDL for which the central charge Z satisfies
[TABLE]
We call such stability conditions normalised.
In particular
[TABLE]
where the complexified level is defined in §3.5. Set StabnBL:=StabBL∩StabnDL, then the latter isomorphism in (5.A) restricts to an isomorphism
[TABLE]
Proposition 5.4**.**
Let L∈Mut0(N), respectively L∈Mut(N). Then the following diagrams commute.
[TABLE]
The latter diagram restricts to a commutative diagram
[TABLE]
Proof.
To ease notation, set Qi:=HomR(L,Li) and write Si′ for the simple ΛL-module corresponding to the projective ΛL-module Qi. Similarly, write Pi=HomR(N,Ni), and Si for the corresponding simple Λ-module.
Consider the perfect pairing
[TABLE]
given by \upchi(a,b):=∑i∈Z(−1)idimCHom(a,b[i]).
Since the pairing is perfect, setting
[TABLE]
implies that [\UpphiL(Qi)]=∑j=1naij[Pj] in \Uptheta.
Furthermore, since \UpphiL−1 is right adjoint to \UpphiL,
[TABLE]
which in turn implies that [\UpphiL−1(Sj)]=∑i=1naij[Si′] in K0(C).
Therefore, for any point \upsigma=(Z,P)∈StabAL, necessarily
[TABLE]
The last diagram follows immediately, as mutation functors in K-theory take ∑(rkRLi)[Si] to ∑(rkRNi)[Si] and thus preserve the normalisation.
∎
5.3. Tilting at Simples via Mutation
By the above, AL⊂CL and BL⊂DL are the hearts of bounded t-structures, with finitely many simples. Each of these simple objects induces two torsion theories, (⟨Si⟩,Fi) and (Ti,⟨Si⟩), where ⟨Si⟩ is the full subcategory of objects whose simple factors are isomorphic to Si. In the case of AL, the subcategories Fi and Ti are defined by
[TABLE]
and the corresponding tilted hearts are defined by
[TABLE]
where Hi(−) is the cohomological functor associated to the standard t-structure on CL defining AL. A similar picture applies in the case of BL.
Lemma 5.5**.**
We have Li(A\upnuiN)=\Upphii(A) and Ri(A)=\Upphii−1(A\upnuiN) for all i=1,…,n. The same statements hold replacing A by B, for all i=0,1,…,n
Proof.
We will only show that Li(A\upnuiN)=\Upphii(A), since the other proof is similar. Since both categories are hearts of bounded t-structures, it suffices to show that \Upphii(A)⊆Li(A\upnuiN). For this, since A is finite length, it is enough to show that \Upphii(Sj)∈Li(A\upnuiN) for all 1≤j≤n.
If j=i, since \Upphii(Si)=Si[−1] by [W1, 4.15(2)], it follows that \Upphii(Si)∈Li(A\upnuiN). Hence we can assume that j=i. Then \Upphii(Sj)∈A\upnuiN by [HW, 4.4]. Hence \Upphii(Sj)≅H0(\Upphii(Sj)), and so \Upphii(Sj) is only in degree zero, and further
[TABLE]
Combining, it follows that \Upphii(Sj)∈Li(A\upnuiN).
∎
5.4. t-structure transfer
In moving to the mutation functors, which reveals many hidden t-structures, we lose control over Fourier–Mukai techniques. The following theorem is one of our main results, and is a crucial ingredient in the proof of Theorem 6.9 later.
Theorem 5.6**.**
Let L∈Mut(N), \upalpha∈Hom\mathdsGaff(CL,CL), and consider
[TABLE]
Then the following conditions are equivalent.
(1)
\Upphi\upalpha* maps the simples S0,…,Sn to simples.*
2. (2)
\Upphi\upalpha:DL→DL* restricts to an equivalence BL→BL.*
3. (3)
\Upphi\upalpha:Db(modΛL)→Db(modΛL)* restricts to an equivalence modΛL→modΛL.*
4. (4)
There is a functorial isomorphism \Upphi\upalpha≅Id.
If further L∈Mut0(N) and \upalpha∈Hom\mathdsG(CL,CL), the above are equivalent to
(5)
\Upphi\upalpha* maps the simples S1,…,Sn to simples.*
2. (6)
\Upphi\upalpha* restricts to an equivalence AL→AL.*
When the last additional conditions are satisfied, it is already known that (5)⇒(2) by [HW, 5.5]. Furthermore, it is clear that (1)⇔(2), (5)⇔(6) and (4)⇒(1)(5). Hence to prove Theorem 5.6 it suffices to show that (1)⇒(3) and (3)⇒(4).
Lemma 5.7**.**
Let Γ be a noetherian ring, and x∈Db(modΓ). Then the following hold.
(1)
x∈Db(modΓ)≤0⟺ExtΓi(x,S)=0* for all i<0 and all simple Γ-modules S.*
2. (2)
If a triangulated equivalence F:Db(modΓ)→Db(modΓ) satisfies F(Γ)≅Γ, then F restricts to an equivalence F:modΓ→modΓ.
Proof.
(1) The direction (⇒) is clear, by replacing x by its projective resolution P, and observing that
ExtΓi(x,S)=HomK−(modΓ)(P,S[i])=0 for all i<0, since there are no chain maps between the complexes P and S[i].
For (⇐), since x is bounded, let t be maximum such that Ht(x)=0. Since Γ is noetherian, every finitely generated module has a map to a simple, so there exists some simple S such that HomΓ(Ht(x),S)=0. But via the spectral sequence (see e.g. [H2, (2.8)])
[TABLE]
the nonzero E20,−t term survives to give a non-zero element of ExtΓ−t(x,S). Hence t≤0.
(2) Via the isomorphism Hn(x)≅HomDb(modΓ)(Γ,x[n]), it follows that F and its inverse take modules to modules, and so they restrict to a Morita equivalence.
∎
The following establishes (1)⇒(3). In fact, we prove a slightly more general version, as we will need this later.
Corollary 5.8**.**
Suppose that G:Db(modΛL)→Db(modΛL) is any equivalence that maps the simples S0,…,Sn to simples. Then G restricts to an equivalence modΛL→modΛL.
Proof.
To ease notation, set E=Db(modΛL). By Lemma 5.7(1) it follows that both G and its inverse restrict to an equivalence E≤0→E≤0.
Since E≥1 can be characterised as the perpendicular to E≤0, it follows that both G and its inverse restrict to an equivalence E≥1→E≥1. Since modΛL=E≤0∩E≥1[1], the result follows.
∎
The implication (3)⇒(4) is by far the most subtle. It requires the following two technical results, both of which rely heavily on the fact that R is isolated cDV.
Proposition 5.9**.**
In the setting of Theorem 5.6, if \Upphi\upalpha restricts to modΛL∼modΛL, then \Upphii−1∘\Upphi\upalpha∘\Upphii restricts to modΛ\upnuiL∼modΛ\upnuiL.
Proof.
Consider the functor G=\Upphii−1∘\Upphi\upalpha∘\Upphii. For each j=i, as in Lemma 3.2 we have \Upphii(Pj)≅Pj. Since \Upphi\upalpha restricts to an equivalence on modΛL, and is necessarily the identity on KL by Proposition 4.8, furthermore \Upphi\upalpha(Pj)≅Pj. In conclusion, whenever j=i we have G(Pj)≅Pj. In a similar vein, by [W1, 4.15(2)], \Upphii(Si)≅Si[−1]. The functor \Upphi\upalpha must send simples to simples, and since it is the identity on KL, by the pairing between projectives and simples it follows that \Upphi\upalpha(Si)≅Si. Thus G(Si)≅Si.
By the assumptions, since ΛL is basic, necessarily \Upphi\upalpha(ΛL)≅ΛL. Now consider T=HomR(\upnuiL,L) defining the functor \Upphii:Db(modΛ\upnuiL)→Db(modΛL). By construction G(T)≅\Upphii−1∘\Upphi\upalpha(ΛL)≅\Upphii−1(ΛL)≅T. Since T=Ti⊕⨁j=iPj, by the above paragraph necessarily G(Ti)≅Ti.
Now by e.g. [W1, A.2(2)] the exchange sequences give rise to an exact sequence of Λ\upnuiL-modules
[TABLE]
with Cokb≅Ti, where ei is the idempotent corresponding to the ith summand of Λ\upnuiL, and (1−ei) is the two-sided ideal generated by 1−ei. Since R is isolated, necessarily Λ\upnuiL/(1−ei) has finite length, and is filtered only by the simple Si. Splicing gives triangles
[TABLE]
Applying G to each, the first triangle shows that Ht(G(Pi))=0 unless t=0,1. On the other hand, the second triangle shows that Ht(G(Ki))=0 unless t=−1,0. But G must take Λ\upnuiL/(1−ei) to degree zero, since G(Si)≅Si and Λ\upnuiL/(1−ei) is filtered by Si. Hence the last triangle implies that Ht(G(Pi))=0 unless t=−1,0.
Combining, we see that Ht(G(Pi))=0 unless t=0, thus G(Pi) is a module. Applying G to the first triangle give a triangle
[TABLE]
in which all terms are modules, so this is necessarily induced by a short exact sequence. Hence by the depth lemma, G(Pi) has depth 3. On the other hand, since Pi is perfect as a complex, so is G(Pi), thus G(Pi) has finite projective dimension as a Λ\upnuiL-module. By Auslander–Buchsbaum [IW1, 2.16], it follows that G(Pi) is projective. Since G is the identity on K\upnuiL, necessarily G(Pi)≅Pi and hence G(Λ\upnuiL)≅Λ\upnuiL. By Lemma 5.7(2), G=\Upphii−1∘\Upphi\upalpha∘\Upphii restricts to an equivalence modΛ\upnuiL→modΛ\upnuiL.
∎
Proposition 5.10**.**
Suppose that G:Db(modΛ)→Db(modΛ) is an R-linear equivalence such that G(S0)≅S0, and suppose that there exists a permutation \upiota∈Sn such that G(Si)≅S\upiota(i) and rkRNi≅rkRN\upiota(i) for all i=1,…,n. Then functorially G≅Id.
Proof.
By Corollary 5.8, G maps projectives to projectives. Since G(S0)≅S0, by the pairing between simples and projectives, necessarily G(P0)≅P0. Consider the R-linear composition F given by
[TABLE]
By [K1, 5.2.4] the functor RHomX(VX,−) maps skyscrapers of closed points to modules of dimension vector rkN=(rkRNi)i=0n which satisfy the ⋆-generated condition, which by definition consists of those Λ-modules A of dimension vector rkN such that HomΛ(A,Si)=0 for all i=1,…,n [SY, 6.11]. For any such A, by the assumptions on where G takes each simple, GA has dimension vector (rkRN\upiota(i))i=0n, which by the last assumption is precisely rkN. Furthermore, for any such A, since G fixes S0 and permutes the other simples, GA is also ⋆-generated. Hence again appealing to [K1, 5.2.4] the functor −⊗ΛLVX takes the module GA to a skyscraper. Combining, we see that skyscrapers of closed points get sent to skyscrapers of closed points, under the above R-linear composition F.
It follows from general Fourier–Mukai theory [BM2, §3.3] that F≅φ∗∘(−⊗L) where φ:X→X is an automorphism and L is some line bundle. Since RHomX(VX,−) sends OX to P0, and G sends P0 to P0, it follows that F sends OX to OX, which in turn implies that L is trivial. Lastly, since F≅φ∗ is R-linear, by Proposition 2.4φ commutes with the map to the base. In particular, the restriction of φ to the dense open subset U=X\C is the identity. Hence φ=IdX, and as a result, F≅Id. From this, it follows that G≅Id.
∎
Finally, we prove (3)⇒(4), completing the proof of Theorem 5.6. The key is that Proposition 5.9 allows us to pull everything back to Db(modΛ), where we can use the geometric Fourier–Mukai techniques of Proposition 5.10.
Corollary 5.11**.**
In the setting of Theorem 5.6, if \Upphi\upalpha restricts to modΛL∼modΛL, then there is a functorial isomorphism \Upphi\upalpha≅Id.
Proof.
Choose a positive path \upgamma:C+→CL, and consider the composition
[TABLE]
Since \upgamma is a composition sit∘…∘si1, we may rewrite the above as
[TABLE]
By induction, using Proposition 5.9 repeatedly, we see that G restricts to an equivalence on modΛ. Since Morita equivalences preserve projectives, and G is the identity on K-theory K=KN by Proposition 4.8, G maps each projective to itself. Since Morita equivalences also preserve simples, by the pairing between projectives and simples, G maps each simple to itself. By Proposition 5.10G≅Id and hence
\Upphi\upalpha≅Id.
∎
6. Stability Conditions on C and D
Consider Stab∘C, the connected component of StabC containing StabA, and similarly Stabn∘D, the connected component of StabnD containing StabnB. In this section we describe both Stab∘C and Stabn∘D as regular covers of the hyperplane arrangements in Section 3.
6.1. Chamber Decomposition
For the fixed R-module N from (2.C), consider the set of morphisms in \mathdsG which terminate at C+, namely
[TABLE]
The set Term(C+) is defined similarly, taking the union instead over L∈Mut(N) and replacing \mathdsG by \mathdsGaff.
Notation 6.1**.**
For L∈Mut0(N), respectively L∈Mut(N), consider the open subsets
[TABLE]
of Stab∘CL, Stab∘DL and Stabn∘DL respectively. For \upalpha∈Term0(C+), \upbeta∈Term(C+), set
[TABLE]
where s(\upalpha) and s(\upbeta) denote the modules corresponding to the chambers which are the sources of \upalpha and \upbeta respectively. Similarly,
[TABLE]
As usual, write U=UN, U=UN and \mathdsN=\mathdsNN.
Lemma 6.2**.**
Given \upalpha,\upbeta∈Term0(C+), respectively \upalpha,\upbeta∈Term(C+), write Ms(\upalpha) and Ms(\upbeta) for the modules corresponding to the chambers which are the sources of \upalpha and \upbeta respectively. Then
(1)
U\upalpha∩U\upbeta=∅* ⟺Ms(\upalpha)≅Ms(\upbeta) and \Upphi\upalpha≅\Upphi\upbeta.*
2. (2)
U\upalpha∩U\upbeta=∅* ⟺Ms(\upalpha)≅Ms(\upbeta) and \Upphi\upalpha≅\Upphi\upbeta⟺\mathdsN\upalpha∩\mathdsN\upbeta=∅.*
Proof.
(1) It suffices to show that, for \upgamma∈Term0(C+), U∩U\upgamma=∅ if and only if Ms(\upgamma)≅N and \Upphi\upgamma≅idC. The implication (⇐) is obvious, since the isomorphisms Ms(\upgamma)≅N and \Upphi\upgamma≅idC implies that U=U\upgamma.
Conversely, suppose that U∩U\upgamma=∅, and write Y:StabC→\UpthetaR for the composition
[TABLE]
where the last map is the projection defined by taking the imaginary parts. By definition Y(U)=C+ and Y(U\upgamma)=\upvarphiMs(\upgamma)(C+).
Since U∩U\upgamma=∅, necessarily Y(U)∩Y(U\upgamma)=∅, thus Ms(\upgamma)≅N by Theorem 3.6, and \Upphi\upgamma is an autoequivalence of C.
It is clear that U∩U\upgamma=∅ implies that \Upphi\upgamma:C→C maps A to A. By Theorem 5.6, this implies that
\Upphi\upgamma≅Id.
(2) The proof of the first ⟺ is identical, appealing to Theorem 3.3 instead of Theorem 3.6 to deduce that \Upphi\upgamma maps B to B. Theorem 5.6 again implies that
\Upphi\upgamma≅Id. The second ⟺ follows immediately from the first.
∎
Lemma 6.3**.**
For \upalpha,\upbeta∈Term0(C+) with l(\upalpha)>l(\upbeta), the chambers StabA\upalpha and StabA\upbeta share a codimension one boundary if and only if there exists a length one path \upgamma∈Mor(\mathdsG+) such that \upalpha=\upbeta∘\upgamma or \upalpha=\upbeta∘\upgamma−1 in Mor(\mathdsG). A similar statement holds replacing A by B, Term0(C+) by Term(C+) and \mathdsG by \mathdsGaff respectively.
Proof.
It is enough to prove that, for \upgamma∈Term0(C+), U and U\upgamma share a codimension one boundary if and only if there is a length one path \updelta such that \upgamma=\updelta or \upgamma=\updelta−1. This follows from [B5, 5.5] and Lemma 5.5.
∎
With notation as above, the following statements hold.
(1)
There is a disjoint union of open chambers
[TABLE]
Furthermore, M=⋃U\upalpha=Stab∘C, where U\upalpha is the closure of U\upalpha in Stab∘C.
2. (2)
There is a disjoint union of open chambers
[TABLE]
Furthermore, N=⋃U\upbeta=Stab∘D.
In particular, as Stab∘D∩StabnD=Stabn∘D, there is a disjoint union of open chambers
[TABLE]
such that Nn=⋃\mathdsN\upbeta=Stabn∘D.
Proof.
(1) By Lemma 6.2, M is a disjoint union, and by Lemma 6.3M is connected. Since M contains U and thus StabA,
there is an inclusion M⊆Stab∘C.
Let \upsigma∈Stab∘C be a point, and choose a point \upsigma0∈U and a path
[TABLE]
such that p(0)=\upsigma0 and p(1)=\upsigma. Since Z:Stab∘C→\UpthetaC is a local homeomorphism, by deforming p if necessary, we may assume that the path Z∘p:[0,1]→\UpthetaC passes through only finitely many codimension one boundaries of chambers \upvarphiL(H+). Thus there exists a sequence 0<t1<t2<…<tℓ−1<tℓ:=1 of real numbers such that:
(a)
for all i=ℓ, every Z(p(ti)) is in a codimension one boundary of some chamber,
2. (b)
for all i, each open interval Z(p(ti,ti+1)) is contained in the interior of some chamber.
Since p((0,t1))⊂U, by Lemma 6.3 there is a length one path \upgamma∈Term0(C+) such that p(t1,t2) is in U\upgamma. By iterating this argument, we see that p((tl−1,1)) is in some open chamber U\upalpha, and hence its end point, \upsigma, belongs to U\upalpha.
(2) This follows using an identical argument to (1).
For the last statements, we first prove that Stab∘D∩StabnD=Stabn∘D. Let \upsigma∈Stabn∘D. Since Stabn∘D is a connected and locally Euclidian space, it is path connected. Hence there is a path from \upsigma to a point \upsigma0∈StabnB⊂Stab∘D. Thus \upsigma also lies in Stab∘D, proving Stabn∘D⊆Stab∘D∩StabnD.
For the opposite inclusion, it is enough to show that Stab∘D∩StabnD is connected, since Stab∘D∩StabnD contains StabnB. But by (2),
[TABLE]
Since \mathdsN\upbeta is the closure of \mathdsN\upbeta in StabnD, we have \mathdsN\upbeta=U\upbeta∩StabnD, and by Lemma 3.10 and Proposition 5.4, all \mathdsN\upbeta are path connected.
Thus again by Proposition 5.4, it suffices to show that \mathdsN∩\mathdsN\upgamma=U∩U\upgamma∩StabnD=∅ for any length one path \upgamma. If \upgamma=si, then consider the point \upsigma=(Z,B)∈StabB defined by Z[Si]=−1/\uplambdai, and Z[Sj]=(1+i)/n\uplambdaj for all j=i, where \uplambdak:=rkRNk. Then \upsigma lies in StabnB⊂U∩StabnD and in the codimension one boundary of StabLi(B) by [B5, Lemma 5.5]. But since StabLi(B)=(\Upphii)∗(StabB\upnuiN)=StabB\upgamma by Lemma 5.5, \upsigma∈StabB\upgamma=U\upgamma. This implies that U∩U\upgamma∩StabnD=∅. Similarly, we see that U∩U\upgamma∩StabnD=∅ when \upgamma=si−1.
Hence Stab∘D∩StabnD is connected, and thus Stab∘D∩StabnD=Stabn∘D follows.
The remaining statements are then immediate from (2).
∎
6.2. Regular Covering Structure
Lemma 6.5**.**
If L∈Mut0(N), respectively L∈Mut(N), then the following statements hold.
(1)
If a point \upsigma=(Z,A)∈Stab∘CL is in U\upalpha for some \upalpha∈End\mathdsG(C+), then ZL(\upsigma) is not on any complexified coordinate axis in (\UpthetaL)C.
2. (2)
If a point \upsigma=(Z,B)∈Stab∘DL is in U\upbeta for some \upbeta∈End\mathdsGaff(C+), then ZL(\upsigma) is not on any complexified coordinate axis in (KL)C.
Proof.
(1) First, for any \uprho∈U1=U, every simple module Si∈AL is \uprho-semistable. Hence, by [BS, 7.6], Si is \uprho-semistable for all \uprho∈U1, and in particular Z[Si]=0 for all (Z,A)∈U1.
Now, for \upsigma∈U\upalpha, by Proposition 5.4 and Proposition 4.8(2), ZL(\upsigma)=ZL((\Upphi\upalpha)∗−1(\upsigma)), and by definition (\Upphi\upalpha)∗−1(\upsigma)∈U1. Hence, by the first paragraph, ZL(\upsigma) is not on any complexified coordinate axis.
(2) is identical to (1).
∎
Lemma 6.6**.**
With notation as above, the following statements hold.
(1)
The map Z:Stab∘C→\UpthetaC restricts to a surjective map
[TABLE]
2. (2)
The map Z:Stabn∘D→LevelC restricts to a surjective map
[TABLE]
Proof.
(1) First, we show that Im(Z)⊆\UpthetaC\HC. By Theorem 6.4 and Proposition 5.4, it is enough to show that Z(\upsigma)=x+iy∈\UpthetaC\HC for each point \upsigma=(Z,A)∈U in the closure of U. Assume that Z(\upsigma)∈HC for some H∈H.
Let I:={1≤i≤n∣yi=0} and B:={\upvartheta∈\UpthetaR∣\upvarthetaj=0\mboxforallj∈I}. If I=∅, then the point \upsigma necessarily lies in U, and so Z(\upsigma)∈H+⊂\Uptheta\HC. Hence we may assume I=∅. Since by Lemma A.2(1) the hyperplane H has the form \uplambda1\upvarthetai1+…+\uplambdas\upvarthetais=0 for some \uplambda1,…,\uplambdas>0, the fact that yj>0 if j∈/I implies i1,…,is∈I. Since B⊆H, by Lemma A.8 there exist k∈I and a minimal mutation sequence
[TABLE]
such that H=\upvarphi\upalpha(Hk), where Hk={\upvarthetak=0}⊂(\UpthetaL)R is the kth coordinate axis in (\UpthetaL)R.
If we set \upsigma′:=(\Upphi\upalpha−1)∗(\upsigma)∈Stab∘CL, then ZL(\upsigma′)∈(Hk)C. Since y∈C+ and \upalpha∈MutToI(N), we see that \upvarphi\upalpha−1(y)=y by the rule (3.B), and so Im(ZL(\upsigma′))∈C+. But this implies that \upsigma′∈U\upbeta⊂Stab∘CL for some \upbeta∈End\mathdsG(C+), which is a contradiction by Lemma 6.5(1). Hence Im(Z)⊆\UpthetaC\HC.
Next, we show the map Z:Stab∘C→\UpthetaC\HC is surjective. Pick z∈\UpthetaC\HC, then by Proposition 3.8 there exists some L∈Mut0(N) such that \upvarphiL(h)=z for some h∈H+. The left hand side of the commutative diagram in Proposition 5.4 shows that we can find \upsigma∈StabAL such that ZL(\upsigma)=h. The commutativity then shows that \upsigma′:=(\UpphiL)∗(\upsigma)∈StabC maps, via Z, to z. Since \upsigma′∈Stab∘C by Theorem 6.4, it follows that Z is surjective.
(2) By Theorem 6.4 and Proposition 5.4, for Im(Z)⊆LevelC\HCaff, it suffices to prove that Z(\upsigma)=x+iy∈LevelC\HCaff for any \upsigma=(Z′,B)∈\mathdsN=U∩StabnD. To see this, let I′:={0≤i≤n∣yi=0}, and note that I′⊊{0,…,n} since x+yi∈LevelC. If Z(\upsigma)∈HCaff, then by a similar argument to (1), now using Lemma A.2(2) and Lemma A.8 (with I′), there exists a minimal mutation sequence \upalpha:L→N∈MutToJ′(N) such that \upsigma′:=(\Upphi\upalpha−1)∗(\upsigma) lies in U\upbeta for some \upbeta∈End\mathdsGaff(C+) and ZL(\upsigma′)∈(Hk)C∩(LevelL)C for some coordinate axis Hk in (KL)R. This contradicts Lemma 6.5(2), and thus Im(Z)⊆LevelC\HCaff. The surjectivity of the map follows by a similar argument to (1), using Proposition 3.11, Proposition 5.4 and Theorem 6.4.
∎
Notation 6.7**.**
Consider the subgroups of AuteqC and AuteqD defined by
[TABLE]
Theorem 6.8**.**
With notation as above, the following statements hold.
(1)
The surjective map Z:Stab∘C→\UpthetaC\HC induces a homeomorphism
[TABLE]
2. (2)
The surjective map Z:Stabn∘D→LevelC\HCaff induces a homeomorphism
[TABLE]
Proof.
We only prove (2), since the proof of (1) is identical. Let \upsigma∈Stabn∘D and Φ∈PBrD. Then Z(Φ∗(\upsigma))=Z(\upsigma) by Proposition 4.8(2) and Proposition 5.4, and so Z induces a map Stabn∘D/PBrD→LevelC\HCaff which is surjective by Lemma 6.6.
We show that this induced map is injective.
Let \upsigma,\upsigma′∈Stabn∘D be two points such that x:=Z(\upsigma)=Z(\upsigma′). By Theorem 6.4, \upsigma∈\mathdsN\upbeta and \upsigma′∈\mathdsN\upbeta′ for some paths \upbeta,\upbeta′∈Term(C+). But by Proposition 3.11, there is a unique L∈Mut(N) such that x∈\upphiL(E+), and so by Proposition 5.4 we see that \upbeta,\upbeta′∈Hom\mathdsGaff(CL,C+). Set \upgamma:=\upbeta′∘\upbeta−1∈End\mathdsGaff(C+), then by definition (\Upphi\upgamma)∗(\mathdsN\upbeta)=\mathdsN\upbeta′.
Since the surjective map Z is a local homeomorphism, there exists an open neighbourhood U of \upsigma such that the restrictions Z∣U and Z∣(\Upphi\upgamma)∗(U) are homeomorphisms. Choose a sequence {\upsigmai}i=1∞⊂\mathdsN\upbeta∩U that converges to \upsigma, and set
\upsigmai′:=(\Upphi\upgamma)∗(\upsigmai)∈\mathdsN\upbeta′∩(\Upphi\upgamma)∗(U). Then again by Proposition 4.8(2) and Proposition 5.4, we have xi:=Z(\upsigmai)=Z(\upsigmai′). The sequence {xi}i=1∞ converges to x since Z∣U is a homeomorphism. Moreover, since Z∣(\Upphi\upbeta)∗(U) is also a homeomorphism, the sequence {\upsigmai′}i=1∞ converges to \upsigma′. Hence
[TABLE]
This implies that \upsigma=\upsigma′ in Stabn∘D/PBrD.
∎
Given a group G acting on a topological space T, consider the following condition.
(∗)
For each x∈T, there is an open neighbourhood U of x such that U∩gU=∅ for all 1=g∈G.
Theorem 6.9**.**
With notation as above, the following statements hold.
(1)
Z:Stab∘C→\UpthetaC\HC* is a regular covering map, with Galois group PBrC.*
2. (2)
Z:Stabn∘D→LevelC\HCaff* is a regular covering map, with Galois group PBrD.*
(2) We first show that the action of PBrD on Stabn∘D satisfies the condition (∗). For this, take a point \upsigma∈Stabn∘D and consider the open neighbourhood \upsigma∈U defined by
[TABLE]
where d(−,−) is the metric introduced in [B4, §6].
Assume that U∩(\Upphi\upbeta)∗(U)=∅ for some \Upphi\upbeta∈PBrD. Then, every point \upsigma′∈U must satisfy d\bigl{(}\upsigma^{\prime},(\Upphi_{\upbeta})_{*}(\upsigma^{\prime})\bigr{)}<1. Furthermore, the central charges of \upsigma′ and (\Upphi\upbeta)∗(\upsigma′) are equal by Proposition 4.8(2) and Proposition 5.4.
Therefore, it follows that \upsigma′=(\Upphi\upbeta)∗(\upsigma′) by [B4, 6.4], for every \upsigma′∈U.
By Theorem 6.4, there is some \mathdsN\upgamma such that \mathdsN\upgamma∩U=∅, so choose \uptau∈\mathdsN\upgamma∩U. Then since \uptau∈\mathdsN\upgamma, the heart of \uptau is (\Upphi\upgamma)∗(Bs(\upgamma)). But on the other hand, since \uptau∈U, by the previous paragraph \uptau=(\Upphi\upbeta)∗(\uptau). Thus the composition
[TABLE]
restricts to an equivalence on Bs(\upgamma). This implies \Upphi\upgamma−1∘\Upphi\upbeta∘\Upphi\upgamma≅Id by Theorem 5.6 applied to \upgamma−1\upbeta\upgamma. Thus \Upphi\upbeta≅Id, and so the action satisfies the condition (∗).
Since Stabn∘D is path connected, as is standard [H1, 1.40(a)(b)] it follows that
PBrD is the group of deck transformations for the regular cover
[TABLE]
Hence by Theorem 6.8, the map Z:Stabn∘D→LevelC\HCaff is a regular covering map, with Galois group PBrD. This completes the proof of (2).
(1) This follows using an identical argument to the above.
For the final statement, since Stab∘C is a manifold, it is locally path connected. Hence as is standard (see e.g. [H1, 1.40(c)]) the cover is universal if and only if the natural map
[TABLE]
is injective. But this is [HW], which works word-for-word in the more general terminal singularities setting here, as explained in [IW2, §10.3].
∎
Corollary 6.10**.**
Stab∘C* is contractible.*
Proof.
The universal cover of the complexified complement simplicial hyperplane arrangement is contractible, due to Deligne’s work on the K(\uppi,1) conjecture [D1].
∎
7. Autoequivalence and SKMS Corollaries
The above description of stability conditions has consequences for autoequivalences, which in turn allows us to compute the SKMS.
7.1. Autoequivalences of C
Consider the subgroup Aut∘C of AuteqC, consisting of those \Upphi∣C where \Upphi is a Fourier–Mukai equivalence Db(cohX)→Db(cohX) that commutes with Rf∗ and preserves Stab∘C. Since \Upphi commutes with Rf∗, automatically \Upphi∣C:C→C.
Theorem 7.1**.**
Suppose that X→SpecR is a 3-fold flop, where X has at worst terminal singularities. Then Aut∘C=PBrC.
Proof.
The inclusion PBrC⊂Aut∘C follows since the Bridgeland–Chen flop functors are Fourier–Mukai equivalences that commute with Rf∗, and PBrC acts on Stab∘C by Theorem 6.9.
For the reverse inclusion, consider g∈Aut∘C. Since g:Db(cohX)→Db(cohX) commutes with Rf∗, passing through \Uppsi:=RHomX(V,−) to obtain \Uppsi∘g∘\Uppsi−1:Db(modΛ)→Db(modΛ), necessarily by [W1, 2.14] \Uppsi∘g∘\Uppsi−1 commutes with the exact functor e(−), where e is the idempotent of Λ corresponding to R.
Since g preserves Stab∘C, V:=\Uppsi∘g∘\Uppsi−1(U1) is open and by Theorem 6.4M is dense in Stab∘C, necessarily V∩M=∅. Thus we must have \Uppsi∘g∘\Uppsi−1(A)=A\upalpha for some \upalpha∈Hom\mathdsG(CB,C+). Consider the composition
[TABLE]
which takes A to the standard heart on CB. Now \Upphi\upalpha−1=\Upphi\upalpha−1 is a composition of mutation functors and their inverses, where we do not mutate the vertex R. By [W1, 4.2] these are functorially isomorphic to flop functors and their inverses, which commute with Rf∗. Again by [W1, 2.14], this translates into \Upphi\upalpha−1 commuting with e(−). Consequently the composition G commutes with e(−).
Since G takes A to a standard algebraic heart, necessarily G takes the simples S1,…,Sn to simples, a priori with a permutation. Hence (1) \Uppsi−1∘G∘\Uppsi commutes with Rf∗, and (2) it sends OC1(−1),…,OCn(−1) to themselves, a priori up to permutation. But exactly as in [DW, 7.17], property (1) implies that \Uppsi−1∘G∘\Uppsi preserves C, and property (2) implies that \Uppsi−1∘G∘\Uppsi preserves the null category {a∈cohX∣Rf∗a=0}. This implies that it necessarily preserves C>0 and C<0, and hence preserves zero perverse sheaves 0PerX. In particular, G(S0)≅S0, as the other simples are permuted.
But since \Uppsi−1∘G∘\Uppsi preserves 0PerX, G restricts to a Morita equivalence modΛ→modΛB. In particular projectives map to projectives, so since G(S0)≅S0, under the pairing we have G(P0)≅P0. Furthermore, since Λ and ΛB are basic, the Morita equivalence sends Λ↦ΛB. Since G commutes with e(−), it follows that N≅B in Db(modR), and so \Upphi\upalpha∈PBrC.
But now \Uppsi−1∘G∘\Uppsi sends OX↦OX, since G(P0)≅P0, and it preserves 0PerX. By the standard Toda argument (see e.g. [DW, 7.18]), \Uppsi−1∘G∘\Uppsi≅φ∗∘(−⊗L) for some isomorphism φ:X→X and some line bundle L. The line bundle L is trivial since OX↦OX. The isomorphism φ commutes with Rf∗ since \Uppsi−1∘G∘\Uppsi does, and hence φ is the identity, given it must be the identity on the dense open set obtained by removing the flopping curve. It follows that G≅Id, and so g=\Uppsi−1∘\Upphi\upalpha∘\Uppsi∈PBrC, as required.
∎
7.2. Identifying Line Bundle Twists
To describe Aut∘D requires us to first realise twists by line bundles as compositions of mutation functors. Set Li:=f∗Li and consider the subgroup Zn≅⟨L1,…,Ln⟩≤Cl(R). For any L in this subgroup and any M∈Mut(N), L⋅M:=(L⊗M)∗∗ belongs to the mutation class of N, in the following predictable way.
Lemma 7.2**.**
[IW2, 9.10(2)(3)]**
The arrangement Haff has a Zn-action, where its generators take the chamber corresponding to N to the next chamber along the primitive vectors of the Zn-lattice given by the chamber N.
To illustrate this, consider the two-curve example in Figure 2. Then the Z2-lattice is the black dots, and the primitive vectors of the Z2-lattice given by the chamber N are the red arrows.
For any such L and M∈Mut(N), consider the isomorphism \upvarepsilon:ΛM→ΛL⋅M defined to be
[TABLE]
Being an isomorphism of algebras, \upvarepsilon induces an isomorphism of categories Db(modΛM)→Db(modΛL⋅M), which we will also denote by \upvarepsilon.
For L∈⟨L1,…,Ln⟩ and a path \upalpha∈Hom\mathdsGaff(CM1,CM2), the translation by L defines a path from CL⋅M1 to CL⋅M2, which we denote by L⋅\upalpha.
Lemma 7.3**.**
Let g,h∈⟨L1,…,Ln⟩, M∈Mut(N), and \upalpha:CM→Cg⋅M be a positive minimal path. Then the following diagram commutes.
[TABLE]
Proof.
By Remark 4.10 the top functor composed with the right hand functor is given by the tilting bimodule HomR(M,g⋅M), with the natural action of ΛM, and the action of Λh⋅g⋅M twisted by the isomorphism \upvarepsilon. Applying h⋅, this is clearly isomorphic, as bimodules, to HomR(h⋅M,h⋅g⋅M), with the action of ΛM twisted by \upvarepsilon, and the natural action of Λh⋅g⋅M. But this is the bimodule that realises the left hand functor composed with the bottom functor, and so the diagram commutes.
∎
Theorem 7.4**.**
Suppose that X→SpecR a 3-fold flop, where X has at worst terminal singularities. Writing \upkappa for a minimal chain of mutation functors from one algebra to the other, for all i=1,…,n the following diagram commutes
[TABLE]
Proof.
By Remark 4.10 the minimal chain of mutations \upkappa is functorially isomorphic to the RHom functor given by the tilting bimodule HomR(N,Li⋅N). So, setting V=VX and taking inverses, it suffices to prove that the diagram
[TABLE]
commutes, where derived tensors are over the relevant endomorphism ring.
The bottom composition is isomorphic to the functor
[TABLE]
by which we mean the Λ≅EndY(V)-action on HomX(V,V⊗Li) on the left is the composition action via \upvarepsilon, and the Λ-action on the right is the standard composition action. Hence the composition from bottom right to top left, along first the bottom and then the left, is functorially isomorphic to
[TABLE]
We first claim that this bimodule has cohomology only in degree zero, and for this we can ignore the left action of Λ completely, and consider HomX(V,V⊗Li)Id⊗ΛLV. Since Li is generated by global sections, there exists a surjection ON↠Li, for some N, and so tensoring by V gives a surjection VN↠V⊗Li. Applying HomX(V,−) gives an exact sequence
[TABLE]
where Ext2 is zero since flopping contractions have fibre dimension one. Since V is tilting, ExtX1(V,V)=0, thus ExtX1(V,V⊗Li)=0. It follows that
[TABLE]
which has degree zero, as claimed.
By the claim, after truncating in the category of bimodules, (7.B) is functorially isomorphic to −⊗ΛL(\upvarepsilonHomX(V,V⊗Li)Id⊗ΛV). Thus (7.A) commutes provided that
[TABLE]
as Λ-OX-bimodules. But the derived counit map is an isomorphism, so by (7.C) it follows that the non-derived counit map
[TABLE]
is also an isomorphism. But this map is the obvious one. By inspection it respects the bimodule structure in (7.D), and thus it gives the required bimodule isomorphism.
∎
Remark 7.5**.**
The position of \upvarepsilon at the end of the chain of mutations \upkappa in Theorem 7.4 is irrelevant. Indeed, given any minimal chain from N and Li⋅N, consider any chamber A through which this minimal path passes. Abusing notation and writing \upvarepsilon for any isomorphism induced by the class group action, and \upkappa for a minimal composition of mutation functors, the following top diagram also commutes
[TABLE]
since the outer diagram commutes by Theorem 7.4, and the commutativity of the bottom diagram is Lemma 7.3. Hence, when composing line bundle twists, we can move all the \upvarepsilon−1s to the right, or to the left, whichever is the most convenient.
7.3. PicX action
Recall that perfect complexes on X are equivalent to Kb(projΛ), and PicX≅Zn with basis L1,…,Ln, where Li is the line bundle satisfying deg(Li∣Cj)=δij. For L∈PicX, by abuse of notation, set
[TABLE]
Lemma 7.6**.**
Write z=(zj)j=0n∈LevelC with zj=xj+iyj. Then for j>0, and any 1≤i≤n, the autoequivalence −⊗Li acts on LevelC by
[TABLE]
Proof.
To ease notation, consider only the action of L1, since all other cases are identical. We first consider the action on the dual vector space K0(D) of K, with basis [S0],…,[Sn]. Recall that \Uppsi(\upomegaC[1])≅S0 and \Uppsi(OCi(−1))≅Si for 1≤i≤n.
Since deg(Lj∣Ci)=δij,
[TABLE]
Let Ox be the skyscraper sheaf associated to a closed point x∈C. Then RHom(Vi∗,Ox)≅Hom(Vi∗,Ox)=CrkNi, so setting ℓi:=rkRNi gives
[TABLE]
If x∈Ci, then the exact sequence 0→OCi(−1)→OCi→Ox→0 implies that
[OCi]=[OCi(−1)]+[Ox]. Combining this with (7.E), it follow that
[TABLE]
and so
[TABLE]
Next we determine the action of L1 on [\upomegaC[1]]=−[\upomegaC]. Since Ox⊗L1≅Ox, we have
[TABLE]
Substituting (7.E) to the left hand side and (7.F) to the third term of the right hand side,
[TABLE]
Combining (7.G) and (7.H), the action of L1 on K0(D) is given by the (n+1)×(n+1) matrix whose first row is (1−ℓ1,1,0,…,0), whose second row is (−ℓ12,ℓ1+1,0,…,0), and (−ℓ1ℓj,ℓj,0,…,1,…,0) is the jth row for any j>1, where 1 is in the (j+1)st entry.
The transpose of this matrix gives the required action on the dual K. But for j>0, the transpose has (j+1)st row (0,…,1,…,0) where the only non-zero entry is in the (j+1)st position, and the first row of the transpose matrix is (1,ℓ1+1,ℓ2,…,ℓn). Since z∈LevelC, by definition x0=−∑i=1nℓixi and y0=1−∑i=1nℓiyi. Using this, together with the rows identified, it is easy to check that the action is as stated.
∎
It will be convenient to visualise this in the case of an irreducible flopping contraction. Recall from Example 3.9 that (z0,z1)∈LevelC is determined by (x1,y1), and that by Lemma 7.6, the autoequivalence −⊗O(1) acts by sending (x1,y1)↦(x1,y1+1). As in Example 3.9, we draw the y1 axis horizontally pointing to the left, and the x1 axis vertically. Thus, with this convention, tensoring by O(1) translates to the left. The case ℓ=3 is illustrated below.
[TABLE]
7.4. Autoequivalences of D
As in the introduction, consider Aut∘D, defined to be the subgroup of AuteqD consisting of those \Upphi∣D:D→D where \Upphi is an R-linear Fourier–Mukai equivalence \Upphi:Db(cohX)→Db(cohX) that preserves Stabn∘D.
In order to control elements in Aut∘D, we first control isomorphisms of algebras that preserves the space of normalised stability conditions. Suppose that ΛL and ΛM arise from L=⨁i=0nLi and M=⨁i=0nMi in Mut(N), and
[TABLE]
is an isomorphism of rings. Let Si be the simple ΛL-module corresponding to the projective module HomR(L,Li). Being an isomorphism, simples get sent to simples, and so there is a bijection \upiota:{0,…,n}→{0,…,n} such that \uprho∗Si≅S\upiota(i)′, where Sj′ is the simple ΛM-module corresponding to the summand Mj.
Lemma 7.7**.**
\uprho∗* preserves Stabn∘D if and only if rkRLi=rkRM\upiota(i) for all 0≤i≤n.*
Proof.
(⇐) It suffices to show that \uprho∗(Z,BΛL)=(Z∘\uprho−1,BΛM)∈Stabn∘DΛM for all (Z,BΛL)∈Stabn∘DΛL. It is clear that \uprho∗ preserves the stability component, since Z∘\uprho−1[S\upiota(i)′]=Z[Si]∈H for each 0≤i≤n,
and, furthermore, \uprho∗ preserves the normalisation since
[TABLE]
(⇒)
To ease notation, set ai:=rkRLi, bj=rkRMj. Furthermore, for each i∈{0,…,n} consider Zi:K0(D)→C defined by
[TABLE]
where a:=∑i=0nai. Now each Zi([Sj]) belongs to H, and ∑i=0najZi([Sj])=i, hence (Zi,BΛL)∈Stabn∘DΛL. Since \uprho∗ preserves normalised stability conditions by assumption,
[TABLE]
Considering the imaginary parts of both sides, we see that
ai=b\upiota(i).
∎
Our next main result, Theorem 7.10, requires two technical lemmas.
Lemma 7.8**.**
For any g∈⟨L1,…,Ln⟩, consider the isomorphism \upvarepsilon:Λ→Λg⋅N. Then there is an isomorphism \upvarepsilon≅\Upphi\upgamma∘(−⊗L) for some L∈Pic(X) and some \upgamma∈Hom\mathdsGaff(N,g⋅N).
Proof.
By assumption we may write g=Li1σ1⋅Li2σ2⋅…⋅Likσk for some k≥0, 1≤ij≤n and σi∈{±1}. If k=0, we have nothing to prove, and so we assume k>0.
We prove the result by induction on k, so first assume that k=1. There are two cases, depending on the parity of σ1. In the case σ1=1, we are considering the isomorphism \upvarepsilon:Λ→ΛLi⋅N. By Theorem 7.4, the functor
[TABLE]
is isomorphic to the composition
[TABLE]
from which it follows that \upvarepsilon≅\Upphi\upalpha∘(−⊗Li). On the other hand, in the case σ1=−1, we are considering the isomorphism \upvarepsilon:Λ→ΛLi−1⋅N. However, by Theorem 7.4 and Lemma 7.3 applied to g=Li and h=g−1, the functor (7.J) is isomorphic to
[TABLE]
from which it follows that \upvarepsilon≅\Upphi(h⋅\upalpha)−1∘(−⊗Li−1). Either way, the result holds for k=1.
For the induction step, assume that k>1 and set h:=g⋅Lik−σk and k:=Likσk, so g=h⋅k. By the inductive hypothesis, there exist M∈PicX and \upbeta∈Hom\mathdsGaff(N,h⋅N) such that the isomorphism \upvarepsilon:Λ→Λh⋅N is isomorphic to \Upphi\upbeta∘(−⊗M). Combining this with Lemma 7.3, the following diagram commutes
[TABLE]
where the right hand composition is our desired isomorphism \upvarepsilon:Λ→Λg⋅N. Now by length one case proved above applied to k, the bottom left \upvarepsilon is isomorphic to \Upphi\upgammak∘(−⊗Likσk) for some \upgammak∈Hom\mathdsGaff(N,k⋅N).
Thus if we set \upgamma:=(k⋅\upbeta)∘\upgammak∈Hom\mathdsGaff(N,g⋅N) and L:=M⊗Likσk, then \upvarepsilon:Λ→Λg⋅N is isomorphic to the composition \Upphi\upgamma∘(−⊗L).
∎
The following is an easy extension of results in [IW2, §9].
Lemma 7.9**.**
Suppose that M∈Mut(N), and that there is an R-linear isomorphism Λ→ΛM such that S0↦Si, where rkRMi=1. Then M≅L⋅N for some L∈⟨L1,…,Ln⟩.
Proof.
Since S0↦Si, by the pairing between simples and projectives, it follows that there is a chain of R-module isomorphisms
[TABLE]
Since rkRMi=1, the right hand side is isomorphic to HomR(M⋅Mi−1,R). Hence applying HomR(−,R) shows that M≅Mi⋅N as R-modules. Since Mi is a summand of M of rank one, and M∈Mut(N), by the bijections in 3.3Mi must appear as a Zn-lattice point in the hyperplane arrangement (see [IW2, 9.10(2)(3)]).
∎
The following is one of our key results.
Theorem 7.10**.**
Aut∘D≅PBrD⋊PicX.
Proof.
Set G=Aut∘D. Then K=PBrD is a clearly a subgroup of G, as is H=PicX since elements of PicX are R-linear by Lemma 2.5, and preserve Stabn∘D by Theorem 7.4.
The remainder of the proof splits into five steps.
Step 1: We first claim that, as sets, G=KH. Let g∈G. Since g preserves Stabn∘D, arguing as in Theorem 7.1, there exists \upbeta∈Hom\mathdsGaff(CM,C+) such that g(B)=B\upbeta. The composition
[TABLE]
is R-linear, and restricts to an equivalence between finite length Λ-modules and finite length Λ\upbeta-modules. In particular, by Lemma 5.7(1) and Corollary 5.8 the composition restricts to an R-linear Morita equivalence
[TABLE]
Since both algebras are basic, necessarily this is induced by an R-algebra isomorphism \upvarphi:Λ→Λ\upbeta. But by Lemma 7.7, it follows that M has rank one summand. By Lemma 7.9, there is L∈⟨L1,…,Ln⟩ such that M≅L⋅N.
Consider the composition autoequivalence
[TABLE]
where \upvarepsilon:Λ∼ΛL⋅N=Λ\upbeta. By a similar argument as above, \Upupsilon is induced by an R-linear isomorphism
\uppsi:Λ∼Λ. Then \uppsi∗S0≅Si for some 0≤i≤n, and by the pairing between projectives and simples, \uppsi restricts to an isomorphism P0≅Pi of R-modules. By Lemma 7.7 we see that rkRNi=1. It follows that
[TABLE]
as R-modules, and so dualizing gives N≅N⋅Ni−1. Then by Lemma 7.9, Ni necessarily lies in ⟨L1,…,Ln⟩. By Lemma 7.2 we thus have Ni≅R, since non-trivial elements of ⟨L1,…,Ln⟩ non-trivially translate the hyperplane arrangement. Thus \Upupsilon(S0)≅S0. As an Morita equivalence, it follows that there exists a permutation \upiota∈Sn such that \Upupsilon(Si)≅S\upiota(i) for all 1≤i≤n. Since \Upupsilon preserves normalised stability conditions, by Lemma 7.7 we see rkRNi=rkRN\upiota(i). Hence by Proposition 5.10, there is a functorial isomorphism \Upupsilon≅Id, and so g≅\Upphi\upbeta∘\upvarepsilon. Using Lemma 7.8 it follows that g is functorially isomorphic to the composition
[TABLE]
for some F∈Pic(X). Hence g≅\Upphi\upbeta∘\upgamma∘F∈KH.
Step 2: Consider the subgroup TrD of G consisting of those elements that are the identity on K-theory K. We know that PBrD⊆TrD by Proposition 4.8. We claim that PBrD⊇TrD, so equality holds. To see this, consider t∈TrD. By Step 1, since t∈G we can write t=kh for some k∈K and some h∈H. Thus h=k−1t, and so h is trivial on K-theory. But by Lemma 7.6 the only line bundle twist that satisfies this is the identity. Hence h=1, so k=t and thus t∈K=PBrD.
Step 3: K⊴G. This follows immediately from Step 2, since being the identity on K-theory is clearly closed under conjugation.
Step 4: K∩H={1G}. Again, this holds by Lemma 7.6, since the only line bundle twist that is the identity on K-theory is the identity.
Combining Steps 1, 3 and 4 we see that G≅K⋊H, as required.
∎
In particular, as is standard for semidirect products, there is an induced exact sequence
[TABLE]
This sequence is the generalisation of [T, 5.4(ii)] to higher length flops.
7.5. Application: Stringy Kähler Moduli Spaces
In this subsection we compute the stringy Kähler moduli space Stabn∘D/Aut∘D for all smooth single curve flops. In this case, Theorem 3.3 reduces to the statement that the mutation class containing N is in bijection with the chambers of an infinite hyperplane arrangement in R1, which we draw as
[TABLE]
extended in both directions to infinity. The walls are labelled by the indecomposable R-modules that are summands of elements in the mutation class of N, and the chambers are labelled by their direct sums. Wall crossing corresponds to mutation. Since N=R⊕N1 from (2.C) must appear in its mutation class, the centre of the hyperplane arrangement has the following form
[TABLE]
Under this convention, with R⊕N1 on the left and R⊕N1∗ on the right, L=f∗L=f∗O(1) generates a subgroup of Cl(R) which acts on (7.L), taking the wall labelled R to the next wall to the right for which the R-module labelling it has rank one.
The following computes the numerics of the hyperplane arrangements that can arise.
Proposition 7.11**.**
Suppose that X→SpecR is an irreducible length ℓ flop, where X is smooth. Then the corresponding affine hyperplane arrangement, together with the ranks of the modules labelling each wall, are, for ℓ=1,…6 respectively:
[TABLE]
In each case the hyperplane arrangement is infinite, and the labels repeat.
Proof.
By Katz–Morrison [KM, K2] it is known that for a smooth single-curve flop, the J⊂\Updelta0 is one of the following cases:
[TABLE]
We analyse each individually. In each case, by [IW2, §1] the J-affine arrangement TCone(Jaff) can be calculated by using local wall crossing rules. Combinatorially, this is very elementary, and is explained in detail in [W2, 1.1].
We sketch the D4 case here.
We first replace the modules by their ranks, and we label the chamber via McKay correspondence. The fact we will repeatedly use below is that the rank of a summand equals the number \updeltai, where i is the vertex in the Dynkin diagram that the summand corresponds to, and \updelta=(\updeltai)i∈\Updeltaaff is the null root [IW2, 9.3]. Doing this, we obtain
[TABLE]
To obtain wall crossing over the wall labelled 2, temporarily delete the vertex corresponding to 2, apply the Dynkin involution to the remainder (which is trivial for A1×A1×A1×A1), then insert back in the vertex labelled 2.
[TABLE]
The wall crossing is thus described by
[TABLE]
Applying the same local rule but instead at the other vertex, and repeating, gives
[TABLE]
The E6 case is explained in detail in [W2, 1.1], and is summarised by the following. The shaded region can be ignored for now, but will be used later in Theorem 7.12.
[TABLE]
For E7, E8(5) and E8(6), the calculations are, respectively,
[TABLE]
[TABLE]
[TABLE]
The following extends the pictures in [T, p6169] and [A, Figure 1], which describe the case ℓ=1, to all higher lengths.
Theorem 7.12**.**
Suppose that X→SpecR is a length ℓ irreducible flop, where X is smooth. Then the SKMS is one of the following:
[TABLE]
The cases ℓ=5,6 behave slightly differently; respectively they are:
[TABLE]
Proof.
By Theorem 7.10 and the resulting exact sequence (7.K), we first quotient by PBrD, then quotient by PicX. By Theorem 6.9, it suffices to identify (Cn\HCaff)/PicX.
But this is §7.3, see (7.I). Indeed, the action of O(1) moves chambers to the left, by either 1,2,4,6,10, or 12 steps, depending on the length of the flopping curve. Thus, for example in the case ℓ=2, the generator O(−1) of PicX acts via
[TABLE]
where we have shaded the fundamental domain. Thus, identifying edges to form a cylinder, the quotient space is
[TABLE]
All other cases are similar, by identifying the left and right hand sides of the fundamental regions shaded in the proof of Proposition 7.11.
∎
Appendix A Combinatorial Tracking Results
In this appendix, which is independent of the rest of the paper, we give the proof of Propositions 3.8 and 3.11, and Lemma 3.10. The Propositions are proved in §A.2, whilst Lemma 3.10 appears as Lemma A.4. Throughout, we use the notation from Section 3.
A.1. Preliminary Results
First, for L∈Mut0(N) write z∈(\UpthetaL)C as
[TABLE]
The action of \upvarphiL on K-theory is induced from Z, so it independently acts on both factors Rxn and Ryn. We will write Hx for the hyperplanes H viewed in Rxn, and Hy for the hyperplanes H viewed in Ryn. Likewise for H∈H, we will write Hx∈Hx and Hy∈Hy accordingly. Since HC:={H×H∣H∈H}, by definition
[TABLE]
On the other hand, for L∈Mut(N) write z∈(KL)C as
[TABLE]
The action of \upphiL again acts independently on both factors. As in §3.5, consider W, the set of full hyperplanes in KL⊗R that separate the open chambers of TCone(Jaff).
Example A.1**.**
In Example 3.5, W is the following infinite collection of hyperplanes in R2
[TABLE]
The hyperplanes converge on the line \upvartheta0+3\upvartheta1=0, but W does not contain this line.
Write Wx for the hyperplanes W viewed in Rxn+1, and Wy for the hyperplanes W viewed in Ryn+1. Mirroring the above notation, for W∈W, similarly consider Wx∈Wx and Wy∈Wy. Again, by definition
[TABLE]
The following is clear.
Lemma A.2**.**
With notation as above, the following statements hold.
(1)
The hyperplanes in H contain the coordinate axes, and are all of the form \uplambda1xi1+…+\uplambdasxis=0 where each ij∈{1,…,n} and each \uplambdaj>0.
2. (2)
The hyperplanes in W contain the coordinate axes, and are all of the form \uplambda1xi1+…+\uplambdasxis=0 where each ij∈{0,1,…,n} and each \uplambdaj>0.
Proof.
By definition, in both cases C+ is a chamber. Since the coordinate axes bound this, both first statements follow. The second statements follow from the fact that C+ is a chamber, together with the observation that if some \uplambdaj<0, then the hyperplane would pass through C+.
∎
The following is then immediate, and establishes ⊇ in Proposition 3.8.
Corollary A.3**.**
⋃\upvarphiL(H+)⊆\UpthetaC\HC**
Proof.
By (A.A) it is clear that \upvarphiL restricts to a bijection between (HL)C and HC, since we already know that it does this on both factors. Hence it suffices to show that H+⊆Cn\HC.
For this, consider z=x+yi∈H+. If all yi>0, then by Lemma A.2(1), all \uplambda1yi1+…+\uplambdasyis>0, so y∈/Hy, and hence z∈/HC by (A.A). By permuting the numbering if necessary, we can thus assume that y1=…=yt=0 for some 1≤t≤n, and that yt+1,…,yn>0. In this case, by the positivity of yt+1,…,yn, and the fact the rest are zero, again using Lemma A.2(1) it follows that y avoids all members of Hy except those hyperplanes of the form
[TABLE]
where i1,…,is∈{1,…,t}. But since z∈H+, the fact that y1=…=yt=0 forces x1,…,xt<0. Hence x avoids all the corresponding members
[TABLE]
of Hx. Thus, overall, y avoids some hyperplanes, and the hyperplanes that it does not avoid are avoided by x. Again by (A.A) it follows that z∈/HC.
∎
This is visibly path connected. To prove the statement, it suffices to show that for every boundary point z∈E+\E+∘, there is a path in E+ from z to a point w in E+∘.
Write z=x+yi, then since z∈E+, not all yj can be zero. Further, since z∈E+\E+∘, after reordering if necessary we can write
[TABLE]
for some k such that 0<k<n. Set \upgamma:=∑i=0k\uplambdai and fix s such that
0<s<\upgamma\uplambdanyn. Then for any t∈[0,s], consider the point
[TABLE]
This satisfies ∑i=0n\uplambdaiy(t)i=∑i=kn\uplambdaiyi, which equals 1 since z∈E+. Setting z(t)=x+y(t)i, it is then clear that z(t)∈(LevelL)C for all t∈[0,s]. On the other hand, by inspection z(t)∈H+′ for all t∈[0,s]. It follows that z(t)∈E+ for all t∈[0,s], so setting w:=x+y(s)i∈E+∘, the path p:[0,s]→E+ sending t↦z(t) connects z and w.
∎
Recall that HCaff=WC∩LevelC. The following establishes ⊇ in Proposition 3.11.
Corollary A.5**.**
⋃\upphiL(E+)⊆LevelC\HCaff**
Proof.
By (A.B) \upphiL restricts to a bijection between (WL)C and WC. Since mutation functors also preserve the level, and HCaff=WC∩LevelC, it suffices to show that E+⊆LevelC\HCaff.
For this, consider z=x+yi∈E+. The key is to view this in H+′, then follow the proof of Corollary A.3. We appeal to Lemma A.2(2) instead of Lemma A.2(1), and (A.B) instead of (A.A), then it follows that z∈/WC. Hence z∈LevelC\HCaff.
∎
To obtain the converse direction in both Propositions 3.8 and 3.11 is slightly more tricky. As preparation, recall that if H is a real hyperplane arrangement, then the intersection poset L(H) of H is the set of all possible intersections of subsets of hyperplanes from H. For X,Y∈L(H), consider
[TABLE]
called the localization and restriction arrangements respectively. The localization HX is a subarrangement of H, whilst HY is an arrangement in Y. The following is elementary.
Lemma A.6**.**
If X⊆Y, then (HX)Y=(HY)X∩Y.
Proof.
On one hand (HX)Y={H∩Y∣X⊆H\mboxandY⊈H}. On the other hand
[TABLE]
These two sets are clearly the same, using the assumption that X⊆Y.
∎
Returning to our flops setting, recall from Lemma A.2 that the coordinate axes belong to H and W. As notation, for a subset I⊆{1,…,n}, consider
[TABLE]
Similarly, for I′⊆{0,1,…,n}, consider \mathdsB={xj=0\mboxforallj∈I′}∈L(W).
In the affine setting, the following result will be crucial.
Lemma A.7**.**
If I′⊊{0,…,n}, then W\mathdsB is finite
Proof.
Say the Tits cone associated to the extended ADE graph \Updeltaaff lives inside the vector space V≅R∣\Updeltaaff∣, with coordinates (x0,…,xm). Write T for the set of full hyperplanes in V that separate the chambers in the Tits cone. The arrangement W is the set of full hyperplanes that separate chambers in TCone(Jaff), so by Definition 3.1 we can write W=TY for some Y obtained by intersecting coordinate axes. By the commutative diagram in Lemma A.6, to show that W\mathdsB=(TY)\mathdsB is finite, it suffices to show that W=TX is finite for any X=⋂k∈K{xk=0} with K⊊{0,…,m}. In turn, it suffices to show that the quotient
[TABLE]
is a finite arrangement. This lives in V/X, which has lower dimension.
For k∈K, applying the Coxeter element sk to the basis {xj+X∣j∈K} of V/X negates the xk entry, and adds some multiple of xk to its neighbours in K, via the standard Coxeter rule. By inspection, this is the same as the Coxeter rule for \Upgamma, where \Upgamma is obtained from \Updeltaaff by deleting the vertices that are not in K. It follows that T/X is the Tits cone associated to the diagram Γ. But deleting a non-empty set of vertices in an extended ADE Dynkin diagram gives a finite ADE Dynkin diagram, or a disjoint union thereof. Hence the Tits cone for \Upgamma has finitely many hyperplanes, hence so too does T/X, and thus TX.
∎
Given I⊆{1,…,n}, I′⊊{0,1,…,n}, define
[TABLE]
and let MutToI(N), respectively MutToI′(N), be the set of all mutations L→…→N whose constituent length one paths all have labels in the set I, respectively I′. The following is one of the main technical results of this Appendix.
Proposition A.8**.**
Consider subsets I⊆{1,…,n}, I′⊊{0,1,…,n}, with associated B and \mathdsB. Then the following statements hold.
(1)
The hyperplanes in HB are precisely those hyperplanes \uplambda1\upvarthetai1+…+\uplambdas\upvarthetais=0 from H such that every ij∈I. Necessarily each \uplambdaj>0.
2. (2)
The hyperplanes in W\mathdsB are precisely those hyperplanes \uplambda1xi1+…+\uplambdasxis=0 from W such that every ij∈I′. Necessarily each \uplambdaj>0.
3. (3)
There are decompositions
[TABLE]
Proof.
(1) The first statement is elementary. The second is immediate from Lemma A.2(1). Part (2) is identical, using instead Lemma A.2(2).
(3) Tracking across the mutation \upnuiN→N for i∈I, by (3.B) D− gets sent to the region
[TABLE]
of \UpthetaR=Rn, where bij∈Z≥0. In contrast, C− gets sent to the region
[TABLE]
Thus, by part (1) we see that the walls of (A.C) are precisely those hyperplanes in H that belong to HB and also bound the walls of (A.D). Hence the region (A.C) is bounded by elements of HB. There are no further walls inside this region, since otherwise there would be further walls within (A.D), which is not the case, using the C− version of Theorem 3.6.
Repeating the above argument, all chambers adjacent to D− in HB can be obtained by tracking D− through some mutation \upnuiN→N. The proof then just proceeds by induction. Consider \upnuj\upnuiN→\upnuiN→N, track D− through both mutations, and just appeal to the C− version of Theorem 3.6. This process finishes since the numbers of chambers in HB is finite, since H is, and at each stage mutation at the labels in I describes the ∣I∣ possible wall-crossings in each chamber.
The last statement is similar, replacing \Updelta by \Updeltaaff, and using the C− version of Theorem 3.3 in place of Theorem 3.6. The key point is that, since I′ is a proper subset, by Lemma A.7 the hyperplane arrangement W\mathdsB is still finite, and so the conclusion of the last sentence in the above paragraph still holds.
∎
Corollary A.9**.**
There is an inclusion Cn\HC⊆⋃L∈Mut0(N)\upvarphiL(H+), and furthermore LevelC\HCaff⊆⋃L∈Mut(N)\upphiL(E+).
Proof.
Pick z∈Cn\HC, and write z=x+yi. By Theorem 3.6 applied to Hy, we can find some L∈Mut0(N) such that \upvarphiL−1(y) has all coordinates ≥0. If all coordinates are positive, then \upvarphiL−1(z)∈H+, thus z∈\upvarphiL(H+), as required.
Hence we can assume that some coordinate of y′:=\upvarphiL−1(y)∈\UpthetaL is zero. Thus there exists some non-empty subset I⊆{1,…,n} such that yi′=0 for all i∈I, and yj′>0 for j∈/I. Note that I={1,…,n} is possible, in which case all yi′=0.
Recall that \upvarphiL:=\upvarphi\upalpha, where \upalpha:L→…→N. Write
[TABLE]
Since x′ belongs to the closure of some chamber in the x-version of \UpthetaL, applying Proposition A.8(3) to (HL)x⊂\UpthetaL we can find a sequence of mutations
[TABLE]
with each jk∈I, such that \upvarphij1−1…\upvarphijs−1(x)∈D−. Since each jk∈I, yjk′=0, and so this path has no effect on y′. In particular,
[TABLE]
where xi′′≤0 provided that i∈I. Since z∈/HC, we must have xi′′=0 for all i∈I, else \upvarphij1−1…\upvarphijs−1\upvarphi\upalpha−1(z) and thus z belongs to a complexified hyperplane. Hence (A.E) belongs to H+, and so z∈\upvarphi\upalpha\upvarphijs…\upvarphij1(H+). This is the tracking of H+ through the chain
[TABLE]
Appealing to Proposition 4.8, \upvarphi\upalpha\upvarphijs…\upvarphij1=\upvarphiM, and so z∈\upvarphiM(H+).
For the second statement, let z∈LevelC\HCaff. The proof proceeds as above, replacing \upvarphi by \upphi at all stages. We obtain a subset I′⊆{0,1,…,n}, but crucially now I′={0,1,…,n} since \upvarphiL−1(z)∈(LevelL)C. This is due to the fact that mutation functors preserve the level, and so multiples of the y coordinates must sum to one, hence not all the y can be zero. Hence I′ is a proper subset, which still allows us to still appeal to Proposition A.8(3). We thus still deduce that \upphiM−1(z)∈H+′. Since mutation functors preserve the level, automatically it follows that \upphiM−1(z)∈E+, and so z∈\upphiM(E+).
∎
We lastly show that the unions are disjoint, which requires the following.
Lemma A.10**.**
Let L,M∈Mut0(N), respectively Mut(N), and let \upalpha:L→M be a minimal path. Suppose that \upvarphi\upalpha(a1′,…,an′)=(a1,…,an) in (\UpthetaM)R, respectively \upphi\upalpha(a0′,…,an′)=(a0,…,an) in (KM)R, with all ai,ai′∈R≥0, and write I={i∣ai′=0}.
(1)
If I=∅, then L≅M.
2. (2)
If I=∅, then the following statements hold.
(a)
The simple mutations giving \upalpha all have labels in the set I.
2. (b)
ai′=ai* for all i.*
3. (c)
\upvarphi\upalpha[Pi′]=[Pi], respectively \upphi\upalpha[Pi′]=[Pi], for all i∈/I.
Proof.
We prove the affine case KM, with the case \UpthetaM being similar.
Set p=∑i=0nai′[Pi]. For a general subset J of {0,1,…,n} and N′∈Mut(N), set
[TABLE]
As calibration, note that C+=C∅.
(1) If all ai>0, then since chambers map to chambers, \upphi\upalpha(p)∈C+. Thus C+∩\upphi\upalpha(C+)=∅. By Theorem 3.3 (respectively 3.6 for \Uptheta), L≅M.
(2) By assumption I=∅, in which case its complement Ic in {0,1,…,n} is a proper subset. Since p∈CI, which is a codimension ∣Ic∣ wall of C+, and \upphi\upalpha maps walls to walls (maintaining codimension), it follows that \upphi\upalpha(p) lies in a codimension ∣Ic∣ wall of C+. These all have the form CI′ for some ∣I′∣=∣I∣, and so it follows that \upphi\upalpha(p)∈CI′ for some such I′ with ∣I′∣=∣I∣.
We first argue that (a) implies (b) and (c). Indeed, since \upphij, with j∈I, negates the entry j (which is zero) and adds zero to the neighbours, evidently this has no effect on elements in CI, and so (a0,…,an)=\upphi\upalpha(a0′,…,an′)=(a0′,…,an′). Consequently, we have ai′=ai for all i, proving (b). Furthermore, (c) follows immediately from (a), using Lemma 3.2.
Now we prove (a). Write \upalpha:L0:=L→L1→…→Lm:=M for a minimal path from L to M. By [IW2, 1.12], in every KLi, all chambers and all walls of all codimension are labelled by Coxeter information. Namely, by wCJ for some w in the affine Weyl group W\Updeltaaff, and some subset J of the vertices of the affine Dynkin diagram \Updeltaaff. The codimension ∣Ic∣ walls have the form wCJ for certain J and w∈W\Updeltaaff, with ∣J∣=∣Ic∣. Consequently, tracking CI in KL⊗R through \upphi\upalpha=\upphiin…\upphii1 gives a sequence of labelled walls
[TABLE]
where the last term is in KM⊗R. At each step, since atoms follow the weak order, the length of the smallest coset representative wi cannot decrease. This holds just since the statement is true for chambers,
and the labels on the walls are induced from these.
Since \upphi\upalpha(p)∈CI′, and \upphi\upalpha(p)∈\upphi\upalpha(CI)=wmCIm, it follows that CI′∩wmCIm=∅. As is standard [B2, V.4.6, Proposition 5],
we deduce that Im=I′, and wm∈WI′, where WI′ is the subgroup of W\Updeltaaff generated by si with i∈I′. In particular wmCIm=CI′, and so the above chain is
[TABLE]
As the minimal length of the coset representative wi cannot decrease throughout the chain, and the chain starts and finishes with length zero, it follows that at each step wiCIi=CIi. Thus, at step one, \upphii1:CI↦CI1. By inspection, this occurs if and only if the label i1 is in the set I, and I=I1. Inducting along the chain, every label it is in the set I, and (a) follows.
∎
Corollary A.11**.**
Suppose that L,M∈Mut0(N), and let \upalpha be the minimal path from L to M. Then
\upvarphi\upalpha(H+)∩H+=∅ in \UpthetaM⟺L≅M. The same statement holds for Mut(N), using instead \upphi\upalpha(E+)∩E+=∅.
Proof.
(⇐) is clear. For (⇒), if the intersection is nonempty, then
[TABLE]
where all zi,zi′∈H. Splitting into real and imaginary parts,
[TABLE]
Since all zi,zi′∈H, necessarily the right hand equation belongs to \upvarphi\upalpha(C+)∩C+.
As before, write I for the set of i for which yi′=0.
On one hand, if I is not a proper subset, then yi=yi′=0 for all i. Since every zi,zi′∈H, all xi,xi′<0. Using the C− version of Proposition 3.6 applied to the x-coordinate, L≅M. On the other hand, if I=∅, then by Lemma A.10(1) we also have L≅M.
Hence we can assume that I=∅ and I is a proper subset. Since I=∅, by Lemma A.10(2), \upalpha comprises of mutations with labels only from the set I. Further, all yi′=yi (and so in particular yi=0 if i∈I), and \upvarphi\upalpha[Pi′]=[Pi] if i∈/I. Since zi,zi′∈H, we then deduce that xi<0 and xi′<0 for all i∈I, and that we can re-write the left hand equation in (A.F) to obtain
[TABLE]
Set I⊂Ic to consist of those i such that xi′−xi≥0, and let Ic=Ic−I. Re-arranging gives
[TABLE]
The left hand side has non-negative coefficients in every entry {0,1…,n}, and the right hand side is in \upvarphi\upalpha(C+). If I=∅, so that Ic=Ic, then the right hand side is in \upvarphi\upalpha(C+) and so by Lemma A.10(1), L≅M.
Hence our final case is when I=∅, I is proper, and I=∅. We will show that this cannot occur, by exhibiting a contradiction. Again, the above displayed equation lies in \upvarphi\upalpha(C+)∩C+ and so now by Lemma A.10(2) the coefficients on both sides must match. But coefficients in Ic do not appear on the left hand side, nor do coefficients in I on the right, so we deduce that xi−xi′=0 for all i∈Ic. But then
[TABLE]
and so by Lemma A.10(2) \upalpha comprises mutations only from the set Ic. But as stated above, \upalpha can only comprise labels in the set I. This is a contradiction, which shows that this final case cannot exist.
The proof of the second statement is similar. The set I must be proper since z∈E+, so all y coordinates are nonnegative, and after weighting by rkRMi they sum to one. Hence not all can be zero. Given this, the rest of the proof remains the same: since E+⊂H+′, replacing \upvarphi by \upphi throughout, and starting the indices with [math], the logic above still holds, as we can still appeal to Lemma A.10 in the affine case.
∎
Corollary A.12**.**
If L,M∈Mut0(N), then \upvarphiL(H+)∩\upvarphiM(H+)=∅ in \UpthetaN⟺L≅M. The same statement holds for Mut(N), using instead \upphiL(E+)∩\upphiM(E+)=∅ in KN.
Proof.
(⇐) is clear. For (⇒), if \upvarphiL(H+)∩\upvarphiM(H+)=∅, then \upvarphiM−1∘\upvarphiL−(H+)∩H+=∅. By Proposition 4.8(3), \upvarphi\upalpha(H+)∩H+=∅ in \UpthetaM, where \upalpha is the minimal path from L to M. By Corollary A.11, the atom \upalpha is the identity, and the result follows. The second statement is identical, as we can still appeal to Proposition 4.8(3) and Corollary A.11.
∎
where the union on the right hand side is disjoint. This now follows by combining Corollaries A.3, A.9 and A.12. On the other hand, Proposition 3.11 asserts that
[TABLE]
where the union on the right hand side is disjoint. This now follows by combining Corollaries A.5, A.9 and A.12.
Appendix B List of Notation
Bibliography32
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[A] P. S. Aspinwall, A point’s point of view of stringy geometry , J. High Energy Phys. 2003, no. 1, 002.
2[B 1] A. Bayer, A tour to stability conditions on derived categories , link .
3[BM] A. Bayer and E. Macrì, The space of stability conditions on the local projective plane , Duke Math. J. 160 (2011), no. 2, 263–322.
4[B 2] N. Bourbaki, Lie groups and Lie algebras . Chapters 4–6. Elements of Mathematics (Berlin). Springer–Verlag, Berlin, 2002. xii+300pp.
5[B 3] T. Bridgeland, Flops and derived categories , Invent. Math. 147 (2002), no. 3, 613–632.
6[B 4] T. Bridgeland, Stability conditions on triangulated categories , Ann. of Math. (2) 166 (2007), no. 2, 317–345.
7[B 5] T. Bridgeland, Spaces of stability conditions , Algebraic Geometry-Seattle 2005. Part 1, 1–21, Proc. Sympos. Pure Math., 80 , Part 1, Amer. Math. Soc., Providence, RI, (2009).
8[B 6] T. Bridgeland, Stability conditions and Kleinian singularities , Int. Math. Res. Not. IMRN (2009), no. 21, 4142–4157.