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.
The free compact closed category on a traced monoidal category is often written , A notation established in the 1996 paper introducing traced monoidal categories. While it isn't really discussed in the paper, the reason is surely that by starting with a very simple traced monoidal category whose objects are natural numbers, with and , we obtain a similar category of integers as . Does this appear explicitly anywhere? I'm writing a computer science paper and I want to cite something for .
There was some related discussion in the TYPES mailing list, under the topic "What algebra am I thinking of?", maybe it helps:
http://lists.seas.upenn.edu/pipermail/types-list/2018/002041.html
http://lists.seas.upenn.edu/pipermail/types-list/2018/002034.html
That is indeed helpful -- thanks!
I was always a bit surprised it's not discussed in the original paper, since it's obviously in the background
While we’re here, something related: Abramsky has a paper (2005) where he observes that the free symmetric monoidal category on some is always traced. If we start with the terminal category then is a good in the above sense, and the Int construction gives . So we have as .
So really we can get a category of integers over any category at all, and the simplest one results in the group of differences construction of the integers.
:shrug:
Chad Nester said:
Abramsky has a paper (2005) where he observes that the free symmetric monoidal category on some is always traced
This sounds extremely surprising. What sort of thing is , a set? What's the title of the paper?
http://www.cs.ox.ac.uk/people/samson.abramsky/calco05.pdf
is any category. I also found this surprising!
A fun observation is that in many ways captures double-entry bookkeeping. David Ellerman has a paper explaining how it’s all really about the group of differences, and the morphisms give you the permissible operations. This suggests a sort of -valued double entry bookkeeping...
... It does come across as a bit of an “okay, so what?” thing haha.
the thing to note (also noted in the paper) is that while the free SMC on a category is canonically traced, it is not the free traced category on
Martti Karvonen said:
the thing to note (also noted in the paper) is that while the free SMC on a category is canonically traced, it is not the free traced category on
Oops I just repeated what Martti said. But what he said is very important!
Martti Karvonen said:
the thing to note (also noted in the paper) is that while the free SMC on a category is canonically traced, it is not the free traced category on
Huhhhh. I know this paper (I read it years ago and I cite it sometimes) but I didn't know this result, I should learn to read more carefully.....
Chad Nester said:
Abramsky has a paper (2005) where he observes that the free symmetric monoidal category on some is always traced
I was thinking about this and I think I see morally why it's true. The morphisms of the free monoidal category on a category should be string diagrams whose wires are labelled by objects of and boxes are labelled by morphisms of , modulo planar isotopy + the equations of . In particular, every box has exactly one input and one output wire. That means that every use of a trace is 1 of 2 cases: either it does not create a loop and so the string can be pulled straight, or it does create a loop but in a disconnected part of the diagram
So you can define a trace by pulling the string straight in case 1, and contracting/ignoring the loop in case 2
Nice. For us string diagram lovers that's enough of a hint to do the whole proof. I hadn't known this fact!
The fact discussed above has a consequence I find surprising: If is symmetric monoidal then is equivalent to . Thus every symmetric monoidal category is equivalent to a traced one.
Chad Nester said:
The fact discussed above has a consequence I find surprising: If is symmetric monoidal then is equivalent to . Thus every symmetric monoidal category is equivalent to a traced one.
Is there a way to see this canonical tracing in $C$? Maybe it is a trivial construction, but I do not see it.
Chad Nester said:
The fact discussed above has a consequence I find surprising: If is symmetric monoidal then is equivalent to . Thus every symmetric monoidal category is equivalent to a traced one.
is symmetric monoidal, but is the category of finite sets and bijections.
Indeed: Over lunch @Amar Hadzihasanovic convinced me that this is wrong. In particular that the free symmetric monoidal category on a symmetric monoidal category is not in general equivalent to it, as in @Nathanael Arkor 's example above.
:slight_frown:
Yeah, you shouldn't expect the free symmetric monoidal category on a symmetric monoidal category to be equivalent to it any more than you expect the free commutative monoid on a commutative monoid to be isomorphic to it.
When you freely throw in tensor products, etc., you get a lot more stuff.