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.
What's the definition of a monomorphism in a (weak) 2-category?
Here's the relevant nLab page, https://ncatlab.org/nlab/show/n-monomorphism
To summarise, if you have an n-category, there is a notion of m-mono for each . In the 2-category of categories, the 0,1 and 2-monomorphisms are the equivalences, fully faithful and faithful functors respectively.
See also https://ncatlab.org/michaelshulman/show/full+morphism
where you have some orthogonal notions defined (eso, eso and full respectively), allowing one to characterize fullness.
Aren't these for -categories? In a -category we have noninvertible -morphisms, does that not change the definition?
I had to link to that page because I couldn't find a page about generic n-monos.
I think @Mike Shulman explained them on ncatcafe somewhere, maybe he can point you to the right place. In any case, iirc you should be able to extract the definition you're looking for from the setting.
I think the answer is a bit more subtle, in the sense that the notion of monomorphism from 1-categories can also have different generalisations/weakenings that are not captured by the n-monomorphism hierarchy. In particular “1-monomorphisms” seem to generalise from
to
But one can also try to weaken the “elementary” definition, that is, is a monomorphism if and only if implies that , more in the direction of 'formal higher category theory'. For example, one weakening that makes sense in 2-categories would be:
“Every 2-isomorphism factors through a 2-isomorphism .”
And in the 2-category of categories, I think that corresponds to a pseudomonic functor, which is a functor that is faithful and full on isomorphisms.
And that's not the same as a 1-monomorphism in the sense above, which corresponds to a full and faithful functor.
So as for many similar questions, the answer is: “There is no single way to generalise this concept from categories to higher categories; you really have to look at the specific aspect that you are trying to capture, and find what works best.”
Amar Hadzihasanovic said:
- A morphism is a monomorphism if and only the are isomorphisms of sets.
I think you mean "injections of sets".
Oops, of course.
On second thought, the issue is probably not about what definition we are taking (the “representable” one or the “elementary” one), but rather about the fact that 'monomorphisms of sets' have different generalisations to (higher) categories/groupoids that induce different generalisations on arbitrary higher categories/groupoids via the “representable” definition.
@Chetan Vuppulury
may be what you want; it relies on the definition of "pseudomonic functor".
It's true that there are many factorization systems on -categories for large , but I think only fully-faithful morphisms and pseudomonic morphisms really have a claim to be "the" notion of monomorphism for -categories, since they're the only ones that specialize to monomorphisms of sets considered as discrete -categories.
In general I think when there are noninvertible 2-cells around, fully-faithful morphisms are better-behaved than pseudomonic ones. But the pseudomonic ones have their uses too.