You're reading the public-facing archive of the Category Theory Zulip server.
To join the server you need an invite. Anybody can get an invite by contacting Matteo Capucci at name dot surname at gmail dot com.
For all things related to this archive refer to the same person.
Anyone know where I can get a big list of monoidal categories that lack a symmetry or braiding? The simpler the examples the better.
The only one I know of off the top of my head is functor composition
I think the category of representations of a Hopf algebra is a great one. A "Hopf algebra" is just an algebra (over some field, say) equipped with precisely enough structure to make its category of representations ( = modules) be monoidal.
EDIT: Ignore this comment. I must have misread the question because I'm describing how to get a braided category.
Since a braided monoidal category is just a -category with only one object and only one morphism, and the canonical example of a -category is -, you can get one family of examples by picking any -category and looking at the category of natural transformations from the identity on that -category to itself.
Are there any nontrivial examples of this if we pick the -category ?
One can obtain a monoidal category (typically without a braiding) from an endo-hom-category of a bicategory.
That is, if is a bicategory and is an object of , then is a monoidal category.
So for instance we have:
The monoidal category of endofunctors on a category is also a natural example of this, with .
Nice, Soichiro. It's interesting to look at monoids in all these monoidal categories you list. A monoid in the monoidal category of endofunctors of a category is a monad. A monoid in the monoidal category of endo-spans on a set is a category. And so on.
Free monoidal categories (on a monoidal signature, ie. a bunch of generating objects and morphisms) are an important class of example, their morphisms are string diagrams without crossings. Categories of diagrams without crossing are sometimes important, eg. in some types of quantum computing where crossings are expensive and you don't want to freely allow them. Free autonomous (non-symmetric compact closed) categories and free autonomous posets are important in linguistics
Another good way of producing non-symmetric monoidal categories is to start with a “small” non-symmetric monoidal category presented by a few generators and relations, and then extend to the category of presheaves on by Day convolution.
Interesting examples: augmented simplicial sets with the join, cubical sets with the Gray product...
ordinal arithmetic (i believe this is ≈ augmented simplicial sets with join? but can be transfinite obviously)
Here's an extra cheap class of examples: a non-commutative monoid is a discrete non-braided monidal category.
You can look at monoid objects internal to concrete categories, and these can be turned into ordinary monoids.
You can feed these into the thing above, presheaves and Day convolution. I'm not sure what these are exactly. A family of objects indexed by the monoid, and tensor given pointwise by the monoid?
It's probably more interesting to think about presheaves on a monoid thought of as a one object category. This is the category of actions of the monoid.
Unfortunately for the purpose of this conversation, if you wanted a monoidal one object category that you could then apply Day convolution to, Eckmann-Hilton says it has to be commutative.
The monoid objects comment earlier points to an enriched version of all this.