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.
Suppose is a monoid, seen as a one-object category. Let's call such an object.
What's ? The obvious choice ( with identities as projections) seems to only work for the trivial monoid.
Then in general suppose is a product for . Considering the cone one sees and need to be left invertible. If is finite, this means and are invertible and equal, hence given a cone and a universal arrow , the condition and implies , therefore the monoid is trivial.
It remains the case is infinite, but I can't do much about that. Any thoughts?
Are you thinking of as a one-object monoidal category? Any abelian monoid will work, surely?
I don't understand your question, sorry. A one-object monoidal category would be very boring, no?
Commutative is probably enough to enable the proof of triviality I gave for finite monoids. The it remains only non-commutative infinite monoids.
Matteo Capucci (he/him) said:
I don't understand your question, sorry. A one-object monoidal category would be very boring, no?
In a one object monoidal category, musn't every object be the tensor unit, so that all maps commute with each other.
Cole Comfort said:
Matteo Capucci (he/him) said:
I don't understand your question, sorry. A one-object monoidal category would be very boring, no?
In a one object monoidal category, musn't every object be the tensor unit, so that all maps commute with each other.
I think you're thinking of free monoidal categories on one object. If you take the category of -vector spaces, and then take the monoidal subcategory containing only the tensor unit (), then you still have -many morphisms.
James Wood said:
Cole Comfort said:
Matteo Capucci (he/him) said:
I don't understand your question, sorry. A one-object monoidal category would be very boring, no?
In a one object monoidal category, musn't every object be the tensor unit, so that all maps commute with each other.
I think you're thinking of free monoidal categories on one object. If you take the category of -vector spaces, and then take the monoidal subcategory containing only the tensor unit (), then you still have -many morphisms.
Which commute with each other because a field has the structure of an commutative monoid. Isn't a one object monoidal category just a commutative monoid?
Ah, sorry, yeah, I misunderstood your remark.
It feels like that could be using symmetry, but I don't really know non-symmetric monoidal categories all that well.
It seems to me like one object monoidal categories and one object symmetric monoidal categories ought to be the same, because you can just braid things with the interchange laws
Up to coherence data these must just be commutative monoids.
While a one-object monoidal category is just a commutative monoid, and a one-object cartesian monoidal category is trivial, a one-object semigroupal category can be more interesting, and even a "cartesian semigroupal" category. For instance, the full subcategory of Set determined by any single infinite set has binary products, since any infinite set is isomorphic to its own cartesian square.
Cole Comfort said:
It seems to me like one object monoidal categories and one object symmetric monoidal categories ought to be the same...
Just for extra confirmation: yes, they are both just commutative monoids.
Mike Shulman said:
[...] a one-object cartesian monoidal category is trivial [...]
Thanks @Mike Shulman. Do you have any reference for this? Or some easy way to complete my proof attempt above?
Also, I'm toying with this questions (limits in a monoid) as a preparation for trying to understand bilimits in the delooping of a monoidal category. I guess products could be more interesting then.
The unit object in a cartesian monoidal category is terminal, more or less by definition. So, a one-object cartesian monoidal category also has just one morphism.
Oooh I see. Right, way easier than I thought XD
I guess one can do a similar trick for pullbacks? Since pullbacks are products in the slices, and the slice over a one-object category is still a one-object category, we deduce every slice is trivial, so is the monoid we start with?
No, a slice of a one-object category will generally have more than one object. Plus, a slice category automatically always has a terminal object.
The under category of a (cancellative) monoid is its divisibility category (poset)
Which, like Mike said, is usually not trivial. For example, in the 'divisibility' (subtractibility) poset of , we have iff whereas in the divisibility poset of , iff divides .
Fawzi Hreiki said:
The under category of a (cancellative) monoid is its divisibility category (poset)
Can you explain why that's true? I'm having some sort of mental block on this, and I don't have the time to sit and calculate. It should be the sort of thing one just "sees".
I don't know a nicer answer than just doing the calculation, but the objects of are maps out of i.e. elements of the monoid, and maps are given by elements with . Cancellativity implies that there's at most one such for given and , so this is exactly the divisibility poset.
I don't know a nicer answer than just doing the calculation
Luckily you just did the calculation at exactly the level of detail I needed to fill in the rest without writing anything. The thing I was missing was cancellativity - that's why we're getting a poset.
That was my mental block.
More generally, you can think of any extension as a (not necessarily unique) 'division' of one map by another.
This gives a sort of fun definition of "cancellative monoid" for category theorists who want other mathematicians to hate them: a cancellative monoid M is one such that the under category is a poset.
Ah no that's false I think
There may be cancellative monoids where the over category is not a poset no?
Actually, no you're right
Looks like this depends on whether left or right cancellative is meant. Looks like mx = my implies x = y is the version meant here.
Mike Shulman said:
No, a slice of a one-object category will generally have more than one object. Plus, a slice category automatically always has a terminal object.
Looks like I can't stop embarassing myself...