A constructive approach to Fourier-Mukai transforms for projective spaces via A∞A_{\infty}-functors between pretriangulated dg categories

preprint2020arXivOpen access

Abstract

We discuss the following problem: how can an arbitrary Fourier-Mukai transform ϕ:Db(Pa)→Db(Pb)ϕ: \mathrm{D}^{\mathrm{b}}( \mathbb{P}^a ) \rightarrow \mathrm{D}^{\mathrm{b}}( \mathbb{P}^b ) between the bounded derived categories of two projective spaces of dimensions aa and bb be expressed in explicit terms as an exact functor between the homotopy categories Kb(Ba)→Kb(Bb)\mathrm{K}^{\mathrm{b}}( \mathbb{B}^a ) \rightarrow \mathrm{K}^{\mathrm{b}}( \mathbb{B}^b ) generated by the full strong exceptional sequences of the line bundles Ba={O(−a),…,O}\mathbb{B}^a = \{\mathcal{O}(-a), \dots, \mathcal{O}\} and Bb={O(−b),…,O}\mathbb{B}^b = \{\mathcal{O}(-b), \dots, \mathcal{O}\}? We show that this problem can be reduced to the following task which is independent of any prescribed Fourier-Mukai kernel: finding an A∞A_{\infty}-functor PP in explicit terms whose induced functor on homotopy categories yields the embedding of {O(i)⊠O(j)∣i=−2a,…,0,  j=−2b,…0}\{ \mathcal{O}(i) \boxtimes \mathcal{O}(j) \mid i = -2a, \dots, 0, ~~j = -2b, \dots 0 \} into Db(Pa×Pb)\mathrm{D}^{\mathrm{b}}( \mathbb{P}^{a} \times \mathbb{P}^{b}). As our main technical tool we provide an explicit formula for the lift of an A∞A_{\infty}-functor F:A→BF: \mathbf{A} \rightarrow \mathbf{B} between a dg category A\mathbf{A} and a pretriangulated dg category B\mathbf{B} to the pretriangulated hull of A\mathbf{A} given by the universal property of pretriangulated hulls. As a further application of this tool, we provide a simple example of two non-isomorphic exact functors between triangulated categories that coincide on the full subcategory generated by a full strong exceptional sequence.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.