SearcharxivSearch

arXiv · 1701.00567

Monoidal categories enriched in braided monoidal categories

Abstract

We introduce the notion of a monoidal category enriched in a braided monoidal category $\mathcal V$. We set up the basic theory, and prove a classification result in terms of braided oplax monoidal functors to the Drinfeld center of some monoidal category $\mathcal T$. Even the basic theory is interesting; it shares many characteristics with the theory of monoidal categories enriched in a symmetric monoidal category, but lacks some features. Of particular note, there is no cartesian product of braided-enriched categories, and the natural transformations do not form a 2-category, but rather satisfy a braided interchange relation. Strikingly, our classification is slightly more general than what one might have anticipated in terms of strong monoidal functors $\mathcal V \to Z(\mathcal T)$. We would like to understand this further; in a future paper we show that the functor is strong if and only if the enriched category is `complete' in a certain sense. Nevertheless it remains to understand what non-complete enriched categories may look like. One should think of our construction as a generalization of de-equivariantization, which takes a strong monoidal functor $\mathsf{Rep}(G) \to Z(\mathcal T)$ for some finite group $G$ and a monoidal category $\mathcal T$, and produces a new monoidal category $\mathcal T // G$. In our setting, given any braided oplax monoidal functor $\mathcal V \to Z(\mathcal T)$, for any braided $\mathcal V$, we produce $\mathcal T // \mathcal V$: this is not usually an `honest' monoidal category, but is instead $\mathcal V$-enriched. If $\mathcal V$ has a braided lax monoidal functor to $\mathsf{Vec}$, we can use this to reduce the enrichment to $\mathsf{Vec}$, and this recovers de-equivariantization as a special case.

Explore related subjects

Keep this discovery

BibTeXRIS

Scott Morrison, David Penneys. 2017-01-03. Monoidal categories enriched in braided monoidal categories. https://arxiv.org/abs/1701.00567

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

A model structure for cartesian 2-fibrations

Cartesian 2-fibrations provide a way to understand indexed categories, but their classical ``straightening'' construction requires several layers of weak coherence data. This paper develops a homotopical framework that replaces much of this bookkeeping with a fully strict model. By using marked 2-categories to record the cartesian morphisms and 2-cells, we construct a model structure whose fibrant objects are precisely the cartesian 2-fibrations over a fixed 2-category $\mathcal{C}$. We then show that the marked Grothendieck construction identifies these 2-fibrations, up to weak equivalence, with strict 2-functors from $\mathcal{C}$ into $2\mathrm{Cat}$. As an additional contribution, we construct localizations of 2-categories that simultaneously invert selected morphisms and 2-cells.

math.CT

A Natural Fuzzy Order on Fuzzy Numbers

This paper introduces a natural fuzzy order on fuzzy numbers that extends the natural orders on real numbers and interval numbers. We investigate its completeness properties and show that the space of uniformly bounded fuzzy numbers is conically complete and conically cocomplete, and that it is complete if and only if the underlying continuous t-norm is the G\"odel t-norm. Moreover, it is proved that this space constitutes a \([0,1]\)-enriched domain if and only if the underlying continuous t-norm satisfies the (S) condition. These results provide a foundation for ordering fuzzy numbers.

math.CT

Noetherian forms of free non-symmetric operads

In this paper, we study certain categories of labeled finite rooted ordered trees over a fixed set of labels where each label is equipped with an arity: a fixed number of children that the vertex with the given label must have. Equivalently, these are expression trees for operations in a free non-symmetric operad. A morphism between these trees matches a pruning of one tree (a prefix) with an entire subtree of another (a suffix). We characterize such categories, up to isomorphism, in terms of suitable exactness properties. It turns out that these categories exhibit strong algebraic behavior, in the sense that every such category, when appended with a strict initial object, has a particularly nice noetherian form.

math.CT