Reading up on a paper, I discovered that I will need Day's convolution to construct tensors in a bicategory of monoidal supported profunctors. The hom-categories of these to then capture supported pre-categories as a partial monoid.
So slowly working toward it, I flesh out some of my notes here:Usually, one encounters convolution in electrical engineering and in image processing; the convolution of two functions and , denoted by the convolution operator as is defined as
where are maps from a group to complex numbers. It can be thought of as a moving window, giving by one of the function, that inspects the values of the other function. This definition can be extended to convolutions on functors on a monoidal category to the category of sets , .
In the standard setting, convolution yields a commutative algebra without identity on the linear space of (suitably) measureable functions. For the extension, the functor category of functors yields a monoidal category; Day's convolution is its tensor product.
A simple example to see how it works is given by graded sets in a categorical setting: given the discrete category with natural numbers as objects and only identify mappings as morphisms, where addition plays the role of the monoidal product, the graded sets then can be represented by functors . The convolution in the category then is
Where is the addition of natural numbers. Moving on to a more general setting, one wants to replace by a general monoidal category . The formula for the convolution, given two presheaves is defined as
In that expression, the convolution product is given by a coend of the functor under the integral symbol. The coend of an functor in is an object with a universal dinatural transformation . In this case, the notion of dinatural transformation relaxes the requirements of a natural transformation: usually, for a natural transformation between functors F and G, depends on some variable co-/contravariantly. A dinatural, or in this case the slightly more restrictive notion of an extranatural transformation requires either F or G to depend on some variable both co- and contravariantly. It is constituted by a collection of morphisms such that for every morphism in the hexagon identity holds:
In this setting, the coend object is an object of . The Day's convolution has some nice properties regarding the preservation of colimits, as well as some interesting relations to the Yoneda embedding. The next posts will contain more on the properties on the convolution and possibly the Yoneda lemma, but also mainly focus on recovering supported precategories in a more abstract setting.
Keine Kommentare:
Kommentar veröffentlichen