I'm learning basic category theory and teaching myself about adjoints. The definition I have is that an adjunction between $F: \mathcal{C} \to \mathcal{D}$ and $G: \mathcal{D} \to \mathcal{C}$ is a bijection, for each pair of an object $A \in Ob(\mathcal{C})$, $B \in Ob(\mathcal{D})$, between morphisms $FA \to B$ in $\mathcal{D}$ and morphisms $A \to GB$ in $\mathcal{C}$, natural in $A$ and $B$: then we say 'G is right-adjoint to F' or 'F is left-adjoint to G'.
My problem is I don't fully understand why a functor would only be right-adjoint or left adjoint: obviously they are not the same thing otherwise you wouldn't give them separate names. If you do have the above setup, then could you not also take your bijection 'in the other direction' between morphisms $GA \to B$ in $\mathcal{C}$ and morphisms $A \to FB$ in $\mathcal{D}$ for $A \in Ob(\mathcal{D})$, $B \in Ob(\mathcal{C})$? Or does the problem lie in the fact that the image of objects $F$ and of $G$ will not necessarily be all of $Ob(\mathcal{C})$ or $Ob(\mathcal{D})$, so we might not be bijecting the same objects/morphisms between them?
Almost certainly this left/right adjoint switching doesn't work but I don't understand why very clearly, hopefully someone here much more experienced can explain things in more simple terms as I'm finding that practically speaking this definition of 'adjunction' isn't very easy for me to work with formally given my inexperience. Sorry if this is too simple a question for Math.Stackexchange! Thanks – Jon
(In addition, if you happen to have a more intuitive understanding of an adjoint than 'one half of a pair of functors between 2 categories for which there is a bijection of the morphisms $FA \to B$ and $A \to GB$ for each pair of objects A, B in their respective categories' then please I would be very grateful to hear how you think of adjoints in practice too! It seems like the notion is a little similar to inverses, but not quite an inverse obviously.)
Best Answer
You ask:
This argument doesn’t quite work, since taking the bijection in the other direction, it will go between morphisms A → GB and morphisms FA → B. The functor G still only appears on the codomains of morphisms.
To give a concrete example where no such bijection exists: let (F, U) be the “free group”/“underlying set” functors between Set and Gp.
Now, F is left adjoint to U. But they can’t be adjoint the other way round! If they were, that would give a bijection between $\mathbf{Sets}(U1,\phi)$ and $\mathbf{Gp}(1,F\phi)$ (where $1$ denotes the trivial group, and $\phi$ the empty set). But $\mathbf{Sets}(U1,\phi)$ is empty, while $\mathbf{Gp}(1,F\phi)$ has one element, since $F\phi \cong 1$.
An intuition for adjoints? There’s no easy, one-size-fits-all answer; but a good place to start is with these sorts of free/forgetful examples. Typically one can thing of a left adjoint as adding stuff, as freely as possible — perhaps new elements, perhaps some structure, perhaps imposing some equations if necessary. On the other hand, a right adjoint typically forgets things — forgets structure, sometimes perhaps throws away elements too...
The point you mention that they're a generalisation of inverses is also a good one. The Stanford Encyclopedia of Philosophy calls them “conceptual inverses”, which depending on how you feel about philosophy may be very helpful or not at all.
But really the best way to get intuition for adjoints comes from looking at as many examples as possible; not necessarily all in a hurry, but every now and then, for a while. They’re one of those concepts that doesn't usually come quickly (it didn't for me, nor for anyone I've seen learning category theory), but which — if you give it time to percolate, and occasional exercises — will sooner or later “click” and suddenly seem so natural you can't imagine not understanding it.
Incidentally, a similar question was also asked some time ago at mathoverflow. I very much like the current second answer, giving a rather different example of adjoints: viewing the posets Z and R as categories in the usual way (i.e. there's a unique map x → y whenever x ≤ y), the “ceiling” function R → Z is left adjoint to the inclusion Z → R, while dually the “floor” function is right adjoint to the inclusion. This suggests the slogan: left adjoints round up (again, adding just as much as is needed to get an integer); right adjoints round down (forgetting the non-integer part).