Want to take part in these discussions? Sign in if you have an account, or apply for one below
Vanilla 1.1.10 is a product of Lussumo. More Information: Documentation, Community Support.
1 to 3 of 3
Quick question as to which nLab pages I should be reading for the following situation:
I have bifunctors which are a bit like a -functor. I have a functor and which are “adjoint” in the sense that for all and , naturally in both. Where do I look to learn about these things? In particular, are there conditions on or , similar to the adjoint functor theorems, that guarantee that they have an adjoint (ie so if I only know one, when can I deduce that the other exists?)?
In case it helps to be more specific, is actually the category of -graded sets for some fixed set , is -graded s, is the corresponding -graded hom-functor and similarly for the versions.
Maybe in your last line some words are missing or something? Not sure, but if your setup can be thought of as taking place entirely in -enriched category theory then all theorems and everything hold as usual.
It doesn’t take place in a -enriched category. The thing to think about is graded Lawvere theories. I think that my generalisation isn’t quite right, so here’s some more details of the specific situation. First, the simple ungraded lemma:
Let be a cocomplete (locally small) category. A functor has a left adjoint if and only if it is representable.
Proof: adjoint representable:
representable adjoint: if , define , then .
Now the graded version. We have a cocomplete (locally small) category . We consider , the category of -graded objects in (aka the category of functors where is viewed as a small discrete category). We can extend the hom-functor on to a bifunctor in the (hopefully) obvious way. Then the result is:
A functor has a left adjoint if and only if it is representable by an object in .
The proof isn’t that much more complicated than the ungraded version, but I’d like to know the general context into which it fits (and thus if there’s a Main Result that can be quoted to avoid having to give the proof at all).
1 to 3 of 3