Left & right adjoints in the context of posets. Definition 1: A function $\theta: X\to Y$ between posets is monotone if whenever $x\le y$, we have $\theta (x)\le\theta (y)$.
Definition 2: For any pair $f:A\to B$ and $g:B\to A$ of monotone maps, we say $g$ is a left adjoint of $f$ and $f$ is a right adjoint of $g$ if $$g(b)\le a\Leftrightarrow b\le f(a).$$

Theorem: Left adjoints preserve all joins; right adjoints preserve all meets.

I'm not at all sure how to prove this theorem (and it's actually a lemma in a paper). It looks like (it should be easy and) we can cut it in half since the argument for left adjoints looks set to be dual to that of right adjoints. I've taken an arbitrary join then hit it with $g$ (for such a pair $f, g$ as in Definition 2). Now what?
Please help :)

It boils down to category theory, and the fact that if $L:\mathcal{C}\leftrightarrows\mathcal{D}: R$ is a pair of adjoint functors, then one of them (I can never remember which, but it's easy to figure out) preserves all limits, while the other preserves all colimits.
A poset $(P,\prec)$ can be viewed as a category $\mathcal{P}$ with object set $P$ and for all $x,y\in P$,
$$\mathcal{P}(x,y)=\begin{cases}\lbrace *\rbrace & \text{if }x\leq y\\\emptyset &\text{otherwise}\end{cases}$$
(Composition need not be defined as there is only one way to do it). This way, monotone maps between two posets are exactly the functors between the associated categories, and Galois correspondences (pairs of monotone maps that satisfy the condition from your second difinition) are exactly pairs of adjoint functors.
Here you'll take $\mathcal{C}=A$ and $\mathcal{D}=B$. To finish, you only need to understand that the meet of a subset $A\subset P$ is the categorical limit of the (inclusion) functor $\iota:\mathcal{A}\hookrightarrow \mathcal{P}$, while the join is its the colimit.
