Some applications of the multiplicative tensor product of matrix factorizations
Abstract
The notion of semi-unital semi-monoidal category was defined a couple of years ago using the so called ”Takahashi tensor product” and so far, the only example of it in the literature is complex. In this paper, we use the recently defined ”multiplicative tensor product of matrix factorizations” to give a simple example of this a notion. In fact,
if denotes the category of matrix factorizations of the constant power series , we define the concept of one-step connected category and prove that there is a one-step connected subcategory of which is semi-unital semi-monoidal.
We also define the concept of right pseudo-monoidal category which generalizes the notion of monoidal category and we prove that is an example of this concept.
Keywords. Semi-unital semi-monoidal category, tensor products, matrix factorizations.
Mathematics Subject Classification (2020). 15A23, 15A69, 18A05.
1 Introduction
Eisenbud introduced the concept of matrix factorization (cf. [6]) in 1980. His research results show how to use matrices to factorize all polynomials. For example the irreducible polynomial over can be factored as follows:
Thus, we say that
is a matrix factorization of .
In a sense, this notion of factorizing polynomials using matrices can be seen as a generalization of the classical notion of polynomial factorization where a polynomial can be considered as the product of two matrices.
Matrix factorizations play an important role in many areas of pure mathematics
and physics. The notion of matrix factorizations is one of the key tools used in representation theory of hypersurface rings. It is a classical tool in the study of hypersurface singularity algebras (cf. [6]).
One of the discoveries of Eisenbud is that matrix factorizations of are closely related to the homological properties of modules over quotient rings .
Let be a field and be the formal power series ring in the variables and be the formal power series ring in the variables . Let and be nonzero noninvertible111Yoshino [18] requires an element to be nonzero noninvertible because if then and if is a unit, then K[[x]]/K[[x]]. But in this paper we will not bother about such restrictions because we will not deal with the homological methods used in [18]. elements.
In 1998, Yoshino constructed a tensor product denoted which is such that if is a matrix factorization of and is a matrix factorization of , then is a matrix factorization of . In 2002 and 2003, Kapustin and Li in their papers [12] and [11], used matrix factorizations in string theory to study boundary conditions for strings in Landau-Ginzburg models. In 2012, Carqueville and Murfet in their paper [4], briefly presented the construction of the bicategory of Landau-Ginzburg models
whose -cells are matrix factorizations. In 2013, the geometry of the category of matrix factorizations was studied in Yu’s Ph.D. dissertation [19]. In 2014, Camacho [3] in her PhD dissertation recalled the notion of graded matrix factorizations with special emphasis on graded matrix factorizations.
In 2016, Crisler and Diveris [5] examined matrix factorizations of polynomials in the ring , using only techniques from elementary linear algebra. They focused mostly on factorizations of sums of squares of polynomials. They improved the standard method for factoring polynomials for this class of polynomials.
More recently in 2019, the author in his Ph.D. dissertation [8] defined the multiplicative tensor product of matrix factorizations and found a variant of this product [9] in 2020. These were then used to further improve the standard method for factoring a large class of polynomials. In [7], properties of matrix factorizations are used to find a necessary condition to obtain a Morita Context in the bicategory of Landau-Ginzburg models.
In this paper, we use the recently defined multiplicative tensor product of matrix factorizations [8] to give a simple example of a semi-unital semi-monoidal category. This is a notion that was defined recently in [1] using the so called ’Takahashi tensor product’ and it required a complex set-up. We will construct an easy-to-understand example with a relatively small amount of set-up. Moreover, we will also use the multiplicative tensor product of matrix factorization to define and give an example of the concept of right pseudo-monoidal category which generalizes the notion of monoidal category.
Significance of the notion of semi-unit:
We first recall some definitions.
A semi-ring is roughly speaking, a ring not necessarily with subtraction. The first natural example of a semi-ring is the set of non-negative integers.
A semi-module is roughly speaking a module not necessarily with subtraction. The category of Abelian groups is nothing but the category of modules over ; similarly, the category of commutative monoids is nothing but the category of semi-modules over
Semi-rings were studied by many algebraists beginning with Dedekind. They have significant applications in several areas, for instance Automata Theory and Optimization Theory (see [10] for applications).
The theory of semi-modules over semi-rings was developed by many authors including Takahashi [17].
In 2008, Jawad used the so called Takahashi’s tensor-like product of semi-modules over an associative semi-ring [17], to introduce notions of semi-unital semi-rings and semi-counital semi-corings (cf. [1]). However, these could not be realized as monoids (comonoids) in the category of -bisemi-modules. This is mainly due to the fact that the category is not monoidal in general. Motivated by the desire to fix this problem, Jawad [1] introduced and investigated a notion of semi-unital semi-monoidal categories with prototype and investigated semi-monoids (semi-comonoids) in such categories as well as their categories of semi-modules (semi-comodules). He realized that although the base semi-algebra is not a unit in , nevertheless has properties of what he called a semi-unit. This motivated the introduction of a more generalized notion of monads (comonads) in arbitrary categories (for more on this, see [1]).
Example 1.1.
An example of semi-unital semi-monoidal category as given by Jawad in [1] is the category of bisemi-modules over a semi-algebra with the Takahashi tensor product . That is the only example we found in the literature. unfortunately, it requires a great amount of set-up and so we refer the reader to theorem 5.11 of [1]. As earlier mentioned, a (less involved) example of semi-unital semi-monoidal category will be given in this paper (cf. theorem 4.1) using the recently defined multipicative tensor product of matrix factorizations [8].
In the next section, definitions of special classes of categories are recalled. In section 3, the notion of tensor products of matrix factorizations in also recalled. A comparison of the tensor product of matrix factorizations and its multiplicative counterpart is presented in section 4. The category of matrix factorizations of the constant power series is studied under this section. Moreover, a simple example of a semi-unital semi-monoidal category using the multiplicative tensor product is presented. We wrap up this section with the definition of the notion of right pseudo-monoidal category.
2 Special classes of categories
Here, we recall the definitions of some special types of categories.
Definition 2.1.
[14]
A monoidal category is a category , a bifunctor , an object , and
three natural isomorphisms ;
such that:
is natural for all and the pentagonal diagram
Definition 2.2.
[14] A symmetric monoidal category is a monoidal category together with a symmetry. A symmetry for a monoidal category is a natural isomorphism such that the following three diagrams commute for all :
An example of a symmetric monoidal category is the category of vector spaces over some fixed field , using the ordinary tensor product of vector spaces.
Definition 2.3.
[13]
A semi-monoidal category is a category , a bifunctor and
a natural transformation , satisfying the following condition:
is a natural isomorphism with components such that the following pentagonal diagram
commutes for all . ( is also called associator (p.11 [4])).
Definition 2.4.
(Defn 3.1 [15]) Given a category and an object of , an idempotent of is an endomorphism with . An idempotent is said to split if there is an object and morphisms , such that and .
Remark 2.1.
(cf. Remark 3.4 [15]) The splitting of an idempotent is a special case of a categorical limit and colimit. More precisely, if is an idempotent, then , is a splitting of if and only if is a colimit and is a limit of the diagram .
Definition 2.5.
[2] An ordinary category is idempotent complete, aka Karoubi complete or Cauchy complete, if every idempotent splits.
The phrase ”ordinary category” as opposed to the phrase ”Higher category” is used here. Higher category theory is the generalization of category theory to a context where there are not only morphisms between objects, but generally -morphisms between -morphisms, for all .
Definition 2.6.
[1] Let be a semi-monoidal category with natural isomorphism for all . Let stand for the identity endofunctor on any given category. We say that is a semi-unit if the following conditions hold:
-
1.
There is a natural transformation ;
-
2.
There exists an isomorphism of functors , i.e., there is a natural isomorphism in with inverse , for each object of , such that and the following diagrams are commutative for all :
A semi-unital semi-monoidal category is a semi-monoidal category with a semi-unit.
Remark 2.2.
[1]
If , then we say that is firm and set .
If is firm (also called a pseudo-idempotent) and , then is an idempotent.
A semi-monoidal category becomes a monoidal category if it has a unit, i.e., is such that ,
and for all , where .
Remark 2.3.
(cf. remark 3.3 of [1], [13])
Kock in [13] called an object a Saavedra unit or reduced unit just in case it is pseudo-idempotent and cancellable in the sense that the endofunctors and are full and faithful (equivalently, is idempotent and the endofunctors and are equivalences of categories). Kock also showed that is a unit if and only if it is a Saavedra unit.
Since every unit is a semi-unit, the notion of semi-unital semi-monoidal categories generalizes the classical notion of monoidal categories.
There is also a notion of skew-monoidal category ([16]) defined as follows:
Definition 2.7.
(cf. [16])
A right-monoidal category consists of a category , a functor , an object of and natural transformations
subject to the following axioms: For all objects
-
1.
-
2.
-
3.
-
4.
-
5.
.
Remark 2.4.
(cf. [16])
If is replaced with , we obtain what is called a left-monoidal category.
If , and are isomorphisms, we recover the notion of monoidal category. So a right-monoidal category is a generalization of a monoidal category.
3 Tensor products of matrix factorizations
In this section, we recall the definitions of the Yoshino tensor product of matrix factorizations denoted . Next, we recall the definition of multiplicative tensor product of matrix factorizations denoted .
Under this section, unless otherwise stated, and where and .
3.1 Yoshino’s tensor product of matrix factorization
Recall the following:
Definition 3.1.
[18]
An matrix factorization of a power series is a pair of matrices such that
, where is the identity matrix and the coefficients of and of are taken from .
Also recall ( of [18]) the definition of
the category of matrix factorizations of a power series denoted by or , (or even when there is no risk of confusion):
The objects are the matrix factorizations of .
Given two matrix factorizations of ; and respectively of sizes and , a morphism from to is a pair of matrices each of size which makes the following diagram commute [18]:
That is,
More details on this category are found in chapter 2 of [8].
Definition 3.2.
[18]
Let be an matrix factorization of and an matrix factorization of . These matrices can be considered as matrices over and the tensor product is given by
()
where each component is an endomorphism on .
It is easy to verify that is in fact an object of of size .
Remark 3.1.
When , we get a matrix factorization of , i.e., which is simply a factorization of in the classical sense. But in case is not reducible, this is not interesting, that’s why we will mostly consider .
Variants of Yoshino’s tensor product of matrix factorizations were constructed in [9].
3.2 Multiplicative tensor product of matrix factorization
In this subsection, we recall the definition of the multiplicative tensor product of matrix factorizations.
First it is well known that if (resp. ) is an (resp. ) matrix, then their direct sum , where the in the first line is a matrix and the one in the second line is an matrix.
Finally, recall that if (resp. ) is an (resp. ) matrix, then their tensor product is the matrix obtained by replacing each entry of with the matrix . So, is a matrix.
Definition 3.3.
[8]
Let be a matrix factorization of of size and let be a matrix factorization of of size . Thus, can be considered as matrices over and the multiplicative tensor product is given by
where each component is an endomorphism on .
Remark 3.2.
One of the reasons for the ”doubling” in the definition of the multiplicative tensor product of matrix factorizations is found in the proof of theorem 4.1. Observe that, in this proof, had we defined as
we would have had only one object in the category . Consequently, we would not have been able to construct another example of semi-unital semi-monoidal category.
Definition 3.4.
[8] For a morphism in and for any matrix factorization in , we define by
Definition 3.5.
[8] For a morphism in and for any matrix factorization in , we define by
We now recall the definition of the multiplicative tensor product of two maps.
Let , and be objects of respectively of sizes and . Let , and be objects of respectively of sizes and .
Definition 3.6.
[8] For morphisms and respectively in and , we define by
Theorem 3.1.
[8] is a bifunctor.
A variant of was found in [9].
4 A comparison of and , and a study of the category
In this section, we compare and and study the category .
The Syzygy property (cf. subsection 4.1 below) will help to find some differences between these two operations.
Moreover, we will observe that the multiplicative tensor product of two objects of is still an object of whereas the tensor product of any two matrix factorizations of a power series is not a matrix factorization of (not even for ). This will motivate the study of . Is it a monoidal category? or a generalization of this notion?
We will define the concept of one-step connected category and prove that there is a one-step connected subcategory of which is a semi-unital semi-monoidal category. This is particularly interesting because the concept of semi-unital semi-monoidal category was recently conceived in [1] and the example provided in that paper (cf. theorem 5.11 of [1]) required a considerable amount of set-up. But in this section, the example (cf. theorem 4.1) we give requires a smaller amount of set-up.
Furthermore, we will define the concept of right pseudo-monoidal category and prove that the category is an example of this concept.
First, recall [8] that
a -matrix is a matrix whose entries belong to the set .
We chose the terminology matrix instead of matrix because some authors use the terminology matrix to refer to what we call here matrix with some additional
conditions.
Definition 4.1.
A category is said to be a one-step connected category if for every two objects of the category, there exists a nonzero morphism between them.
4.1 A comparison of and
and are different at several levels. First of all,
the Syzygy helps in pointing out some differences between these two operations.
First recall the definition of the Syzygy222We use this word because that is the name (cf. [18]) given to the operator we are going to use in Prop. 4.1. where is a matrix factorization of a power series .
We now want to state a Syzygy property for . In [18], a Syzygy property was proved for , the tensor product of matrix factorization (cf. subsection 3.1). It was proved that and . But the Syzygy property that holds for is totally different. It shows that the functor is ”linear” with respect to the operation .
Proposition 4.1.
[8] (Syzygy property)
There is an identity .
For instance, observe that in general, unlike with ; as can be easily checked computationally.
It is easy to verify that in general, . It is also easy to verify that unlike with , .
Moreover, from the definitions of (cf. subsection 3.1) and (cf. definition 3.3), we immediately see some similarities and differences. For example, given two matrix factorizations of of size and of of size , though and are both of size , they are objects of two different categories namely and . Even if we consider two objects of the same category, say and of a nonzero power series , (respectively ) will be an object not in but instead of a different category namely (respectively ). Now, there is a striking difference between the two tensor products when . In fact, if , then but . That is, the multiplicative tensor product of two objects of is still an object of . This motivates the study of to know whether it is a monoidal category or a generalization of this notion.
4.2 An application of : A semi-unital semi-monoidal subcategory of
We prove that has a one-step connected subcategory which is a semi-unital semi-monoidal category.
Objects of are of the form where is an matrix, . Morphisms are pairs of matrices such that a certain diagram commutes (cf. subsection 3.1).
Theorem 4.1.
There is a one-step connected subcategory of which is a semi-unital semi-monoidal category.
Proof.
We extract a one-step connected subcategory of which is a semi-unital semi-monoidal category. We will call it .
Objects of are of the form where . We characterize these objects.
,
It is easy to see that in general, .
We give a notation before defining morphisms between two objects of .
Notations 4.1.
We will denote by the zero matrix of size whenever there would be a risk of confusion on the size of the zero matrix in the context under consideration. Otherwise, we will simply write .
Morphisms of are defined as in (cf. subsection 3.1), but with some restrictions.
We now define what a morphism is in .
Discussion :
First recall that a permutation matrix is a square matrix obtained from the same size identity matrix by a permutation of rows.
For , recall that a morphism in is a pair of matrices such that the following diagram commutes:
That is,
It follows from , that a morphism in is a pair of matrices with . This does not impose any restrictions on the entries of or , the entries could be anything provided we have the equality .
But, we define a morphism in to be a pair of matrices such that is a matrix of size with at most one nonzero entry in each row and each column. This restriction will ensure that the composition of two morphisms in is again a morphism in .
Thus, for example we could have the following values of and for the pair to be a morphism in :
From the twin square diagram , it is clear that and should both be of size .
The fact that we actually have a morphism from to for the above values of is obvious from diagram .
Discussion actually gives us a sufficient condition on a pair to be a nonzero morphism in .
It is not difficult to see that is a subcategory of .
In fact, for every pair of morphisms and in , the composite is in whenever it is defined. In fact, and by definition are pairs of matrices such that in each matrix; each column and each row has at most one nonzero entry. It then follows that the composition of such matrices will yield another matrix in which each column and each row would have at most one nonzero entry, whence we will still have a morphism of .
Moreover, is a one-step connected category because between any two objects of say and , there exists a nonzero morphism as can be seen from discussion .
We now proceed to prove that is a semi-unital semi-monoidal category.
We first prove that is a semi-monoidal category (cf. definition 2.3):
- The fact that is a bifunctor follows from theorem 3.1 [8] by replacing and by the constant power series and by letting .
- There is a natural isomorphism from the functor to the functor with components , where are matrix factorizations of in .
Let be objects of . Let , and be maps in . We show that the following diagram commutes:
i.e.,
In fact, the matrices representing and are identity matrices. Besides, the tensor product of maps is associative. Thus, holds. That is is a natural transformation. Moreover, for all and ; is an equality and so, it is an isomorphism. Hence, is a natural isomorphism.
Next, let us show that the pentagonal diagram of definition 2.3 commutes for all
Since all the maps linking the vertices of the pentagon are identity maps, this diagram must commute. In fact, we know that (the associator) is an identity map. Moreover, since the pair of matrices making up are identity matrices, it follows from the definition 3.6 (of the multiplicative tensor product of two maps) that and are also identity maps.
Therefore, is a semi-monoidal category.
Next, we prove that is a semi-unital semi-monoidal category. To that end, we need to find a semi-unit in the semi-monoidal category .
Claim: is a semi-unit in .
From the definition of a semi-unit (cf. definition 2.6), we need to find a natural transformation , where G is the identity endofunctor on and is an endofunctor on , such that . Components of are:
, where is an object of of size , that is with . We have: is of size .
The family of morphisms should satisfy the following two requirements:
-
1.
For each , should be a morphism in .
Since and are objects of which is a one-step connected category, we let be the nonzero morphism between and such that: , where is the operation of taking the transpose, is the zero matrix. is clearly a morphism in as discussed under discussion . -
2.
Naturality of :
Let be a matrix factorization in of size and let be a map of matrix factorizations. It is easy to see that and are each of size . The following diagram should commute:
i.e.,
We know that is of size since is of size . We also know that . Now, by definition of composition of two morphisms in , the right hand side of equality becomes:
in is the zero matrix.
As for the left hand side of , first recall that , (where is the zero matrix) and by definition 3.5 of the multiplicative tensor product, we know that
So, .
From and , we see that equality holds.
Hence is a natural transformation.
The next step towards proving that is a semi-unital semi-monoidal category is to prove
that there is an isomorphism of functors , i.e., there is a natural isomorphism with inverse , for each object of such that and the following diagrams are commutative for all objects and of .
Before we define , observe that .
We define to be the pair of matrices where is of size . From discussion , it follows that is a morphism in .
Naturality of :
Let be a matrix factorization of size and let be a map of matrix factorizations. It is easy333By drawing the twin diagram that has to commute with , we see the sizes of and . to see that and are each of size .
The following diagram should commute:
i.e.,
Since and are just pairs of identity matrices, it suffices to show that
.
By definition 3.5 of the multiplicative tensor product, we know that
And we also have by definition 3.4 of the multiplicative tensor product, that
Thus , so is a natural transformation.
is a natural isomorphism. In fact, and its inverse is clearly such that .
Commutativity of diagrams :
For diagram , it would commute if .
We show that all the maps involved in equality are identities. For all objects , we clearly have by the definitions of and that they are identity maps. We now show that the other maps involved in diagram are identity maps.
Since is of size , we have . Let be of size . By definition 3.4,
Hence is an identity map as expected.
Similarly using definition 3.5, we prove that is an identity map. Let be of size and be as above. Then,
and show that .
It is easy to see that all the other maps involved in diagram are equal to .
So diagram is commutative.
Next, we show that diagram commutes. To this end, we need to find an isomorphism ,
such that .
Now, we know that , where is the zero matrix and is of size . Hence by definition 3.4
Next, since is an object of size , we obtain from the way is defined that
)
From and , we see that and are both matrices with the same number of rows and columns. Moreover, they have the same number of s and each of these s is the only nonzero entry in its row and in its column. Simply put, the matrix from is (row-)permutation equivalent to the matrix in . That is the rows have simply been interchanged.
Hence, there exists a permutation matrix such that .
being a permutation matrix is invertible and its inverse is .
Now that we know exists and is invertible, we need to check if the pair of matrices is
a map from to in and if the pair of matrices is
a map from to .
We do it for , the case of is completely similar.
Once more, and are objects of . So, we can let and . Observe that . Let
All we need check now to conclude that is a map in is that the following diagram commutes:
Now, this diagram clearly commutes, so we can take and .
Therefore there exists an isomorphism namely such that diagram commutes.
A small remark: The foregoing proof for the commutativity of diagram helps understand the motivation behind the choice of the objects of .
In fact, if objects were chosen arbitrarily say pairs of matrices , as we showed in remark 4.1, the twin diagram above will commute only if . But as explained in remark 4.1, this is not possible as on the left side of the equality, the rows of are permuted and on the right side the columns are permuted, since is a permutation matrix.
Moreover, though diagram commutes even if is replaced with any matrix, what we need is a matrix that will make diagram commute and that matrix should also be invertible because we need an isomorphism in diagram .
The commutativity of diagram is proved in a manner similar to the proof given for the commutativity of
diagram .
So is a semi-unit in .
Conclusion: is a one-step connected semi-unital semi-monoidal subcategory of .
∎
The above proof works well for because the objects of are judiciously chosen so that the pair of matrices that make an object in is not any kind of matrix and its inverse (in order for the product to yield times the identity matrix of the right size), but they are identity matrices thanks to which diagrams will be commutative. In fact, diagrams and in definition 2.6, commute when and are objects in , i.e., of the form for some . But we will see in remark 4.1, that for arbitrary values of and , diagrams and are not always commutative. This implies that is not a semi-unital semi-monoidal category.
Remark 4.1.
We now explain why is not a semi-unital semi-monoidal category.
-
1.
We explain that for of size , the only reasonable (nonzero) possible choice for is what we made for the subcategory , namely .
First of all, observe that considering the definition of morphisms in (i.e., pairs of matrices s.t. each column and each row has at most one nonzero entry), the only possible choice for in is the one we made above (cf. theorem 4.1), i.e., .
It is clear that the only candidate to be a semi-unit in was . Hence, it is also the only candidate for to be semi-unital. This entails that for in , the only possible way to define is . Otherwise, would no more be a semi-unit in . -
2.
Next, we prove that with this choice of , the diagram above does not commute in general (i.e., for arbitrary values of and in ). That is,
does not commute. In fact, we showed in the proof of theorem 4.1 that with , the matrix constituting the map is permutation equivalent to the matrix constituting the map . Hence, in order to find the desired isomorphism of diagram , all we need do is to find a permutation matrix as explained in the proof of theorem 4.1. Now, the catch is that we need to verify that this permutation matrix is actually the matrix of a map in . It turns out that it is not.
Suppose we have already found the permutation matrix that enables us to move from the matrix of to the matrix of , call it . Now by definition of , we have which is an object of , so there is a matrix such that . Our aim is to show that is not a map in for arbitrary values of and , because the following diagram cannot commute:For this diagram to commute, we need to have (from the second square) . Now, we know that is the matrix obtained from by permuting the rows according to the permutation and is the matrix obtained from by permuting the columns according to the permutation . So, will be true just in case is the identity matrix. Now, is not necessarily the identity matrix, for instance if we take and
then is clearly not equal to the identity matrix.
Remark 4.2.
is not a monoidal category because it has no unit. In fact, the only candidate to be a unit is . Now, in order to be a unit, needs to first of all be a pseudo-idempotent (cf. remark 2.3). But is not even a pseudo-idempotent.
We have .
Let and . Consider the following situation:
From the discussion we had about the choice of matrices constituting in remark 4.1, we have only one (nonzero) choice for ; namely and similarly we have only one way of defining ; .
Hence, we clearly obtain . Hence, .
But, we do not obtain .
In fact,
Therefore, there is no isomorphism between and . A consequence of remark 4.2 is that is not a monoidal category since the only candidate to be a unit, namely is not even a pseudo-idempotent.
Remark 4.3.
Moreover, is not a right-monoidal category (cf. definition 2.7) because when trying to verify if the axioms of definition 2.7 hold for , instead of equalities we obtain maps which are not equal but whose representing matrices are row-permutation equivalent. Let us for example illustrate what we mean with the second axiom (cf. definition 2.7):
where are in , is the associator and is the natural transformation defined in the proof of theorem 4.1. If and are respectively of sizes and , then by definition of , and since , and so the left hand side of becomes .
Next, by definition 3.4, we compute the right hand side of as follows:
The matrices we obtained in and are row-permutation equivalent but not equal. This proves that does not hold in , so it is not a right-monoidal category. A direct consequence of this result is that is not also a right-monoidal category.
Nevertheless, is still a category which is close to being a monoidal category as we shall see (cf. subsection 4.3).
4.3 Another application of : The category is a right pseudo-monoidal category
In this section, we first define what a right pseudo-monoidal category is. We observe that this notion is a generalization of the notion of monoidal category. We exploit the results obtained in the previous sections of this paper to show that the category is a right pseudo-monoidal category.
First recall that a semi-monoidal category definition 2.3 is one endowed with a bifunctor and a natural isomorphism (called the associator [4]) such that the pentagon diagram (cf. definition 2.3) commutes.
Definition 4.2.
A right pseudo-monoidal category is a category which possesses a distinguished element , a natural isomorphism and two natural retractions s.t. the following hold:
There exists a morphism s.t. has a right inverse.
is a natural isomorphism with components such that the following pentagonal diagram
commutes for all .
, are natural444On p.10 of [4], and are also called left and right unit actions (or unitors). The difference here is that in the definition of a right pseudo-monoidal category, we do not require these unitors to be natural isomorphisms but it is enough for them to have right inverses. transformations.
For all objects , , have right inverses but do not necessarily have left inverses.
.
For and for any object , the triangular diagram
commutes.
Remark 4.4.
It is easy to see that every monoidal category (cf. definition 2.1) is a right pseudo-monoidal category. In fact, in the foregoing definition, if the triangular diagram commutes for all ; and the maps and are invertible, then we will recover the definition of a monoidal category. This shows that this notion is a generalization of the classical notion of monoidal category.
Theorem 4.2.
The category is a right pseudo-monoidal category.
Proof.
Following definition 4.2, we need to first of all show that is semi-monoidal (cf. definition 2.3). Thus we need to show that is a bifunctor, and the associator ”” in is a natural isomorphism such that the pentagon (cf. definition 4.2) diagram commutes.
Recall that an object of is of the form where .
In the entire proof; stand for arbitrary objects of , say , and .
We know that is a bifunctor (cf. theorem 3.1).
It is easy to see that is an identity map and hence it is an isomorphism. It is also easy to see that is natural for all and that the above pentagonal diagram commutes, in fact; we actually already proved it above when proving that was a semi-monoidal category (cf. theorem 4.1) .
This shows that is a semi-monoidal category.
Next, we find the distinguished object ”” and the morphism s.t. has a right inverse.
Take , the pair of matrix factorization. We have .
Consider the following situation:
In order to find the map and its right inverse, it suffices to take: , let . Thus, . Hence, we clearly obtain which proves that is a right inverse to .
We now show that the maps and should be natural retractions satisfying . That is, for each , and have right inverses and .
is a natural transformation:
where G is the identity endofunctor on and is an endofunctor555It is easy to verify that is a functor. on , such that .
The family of morphisms should satisfy the following two requirements:
-
1.
For each , should be a morphism between objects in . Before we proceed, observe that, for any of size in ,
To show that is a morphism, we need to find a pair of matrices such that the following diagram commutes:
That is,
For , where is the zero matrix, the equational system becomes
That is;
and this is clearly true. Therefore, we have found a pair of matrices such that diagram commutes, and this means that is a map of matrix factorizations.
-
2.
Naturality of :
Let be a matrix factorization of size and let be a map of matrix factorizations. It is easy666By drawing the twin diagram that has to commute with , we see the sizes of and . to see that and are each of size . The following diagram should commute:
i.e.,
We know that is of size since is of size . We also know that . Now by definition of composition of two morphisms in , the left hand side of equality becomes:
in is the zero matrix.
As for the right hand side of , first recall that , (where is the zero matrix) and by definition 3.5 of the multiplicative tensor product, we know that
So, .
From and , we see that equality holds. That is is a natural transformation.
We find the right inverse of , for any of size in .
we denote it . should be a member of the family of morphisms of a natural transformation , where G is the identity endofunctor on and is an endofunctor777this was discussed above when dealing with on , such that .
The family of morphisms should satisfy the following two requirements:
-
1.
For each , should be a morphism in .
should be a pair of matrices such that the following diagram commutes:That is,
For , where is the operation of taking the transpose, is the zero matrix, the equational system becomes
That is;
and this is clearly true. Therefore, we have found a pair of matrices such that diagram commutes, and this means that is a map of matrix factorizations.
-
2.
Naturality of :
Let be a matrix factorization of size and let be a map of matrix factorizations. It is easy888By drawing the twin diagram that has to commute with , we see the sizes of and . to see that and are each of size . The following diagram should commute:
i.e.,
We know that is of size since is of size . We also know that . Now by definition of composition of two morphisms in , the right hand side of equality becomes:
in is the zero matrix.
As for the left hand side of , first recall that , (where is the zero matrix) and by definition 3.5 of the multiplicative tensor product, we know that
So, .
From and , we see that equality holds. That is is a natural transformation.
Next, we show that is the right inverse of by computing the following: . So is the right inverse of .
To see that is a natural transformation and that for any objet in , has a right inverse, it suffices to observe that both and have the same domain and codomain since for any in , we have:
Similarly,
So, we define for any in .
We also clearly have .
Finally, for any object and for , we prove that the following triangular diagram commutes:
Our goal here is to show that the diagram commutes i.e., i.e., since the associator is the identity.
We use definition 3.6 to verify that this equality holds.
From and , it is clear that .
Therefore is a right pseudo-monoidal category. QED
∎
Remark 4.5.
When proving the commutativity of the triangular diagram in the foregoing proof, we kept writing instead of directly writing because we wanted to point out the fact that this diagram is simply the triangular diagram one has in the definition of a monoidal category, except that here, the diagram commutes only for . It is easy to see that if (meaning ), then . In fact, the pair of matrices representing these two maps will be permutation similar but not equal. So, resembles a monoidal category in many respects without being one. That is one of the motivations behind the appellation right pseudo-monoidal category.
Acknowledgments
This work was carried out while doing my Ph.D. at the University of Ottawa in Canada. I would like to thank Prof. Dr. Richard Blute who was my Ph.D. supervisor for the fruitful interactions. This research was supported in part by the Bank of Montreal financial group award I.
References
- Abuhlail, [2013] Abuhlail, J. (2013). Semiunital semimonoidal categories (applications to semirings and semicorings). Theory and Applications of Categories, 28(4):123–149.
- Borceux and Dejean, [1986] Borceux, F. and Dejean, D. (1986). Cauchy completion in category theory. Cahiers de topologie et géométrie différentielle catégoriques, 27(2):133–146.
- Camacho, [2015] Camacho, A. R. (2015). Matrix factorizations and the landau-ginzburg/conformal field theory correspondence. arXiv preprint arXiv:1507.06494.
- Carqueville and Murfet, [2016] Carqueville, N. and Murfet, D. (2016). Adjunctions and defects in landau–ginzburg models. Advances in Mathematics, 289:480–566.
- Crisler and Diveris, [2016] Crisler, D. and Diveris, K. (2016). Matrix factorizations of sums of squares polynomials. Diakses pada: http://pages. stolaf. edu/diveris/files/2017/01/MFE1. pdf.
- Eisenbud, [1980] Eisenbud, D. (1980). Homological algebra on a complete intersection, with an application to group representations. Transactions of the American Mathematical Society, 260(1):35–64.
- [7] Fomatati, Y. (2021a). Necessary conditions for the existence of morita contexts in the bicategory of landau-ginzburg models. arXiv preprint arXiv:2106.10490.
- Fomatati, [2019] Fomatati, Y. B. (2019). Multiplicative Tensor Product of Matrix Factorizations and Some Applications. PhD thesis, Université d’Ottawa/University of Ottawa.
- [9] Fomatati, Y. B. (2021b). On tensor products of matrix factorizations. arXiv preprint arXiv:2105.10811.
- Golan, [1999] Golan, J. (1999). Semirings and their applications.— kluwer acad. Publ., Dordrecht.
- Kapustin and Li, [2004] Kapustin, A. and Li, Y. (2004). D-branes in landau-ginzburg models and algebraic geometry. Journal of High Energy Physics, 2003(12):005.
- Kapustin et al., [2003] Kapustin, A., Li, Y., et al. (2003). Topological correlators in landau-ginzburg models with boundaries. Advances in Theoretical and Mathematical Physics, 7(4):727–749.
- Kock, [2008] Kock, J. (2008). Elementary remarks on units in monoidal categories. In Mathematical Proceedings of the Cambridge Philosophical Society, volume 144, pages 53–76. Cambridge University Press.
- Mac Lane, [2013] Mac Lane, S. (2013). Categories for the working mathematician, volume 5. Springer Science & Business Media.
- Selinger, [2008] Selinger, P. (2008). Idempotents in dagger categories. Electronic Notes in Theoretical Computer Science, 210:107–122.
- Szlachányi, [2012] Szlachányi, K. (2012). Skew-monoidal categories and bialgebroids. Advances in Mathematics, 231(3-4):1694–1730.
- Takahashi, [1982] Takahashi, M. (1982). On the bordism categories iii. In Mathematics seminar notes, volume 10, pages 211–236.
- Yoshino, [1998] Yoshino, Y. (1998). Tensor products of matrix factorizations. Nagoya Mathematical Journal, 152:39–56.
- Yu, [2013] Yu, X. (2013). Geometric study of the category of matrix factorizations.