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.
In category theory, a functor can have the property of having a left adjoint iff , and such that, and forall , such that the triangle commutes: .
This definition is nice because it is very minimalistic, and it can be canonically extended to construct a left adjoint functor when it holds. I suppose another way to say this is that these are the necessary and sufficient conditions for a left adjoint defined any other way.
My question is: Do we have a similar minimal sort of definition for having an oo-left adjoint?
I don’t have any particular model of oo-cat in mind.
The answer is yes. But in order to make it precise one probably has to choose a particular model.
The first functor should probably be called U, not F. Also A∈C, not A∈X.
The condition after “such that” can be reformulated by saying that the canonical functor FX/C→X/U induced by U and precomposition with η_X is an equivalence of categories.
Presumably, replacing equivalences with ∞-equivalences should yield the desired outcome.
So I had a chat with Emily and it turns out there is a way to make this precise:
A functor has a left adjoint if for all in , the comma category has an initial object .
Then you should be able to stick an oo infront of everything.
This is proposition 4.1.5 in her new book.
Am I correct in thinking that because we are considering oo-initial objects, we typically don’t even need to consider higher coherences?
That probably depends on your definition of -initial…
1 to 6 of 6