Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision Next revision Both sides next revision | ||
|
counit-unit_adjunction [2016/01/03 15:13] nikolaj |
counit-unit_adjunction [2016/01/03 15:33] nikolaj |
||
|---|---|---|---|
| Line 24: | Line 24: | ||
| $\beta$ in $1_{\bf D}\cong GF$ | $\beta$ in $1_{\bf D}\cong GF$ | ||
| - | In the case of an adjunction, only the unit $\eta_{GX}$ (or $F(\eta_Y)$) can be inverted, but the nice thing is that the inverse is already something known, namely the other nat | + | In the case of an adjunction, only the unit arrows $\eta_{GX}$ (i.e. the units on the image of $G$) and the $F$-images of $\eta$ (i.e. $F(\eta_Y)$) can be inverted, but the nice thing is that the inverse is already something known, namely the other natural transformation |
| $\varepsilon_{FY}\circ F(\eta_Y)=1_{FY}$ | $\varepsilon_{FY}\circ F(\eta_Y)=1_{FY}$ | ||
| Line 32: | Line 32: | ||
| There is also the combined case where you have an equivalence where the natural transformations are related in the sense of above - this is called an adjoint equivalence. | There is also the combined case where you have an equivalence where the natural transformations are related in the sense of above - this is called an adjoint equivalence. | ||
| - | For another perspective relating to universal morphisms, see [[On universal morphisms]] (31.10.2014). | + | == Inducing hom-set adjunctions == |
| + | Say you're given an arrow $f$ from or to the images of one of the functors (in either ${\mathrm{Hom}}(FX,Y)$ or ${\mathrm{Hom}}(X,GY)$). We can now pre- or post-compose with arrows formed from $\eta$ and $\epsilon$, use the functors on arrows and thus algebraically find an image of $f$ in the other category. | ||
| - | ... | + | Of course, each identity morphisms $1_{FX}:{\mathrm{Hom}}(FX,FX)$ in ${\bf C}$ corresponds to a component $\eta_X:{\mathrm{Hom}}(X,GFX)$ of $\eta:1_{\bf D}\xrightarrow{\bullet}GF$. And the claim here is that not only |
| - | + | ||
| - | Emphasis: Having an adjoint functor pair really means you also got a nice pair of natural transofmrations (for which functors are only a conditions). Given any functor $G$ (w.l.o.g, say you're in ${\bf D}$ and the functor out of it is $G$), then if there is an $F$ so that $F\dashv G$, you got yourself a [[monad]]. | + | |
| - | + | ||
| - | Each identity morphisms $1_{FX}$ in ${\bf C}$ corresponds to a component $\eta_X$ of $\eta:1_{\bf D}\xrightarrow{\bullet}GF$. And not only | + | |
| $1_{FX}\leftrightarrow \eta_X$ | $1_{FX}\leftrightarrow \eta_X$ | ||
| Line 49: | Line 46: | ||
| ^ ${\mathrm{Hom}}(FX,Y)\cong{\mathrm{Hom}}(X,GY)$ ^ | ^ ${\mathrm{Hom}}(FX,Y)\cong{\mathrm{Hom}}(X,GY)$ ^ | ||
| + | |||
| + | == As universals == | ||
| + | |||
| + | For another perspective relating to universal morphisms, see [[On universal morphisms]] (31.10.2014). | ||
| + | |||
| + | == To monads == | ||
| + | |||
| + | Having an adjoint functor pair really means you also got a nice pair of natural transofmrations (for which functors are only a conditions). Given any functor $G$ (w.l.o.g, say you're in ${\bf D}$ and the functor out of it is $G$), then if there is an $F$ so that $F\dashv G$, you got yourself a [[monad]]. | ||
| === Theorems === | === Theorems === | ||
