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.
As I'm learning more, it seems like monoidal categories are in a certain sense more "natural" than non-monoidal ones. In particular, once you take a higher categorical perspective if you don't (artificially, IMO) disallow 0-dimensional pasting diagrams then you get your tensor and unit as 0-dimensional composition and identity. Is this a well-known insight? Is there an approach to category theory that treats monoidal as normal and non-monoidal as a corner-case generalization?
Shea Levy said:
Is there an approach to category theory that treats monoidal as normal and non-monoidal as a corner-case generalization?
Not that I know of. This is how I think about it:
Categories are great, bicategories are great, tricategories are great...
... and monoidal categories are bicategories with one object.
I don't know what do you mean by "approach to category theory", but for sure "just" categories are the corner case in many fields of applied category theory. For instance, all the categorical quantum mechanics stuff relies on process theories that are always monoidal. Same thing for the prop-based approach to concurrency that many people are pursuing, e.g. at UCL and Talltech.
In this cases you always have some monoidal structure to be around. Also, I find the interpretation of monoidality as "bicategories with just one object" illuminating from a mathematical point of view, but rather uninstructive if you are thinking about applications. For me, "monoidal category" = "something you can do string diagrams with". One may argue that yes, there are surface diagrams and the like for higher categories, but then again these have, at least for me, a completely different flavor that is not necessarily process-theoretic
ah, but string diagrams in a monoidal category are exactly bicategory string diagrams with no labelling for 0-cells!
you only need surface diagrams for monoidal bicategories and tricategories etc
sarahzrf said:
ah, but string diagrams in a monoidal category are exactly bicategory string diagrams with no labelling for 0-cells!
Absolutely. If you draw the surfaces all of the same colour, you get back string diagrams. But I'm saying that if you look at -> Applications <- string diagrams and (general) surface diagrams look like very different beasts, and are used in very different contexts.
I am arguing that application-wise - and I consider myself an applied category theorist - this mathematical generalization is more obscuring that helpful. You basically say "Oh, X is a special case of Y" and this obscures the fact that, often, X is used to model things that are completely different from the ones you model with Y.
I mean, you can say "A group is a special kind of set" or "a ring is a special kind of group". Still, everyone would agree that most often than not this is the best way for not really understanding what's going on in group (resp. ring) theory.
I think that comparison is the wrong way around. Just as by moving from groups to sets, you lose structure, so by moving from bicategories to monoidal categories, you also lose structure. It can be useful to realise that a monoidal category is actually just a hom-category in a bicategory, because it reveals new structure that might be helpful. Generalised species are a good example of this phenomenon.
I said already that I find this generalization mathematically illuminating. It just seems natual to me, though, to think that a generalization may not always be what you want. Thinking about monoidal categories in terms of bicategories is sometimes helpful, sometimes it is not. I'm saying that, conceptually, there's more to monoidal categories than saying "they are just bicategories with one object"
Here's the most interesting application I've seen of bicategorical string diagrams to do things similar to what people usually do with monoidal category string diagrams:
This is the diagram for Diffie-Hellman key exchange:
Yes, I'm familiar with this paper. And indeed, the focus here is much more information-flow like than process-theoretic. There's an entire line of work in CQM about using higher cats and surface diagrams, carried on by people like Jamie Vicary, David Reutter and others. Again, it seems to me that this has deeper ties with information theory than "traditional" CQM does, but maybe I'm wrong.
i remember this paper, but i forgot they did a version of diffie-hellman. however, there's a big catch (p.20): "Erasing the public data is necessary for information-theoretical security in the classical case, and for maintaining coherence in any quantum interpretation."
If we can erase the public information later, might as well just send the key to Bob, do all the communication we want, then erase the key when we're done. A really interesting thing, which I still haven't seen in any of the diagrammatic approaches, is a proof of computational security.
Information-theoretic security usually amounts to showing two parts of a diagram disconnect. For example, at the end we can show a noise channel (i.e. the uniform stochastic map) from the private info to the eavesdropper, which is rank-1, so it can be depicted as something that disconnects when is tensor product-like.
I have no idea what computational security would look like, but 2-categories might have the answer...
Since early in the 2000's, we have seen Spekkens' work where he derives almost all quantum effects from what he called an "epistemic restriction". It was around that time that Coecke and others began writing a lot about presupposing a monoidal structure and picking out categorical structure that replicates what we see in Hilbert Spaces. Since shortly after this time, I decided that the monoidal program was, actually, less interesting than programs that would derive that structure from some sort of information or other axioms.
In my research, I did a naive abstraction of the Spekkens model to processes, where we see a functor from a category of system under study to a category of the apparatus as an epistemic restriction on causal structure. This leads to (co)monads which I feel are more natural, and data structures appear naturally. Spivak has stated in his paper on Poly, that monads on Set are a more natural setting than operads (a gadget on monoidal categories) for mode-dependent systems.