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.
This is a spinoff to the discussion we have on "Beginner questions" on the topic of quantifiers as adjoints. I want to point out some connections that I see between the adjunctions and categorical equivalences, particularily when it comes to quantifiers. I am doing it in a separate topic, because I am not sure if I am correct and I don't want to confuse people.
My source for this is example 7.1.1.13 from Spivak's "Category theory for the sciences", namely the fact that given a function $p: A \to B$ the inverse image of this function is left adjoint of the and right adjoint of .
Now, if I got the picture right, one thing I am noticing is that besides adjunctions, these pairs of functors define a "half-equivalence" or "one-direction equivalence" (I swear there was a name for this, but I don't remember it). So, on one hand we have (but we don't have the other direction ). And same for exists --- we have , but not the other direction.
Moreover, in the cases where the function is an isomorphism, this partial equivalence becomes full equivalence (I think that's not the only case, but I am not sure).
The same things can happen if we remove some elements from .
Here is a visualization of the example in the book --- the adjunction between the inclusion order of the natural numbers and the inclusion order of the set , that is generated by the function .
B941E9DE-BF8D-499C-93C7-8EE058208FF0.jpg
It's even better to refer to specific morphisms as isomorphisms or not. So instead of wondering whether, for example, is the identity, the issue should be whether the unit of the adjunction , which is of the form
is an isomorphism. Of course if your categories are posets, this is asking the same thing since there is at most one morphism between these functors to begin with. But in general, it's better to ask the second question.
This is a great example to work with when learning adjoints, because the functors here are very familiar constructions. takes a subset of to its direct image , so the statement that we have an adjunction is that for subsets of respectively, if and only if . The unit assigns to each such a subset inclusion , and the counit assigns to each such a subset inclusion .
Here, the unit is an isomorphism iff is injective. For example, consider a noninjective function like the function . Notice that , so the unit component is not an isomorphism. Incidentally, in general when the unit is an isomorphism, the left adjoint part is called a coreflection.
There is also a nice exercise that the counit of is an isomorphism iff is surjective.
It's also a nice exercise to work out the situation for . In the context of classical logic, is given by the formula where denotes complement.
Jencel Panic said:
Now, if I got the picture right, one thing I am noticing is that besides adjunctions, these pairs of functors define a "half-equivalence" or "one-direction equivalence" (I swear there was a name for this, but I don't remember it).
As Todd hinted, the relevant buzzwords include [[reflective subcategory]] and various other terms based on 'reflection' and 'coreflection'.
Thanks a lot, nice to know that I was on the right track.
Yeah, I think "reflection" and "coreflection" are supposed to be applied to the functors that behave more like retractions, so I slightly misspoke. I'll excuse myself by saying I wrote this just after I woke up this morning. One can say "reflective embedding" or similar for the functor that behaves more like the section.
Anyway, Jencel: you had omitted saying anything about being injective or surjective, so in part my comment was correcting this.
Sorry, it seems I made a mistake in the formula.
I meant to say:
.
so the counit of Exists and the unit of Forall are isomorphisms i.e. we have a partial equivalence for both adjunctions (in different directions). This should be valid even if is not injective, I think (the function I am using in the graphic is not).
This is a great example to work with when learning adjoints, because the functors here are very familiar constructions.
Well, it's the only way for me to learn currently, I get lost quick in formulas, so if I don't draw a diagram of something I usually cannot grasp it at all.
As I said, , i.e., the counit of is an isomorphism, iff is surjective.
Aha, thanks, makes sense.
Similarly, , i.e., the unit of is an isomorphism, iff is surjective.
Yes, I got the picture, units/counits that are from to are isomorphisms if is surjective and ones from to --- if it is injective. The only thing that I still don't know is why.
The following may be higher-brow than necessary, but since both and are left adjoints, they preserve colimits, i.e., unions, and since every subset is a union of singletons, it suffices to check what's happening with singletons. (And this I'll leave as an exercise.)