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.
A monoidal category is rigid in case every object therein has a left dual and a right dual.
I'm wondering if there's a name for monoidal categories in which every object has either a left dual or a right dual.
I'm tempted to go with semi-rigid, but if something already exists for this I'd like to use that. Also, has anyone else encountered categories like this? (more examples would be good!)
The "or" can be inclusive or exclusive here, although it's worth noting that in the exclusive case the monoidal unit is an exception.
You got an example?
(I think) duals on the same side have the nice property that , so I'm curious what happens when you tensor objects which have duals on opposite sides.
In this paper the "free cornering" of a symmetric (strict) monoidal category is a single object double category. If I consider the horizontal cells of that double category (those with trivial top and bottom boundary), I obtain a monoidal category. This category has the "semi-rigid" property. In the notation of the paper, is the left dual of for all (and so is the right dual of ), but need not have a left dual, and need not have a right dual.
This category of horizontal cells is odd, but might end up being important. Currently working on a journal-special-issue version of that paper which will include a discussion of its structure.
'autonomous' is used as a synonym for 'rigid', and I've seen 'left autonomous' and 'right autonomous' to mean only left/right duals respectively (although never 'left rigid' etc.)
Maybe consult remark 4.2 of https://arxiv.org/abs/0908.3347
2021-11-10-110249_667x150_scrot.png
I wonder if you can steal existing terminology from monoids? This thing is like a noncommutative monoid where everything has a left-inverse
(I like to think of autonomous categories as a categorification of groups - being a dual object is a better categorification of inverse elements than the obvious thing)
Jules Hedges said:
I wonder if you can steal existing terminology from monoids? This thing is like a noncommutative monoid where everything has a left-inverse
If everything has a left inverse, the monoid is a group!
Is it? Every object has a left or right dual, but some objects don't have left duals, and some objects don't have right duals.
The autonomous vs rigid thing isn't really the point. It's that instead of having both properties (left and right dual) for each object of the category, I have one of them.
What happens when you tensor a left dual with a right dual, like Morgan mentioned before?
Maybe nothing? All that comes to mind is that there's an interesting morphism ( is a left dual and is a right dual). The morphism is interesting because there need not be a morphism in the other direction, which is what stops this from being a symmetric monoidal category.
I would have imagined that the fact that every object either has a left-dual or right-dual is less important than the fact that the category is equipped with a subcategory, whose objects all have right duals. That is, I would be surprised if there were theorems about "monoidal categories in which every object has a left or right dual" (which seems to me like a freeness property), but there are certainly theorems about monoidal categories that embed into monoidal categories in which every object has a right dual (these are one-object proarrow equipments), and so it may be that the latter is worth naming, but not the former.
Does actually have either a left or right dual?
@Nathanael Arkor I think you're right!
Reid Barton said:
Does actually have either a left or right dual?
Embarassingly, no. My question isn't the right question to be asking about my example -- which isn't an example at all!
My curiosity is satisfied.
Morgan Rogers (he/him) said:
Jules Hedges said:
I wonder if you can steal existing terminology from monoids? This thing is like a noncommutative monoid where everything has a left-inverse
If everything has a left inverse, the monoid is a group!
I'm not convinced, can you write a proof? If this was true then every pregroup would collapse to just be a group, I guess...
Consider an element . It has a left inverse . Also, has a left inverse . That is, . But then is a two-sided inverse to .
Doesn't " has a left inverse " mean , not ?
That seems reasonable, I have flipped everything accordingly.
Morgan Rogers (he/him) said:
Jules Hedges said:
I wonder if you can steal existing terminology from monoids? This thing is like a noncommutative monoid where everything has a left-inverse
If everything has a left inverse, the monoid is a group!
Chad Nester said:
Is it?
Yeah, I just checked. Suppose you have a monoid where every element has a left inverse. Thus every has a left inverse, say :
I claim is also the right inverse of . This will prove Morgan's statement.
First, note that
Now multiply on the left by the left inverse of , which I'll call :
Since we get
so is the right inverse of .
(This is basically Morgan's argument above, but I wrote it before reading his latest comments. It was a fun puzzle.)
Morgan Rogers (he/him) said:
Jules Hedges said:
I wonder if you can steal existing terminology from monoids? This thing is like a noncommutative monoid where everything has a left-inverse
If everything has a left inverse, the monoid is a group!
Does this cute result have a name by the way? I've seen it a couple times now
Another way to phrase the proof is: if has a left inverse and has a left inverse , then has both a left and a right inverse. Therefore, those two coincide and are a two-sided inverse. This is no different from Morgan's argument, but it might make it sound more familiar.
It's also an instance of the [[2-out-of-6 property]]...
Two out of six - cute!