I asked this [same question](https://math.stackexchange.com/questions/3728239/how-to-understand-the-effect-of-adjoint-functors) on MathUnderflow two weeks ago but didn't receive any answer. Now that I am thinking more, it feels like the most suitable place for this question is here.


I have a good grasp of all different definitions/interpretations of adjoint functors, but still do not know have to interpret the left or right adjoint of a give functor, when it exist. It would be a easy to explain my question through an example.


For a particular example consider the inclusion of groupoids into small categories: $$\mathcal{F}:\mathcal{Grpd}\hookrightarrow\mathcal{Cat}.$$ This functor has left adjoint $\mathcal{L}$ which freely invert all existing morphisms of a category. Also it has a right adjoint $\mathcal{R}$ which extract the (maximal) subcategory of all isomorphisms, called "core groupoid" of a category. In some scene this bi-adjunction align with the free-forgetful philosophy. Also we can compute these adjoint functors explicitly as pointwise Kan extensions, then $$\mathcal{L}(\mathcal{C})=\text{Ran}\_{\mathcal{F}}(\text{id}\_{\mathcal{Grpd}})(\mathcal{C})=\lim(\mathcal{C}\downarrow\mathcal{F}\xrightarrow{\Pi\_{\mathcal{C}}}\mathcal{Grpd}\xrightarrow{\mathcal{F}}\mathcal{Cat}).$$ But I don't understand how to interpret this "limit" as a localization process and same for the right adjoint $\mathcal{R}.$ Can we derive it from this formula? If not, how can we see it?


In general, If we know some adjoint of a given functor exist, what is the process to understand it's effect/outcome?



How to understand adjoint functors?
Nice question Bumblebee. So, let us start with some "metaphysics of adjointness":



> 
> THE LEFT AND RIGHT ADJOINTS TO A FUNCTOR
> 
> 
> $ \mathcal{F}:\mathcal{C}\hookrightarrow\mathcal{D}$
> 
> 
> ARE THE FREE (LEFT) AND CO-FREE (RIGHT) WAYS TO GO BACK FROM $D$ TO
> $C$.
> 
> 
> 


If you choose some easy examples, for instance $C=Top$ and $D=Set$ and the functor is simply the forgetful functor which "forgets" the topological structure, Left and Right start from a given set and endow it with a topology, in the most economic way (trivial topology) or in the most rigid one (discrete) . Same happens if you replace $Top$ with $Groups$ (or any other algebraic category).


Now, not all functors which have adjoints are forgetful functors, so matters are slightly more subtle sometimes, but the "general metaphysics" of adjointness still holds true.


Now the second part of your question, the scary formula for your example: rather that filling this page with calculations, I want to give you the heuristics (so far I have told you what adjoints are, not whether they exist or how they are calculated).


Here, I use the second "metaphysical principle of adjointness", namely this:



> 
> THINK OF CATEGORIES AS GENERALIZED ORDERS, AND OF ADJOINTNESS AS
> GENERALIZED GALOIS CONNECTIONS.
> 
> 
> 


If you look up Galois connections (see [here](https://en.wikipedia.org/wiki/Galois_connection)), how they are defined and calculated, you will also understand cats, by generalizing. Same exact story.....


