L ⊣ R means that L is the left adjoint and R is the right adjoint
A pair of functors F : 𝒞 ⇄ 𝒟 : G are called adjoint if there is an equivalence Hom (F, −) ≅ Hom (−, G) between these functors 𝒞op × 𝒟 → Set.
In this case, F is called the left adjoint and G is the right adjoint
Let U : Grp → Set be the forgetful functor that sends a group to its underlying set and F : Set → Grp send a set to the free group it generates. Then F ⊣ U
Let i : CHaus → Top be the inclusion of compact Hausdorff spaces into all topological spaces. Then its left adjoint is the Stone-Cech compactification SC ⊣ i
View ℤ, ℝ as posets, and take the inclusion i : ℤ → ℝ. This functor has both a left and right adjoint — the ceiling function and floor function ceil ⊣ i ⊣ floor
Notation: Actually this kinda motivates
writing things in the opposite direction: floor ⊢ i ⊢ ceil, going from the
smallest to the biggest
Let U : Top → Set be the forgetful functor on topological spaces. Then the functors that grant a set the discrete or indiscrete topology are left/right adjoints respectively. Discr ⊣ U ⊣ Indiscr
Let 1 be the terminal category (the discrete category with one object). Then adjoints to * : 𝒞 → 1 correspond to initial / terminal objects in 𝒞: Init ⊣ * ⊣ Term
Let 𝒥 be an indexing category. Then the adjoints to the diagonal functor Δ : 𝒞 → 𝒞𝒥 which sends each object X to the constant functor ΔX, are the functors picking out limits and colimits of each functor 𝒥 → 𝒞: colim ⊣ Δ ⊣ lim
⊔ ⊣ Δ ⊣ ×
The diagram is a pair of parallel morphisms
We then take the functor category CI
The constant functor Δ : C → CI by A → A⇉idA
$\textsc{Coeq} \dashv \Delta \dashv \textsc{Eq}$
Your diagram is a span (or cospan)