scratch

§ Monadic Functor

created 2022-01-28 · last edited 2022-05-30
  • A fuctor U:D→CU: D \to CU:D→C is monadic iff it has a left adjoint F:C→DF: C \to DF:C→D and the adjunction is monadic.
  • An adjunction C:F⊢U:DC : F \vdash U: DC:F⊢U:D is monadic if the induced "comparison functor" from DDD to the category of algebras (eilenberg-moore category) CTC^TCT is an equivalence of categories .
  • That is, the functor ϕ:D→CT\phi: D \to C^Tϕ:D→CT is an equivalence of categories.
  • Some notes: We have D→CTD \to C^TD→CT and not the other way around since the full order is CT→D→CTC_T \to D \to C^TCT​→D→CT: Kleisli, to DDD, to Eilenberg moore. We go from "more semantics" to "less semantics" --- such induced functors cannot "add structure" (by increasing the amount of semantics), but they can "embed" more semantics into less semantics. Thus, there is a comparison functor from DDDto CTC^TCT.
  • Eilenberg-moore is written CTC^TCT since the category consists of TTT-algebras, where TTT is the induced monad T:C→D→CT: C \to D \to CT:C→D→C. It's CTC^TCT because a TTT algebra consists of arrows {Tc→c:c∈C}\{ Tc \to c : c \in C \}{Tc→c:c∈C}with some laws. If one wished to be cute, the could think of this as " T→CT \to CT→C".
  • The monad TTT is C→CC \to CC→C and not D→DD \to DD→D because, well, let's pick a concrete example: Mon. The monad on the set side takes a set SSS to the set of words on SSS, written S⋆S^\starS⋆. The other alleged "monad" takes a monoid MMM to the free monoid on the element of MMM. We've lost structure.
❦
Newer ৪ Blog ৪ Older