For quite some time I, as a beginner in Category Theory, have been pondering about the intuition behind defining adjoint functors. I've gone through the other answers addressing this, but they seemed to be too technical for me. Is it right to think of adjoint functors to kind of 'translate a difficult problem to a simpler setting'? For example, in case of matrices, one can jump from one linear transform to another on the other side inside an inner product, if they are adjoint(although I haven't seen any instance of using adjointness to actually simplify things, I like to believe it, and I might be wrong).
Also, Ravi Vakil in his notes motivates adjoint functors in the following way:
Just as a universal property “essentially” (up to unique isomorphism) determines an object in a category (assuming such an object exists), “adjoints” essentially determine a functor (again, assuming it exists).
I'm not sure what he means by adjoints "essentially determine a functor".
How should I look at adjoint functors, and adjointness in general?
There are a lot of ways to understand adjoints, because they show up in many places, each of which gives a different perspective on things. For instance, if you're familiar with some galois theory or covering space theory, we have a close relationship between the lattice of field extensions and the lattice of subgroups of the galois group (resp. between the lattice of covering spaces and the lattice of subgroups of the fundamental group).
These facts are both extremely useful, since one half of the relationship (field extensions or covering spaces) is full of extremely complicated objects, and the other half of the relationship is "just" subgroups of a group (which is a discrete problem we can often solve completely!).
The "close relationship" between these lattices is mediated by a galois connection, which is actually just a historical name for an adjunction! Many properties of galois connections (which specialize to give the useful facts for galois theory, covering space theory, and many more) are actually properties of all adjunctions, or at least adjunctions between posets. These have their own name because we started studying galois connections in the 40s, but didn't even have a definition of adjunction until the mid 50s!
So one takeaway from this discussion is that yes. Adjunctions can help us study something complicated by transposing the complicated question to another domain where the question is easier to answer. I've gestured at some historical examples in the area of galois connections, but these ideas can be seen everywhere.
Now, what about this "adjunctions specify a functor" business?
The idea here is that the left adjoint of a functor is unique. Here's a proof (crucially using yoneda's lemma):
Say that $L_1$ and $L_2$ are both left adjoints to $R$. Then for every $X$ and $Y$ we have
$$\text{Hom}(L_1 X, Y) \cong \text{Hom}(X, RY) \cong \text{Hom}(L_2 X, Y)$$
using the definition of an adjunction $L_1 \dashv R$ in the first isomorhpism, and the definition of an adjunction $L_2 \dashv R$ in the second isomorphism. So homming out of $L_1X$ and $L_2 X$ always give the same answer, which means $L_1 X \cong L_2 X$ by yoneda. Thus $L_1$ and $L_2$ are naturally isomorphic.
So this proof tells us that, if $R$ has a left adjoint (and of course the story is the same if it has a right adjoint by duality) that adjoint is (essentially) unique! Now there are LOTS of functors that are
For instance, the forgetful functor $U : \mathsf{Groups} \to \mathsf{Sets}$. This functor is super easy to understand -- it just takes a group $(G, \times, 1)$ and forgets everything but the underlying set $G$. One can show that this functor has a left adjoint (say, using one of the adjoint functor theorems), which sends a set $X$ to the free group on $X$!
The uniqueness of adjoints tells us that, in some sense, everything about the free group functor $F$ is already available inside the forgetful functor $U$. Moreover, just as in the case of galois connections, we can answer lots of interesting questions about the free group functor by transposing them along this adjunction to questions about the forgetful functor (which is much easier to study).
And, of course, there's nothing special about the free group functor here. There are countless examples of extremely complicated functors which are uniquely specified by being adjoint to some particularly simple functor. Again, this lets us answer questions about the complicated functor by transposing those questions to questions about the simple functor.
I hope this helps ^_^