Constructing $A_\infty$-categories of matrix factorisations
Daniel Murfet

TL;DR
This paper develops explicit $A_ fty$-models for the DG-category of matrix factorizations over a commutative $Q$-algebra, enhancing the understanding of their algebraic structure.
Contribution
It constructs Hom-finite $A_ fty$-categories with idempotent functors for matrix factorization DG-categories, providing a constructive approach.
Findings
Explicit $A_ abla$-models for matrix factorization categories
Hom-finite $A_ abla$-categories with idempotent functors
Enhanced algebraic understanding of matrix factorizations
Abstract
We study constructive -models of the DG-category of matrix factorisations of a potential over a commutative -algebra , consisting of a Hom-finite -category equipped with an -idempotent functor.
Click any figure to enlarge with its caption.
Figure 1
Figure 2
Figure 3
Figure 4
Figure 5
Figure 6
Figure 7Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgebraic structures and combinatorial models · Advanced Topics in Algebra · Homotopy and Cohomology in Algebraic Topology
Constructing -categories of matrix factorisations
Daniel Murfet
Abstract
We study constructive -models of the DG-category of matrix factorisations of a potential over a commutative -algebra , consisting of a Hom-finite -category equipped with an -idempotent functor.
Contents
1 Introduction
This paper continues the project from [15, 31, 10] of making the theory of affine B-twisted topological Landau-Ginzburg models constructive, in the sense of deriving formulas and algorithms which compute the fundamental categorical structures from coefficients of the potential and the differentials of matrix factorisations. For example, the units and counits of adjunction in the bicategory of Landau-Ginzburg models [10] and the pushforward and convolution operations [15] may be described in terms of various flavours of Atiyah classes.
We study idempotent finite -models of DG-categories of matrix factorisations over arbitrary -algebras . An idempotent finite model of a DG-category over is a pair consisting of an -category over which is Hom-finite, in the sense that for each pair of objects the complex is a finitely generated projective -module, together with a diagram of -functors
[TABLE]
with -homotopies and . Using the finite pushforward construction of [15] and Clifford actions of [31] we explain how to define an idempotent finite -model of the DG-category of matrix factorisations of any potential over . When is a field this is constructive in the sense that we give algorithms for computing the entries in the higher -operations on and the components of , viewed as matrices, from the Atiyah class of and a Gröbner basis of the defining ideal of the critical locus of .
We note that our goal is not to construct a minimal model: has nonzero differential. When is a field the usual approach to finding a Hom-finite -model of is to equip with an -structure, so that there is a diagram of -functors
[TABLE]
and -homotopies and . The problem is that the minimal model is only under good control for those matrix factorisations where we happen to know a good cohomological splitting on . In our approach the idempotent finite model is constructed directly from , and if we happen to know a cohomological splitting then this provides the data necessary to split . An important example is the case where is the standard generator, where there is a natural cohomological splitting and the resulting -structure has been studied by Seidel [38, §11], Dyckerhoff [14, §5.6], Efimov [16, §7] and Sheridan [39]. We explain how to split our idempotent in this special case and recover the minimal -model of in Section 6.
To explain in more detail, let be the DG-category of finite-rank matrix factorizations of a potential over an arbitrary -algebra . This is a DG-category over , which we can view as a -graded -module
[TABLE]
equipped with some -linear structure, namely, the differential and composition operator . Let denote the inclusion of constants. We can ask if the restriction of scalars is -homotopy equivalent over to an -category which is Hom-finite over , and can such a finite model be described constructively? This is related to the problem of pushforwards considered in [15] and, here as there, it is unclear that in general a direct construction of the finite pushforward exists.
Instead, following [15] the conceptual approach we adopt here is to seek an algorithm which constructs both a larger object which is a Hom-finite -category over together with an idempotent which splits to . More precisely, the larger object is obtained by adjoining to a number of odd supercommuting variables and completing along the the critical locus of to obtain the DG-category
[TABLE]
where is the -graded -module which is concentrated in odd degree, and denotes the -adic completion where . The differential on is the one inherited from . Note that the completion can be recovered from by splitting the idempotent DG-functor on which arises from the morphism of algebras
[TABLE]
which projects onto the identity by sending all -forms of nonzero degree to zero.
One should think of as the normal bundle to the critical locus of , and can be equipped with a natural strong deformation retract which arises from a connection “differentiating” in the normal directions to the critical locus. This strong deformation retract can be interpreted as an analogue in algebraic geometry of the deformation retract associated to the Euler vector field of a tubular neighborhood; see Appendix A. Applying the homological perturbation lemma results in a Hom-finite -category with
[TABLE]
By construction there is an idempotent finite -model
[TABLE]
of the completion , which we show is homotopy equivalent to over (in particular and are both DG-enhancements of the -linear triangulated category , with the latter being analogous to working with matrix factorisations over the power series ring ). The -idempotent arises in the obvious way as the transfer to of the idempotent (1.1).
Outline of the paper. In Section 3 we give the details of the above sketch of the construction of the idempotent finite model of , although the proofs are collected in Appendix B. The algorithmic content of the theory is summarised in Section 3.1, but developed over the course of Section 4 and Section 5 culminating in the Feynman rules of Section 5.6. Some of the geometric intuition for the central strong deformation retract is developed in Section A. In Appendix C we give some technical observations necessary to remove a Noetherian hypothesis from [31].
Related work. The approach we develop here seems to be related to ideas developed in the complex analytic setting by Shklyarov [40] in order to put a Calabi-Yau structure on , although we do not understand the precise connection. For applications to string field theory it is important to construct cyclic -minimal models; see for example [7]. For a recent approach to this problem for the endomorphism DG-algebra of see [42]. We do not understand the interplay between cyclic -structures and idempotent finite -models. This project began as an attempt to understand the work on deformations of matrix factorisations and effective superpotentials in the mathematical physics literature [2, 3, 4, 5, 8, 9, 24] which should be better known to mathematicians. Some ideas developed here were inspired by old work of Herbst-Lazaroiu [21] that has now culminated in a new approach to non-affine Landau-Ginzburg models [1].
Acknowledgements. Thanks to Nils Carqueville for introducing me to -categories, Calin Lazaroiu for encouragement and the opportunity to present the results at the workshop “String Field Theory of Landau-Ginzburg models” at the IBS Center for Geometry and Physics in Pohang. The author was supported by the ARC grant DP180103891.
2 Background
Throughout is a commutative -algebra and unless specified otherwise means . If is a sequence of formal variables then denotes and similarly for power series rings. Given we write for .
Let be a commutative ring. Given finite-rank free -graded -modules and we say that is even (resp. odd) if (resp. ) for all . This makes into a -graded -module. Given two homogeneous operators the graded commutator is
[TABLE]
In this note all operators are given a -grading and the commutator always denotes the graded commutator. We briefly recall some important operators on exterior algebras
[TABLE]
where denotes a free -module of rank with basis . We give a -grading by assigning , that is, . The inherited -grading on is the reduction mod of the usual -grading on the exterior algebra, e.g. .
We define odd operators on by wedge product and contraction, respectively, where contraction is defined by the formula
[TABLE]
Often we will simply write for and for . Clearly with this notation, as operators on , we have the commutator (as always, graded)
[TABLE]
and also .
2.1 -categories
For the theory of -categories we follow the notational conventions of [28, §2], which we now recall. Another good reference is Seidel’s book [37]. A small -graded -category over is specified by a set of objects and -graded -modules for any pair together with -linear maps
[TABLE]
of degree for every sequence of objects with . If the objects involved are clear from the context, we will write for this map. These maps are required to satisfy the following equation for
[TABLE]
In particular we have a degree zero map
[TABLE]
which satisfies the equation
[TABLE]
expressing that is associative up to the homotopy relative to the differential . The operators are sometimes referred to as higher operations. Any DG-category is an -category where is the differential, is the composition and for . Note that a DG-category has identity maps for all objects , and these make a strictly unital -category [28, §2.1], [37, §I.2].
To minimise the trauma of working with -categories, it is convenient to adopt a different point of view on the higher operations, which eliminates most of the signs: from the we can define suspended forward compositions [28, §2.1]
[TABLE]
for which the -constraints (2.3) take the more attractive form
[TABLE]
As before we write for if the indices are clear. Note that while has -degree , the ’s are all odd operators. The -degree of a homogeneous element will be denoted and we write for the degree of viewed as an element of . Sometimes we refer to this as the tilde grading. We refer the reader to [28] for the definition of the suspended forward compositions, but note and
[TABLE]
The Koszul sign rule always applies when we evaluate the application of a tensor product of homogeneous linear maps on a tensor, for example since is odd
[TABLE]
applied to a tensor is
[TABLE]
where we had to know that the domain involved rather than to know that we were supposed to use the tilde grading on .
We also use the sector decomposition of [28, §2.2]. We associate to the -module
[TABLE]
equipped with the induced -grading. Let be the commutative associative -algebra (without identity) generated by for subject to the relations (this non-unital algebra is denoted in [28]). Then has a -bimodule structure in which acts on the left by the projector of onto the subspace and acts on the right by the projector of onto the subspace . The -fold tensor product of the -bimodule over is
[TABLE]
with the obvious -bimodule structure involving the values of , so that the forward suspended product is an odd -bilinear map from .
3 The idempotent finite model
Throughout is a commutative -algebra and all -categories are -linear.
Definition 3.1.
An -category is called Hom-finite if for every pair of objects the underlying -module of is a finitely generated and projective -module.
Definition 3.2.
An idempotent finite -model of a DG-category is a pair consisting of a Hom-finite -category and -functor , and a diagram
[TABLE]
of -functors and -homotopies and .
We recall from [10] the definition of a potential:
Definition 3.3.
A polynomial is a potential if
- (i)
is a quasi-regular sequence;
- (ii)
is a finitely generated free -module;
- (iii)
the Koszul complex of is exact except in degree zero.
A typical example is a polynomial with isolated critical points [10, Example 2.5]. As shown in [10], these hypotheses on a potential are sufficient to produce all the properties relevant to two-dimensional topological field theory, even if is not a field. If is Noetherian then (iii) follows from (i).
Definition 3.4.
Given a potential the DG-category has as objects matrix factorisations of over [17] that is, the pairs consisting of a -graded free -module of finite rank and an odd -linear operator satisfying . We define
[TABLE]
The composition is the usual composition of linear maps.
Throughout we set to be the defining ideal of the critical locus, and write for the -adic completion. Let be a potential and let be a full sub-DG-category of the DG-category of matrix factorisations . The first observation is that we can replace by the completion .
Lemma 3.5**.**
Let be a potential. The canonical DG-functor
[TABLE]
is a -linear homotopy equivalence, that is, for every pair of matrix factorisations
[TABLE]
is a homotopy equivalence over .
Proof.
See Appendix C. ∎
To construct an idempotent finite model of we form the extension
[TABLE]
which is a DG-category with the same objects as and mapping complexes
[TABLE]
The differentials in are induced from and the composition rule is obtained from multiplication in the exterior algebra and composition in , taking into account Koszul signs when moving -forms past morphisms in . Next we consider the -graded modules and the -bimodule defined in Section 2.1, namely
[TABLE]
At the moment this has no additional structure: it is just a module, not an -category. But we note that since is a free -module of finite rank, and is free of finite rank over , the spaces are free -modules of finite rank. The goal of this section is to construct higher -operations on .
Setup 3.6**.**
Throughout we adopt the following notation:
- •
.
- •
* is a free -graded -module of rank , with .*
- •
* is a quasi-regular sequence in , such that with *
- –
* is a finitely generated free -module*
- –
each acts null-homotopically on for all
- –
the Koszul complex of over is exact except in degree zero.
- •
We choose a -linear section of the quotient map and as in Appendix A we write for the associated connection with components .
- •
* is a null-homotopy for the action of on for each .*
- •
We choose for an isomorphism of -graded -modules
[TABLE]
where is a finitely generated free -graded -module. Hence
[TABLE]
Remark 3.7.
By the hypothesis that is a potential, the sequence satisfies the hypotheses and we may choose to be the operator defined by choosing a homogeneous basis for and differentiating entry-wise the matrix in that basis. However some choices of and the may be better than others, in the sense that they lead to simpler Feynman rules.
To explain the construction of the higher operations on , it is convenient to switch to an alternative presentation of the spaces . Consider the following -graded -modules, where the grading comes only from and the Hom-space:
[TABLE]
Using (3.2) there is an isomorphism of -graded -modules . By Lemma A.5 there is a -linear isomorphism and combined with (3.2) this induces an isomorphism of -graded -modules
[TABLE]
which induces an isomorphism of -graded -modules
[TABLE]
Hence there are induced isomorphisms and . Using these identifications we transfer operators on to their primed cousins, usually without a change in notation. For example we write for
[TABLE]
This map is the differential in a -linear DG-category structure on , with the forward suspended composition in this DG-structure given by
[TABLE]
where the unlabelled isomorphisms are and . Going forward when we refer to as a DG-category this structure is understood. Finally the tensor product of the inclusions and , respectively the projections and define -linear maps and as in the diagram
[TABLE]
and hence degree zero -linear maps
[TABLE]
Definition 3.8.
The critical Atiyah class of is the operator on given by
[TABLE]
where is the connection of Section A. This is a closed -linear operator, independent up to -linear homotopy of the choice of connection.
We call the critical Atiyah class since it is defined using the connection , which is a kind of derivative in the directions normal to the critical locus, and some name seems useful to distinguish from various other Atiyah classes also playing a role in the theory of matrix factorisations, for example the associative Atiyah classes of [10].
Definition 3.9.
Since is a module over we may define
[TABLE]
where is the two-sided ideal spanned by the . We define the -linear operator
[TABLE]
for a homogeneous -form and . Evaluated on polynomial this is the inverse of the grading operator for virtual degree which is a -grading in which for and for .
Definition 3.10.
We introduce the following operators:
[TABLE]
where acts on by post-composition
[TABLE]
Note that the sums involved are all finite, since has positive -degree. The -degrees of these operators are and .
We now have the notation to state the main theorem. Let denote the set of all valid plane binary trees with inputs (in the sense of Appendix D). Given such a tree , we add some additional vertices and then decorate the tree by inserting operators at each vertex. The denotation of such an operator decorated tree is defined by reading the tree as a “flowchart” with inputs inserted at the leaves and the output read off from the root. For example the tree in Figure 1 has for its denotation the operator
[TABLE]
See Appendix D for our conventions on trees, decorations and denotations. We note that these denotations involve Koszul signs when evaluated, arising from the -degree (with respect to the tilde grading) of the involved operators (recall for example that is odd). See Section 2.1 for the definition of the ring and the -bimodule structure on , and note that we write for the number of internal edges in a tree .
Theorem 3.11**.**
Define the odd -bilinear map
[TABLE]
where is the denotation of the decoration with coefficient ring which assigns to every leaf and to every edge, and to
- •
inputs:* *
- •
internal edges:* *
- •
internal vertices:* *
- •
root:* *
Then is a strictly unital -category and there are -functors
[TABLE]
*and an -homotopy . *
Proof.
The full details are given in Appendix B, but in short this is the usual transfer of -structure via homological perturbation applied to a particular choice of strong deformation retract arising from the connection and the isomorphism . ∎
The projector of (1.1) can be written in terms of creation and annihilation operators
[TABLE]
where denotes the operator and denotes contraction . This is a morphism of algebras and induces a functor of DG-categories .
Definition 3.12.
Let be the following composite of -functors
[TABLE]
Corollary 3.13**.**
The tuple is an idempotent finite -model of .
Proof.
Consider the diagram
[TABLE]
where is the natural inclusion and is the projection, so that and . These are both DG-functors. We define and as -functors. Since we have an -homotopy we have an -homotopy
[TABLE]
and by definition . ∎
At a cohomological level the pushforward of matrix factorisations is expressed in terms of residues and null-homotopies , see for example the results in [15, §11.2] on Chern characters. These residues can be understood as traces of products of commutators with the connection [15, Proposition B.4]. The results just stated extend this “closed sector” or cohomological level analysis of pushforwards via residues to the “open sector” or categorical level, where the supertraces are removed and the higher operations of the idempotent finite model are described directly in terms of the commutators and homotopies . Moreover, these formulas arise from homological perturbation applied to a kind of tubular neighborhood of the critical locus, so it seems natural to interpret as a kind of “-categorical residue” of along the subscheme .
Recall that the purpose of the idempotent is that it encodes the information necessary to “locate” within the larger object . The information in the lowest piece of this -idempotent is the simplest, as it locates as a subcomplex within .
Definition 3.14.
Let be the -linear cochain maps
[TABLE]
respectively.
Theorem 3.15**.**
There is a -linear homotopy
[TABLE]
and -linear homotopies and
[TABLE]
where denotes the th component of the Atiyah class , viewed as an odd closed -linear operator on .
Proof.
This is essentially immediate from [31], see Appendix B for details. ∎
3.1 Algorithms
When is a field there are algorithms which compute the -functors and the higher -products in the sense that once we choose a -basis for and homogeneous -bases for the matrix factorisations, for each fixed there is an algorithm computing the coefficients in the matrices . We explain this algorithm in detail only for as the algorithms for are variations on the same theme using [32].
The algorithm is implicit in the presentation of as the sum of denotations of operator decorated trees, provided we have algorithms for computing the section , Atiyah classes and homotopies as operators on . If is a field, then by choosing a Gröbner basis of the ideal we obtain such algorithms; see Remark 4.4 and Remark A.9. Over the course of Section 4 and Section 5 we present the details of this algorithm in the case where the matrix factorisations are of Koszul type, using Feynman diagrams.
Remark 3.16.
For general the algorithmic content of the theory depends on the availability of a replacement for Gröbner basis methods. One important case where such methods are available is the example of potentials with , using Gröbner systems [44] and constructible partitions.
Remark 3.17.
Finding a Hom-finite -category -homotopy-equivalent to is equivalent to splitting the idempotent within Hom-finite -categories. We do not know a general algorithm which performs this splitting. However, this can be done when we have the data of a chosen cohomological splitting, for example in the case of the endomorphism DG-algebra of the standard generator when is a field; see Section 6.
4 Towards Feynman diagrams
In this section we collect some technical lemmas needed in the presentation of the Feynman rules, in the next section. Throughout the conventions of Setup 3.6 remain in force. See Appendix D for our conventions on trees, decorations and denotations. Given a binary plane tree we denote by the mirror of , which is obtained by exchanging the left and right branch at every vertex. Associated to a decoration of is a mirror decoration of . Given a plane tree decorated by as explained in Theorem 3.11 let be the mirror decoration evaluated without Koszul signs (Definition D.5).
Lemma 4.1**.**
We have
[TABLE]
where is the number of times the path from the th leaf in (counting from the left) enters a trivalent vertex as the right-hand branch on its way to the root, and is the number of internal vertices in .
Proof.
Let us begin with the special case given in Figure 1, using
[TABLE]
and the operator given in (3.5) to compute that
[TABLE]
where gives the Koszul sign arising from moving the inputs “into position”. Note that since and every decorating the tree , except for the one adjacent to the root, is followed immediately by a , this sign is always .
Hence the signs that arise in computing in terms of on the mirrored tree arise entirely from (4.2). If we continue to calculate, we find
[TABLE]
where
[TABLE]
This verifies the sign when . By induction on the height of tree, it is easy to check that in general there is a contribution to the sign of a at the vertex where the path from the th and th leaves to the root meet for the first time, and a every time the path from the th leaf enters a trivalent vertex on the right branch (of the original tree ), as claimed. ∎
4.1 Transfer to
Recall that given a choice of section , which we have fixed above in Setup 3.6, there is by Lemma A.5 an associated -linear isomorphism
[TABLE]
From this we obtain (3.3) which is used to transfer operators on (such as the differential or the homotopies ) to operators on . Since this introduces various complexities we should first justify why such transfers are necessary: that is, why do we prefer the left hand side of (3.3) to the right hand side?
Recall that the higher products on are defined in terms of operators on the larger space . If we are to reason about these higher products using Feynman diagrams, then to the extent that it is possible, the operators involved should be written as polynomials in creation and annihilation operators for either bosonic or fermionic Fock spaces (that is, in terms of multiplication by or the derivative with respect to ordinary polynomial variables or odd Grassmann variables ). It is not obvious a priori how to do this: recall that in order to ensure that the connection existed we had to pass from to the -adic completion , which in general is not a power series ring. For example, it is not clear how to express the operation of multiplication by , which we denote by , in terms of creation and annihilation operators on .
The purpose of this section is then to explain how the isomorphism is the canonical means by which to express in terms of creation operators for “bosonic” degrees of freedom, here represented by polynomials in the .
In what follows we fix a chosen -basis of , which we denote
[TABLE]
When is a field there is a natural monomial basis for associated to any choice of a monomial ordering on and Gröbner basis for , see Remark A.9. Since is not, in general, an algebra isomorphism (see Lemma A.5) there is information in the transfer of the multiplicative structure on to an operator on , and we record this information in the following tensor:
Definition 4.2.
Let denote the -linear map
[TABLE]
where denotes the usual multiplication on . We define as a tensor via the formula
[TABLE]
Definition 4.3.
Given we write for the unique collection of coefficients in with the property that in there is an equality
[TABLE]
Given we denote by the -linear operator
[TABLE]
where denotes multiplication by .
Remark 4.4.
For the overall construction of the idempotent finite model to be constructive in the sense elaborated above, it is crucial that we have an algorithm for computing these coefficients . In the notation of Section A, is the coefficient of in the vector , so it suffices to understand how to compute the .
As a trivial example, if then so and is just the coefficient of the monomial in the polynomial . In general, when is a field there is an algorithm for computing , see Remark A.9.
Lemma 4.5**.**
The operator is given in terms of the tensor by the formula
[TABLE]
Proof.
We have
[TABLE]
as claimed. ∎
4.2 The operator
One of the most complex aspects of calculating the -products described by Theorem 3.11 are the scalar factors contributed by the operator which is the inverse of the grading operator for the virtual degree. In this section we provide a closer analysis of these factors.
While the virtual degree of Definition 3.9 is not a genuine -grading because involves power series, for any given tree our calculations of higher -product on only involve polynomials in the , so there is no harm in thinking about the virtual degree as a -grading and as its inverse. Observe that that the critical Atiyah class is not homogeneous with respect to this grading, because while is homogeneous of degree zero with respect to the virtual degree (since has virtual degree and has virtual degree ) the operator involves multiplications by polynomials which need not have a consistent degree (viewed as operators on as in the previous section). To analyse this operator on we write
[TABLE]
for some -linear odd operators on . Then
[TABLE]
Evaluated on a tensor of virtual degree this gives
[TABLE]
where the scalar factor is computed by
Definition 4.6.
Given integers and a sequence we define
[TABLE]
and a symmetrised version
[TABLE]
In general there is no more to say, and the generic factors contributed by to Feynman diagrams have the form given in (4.4) above. However, there is a useful special case:
Lemma 4.7**.**
Let be a subspace with the following properties
- (a)
* is closed under for every .*
- (b)
As operators on , we have \big{[}d_{\mathcal{A}}^{\,(\delta)},d_{\mathcal{A}}^{\,(\gamma)}\big{]}=0 for all .
Then for any , is equal to
[TABLE]
Proof.
Only sequences of distinct ’s contribute, so we find that is equal to
[TABLE]
Note that only sequences with all contribute to this sum, so by hypothesis all the operators involved anti-commute
[TABLE]
as claimed. ∎
The lemma is sometimes useful in reducing the number of Feynman diagrams that one has to actually calculate, see Remark 5.20. While the hypotheses of Lemma 4.7 are technical, in the typical cases they are easy to check:
Example 4.8.
Suppose that is a Koszul matrix factorisation as in (5.3) and that we use the isomorphism of Lemma 5.8 to identify with
[TABLE]
on which space by Lemma 5.11 we have
[TABLE]
for some operators on computed by Lemma 4.5. Let be the subspace
[TABLE]
with no ’s, then as an operator on
[TABLE]
These operators will all pair-wise anticommute, provided that as operators on for all and . This is true trivially when , which means that the previous Lemma applies to calculating everywhere in Feynman diagrams computing the minimal model of , see Section 6.
Remark 4.9.
Scalar factors like occur in the context of infrared divergences involving soft virtual particles (such as soft virtual photons in quantum electrodynamics) see for instance [43, Ch. 13] and [34, p.204]. The operator is part of a propagator [26, §4.1.3] which like in QFT has the effect generically of suppressing contributions from terms far off the mass-shell (the further off the mass-shell you are, the larger is). In our case, Feynman diagrams with large numbers of internal virtual particle lines ( and lines) are suppressed with respect to the usual metric on .
The most commonly treated case of the soft amplitudes in textbooks is the case of an on-shell external electron line, which corresponds to taking . In this case there is a simple formula for , which is easily proved by induction:
Lemma 4.10**.**
Given a sequence of integers,
[TABLE]
We do not know any simple formula for in general.
5 Feynman diagrams
In quantum field theory, the calculus of Feynman diagrams provides algorithms for computing scattering amplitudes (with some caveats) and reasoning about physical processes. The role of Feynman diagrams in the theory of -categories is similar: they provide an algorithmic method for computing the higher -products on as well as a set of tools for reasoning about these products. The connection between -structures, homological perturbation and Feynman diagrams is well-known; see [26, 27], [28, p.42] and [20, §2.5]. However, in this context nontrivial examples with fully explicit Feynman rules accounting for all signs and symmetry factors and actual diagrams like Figure 3 below, are rare. For background in the physics of Feynman diagrams we recommend [43, Ch. 6], [34, §4.4] and for a more mathematical treatment [13].
The presentation of -products in terms of Feynman diagrams is most useful when the objects of are matrix factorisations of Koszul type, and so we will focus on this case below. Throughout we adopt the hypotheses of Setup 3.6, and we write
[TABLE]
Our aim is give a diagrammatic interpretation of the operators , as given for example in (3.5). Implicitly consists of many summands, obtained by expanding the and operators. Among the summands generated from (3.5) is for example
[TABLE]
The aim is to
- •
represent the space on which these operators act as a tensor product of exterior algebras and (completed) symmetric algebras, and
- •
represent the operators as polynomials in creation and annihilation operators (that is, as multiplication with, or the derivative with respect to, even or odd generators of the relevant algebras).
Once this is done we can represent the operator (5.2) as the contraction of a set of polynomials in creation and annihilation operators, with the pattern of contractions dictated by the structure of the original tree. The process of reducing this contraction to normal form (with all annihilation operators on the right, and creation operators on the left) involves commuting creation and annihilation operators past one another, and their commutation relations generate many new terms. Feynman diagrams provide a calculus for organising these terms, and thus computing the normal form. There are three classes of operators making up (5.2) which need to be given a diagrammatic interpretation:
- •
In Section 5.1 we represent as suggested above.
- •
In Section 5.2 we treat .
- •
In Section 5.4 we treat .
- •
In Section 5.5 we treat .
Finally, in Section 5.6 we give the Feynman rules and explain the whole process of computing with Feynman diagrams in an example.
5.1 Koszul matrix factorisations
Our Feynman diagrams will have vertices representing certain operators on for a pair of matrix factorisations of of Koszul type. This means that we suppose given collections of polynomials and in satisfying
[TABLE]
To these polynomials we may associate matrix factorisations defined as follows: we take odd generators , set and
[TABLE]
and then define
[TABLE]
We ultimately want to give a graphical representation of operators on the -module (5.1), for which relevant operators are polynomials in creation and annihilation operators. It is therefore convenient to rewrite in the form of an exterior algebra.
Lemma 5.1**.**
There is an isomorphism of -graded -modules
[TABLE]
defined by
[TABLE]
The contraction operator which removes from a wedge product in can be written or for short, but this is awkward. Even worse, the operation of wedge product in this exterior algebra cannot be safely abbreviated to because some of our formulas will involve precisely the same notation to denote the contraction operator on . So we introduce the following notational convention:
Definition 5.2.
We write for and so that as operators on we have
[TABLE]
The same conventions apply to and any other odd generators.
Using we may identify as a -graded -module with
[TABLE]
which we view as the tensor product of a -module of coefficients with the (completed) bosonic Fock space with creation and annihilation operators and fermionic Fock spaces with creation operators and annihilation operators respectively.
5.2 Diagrams for
In the notation of the previous section we now elaborate on the explicit formulas for in terms of creation and annihilation operators.
Lemma 5.3**.**
The operator which makes the diagram
[TABLE]
is given by the formula
[TABLE]
Proof.
By direct calculation. ∎
With this notation, the operator on corresponds to an operator on (5.5) given by the following formula (we use the superscript to record that this isomorphism is used to transfer )
[TABLE]
where for an element what we mean by is the -linear operator on which is the commutator of with the operator of Definition 4.3. By Lemma 4.5 we can write this explicitly in terms of the multiplication tensor of Definition 4.2 as
[TABLE]
where the coefficients are as in Definition 4.3, is our chosen -basis of and is the multiplication tensor. Reading as the operator of left multiplication by this monomial, we may write
[TABLE]
Next we describe the operators and for this we need to choose a particular homotopy with . Recall that is a quasi-regular sequence satisfying some hypotheses satisfied in particular by the partial derivatives of the potential , but other choices are possible. We assume here that our homotopies are chosen to be of the form
[TABLE]
for polynomials in which satisfy the equations
[TABLE]
Remark 5.4.
If then satisfy these requirements and hence define a valid sequence of homotopies .
The operator of Definition 3.10 acts by post-composition with , and so the corresponding operator on (5.5) under is by the same calculation as Lemma 5.3 given by the formula (5.9). In this notation (again using a superscript to indicate the transfer)
[TABLE]
Combining (5.6) and (5.8) yields:
Lemma 5.5**.**
The critical Atiyah class may be presented using as an operator on (5.5) given by the sum of the four terms given below, each of which is itself summed over the indices and :
[TABLE]
Schematically, we can write
[TABLE]
Combining (5.10) and (5.8) yields:
Lemma 5.6**.**
The operator may be presented using as an operator on (5.5) given by the sum of the two terms given below, each of which is itself summed over the indices and :
[TABLE]
Schematically, we can write
[TABLE]
Each of these monomials in creation and annihilation operators is associated with its own type of interaction vertex in our Feynman diagrams. Eventually these vertices will be drawn on the same trees used to define the -products and they will be given a formal interpretation by the Feynman rules, but for the moment they are just pictures. In our description we tend to imagine time evolving from from top of the page (the input) to the bottom (the output). At an interaction vertex associated with a monomial, each annihilation operator becomes an incoming line (entering the vertex from above) and each creation operator becomes an outgoing line (leaving the vertex downward). Different line styles are used to distinguish creation and annihilation operators of different “types”.
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
We refer to the vertices (5.11)-(5.14) arising from the Atiyah class respectively as A-type vertices (A.1, A.2, A.3, A.4) and the vertices (5.16),(5.17) arising from as C-type vertices (C.1, C.2). There are also B-type vertices given by the operator .
Remark 5.7.
Some remarks on these diagrams:
- •
We do not think of the vectors in as states of literal particles (this word is generally reserved for state spaces transforming as representations of the inhomogeneous Lorentz group [43]) but the physics terminology is convenient and we sometimes refer to bosons (the ) and fermions (the ). Another useful concept is that of virtual particles which is a term used to refer to lines propagating in the interior of Feynman diagrams. In our diagrams this role is played by the bosons and fermions (hence the virtual degree of Definition 3.9) which represent the degrees of freedom that are being “integrated out” by the process of computing the -products.
- •
Following standard conventions bosons (commuting generators) are denoted by wiggly or dashed lines, and fermions (anticommuting generators) by solid lines [34, §4.7] (perhaps doubled). For simplicity we distinguish the and lines only by their labels and we write for a line labelled . Strictly speaking a squiggly line labelled should be interpreted as lines labelled for . We use the orientation on a fermion line to determine whether it should be read as a creation or annihilation operator for (downward) or for (upward).
- •
Each vertex above actually represents a family indexed by possible choices of indices. If we wish to speak about a specific instance we use subscripts, for example is the interaction vertex with an incoming and outgoing .111Depending on the matrix factorisations involved, some families of A or C-type interaction vertex may be infinite. For example, if is nonzero for infinitely many there may be infinitely many vertices with nonzero coefficients. However only finitely many distinct types of interaction vertices can contribute for any particular tree . If has leaves there are internal edges and hence occurrences of in the associated operator. In terms of Feynman diagrams, that means there are precisely B-type interactions. Since each that is generated in a Feynman diagram must eventually annihilate with a at a B-type interaction vertex, and each interaction vertex with indices generates either or copies of the ’s, only coefficients with contribute. In short, larger trees can support more “virtual bosons” and more complex interactions.
5.3 Alternative isomorphism
We have used the isomorphism to present operators on as creation and annihilation operators. In the case there is an alternative isomorphism which leads to less interaction vertices.
Lemma 5.8**.**
There is an isomorphism of -graded -modules
[TABLE]
where on the right hand denote the usual operators and .
Remark 5.9.
Let be the -graded algebra generated by odd for subject to the relations and . We denote multiplication in this Clifford algebra by . There is an isomorphism of -graded -modules
[TABLE]
Making this identification, is the linear map underlying an isomorphism of the Clifford algebra with the endomorphism algebra of . In particular, the diagram
[TABLE]
commutes, where on the left is the multiplication in the Clifford algebra.
Lemma 5.10**.**
The diagrams
[TABLE]
commute, where graded commutators are in the algebra .
Proof.
By direct calculation. ∎
Lemma 5.11**.**
The operator which makes the diagram
[TABLE]
is given by the formula
[TABLE]
Proof.
By definition the differential is
[TABLE]
so this is immediate from Lemma 5.10. ∎
Using we may identify as a -graded -module with
[TABLE]
With this notation, the operator on corresponds to
[TABLE]
With the same conventions about as above, we have
[TABLE]
The operator acts on by post-composition with , that is to say, by left multiplication in the endomorphism ring, and since is an isomorphism of algebras the corresponding operator on (5.20) using is
[TABLE]
where means multiplication in the Clifford algebra structure on . It is easily checked that as operators on this tensor product, we have
[TABLE]
with the usual convention that means and means . So finally
[TABLE]
Lemma 5.12**.**
The critical Atiyah class may be presented using as an operator on (5.20), given by the sum of the four terms below, each of which is itself summed over the indices and :
[TABLE]
Lemma 5.13**.**
The operator may be presented using as an operator on (5.20) given by the sum of the two terms given below, each of which is itself summed over the indices and :
[TABLE]
The B-type interaction is as before. The other interactions are
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
5.4 Diagrams for
A power of will contribute a sequence of A-type interactions together with the scalar factors analysed in Section 4.2. To put these factors in the context of Feynman diagrams, consider a power contributing A-type vertices, each of which emits a , some monomial , and acts in some way on the rest of which we ignore. Such a process is depicted generically in Figure 2 and the factor contributed by this diagram is
[TABLE]
There is also an occurrence of as in , which contributes a scalar factor immediately after every B-type vertex. To be precise, will contribute
[TABLE]
5.5 Diagrams for
Finally, we require a diagrammatic representation for the composition
[TABLE]
In addition to the spaces and underlying the matrix factorisations we now introduce odd generators , and set
[TABLE]
underlying a Koszul matrix factorisation .
Lemma 5.14**.**
For and
[TABLE]
First we explain how to represent diagrammatically. The following lemmas are proven by straightforward direct calculations, which we omit.
Lemma 5.15**.**
The diagram
[TABLE]
commutes, where denotes the projection onto the subspace with no ’s or ’s.
Lemma 5.16**.**
The diagram
[TABLE]
commutes, where denotes the projection onto the subspace with no ’s and is multiplication in the exterior algebra.
Lemma 5.17**.**
The diagram
[TABLE]
commutes, where projects onto the subspace with no ’s and is multiplication in the exterior algebra. The operator in the exponential acts on the third tensor factor.
These lemmas allow us to represent the part of as a boundary condition together with new types of interaction vertices. From Lemma 5.15 we obtain the (D.1)-type vertex, in which couples an incoming in the right branch with an incoming (which we view as an travelling upward) in the left branch. From Lemma 5.16 we obtain the (D.2)-type vertex, which has a similar description. To these interaction vertices we add the (D.3)-type vertex, which represents the part of the operator in Lemma 5.14 (keeping in mind that the incoming and are on the left and right branch at an internal vertex of the tree, respectively):
[TABLE]
Note that in the “mixed” cases of Lemma 5.16 and Lemma 5.17 there are still multiplication operators in the final presentation. For example the in Lemma 5.16 means that an upward travelling entering the vertex can either continue upwards into the left branch, or into the right branch. More precisely, since is a graded derivation . A similar description applies to the in Lemma 5.17.
5.6 The Feynman rules
We now integrate the previous sections into a method for reasoning about higher operations using Feynman diagrams. We fix matrix factorisations which we assume to be Koszul with underlying graded -modules . Once we choose for each pair and either or to present the mapping spaces as a tensor product of exterior algebras, the higher operation is a -linear map
[TABLE]
which is a (signed) sum of operators for binary plane trees with inputs. According to Lemma 4.1 evaluating involves applying to the input . We develop a diagrammatic understanding of the evaluation of on this tensor, via Feynman diagrams embedded in a thickening of the mirror tree . Given a basis vector
[TABLE]
we wish to know the coefficient of in the evaluation , which we denote
[TABLE]
The description of diagrams contributing to is reached in several stages, which are summarised by the Feynman rules in Definition 5.18. To explain the algorithm it will be helpful to keep in mind the data structure
[TABLE]
This data structure will be modified as we proceed, but it will always be a sequence of tuples consisting of a scalar , an output basis vector , a -linear operator with the same domain and codomain as , and an input basis vector . Each time we modify the sum will remain invariant, that is, we will always have
[TABLE]
In the following “the tree” means unless specified otherwise.
Stage one: expansion. Recall is defined as a composition of operators
[TABLE]
which may be written, with some signs and factorials, in terms of the operators222For the reader’s convenience, here is a cheatsheet: for see Section 4.2, is the Atiyah class of Definition 3.8, the chosen connection from Corollary A.6, the chosen section of the quotient map , for see Definition 3.10, is ordinary composition in .
[TABLE]
The signs and factorials involved are accounted for carefully in Definition 5.18 below; for clarity we omit them in the present discussion. Choose a presentation or for each edge in . We expand occurrences of using (5.11)-(5.14),(5.16),(5.17) on the edges of the tree for which has been chosen and (5.24),(5.25),(5.26),(5.27) on the edges for which is chosen. We replace the occurrences of using the lemmas of Section 5.4 with additional exponentials, occurrences of and contributions from (D.3) vertices. Next we absorb the and from (5.35) into the operator decorated tree, by writing the input tensors as products of creation operators and the projection as a product of annihilation operators followed by the projection (here we assume for simplicity that in the chosen basis for ). In the resulting expression the remaining terms that are not creation and annihilation operators are occurrences of and the multiplications on exterior algebras from Lemma 5.16 and Lemma 5.17. Since the relevant virtual degrees are now all fixed, we can calculate the scalar contribution from the operators and absorb them into the coefficients. Hence we can replace by a sequence of tuples
[TABLE]
in which every is the denotation of an operator decorated tree (in the sense of Definition D.5) with operators taken from the list (here stand for any fermionic generator coming from the matrix factorisations themselves, so we do not separately list )
[TABLE]
This completes the expansion stage.
Stage two: reduction to normal form. The operators in are denotations of trees decorated by monomials in creation and annihilation operators. Such an operator (or more precisely the decoration from which it arises) is said to be in normal form if any path from an annihilation operator in the tree to an input leaf encounters no creation operators (roughly, annihilation operators appear to the right of creation operators). After stage one the operators are not in normal form, and we now explain a rewrite process which transforms such that after each step (5.37) holds, and the process terminates with the operator in every tuple of in normal form. During some steps of the rewrite process a tuple is replaced by a pair , because the rewriting is “nondeterministic” in the sense that it involves binary choices. A Feynman diagram is a graphical representation of such binary choices made during rewriting.
Here is the informal algorithm for the rewrite process: take the first tuple in which contains a fermionic annihilation operator, and let be the one occurring closest to the root (so is or ) and use the available (anti)commutation relations to move it up the tree past the other operators in (5.38), changing the sign of as appropriate. The only nontrivial anticommutators that we encounter are:
- (a)
meets and generates two additional terms
[TABLE]
- (b)
meets and generates two additional terms
[TABLE]
- (c)
meets the input .
In (a), (b) the tuple is replaced in by two new tuples, in which the decoration of the tree differs from the one determining only in the indicated way (changing the coefficient by a sign if is replaced by ). In (c) we remove the tuple from , since it contributes zero to . The meaning of the pictures will become clear later. We say the occurrence of in these new tuples is descended from the original and we continue the process of commuting these descendents upwards until in there are no tuples containing operators descended from our original annihilation operator. Once this is done we return to the beginning of the loop, choosing a new fermionic annihilation operator in as our . This part of the algorithm terminates when there are no fermionic annihilation operators remaining in . It is possible that is now empty, so that and the overall algorithm terminates.
We next treat the occurrences of the bosonic annihilation operators in the same way, with the only nontrivial commutation relation being which generates two new tuples in . The operators act on the next to give scalar factors . This part of the algorithm terminates when there are no annihilation operators remaining, that is, we have replaced by a sequence of tuples in which every is the denotation of an operator decorated tree with operators taken from
[TABLE]
Since we apply and at the bottom of our diagrams, we do not change the coefficient (5.37) if we delete from any tuple in which contains a creation operator. After doing so, the remaining tuples all have the same decoration by ’s and and hence the same operator , so at the completion of the second stage we have replaced by a set
[TABLE]
where is some index set. Hence .
Stage three: drawing the diagram. An index contains the information of a sequence of binary choices made at each nontrivial step of the rewrite process: for example, the choice to replace by either or , where is one of . The tuple to which this choice refers has a unique ancestor among the tuples in at the end of stage one. In that ancestor tuple, the creation operator is associated with a particular monomial inserted at a location on , and the annihilation operator is associated with a monomial at some other location. By construction occurs lower on the tree than . These monomials are precisely the interaction vertices to which we have assigned names and diagrams above.
To encode the information in diagrammatically, we draw all the interaction vertices (in the unique ancestor of the tuple among the tuples of stage one) at the location that they occur in the decoration of . Each incoming line labelled to such an interaction vertex is uniquely associated by the choices in with an outgoing line labelled at some vertex higher up the tree, namely, the first and only creation operator where chooses rather than for the annihilation operator whose ancestor is the chosen incoming line. We connect the two interaction vertices by joining them with a line labelled . The resulting diagrammatic representation of is called a Feynman diagram, see Figure 3 for an example.
In summary, we have the following Feynman rules for enumerating Feynman diagrams and computing their coefficient . See [43, §6.1] for real Feynman rules in QFT.
Definition 5.18 (Feynman rules).
The coefficient is a sum of coefficients associated to Feynman diagrams . To enumerate the possible Feynman diagrams, first draw in order on the input leaves and on the root of , as sequences of incoming and outgoing particle lines. Then choose for each
- •
input a sequence of A-type vertices, then a sequence of C-type vertices (from ).
- •
internal vertex a sequence of vertices of type (D.1),(D.2) and exactly one (D.3) vertex (this arising from multiplication in ).
- •
internal edge a sequence of C-type vertices, then a single B-type vertex, then a sequence of A-type vertices and a sequence of C-type vertices (from ).
- •
and for the outgoing edge a sequence of C-type vertices (from ).
Draw the chosen interaction vertices on the thickened tree and choose a way of connecting outgoing lines at vertices to incoming lines of the same type lower down the tree. Since the only lines incident with the incoming and outgoing boundary of the tree are those arising from the and no “virtual particles” (’s or ’s) may enter or leave the diagram. In each case the number of A, C, D-type vertices chosen may be zero, but every internal edge has precisely one B-type vertex. These choices parametrise a finite set of Feynman diagrams . The coefficient contributed by the Feynman diagram is the product of the following five contributing factors:
- (i)
The coefficients associated to each A,C-type interaction vertex as given above (for example the vertex has coefficient multiplied by the scalar arising from the partial derivative ).
- (ii)
For each sequence of C-type vertices a factorial and if the sequence immediately preceedes a B-type vertex or the root, a sign (from versus ).
- (iii)
factors from operators (see Section 5.4).
- (iv)
For each time two fermion lines cross, a factor of .
- (v)
For each A-type vertex a factor of (from the in ).
Remark 5.19.
Recall that we draw an interaction vertex with an outgoing line labelled in our pictures, the convention is that such a line stands for separate lines labelled for some . The above description of the Feynman rules involves choosing, for each such , a series of B-type vertices to pair with each of these lines.
This leads to otherwise identical diagrams, in which the only difference is which of the lines labelled is paired with which vertex. The usual convention is to draw just one such diagram, counted with a symmetry factor .
Remark 5.20.
The rules involve sequences of A and C-type interactions: different orderings are different Feynman diagrams. In general the Feynman diagrams associated to different orderings have because the interaction vertices are operators that do not necessarily commute. In practice, however, one can often infer that the incoming state to a particular edge is constrained to lie in a subspace on which all the relevant operators do commute, in which case the different orderings can be grouped together and counted as a single diagram with an appropriate symmetry factor (cancelling, in the C-type case, the scalar factor of (ii) in the Feynman rules).
The situation for a length sequence of A-type vertices is more subtle, because these arise from powers of and the operators arising from do not commute with . However, when the incoming state lies in a subspace to which Lemma 4.7 applies, we can group together permutations of the vertices and the factors become a symmetrised . This applies in the context of Section 6.
Example 5.21.
Consider the potential and matrix factorisations
[TABLE]
so . We set and choose our connection and operators as in Example A.8 with . For the homotopies we use the default choices of Remark 5.4, so that
[TABLE]
To compute the coefficients associated to all the interaction vertices, we need to compute for various the coefficients (see Definition 4.3) as well as the tensor . This involves fixing the -basis that is, for , and the section . Then for example
[TABLE]
and in general for . Since all the polynomials occurring in have degree these coefficients are all easily calculated as delta functions in this way. The tensor encodes the multiplication in and is given by Definition 4.2 for by
[TABLE]
To present interaction vertices as creation and annihilation operators we use on all edges of the tree involving pairs and and on edges involving . Such edges involve ’s travelling downward and ’s travelling upward, and the interactions with their coefficients are (recall our convention is to write for in these diagrams):
[TABLE]
[TABLE]
[TABLE]
On the edges involving purely, where we are using the presentation, we have the following interaction vertices (we omit the B-type which is as above):
[TABLE]
[TABLE]
[TABLE]
On edges involving purely, where again we use the presentation, we have:
[TABLE]
[TABLE]
[TABLE]
Suppose we want to evaluate the forward suspended product
[TABLE]
on an input tensor
[TABLE]
We examine one Feynman diagram contributed by our standard tree of Figure 3.5. We are in the situation examined in the proof of Lemma 4.1, with
[TABLE]
Next we expand the exponentials and , among the summands is
[TABLE]
If we now further expand among the summands is
[TABLE]
which are, reading from left to right, the vertices and . Next we replace all occurrences of according to Section 5.5. Among the summands are (we omit the boundary condition operators for legibility)
[TABLE]
Now we commute the leftmost fermionic annihilation operator to the right. The only nonzero contribution is when this pairs with the next . The leftmost has to annihilate with the closest , the has to annihilate with the , and so on. There is only one pattern of contractions which has a nonzero coefficient, and the pairings of fermionic creation and annihilation operators is shown in the diagram
The corresponding Feynman diagram with outgoing state is shown in Figure 3. If we had taken as our outgoing state in the Feynman rules, then this Feynman diagram would be one of the contributors to and its contribution is .
6 The stabilised residue field
In this section we sketch how our approach recovers the usual -minimal model [38, 14, 16, 39] of when is a field, as an illustration of an example where may be split by hand. Let be a characteristic zero field, a potential and the DG-category with the single object
[TABLE]
for some chosen decomposition where . Hence
[TABLE]
This Koszul matrix factorisation is a classical generator of the homotopy category of matrix factorisations over as was shown first by Schoutens in the setting of maximal Cohen-Macaulay modules [36] and then rediscovered by Orlov [33] (see [38, Lemma 12.1]) Dyckerhoff [14, Corollary 5.3] and others [23, Proposition A.2]. In Setup 3.6 we take:
- •
so .
- •
meaning as usual .
- •
is the inclusion of scalars, and .
It can be shown that
[TABLE]
where , and hence in the operator decorated trees computing the higher operations we can remove all the occurrences of at the cost of replacing at each internal vertex by . Under the isomorphism of Lemma 5.8
[TABLE]
the differential on the right hand corresponds on the left hand side to
[TABLE]
by Lemma 5.10. Moreover under the operator corresponds to , so is a family of interaction vertices that allows a downward travelling on the left branch to convert into an upward travelling on the right. We identify with with zero differential. The Atiyah classes as operators on are
[TABLE]
Together with these Atiyah classes form a representation of the Clifford algebra, which determines a subspace such that
[TABLE]
For example, if so that then . This subspace is closed under the higher operations on since neither nor can introduce a . It follows that equipped with the restricted operations is a minimal -category which splits the idempotent .
Appendix A Formal tubular neighborhoods
In this section we introduce the geometric content of the strong deformation retract which forms the basis of this paper, based on the idea of a formal tubular neighborhood [12, 29]. We begin with a brief introduction to quasi-regular sequences, for more on which see [25, §15.B], [19, Chapitre [math] §15.1] and [45, Section 10.68].
Definition A.1.
A sequence in a commutative ring is quasi-regular if, writing , the morphism of -algebras
[TABLE]
is an isomorphism. In particular, this means that .
We recall the motivation for this definition from algebraic geometry.
Remark A.2.
Let be a Noetherian scheme and let be a closed subscheme with ideal sheaf . The first-order deformations of in are controlled [18, Theorem VI-29] by the normal sheaf .
In general, the full description of the space of normal directions to in requires more than just the normal sheaf. The correct approach is to start with the blowup of along (which is described by a universal property) and then look at the closed subscheme of that blowup induced by , as in the diagram:
[TABLE]
The closed subscheme of the blowup (called the strict transform of ) is given by the relative Proj of the sheaf of graded algebras on , and its points give the correct notion of a point on together with a normal direction in . For this reason the scheme , whose projectivisation is the strict transform of in the blowup, is called the normal cone of in .
Thus, to say that a sequence is quasi-regular is to say that the projectivised normal cone of in is the space of lines in the normal bundle, since the definition of quasi-regularity gives
[TABLE]
Recall that in differential geometry if we are given a submanifold of a smooth manifold the tubular neighborhood theorem [22, §4.5] identifies an open neighborhood of the zero section of the normal bundle with an open neighborhood of in .
There is no direct analogue of this identification of neighborhoods for a general closed immersion of schemes. Let us discuss what such an identification would mean at the level of formal neighborhoods in the affine case, assuming that is generated by a quasi-regular sequence. Completing the normal cone along the zero section means completing in the -adic topology, while completing along means taking the -adic completion of , so that such an identification would amount to an isomorphism of topological rings
[TABLE]
where denotes the -adic completion. It easy to produce examples where this fails:
Example A.3.
Let be a field, and for . Since the -adic topology is the same as the -adic topology, since one ring is reduced while the other is not.
However, if is smooth [25, Definition 28.D], so that we are in a situation more resembling the one in differential geometry, there is indeed an isomorphism of topological rings of the form (A.1) (see e.g. Lemma A.5 below). This formal tubular neighborhood theorem was developed in the noncommutative setting by Cuntz-Quillen [12, Theorem 2].
In our applications, however, Example A.3 is more typical, as is generated by the partial derivatives of a potential and the critical locus of a potential is rarely smooth. While in general there is no strong analogue of the tubular neighborhood theorem, Lipman proves in [29] that the cases we care about, there is still an isomorphism of -modules, and this is enough to produce connections.
Setup A.4**.**
For the rest of this section let be a commutative -algebra, a -algebra, and let be a quasi-regular sequence in such that, writing , the quotient is a finitely generated projective -module.
Lemma A.5**.**
Any -linear section of the quotient induces an isomorphism of -modules
[TABLE]
where denotes the -adic completion. If further is smooth over then there exists a section such that is an isomorphism of topological -algebras.
Proof.
This is [29, Lemma 3.3.2]. The map is induced from by extension of scalars, where acts on by making act as multiplication by . The main point is that every has a unique representation as a power series
[TABLE]
for elements , and the inverse to sends to . The uniqueness of (A.2) is a consequence of quasi-regularity, while the existence is proven as follows: given we have and so there exist with
[TABLE]
Applying the same argument to each yields
[TABLE]
This process converges in the -adic topology to a series (A.2). If is smooth then by a standard argument [25] we can produce a section which is a morphism of -algebras. It is clear then that is an isomorphism of topological algebras. ∎
Recall from [30, §8.1.1] the notion of a connection on a module. As alluded to above, we can use the isomorphism of Lemma A.5 to produce connections. For a more complete discussion on this point, see [15, Appendix B].
Corollary A.6**.**
Associated to any -linear section , there is a -linear connection on as a -module, where acts as multiplication by :
[TABLE]
Proof.
The usual partial derivatives give a -linear connection on as a -module which extends, by Lemma A.5, to a connection on , see [30, §8.1.3]. In terms of the power series representation (A.2) the connection is given by
[TABLE]
which completes the proof. ∎
Definition A.7.
With a section fixed, we will write for the associated connection . We also introduce -linear operators by the identity . The operators depend on the choice of section , but we will abuse notation and write
[TABLE]
Example A.8.
Let be a field, and , with . Choose the -linear section defined by for . Then
[TABLE]
In an important class of examples there is an explicit algorithm for computing and thus the derivatives for any element .
Remark A.9.
Suppose that is a characteristic zero field, and . Choose a monomial ordering for and let be a Gröbner basis for , which may be computed from the polynomials by Buchberger’s algorithm [11, §2.7]. Moreover this algorithm also computes an expression for .
Following the notation of [11] we write for the remainder on division of by . This is the unique polynomial with no term divisible by any of the leading terms of the , and for which there exists with [11, §2.6]. The generalised Euclidean division algorithm produces together with polynomials such that
[TABLE]
It is easy to check that the function
[TABLE]
is well-defined and is a -linear section of [11, Corollary 2, §2.6]. This means that (A.6) is the desired expression in (A.3) used to generate the ’s. So for example in the case we take and for in the case we have
[TABLE]
Observe that the monomials with not divisible by any of the leading terms of the give a -basis of . Denote the set of such tuples by . Then and , generalising Example A.8.
What we have already said computes the coefficients of in the basis in the cases where . For the cases where we simply have to run the division algorithm with in place of in (A.6). Proceeding in this way constitutes an algorithm for computing the coefficient of in for any .
The upshot is that when is a field, the map
[TABLE]
sends to a power series whose coefficients are obtained by iterated Euclidean division of by a Gröbner basis of . When is not a field, it is not obvious how to calculate the algorithmically.
A.1 Analogy to the Euler field
In this section we are in the situation of Setup A.4. The Koszul complex of the sequence over is (K,d_{K})=\big{(}\bigwedge(k\theta_{1}\oplus\cdots\oplus k\theta_{n})\otimes\widehat{R},\,\,\sum_{i}t_{i}\theta_{i}^{*}\big{)}. By identifying with we identify with . For the remainder of the section we fix a section and associated connection . We have the following -linear operator on :
[TABLE]
Using (A.5) we have explicitly where .
Lemma A.10**.**
If is smooth, may be chosen such that is a derivation of .
Proof.
Suppose is an algebra morphism. Then for we have
[TABLE]
and hence . From this the claim follows. ∎
Recall that for a submanifold , any tubular neighborhood of in determines an open neighborhood of and on this open neighborhood a vector field induced by the Euler field on , which is the infinitesimal generator of the scaling action of in the fibers. In local coordinates where are the coordinates in the fiber directions. Conversely, the integral curves of the vector field determine the tubular neighborhood [6, §2.3] and, in particular, gives rise to a deformation retract of onto .
When is smooth, the derivation is in light of (A.7) clearly analogous to . In general will not be a derivation, but nonetheless the operators still give rise to a deformation retract of onto in a sense that we will make precise below.
Example A.11.
In the situation of Example A.8 observe that is not a derivation, as for example but .
Let us now examine the way in which, in the smooth setting, the vector field gives rise to idempotents. The Lie derivative gives rise to an idempotent linear operator on the bundle which is a splitting of the exact sequence
[TABLE]
While the Lie derivative with gives an idempotent operator on vector fields, it is not idempotent on smooth functions. However, a rescaling of its action on smooth functions does give an idempotent, the corresponding algebra being the following:
Remark A.12.
Consider the following diagram of -linear operators
[TABLE]
where is the quotient map, and denotes the extension of to an operator on . It is easy to check that
[TABLE]
and hence . So while is not an idempotent operator on , the rescaled operator is an idempotent, which splits as a -linear direct sum .
Appendix B Proofs
In this section we prove Theorem 3.11 and Theorem 3.15. All notation is as in Setup 3.6, and more generally as in Section 3. For example denotes the DG-category of matrix factorisations of and is the extension of (3.1). The proofs mostly consist of applying the techniques already developed in [15, 31] using homological perturbation to the situation at hand, but there are two technical points worth noting:
- (i)
In [31] the quasi-regular sequence is always .
- (ii)
In [31] there is an assumption that is Noetherian.
We explain in Appendix C why the Noetherian hypothesis is not necessary. Regarding (i), we reiterate the relevant parts of [31] below in the current generality (that is, the hypotheses of Setup 3.6) where is not necessarily . The upshot is that the only place where the hypothesis that plays any meaningful role is in the final form of the Clifford operator and we address this explicitly in the proof of Theorem 3.15.
The aim is to put a strict homotopy retract [28, §3.3] on , where
[TABLE]
The -adic completion of has as a quasi-regular sequence and . By [15, Appendix B] there is a standard flat -linear connection
[TABLE]
where denotes the polynomial ring in variables . Let . We run through the steps of [31, §4.3] with our new notation for , and the complex replacing (see [31, §4.5] which also discusses this special case). The role of in loc.cit is now played by . In the first step extends to a -linear operator on . Choosing a homogeneous -basis for and taking the induced basis on over , and extending , we get a -linear splitting homotopy
[TABLE]
where (K,d_{k})=\big{(}\bigwedge F_{\theta}\otimes R,\sum_{i=1}^{n}t_{i}\theta_{i}^{*}\big{)} and we identify with . This splitting homotopy corresponds to the strong deformation retract (with homotopy )
[TABLE]
In the second step we view , the differential on , as a perturbation and we learn that
[TABLE]
is a -linear splitting homotopy, to which is associated the following -linear strong deformation retract of complexes (with homotopy )
[TABLE]
where
[TABLE]
In the third step, since each acts null-homotopically on we have an isomorphism of complexes over
[TABLE]
where . Note we do not assume that is a partial derivative of . In the fourth step the canonical map is by Lemma 3.5 (based on [15, Remark 7.7]) a homotopy equivalence over . Hence we have homotopy equivalences of -complexes, combining the above
[TABLE]
Note that is by our hypotheses a -graded complex of finite rank free -modules. Next we argue that (B) gives a strict homotopy retraction of . With this in mind the overall content of (B) is a -linear homotopy equivalence
[TABLE]
where we have and where
[TABLE]
By construction we have:
Lemma B.1**.**
The data consisting of
[TABLE]
form a strict homotopy retract on the DG-category in the sense of [28, §3.3].
Proof of Theorem 3.11.
By homological perturbation [28, §3.3, p.33] (see also [37, §I] and particularly [37, Remark 1.15]) applied to the strict homotopy retract of the lemma, we obtain forward suspended -products defined on the family of spaces
[TABLE]
which make into an -category. These higher products have the given description in terms of sums over trees decorated by but the description of used in Definition 3.10 differs from that given in (B.2), (B.1) above and we have to address this discrepancy. This uses an argument that first appeared in a slightly different form in [15, (10.3),(10.4)]. We set so that
[TABLE]
Now , and hence we can replace any string by the string and so
[TABLE]
In the same way we obtain the form of given in Definition 3.10. Finally, the fact that may be computed by the formula of Definition 3.9 is easily checked.
From the theory of homological perturbation we also obtain -functors with and an -homotopy , see [32]. It remains to check strict unitality. Clearly is strictly unital, since it is a DG-category. Now we apply [28, p.37] which shows that is strictly unital, provided and for all units . The first condition follows because we have a strong deformation retract (not just a strict homotopy retract in the sense of [28]) and the second condition because
[TABLE]
and hence since and . ∎
Proof of Theorem 3.15.
We have so that . These transfers were studied in [31] quite generally, but the final formulas were given only in the special case where , and our job here is to recapitulate the argument to the degree that is necessary to derive the general formula and exhibit that everything we need from [31] works in full generality.
Firstly observe that since there is a -linear homotopy
[TABLE]
From [31, Lemma 4.17] we get and [31, Theorem 4.28] gives
[TABLE]
Next we copy elements from the proof of [31, Proposition 4.35]. Throughout means defined as in [15] with respect to the ring morphism . Note that in the formula (B.7) for the Atiyah class is -linear and so, using that as an operator on the operator has the property that modulo
[TABLE]
we may calculate
[TABLE]
So far this is an equality of operators on the complex , but we can now apply the fact that Atiyah classes anti-commute up to -linear homotopy (the argument of [31, Theorem 3.11] applies) to see that
[TABLE]
To conclude we apply this to the operators and exactly as in [31, Proposition 4.35]. ∎
Appendix C Removing Noetherian hypotheses
In [31] there is a hypothesis that the base ring is Noetherian. This is not necessary, and we explain how to remove it. Along the way we prove Lemma 3.5. Throughout is a commutative -algebra and a -algebra, and is a quasi-regular sequence in with . We write for the -adic completion. It is well-known that the sequence is quasi-regular in and that the canonical map is an isomorphism; see for example [25, §15.B], [19, Chapitre [math] §15.1].
Lemma C.1**.**
Suppose that
- (i)
* are projective -modules.*
- (ii)
The Koszul complex of over is exact in nonzero degrees.
Then if is any -linear section of the quotient map and is is the canonical morphism of complexes then there is a degree -linear operator on as in the diagram
[TABLE]
such that
- •
,
- •
**
- •
.
Proof.
Since and are projective over , the Koszul complex may be decomposed into a series of split short exact sequences, and is easily constructed from these splittings with the desired properties. ∎
Next we observe that [15, Remark 7.7] holds in greater generality.
Remark C.2.
Let be a ring morphism, and a matrix factorisation of over (again, not necessarily finite rank), a quasi-regular sequence in with , and homotopies . We assume that there is a deformation retract (of -graded complexes) over
[TABLE]
satisfying where is the canonical map. By the previous lemma, it suffices for this to assume that are projective over and that is exact except in degree zero. Let be any ring morphism such that
- •
is quasi-regular in
- •
the induced map is an isomorphism
- •
there is a deformation retract (of -graded complexes over )
[TABLE]
satisfying where is the Koszul complex over .
Then the canonical morphism of linear factorisations of over , is an -linear homotopy equivalence. Here is the proof (note that we are not assuming is flat, as is done in [15, Remark 7.7]). The results of [15] show that we have homotopy equivalences over (where )
[TABLE]
and the canonical -linear map is an isomorphism, by hypothesis. It is clear that the canonical -linear map induces a commutative diagram
[TABLE]
hence a homotopy commutative diagram in the notation of [15])
[TABLE]
If we produce using the homotopies as explained in [15, §4] then it is also clear that the following diagram commutes
[TABLE]
So in summary both squares in the following diagram commute in
[TABLE]
Now and in the homotopy category, and the above shows that (identifying with as these are isomorphic, not just homotopy equivalent). Since they split the same idempotent, must be isomorphic in and so the middle column in the above diagram is a homotopy equivalence, as claimed.
In [31] we assumed the ground ring was Noetherian. The only reason for this hypothesis was to guarantee that the ring homomorphism is flat, which allows us to use [15, Remark 7.7] to infer that the canonical map is a homotopy equivalence, in [31, §4.3]. Using Remark C.2 above we explain why everything in [31] holds for any commutative -algebra.
We assume we are in the context of [31, Setup 4.1] and in particular that are potentials in the sense of [10, Definition 2.4]. Set for . By hypothesis this is a quasi-regular sequence in , is a finitely generated projective -module, and is exact outside degree zero. We claim that Remark C.2 applies to
[TABLE]
We check each of the hypotheses in turn:
- •
By Lemma C.1 since are projective -modules and is exact outside degree zero we have a deformation retract (C.1) satisfying the necessary conditions.
- •
Applying [15, Appendix B] to the tuple gives an isomorphism of -modules
[TABLE]
Observe that via as complexes of -modules, and in particular is exact outside degree zero. Moreover using connections we may produce a deformation retract (C.2) of the form required by Remark C.2.
The conclusion is that in the canonical map
[TABLE]
is an isomorphism, as claimed. This removes the Noetherian hypothesis from [31].
Proof of Lemma 3.5.
This is a special case of the above: we apply Remark C.2 to
[TABLE]
Notice that in the above need not be the sequence of partial derivatives, provided it satisfies the conditions set out in Setup 3.6. ∎
Appendix D Operator decorated trees
Here we collect some standard material on decorated trees. A tree is a connected acyclic unoriented graph. All our trees are finite. A rooted tree is a tree in which a particular leaf vertex (meaning a vertex of valency ) has been designated the root. We view a rooted tree as an oriented graph by orienting all edges towards the root, that is, in the direction of the unique path to the root. The children of a vertex are those vertices for which is the next vertex on the path from to the root. If is a child of we call the parent of . A plane tree is a rooted tree together with a chosen linear order for the set of children of each vertex . A morphism in the category of plane trees is a morphism of oriented graphs which preserves the root vertex and the ordering on children. A plane tree is valid if it has leaves (including the root) for some and all non-leaves have valency at least three. We call leaves external vertices, non-leaves internal vertices, the edges meeting a leaf are external edges and the others are internal edges.
Definition D.1.
is the set of isomorphism classes of valid plane trees with leaves. We denote by the set of isomorphism classes of valid plane binary trees, that is, trees in which every non-leaf vertex has valency three.
Let be a commutative, associative (but not necessarily unital) ring. When we speak of graded -modules we mean either or -graded.
Definition D.2.
An -linear decoration of a plane tree is the following data:
- •
a graded -module for each leaf (including the root).
- •
a graded -module for each edge .
- •
for each internal vertex with incoming edges (in order) and outgoing edge an integer (in or ) and a degree -linear map
[TABLE]
- •
for each non-root leaf vertex a degree zero -linear map where is incident at .
- •
a degree zero -linear map where is incident at , the root vertex.
Definition D.3.
Let be any plane tree and an -linear decoration of . Let be the root vertex and the vertex adjacent to . Suppose has valence (possibly ). Consider the diagram
We define plane trees to be (note is not in )
where is some new vertex, which we declare to the root of . We make a plane tree using the ordering from , and decorate according to the decoration which agrees with and assigns from to and also and as in .
Definition D.4.
Given an -linear decoration of the denotation is a homogeneous -linear map where denote the non-root leaves (in order) defined as follows:
- •
if has one edge, then .
- •
otherwise we define recursively
[TABLE]
using the branch decomposition of Definition D.3. Note that this is a tensor product of homogeneous operators on graded -modules, and obeys the usual Koszul sign convention when evaluated on a homogeneous tensor.
Note that this denotation differs by signs from another natural evaluation of the diagram, which composes operators by organising them according to their height in the tree, rather than their branch (as we have done).
Definition D.5.
Let be a plane tree, a decoration and the modules assigned to the leaves so that . We define
[TABLE]
to be the -linear map associated to as a diagram in the category of -modules, ignoring the grading. Recursively, if has one edge and in the case of (D.1) we use the same formula but read the tensor product as being of plain -linear maps (so there are no Koszul signs when we evaluate the results on an input tensor).
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] E. M. Babalic, D. Doryn, C. I. Lazaroiu and M. Tavakol, Differential models for B-type open-closed topological Landau-Ginzburg theories , Commun. Math. Phys. 361, 1169-1234 (2018), [ar Xiv:1610.09103] .
- 2[2] M. Baumgartl, I. Brunner and M. R. Gaberdiel, D-brane superpotentials and RG flows on the quintic , JHEP 0707 (2007), 061.
- 3[3] M. Baumgartl, I. Brunner and M. Soroush, D-brane Superpotentials: Geometric and Worldsheet Approaches , Nucl. Phys. B 843 (2011), 602–637.
- 4[4] M. Baumgartl and S. Wood, Moduli Webs and Superpotentials for Five-Branes , JHEP 06 (2009) 052.
- 5[5] M. Baumgartl, I. Brunner and D. Plencner, D-brane moduli spaces and superpotentials in a two-parameter model , JHEP 2012(3), 39.
- 6[6] H. Bursztyn, H. Lima and E. Meinrenken, Splitting theorems for Poisson and related structures , Journal für die reine und angewandte Mathematik (Crelles Journal), 2017.
- 7[7] N. Carqueville, Matrix factorisations and open topological string theory , JHEP 07 (2009) 005.
- 8[8] N. Carqueville, L. Dowdy and A. Recknagel, Algorithmic deformation of matrix factorisations , JHEP 04 (2012) 014.
