Papers
Topics
Authors
Recent
Search
2000 character limit reached

Decorated Cospans

Published 3 Feb 2015 in math.CT | (1502.00872v3)

Abstract: Let $\mathcal C$ be a category with finite colimits, writing its coproduct $+$, and let $(\mathcal D, \otimes)$ be a braided monoidal category. We describe a method of producing a symmetric monoidal category from a lax braided monoidal functor $F: (\mathcal C,+) \to (\mathcal D, \otimes)$, and of producing a strong monoidal functor between such categories from a monoidal natural transformation between such functors. The objects of these categories, our so-called `decorated cospan categories', are simply the objects of $\mathcal C$, while the morphisms are pairs comprising a cospan $X \rightarrow N \leftarrow Y$ in $\mathcal C$ together with an element $1 \to FN$ in $\mathcal D$. Moreover, decorated cospan categories are multigraph categories---each object is equipped with a special commutative Frobenius monoid---and their functors preserve this structure.

Citations (68)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.