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.
There's a bunch of names one can give to a left adjoint: completion, free completion, free ..., -ization. This nLab page explains when to use which. To summarize (as far as I understand what the page is trying to say), we call a left adjoint
Is that correct? While I read the article rather carefully and most of the examples seem to support these definitions, I am confused about these counterexamples:
By contrast, the forgetful functor from the 2-category of monoidal categories to Cat forgets structure, rather than properties, so its left adjoint should be called a “free” construction rather than a “completion.”
But the forgetful functor from monoidal categories to categories is not faithful, since a monoidal functor is not determined by its underlying functor of categories. So why is one allowed to call that construction "free"?
The rambling reflections on that page shouldn't be taken as gospel, but as an attempt to make sense of an existing hodgepodge of terminology. So it's not surprising that it won't encompass all existing terminologies -- it's more surprising that any systematic classification would encompas so many of the existing terminologies, most of which were probably introduced in an ad hoc manner.
With that said...
Ad (1), I don't see anywhere on the page that suggests that we should only use the word "free" when the right adjoint is faithful.
I could imagine someone making such a suggestion, but only in the context of 1-categories. For higher categories, I think the criterion ought to go up with the dimension.
Ad (2), I don't think I would call it "regularization" -- I would say "free regular completion".
Where did you see "regularization"?
Thank you very much!
Ad (1), this quote from the nLab page suggests that we should only use the word "free" when the right adjoint is faithful:
By contrast, when we add structure to objects, i.e. we consider an adjoint to a forgetful functor which is faithful but not necessarily full, we usually do not use the word “completion” but rather the word “free”.
What do you mean by "the criterion ought to go up with the dimension", is there a reasonable definition of "faithful" for 2-functors such that the forgetful functor from monoidal categories to categories is faithful?
Ad (2), I read "regularization" at several places in the Elephant.
That quote says that we use the word "free" when we add structure, but not that we only use the word free when adding structure.
I don't mean the criterion for the word "faithful" but the one for the word "free". If we're restricting left adjoints between 1-categories to be called "free" when their right adjoint is faithful, then I would say a left adjoint between 2-categories should be allowed to be called "free" when its right adjoint is locally faithful, and so on. This "changing the goalposts" when we go up in dimension is, I think, another argument for not imposing such a requirement on the word "free", since it's better to be able to consider 1-categories as degenerate 2-categories without changing our terminology.
Re: the Elephant, ah, I see. Well, as I said, I wouldn't say that.
Thanks!
By the way, would you call a functor "forgetful" only in the case it is faithful?
No.
For instance, the projection clearly "forgets one of the sets", but it is not faithful.
According to the dogma of [[stuff, structure, property]] we would say it "forgets stuff" rather than structure or properties.
(Huh, does the auto nLab link not work for page names containing commas or something?)
Alright, and what about "underlying", does that require faithfulness? :P
I mentioned that issue also here.
I don't know Mike's thoughts, but off the top of my head, I'd expect "underlying" to forget at most structure. The pair of sets one is a good example. If you have , then it's not really reasonable to say that X is the underlying set of (X,Y), right? Maybe I'd also probably want it to forget at least structure. Forgetting from Ab to Grp, it seems weird to say you're talking about the underlying group of an abelian group.
In my experience, when you want to talk about the underlying thingy, it's because you want to access more general maps on the same gizmo.
What do you mean by "forget at most structure" and "forget at least structure" precisely?
I think the reason it sounds weird to say that is "the underlying set" of is that there are two sets, so it's the definite article that's inappropriate, not the word "underlying". Consider for instance the category whose objects are a pair of a ring and an -module . Wouldn't you say that is the underlying ring of a pair ?
And certainly a monoidal category has an underlying category...
Good points. Good thing I said "off the top of my head". :upside_down:
@Mike Shulman Your example suggests that an "underlying * functor" doesn't have to be faithful. So when is one allowed to call a functor "underlying" or "forgetful" -- is there any requirement that is usually satisfied? Also, are "underlying" and "forgetful" synonymous?
Would you say "underlying preorder of a category"?
@Joe Moeller Just a reminder that I asked a question you ignored. :P
Sorry, I mean what is said on the nLab page for stuff structure properties that Mike pointed to.
I don't think it's possible to give a formal and equivalence-invariant definition of when one uses the words "underlying" and "forgetful". Normally one uses it for a functor when the objects of are defined to be objects of with some extra stuff, but this notion of "defined to be" is not equivalence-invariant. For instance, we wouldn't normally say that the free group functor is "forgetful"; but if we replace the category with the equivalent category whose objects are groups equipped with a subset that generates them freely and whose morphisms are group homomorphisms that preserve the generating sets, then the corresponding functor does look "forgetful" since it just forgets the generators.
Similarly, I wouldn't normally say "underlying preorder of a category", but if were replaced by the equivalent category whose objects are preorders together with a category whose preorder reflection is the given one, then it would make sense to talk of the underlying preorder of such a gadget. (This is not as weird as it may appear, actually -- direct categories often are defined to come with a well-founded ordering on their objects, which could be called their "underlying" one, even though it's usually also their preorder reflection.)
The most I think could be said is if two categories come with a presentation as models of some formal theory, and the one theory is a syntactic extension of the other, then the induced functor is called "underlying" or "forgetful".
I don't know if there are situations where I'd use one of "underlying" and "forgetful" but not the other.
Thanks, that's enlightening!
I think there's a (last?) question remaining: when to use "free"? We already agreed that the right adjoint of a free functor doesn't have to be faithful. So can we use "free" for each left adjoint? Or is "free", like the notions "underlying" and "forgetful", a presentation-dependent notion?
Well, according to the nLab [[free object]], it can be used for any left adjoint. As you said, it would be a little odd to call the abelianization of a group the "free abelian group" on it. More commonly I think it's used for left adjoints of "forgetful" functors, whatever that means.
Thanks!
Leopold Schlicht said:
What do you mean by "forget at most structure" and "forget at least structure" precisely?
A functor forgets at most structure iff it's faithful.
I never say "forgets at least structure" but I guess this means not(forgets at most properties). If so, I guess it means "not full and faithful".
The nLab article on "properties, structure and stuff" explains this stuff, as does my paper with @Mike Shulman called "Lectures on n-categories and cohomology".
Thanks!
Mike Shulman said:
Ad (2), I don't think I would call it "regularization" -- I would say "free regular completion".
FWIW, I also like "free regularization".