Liftable pairs of adjoint functors between braided monoidal categories in the sense of \cite{GV-OnTheDuality} provide auto-adjunctions between the associated categories of bialgebras. Motivated by finding interesting examples of such pairs, we study general pre-rigid monoidal categories. Roughly speaking, these are monoidal categories in which for every object $X$, an object $X^{\ast}$ and a nicely behaving evaluation map from $X^{\ast}\otimes X$ to the unit object exist. A prototypical example is the category of vector spaces over a field, where $X^{\ast}$ is not a categorical dual if $X$ is not finite-dimensional. We explore the connection with related notions such as right closedness, and present meaningful examples. We also study the categorical frameworks for Turaev's Hopf group-(co)algebras in the light of pre-rigidity and closedness, filling some gaps in literature along the way. Finally, we show that braided pre-rigid monoidal categories indeed provide an appropriate setting for liftability in the sense of loc. cit. and we present an application, varying on the theme of vector spaces, showing how -- in favorable cases -- the notion of pre-rigidity allows to construct liftable pairs of adjoint functors when right closedness of the category is not available.
We discuss generalised duality theory for monoidal categories and its applications to the categories of exact endofunctors, graded vector spaces, and topological vector spaces.
We prove that a category which is symmetric (relaxed) monoidal closed, (small) complete, well-powered and has a small cogenerating family, is cocomplete.
We show that the word problem for braided monoidal categories is at least as hard as the unknotting problem. As a corollary, so is the word problem for Gray categories. We conjecture that the word problem for Gray categories is decidable.
We denote the monoidal bicategory of two-sided modules (also called profunctors, bimodules and distributors) between categories by $\mathrm{Mod}$; the tensor product is cartesian product of categories. For a groupoid $\scr{G}$, we study the monoidal centre $\mathrm{ZPs}(\scr{G},\mathrm{Mod}^{\mathrm{op}})$ of the monoidal bicategory $\mathrm{Ps}(\scr{G},\mathrm{Mod}^{\mathrm{op}})$ of pseudofunctors and pseudonatural transformations; the tensor product is pointwise. Alexei Davydov defined the full centre of a monoid in a monoidal category. We define a higher dimensional version: the full monoi…
We define a traced pseudomonoid as a pseudomonoid in a monoidal bicategory equipped with extra structure, giving a new characterisation of Cauchy complete traced monoidal categories as algebraic structures in Prof, the monoidal bicategory of profunctors. This enables reasoning about the trace using the graphical calculus for monoidal bicategories, which we illustrate in detail. We apply our techniques to study traced ∗-autonomous categories, proving a new equivalence result between the left ⊗-trace and the right ⅋-trace, and describing a new condition under which traced ͨ…
We lift the standard equivalence between fibrations and indexed categories to an equivalence between monoidal fibrations and monoidal indexed categories, namely weak monoidal pseudofunctors to the 2-category of categories. In doing so, we investigate the relation between this `global' monoidal structure where the total category is monoidal and the fibration strictly preserves the structure, and a `fibrewise' one where the fibres are monoidal and the reindexing functors strongly preserve the structure, first hinted by Shulman. In particular, when the domain is cocartesian monoidal, lax monoidal…
We introduce DisCoPy, an open source toolbox for computing with monoidal categories. The library provides an intuitive syntax for defining string diagrams and monoidal functors. Its modularity allows the efficient implementation of computational experiments in the various applications of category theory where diagrams have become a lingua franca. As an example, we used DisCoPy to perform natural language processing on quantum hardware for the first time.
Every small monoidal category with universal finite joins of central idempotents is monoidally equivalent to the category of global sections of a sheaf of local monoidal categories on a topological space. Every small stiff monoidal category monoidally embeds into such a category of global sections. An infinitary version of these theorems also holds in the spatial case. These representation results are functorial and subsume the Lambek-Moerdijk-Awodey sheaf representation for toposes, the Stone representation of Boolean algebras, and the Takahashi representation of Hilbert modules as continuous…
We show that each rigid monoidal category A over a field defines a family of universal tensor categories, which together classify all faithful monoidal functors from A to tensor categories. Each of the universal tensor categories classifies monoidal functors of a given 'homological kernel' and can be realised as a sheaf category, not necessarily on A. This yields a theory of 'local abelian envelope' which completes the notion of monoidal abelian envelopes.
The category of double categories and double functors is equipped with a symmetric closed monoidal structure. For any double category $\mathbb A$, the corresponding internal hom functor $|[ \mathbb A,-]|$ sends a double category $\mathbb B$ to the double category whose 0-cells are the double functors $\mathbb A \to \mathbb B$, whose horizontal and vertical 1-cells are the horizontal and vertical pseudotransformations, respectively, and whose 2-cells are the modifications. Some well-known functors of practical significance are checked to be compatible with this monoidal structure.
We introduce the notion of a braiding on a skew monoidal category, whose curious feature is that the defining isomorphisms involve three objects rather than two. These braidings are shown to arise from, and classify, cobraidings (also known as coquasitriangular structures) on bialgebras. Using a multicategorical approach we also describe examples of braidings on skew monoidal categories arising from 2-category theory.
It is common to encounter symmetric monoidal categories $\mathcal{C}$ for which every object is equipped with an algebraic structure, in a way that is compatible with the monoidal product and unit in $\mathcal{C}$. We define this formally and say that $\mathcal{C}$ supplies the algebraic structure. For example, the category $\mathsf{Rel}$ of relations between sets has monoidal structures given by both cartesian product and disjoint union, and with respect to either one it supplies comonoids. We prove several facts about the notion of supply, e.g. that the associators, unitors, and braiding of …
In this paper we introduce a notion of $\mathbf{O}$-monoidal $\infty$-categories for a finite sequence $\mathbf{O}^{\otimes}$ of $\infty$-operads, which is a generalization of the notion of higher monoidal categories in the setting of $\infty$-categories. We show that the $\infty$-category of coCartesian $\mathbf{O}$-monoidal $\infty$-categories and right adjoint lax $\mathbf{O}$-monoidal functors is equivalent to the opposite of the $\infty$-category of Cartesian $\mathbf{O}_{\rm rev}$-monoidal $\infty$-categories and left adjoint oplax $\mathbf{O}_{\rm rev}$-monoidal functors, where $\mathbf…
Monoidal categories enriched in a braided monoidal category $\mathcal{V}$ are classified by braided oplax monoidal functors from $\mathcal{V}$ to the Drinfeld centers of ordinary monoidal categories. In this article, we prove that this classifying functor is strongly monoidal if and only if the original $\mathcal{V}$-monoidal category is tensored over $\mathcal{V}$. We then define a completion operation which produces a tensored $\mathcal{V}$-monoidal category $\overline{\mathcal{C}}$ from an arbitrary $\mathcal{V}$-monoidal category $\mathcal{C}$, and we determine many equivalent conditions w…
We construct an equivalence between the 2-categories VMonCat of rigid V-monoidal categories for a braided monoidal category V and VModTens of oplax braided functors from V into the Drinfeld centers of ordinary rigid monoidal categories. The 1-cells in each are the respective lax monoidal functors, and the 2-cells are the respective monoidal natural transformations. Our proof also gives an equivalence in the case that we consider only strong monoidal 1-cells on both sides. The 2-categories VMonCat and VModTens have G-graded analogues. We also get an equivalence of 2-categories between G-extensi…
We prove that the homotopy theory of parsummable categories (as defined by Schwede) with respect to the underlying equivalences of categories is equivalent to the usual homotopy theory of symmetric monoidal categories. In particular, this yields a model of symmetric monoidal categories in terms of categories equipped with a strictly commutative, associative, and unital (but only partially defined) operation.
The main objective of this paper is to construct a symmetric monoidal closed model category of coherently commutative monoidal quasi-categories. We construct another model category structure whose fibrant objects are (essentially) those coCartesian fibrations which represent objects that are known as symmetric monoidal quasi-categories in the literature. We go on to establish a Quillen equivalence between the two model categories.
