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.
I've had this question for ages and figure I might as well ask it:
Are there good examples of monoidal categories that are braided but not symmetric, that arise naturally in contexts other than quantum mechanics or knot theory? I'm most interested in examples that "turn out" to have a nice natural braiding, rather than being designed to study something that's already about strings moving around in space.
Then my question is, where do algebras arise in applications? This is part of the motivation for my question actually - someone told me that -operads are good for thinking about "degrees of braiding" in some sense, and then that led me to wonder about applications for braiding outside of physics.
I guess I'm hoping for places braiding might emerge in "ACT" type topics or computer science - places you might not necessarily expect to be dealing with topology.
I'm also very interested in the answer to this question. I can't find any "computer science-y" examples that don't feel contrived.
There's a sort of extensional braided combinatory algebra studied in https://arxiv.org/pdf/2405.10152, and from any one of these the authors recover a braided monoidal category. However, I don't know of any "naturally occurring" braided combinatory algebras (extensional or not).
There is also this: https://www.kurims.kyoto-u.ac.jp/~hassei/papers/quantumdouble20111101.pdf
I'm not sure how 'applied' it is.
How about Melliès in Braided notions of dialogue categories. He does start off talking about representation theory of, e.g., quantum groups, but then writes:
Besides the connections to representation theory, this work is part of a research program in logic and computer science, whose general purpose is to recast the dialogical interpretation of proofs and programs in the language of contemporary algebra.
There was one example of a braided but not symmetric monoidal category in the context of profunctor optics, specifically affine traversals.
If I recall correctly, that was the monoidal structure we define in 5.2.10. in the actegories paper.
I asked a bot to build on an analogy I thought might work to discriminate between braided and symmetric. I don't think it's absolute trash.
I don't think it's absolute trash.
Sorry, but it is. And it doesn't answer the question.
There's a weird connection between braidings and large cardinals, which I described here:
A [[shelf]] is a set with a binary operation that distributes over itself, usually written . Any shelf gives a lax-braided monoidal category where the monoidal structure is the cartesian product of sets and the lax braiding is determined by
I call this a 'lax braiding' because may not be invertible. If is invertible we call our shelf a [[quandle]].
Here's the weird part: there's a simple-sounding question about quotients of the free shelf on one generator whose answer is only known if we assume the existence of a certain extremely large cardinal. The Ackermann function is also relevant.
Great - as a corollary we get a braided monoidal category from any group, which is exactly the kind of simple example I was looking for! I'll have fun thinking about this.
@John Baez wrote:
Here's the weird part: there's a simple-sounding question about quotients of the free shelf on one generator whose answer is only known if we assume the existence of a certain extremely large cardinal. The Ackermann function is also relevant.
You're referring to the Laver tables, I guess!
Besides this connection with self-distributivity, braids also crop up in connection with distributive laws between monads; this Cafe post gets into this.
IIRC, you get examples of braided monoidal structures by starting with $\mathbb{N}$-graded vector spaces with its standard signed symmetric monoidal structure, but replacing the signs by for parameters . Again IIRC, this example was given in the original Joyal-Street paper on braided monoidal categories, i.e., the Macquarie University Report version (before the journal version).
Yes, my blog article explained the idea of Laver tables.