Kleisli category


2-Category theory

Higher algebra

Kleisli category


Given a monad TT on some category 𝒞\mathcal{C}, the Kleisli category of TT has as objects the objects of 𝒞\mathcal{C}, but a morphism XYX \to Y in the Kleisli category is a morphism XT(Y)X \to T(Y) in 𝒞\mathcal{C}. The monad structure induces a natural composition of such ”TT-shifted” morphisms.

Equivalently, the Kleisli category is the full subcategory of the Eilenberg–Moore category of TT on the free T-algebras (the free TTmodules).


Let T=(T,μ,η)\mathbf{T}=(T,\mu,\eta) be a monad in Cat, where T:CCT:C\to C is an endofunctor with multiplication μ:TTT\mu:T T\to T and unit η:Id CT\eta:Id_C\to T.

In terms of free algebras


A free T\mathbf{T}-algebra over a monad (or free T\mathbf{T}-module) is a T\mathbf{T}-algebra (module) of the form (T(M),μ M)(T(M),\mu_M), where the action is the component of multiplication transformation μ M:T(T(M))T(M)\mu_M : T(T(M))\to T(M).


The Kleisli category C TC_{\mathbf{T}} of the monad T\mathbf{T} the subcategory of the Eilenberg–Moore category C TC^{\mathbf{T}} on the free T\mathbf{T}-algebras.


If U:C TCU:C^{\mathbf{T}}\to C is the forgetful functor and F:CC TF: C\to C^{\mathbf{T}} is the free algebra functor F:M(TM,μ M)F: M\mapsto (T M,\mu_M), then the Kleisli category is simply the full subcategory of C TC^{\mathbf{T}} containing those objects in the image of FF.

In terms of Kleisli morphisms

As another way of looking at this, we can keep the same objects as in CC but redefine the morphisms. This was the original Kleisli construction:


The Kleisli category C TC_{\mathbf{T}} has as objects the objects of CC, and as morphisms MNM\to N the elements of the hom-set C(M,T(N))C(M,T(N)), in other words morphisms of the form MT(N)M \to T(N) in CC, called Kleisli morphisms.

Composition is given by the Kleisli composition rule g Kleislif=μ PT(g)fg\circ_{Kleisli} f = \mu_P\circ T(g)\circ f (as in the Grothendieck construction (here MfNgPM\stackrel{f}\to N\stackrel{g}\to P).


More explicitly, this means that the Kleisli-composite of f:xTyf : x \to T y with g:yTzg : y \to T z is the morphism

xfTyTgTTzμzTz. x \stackrel{f}{\to} T y \stackrel{T g}{\to} T T z \stackrel{\mu z}{\to} T z \,.

This Kleisli composition plays an important role in computer science; for this, see the article at monad (in computer science).


Universal properties

In more general 2-categories the universal properties of Kleisli objects are dual to the universal properties of Eilenberg–Moore objects?.

In functional programming

In typed functional programming Kleisli composition is used to model functions with side-effects and computation. See at monad (in computer science) for more on this.


  • Jenö Szigeti, On limits and colimits in the Kleisli category, Cahiers de Topologie et Géométrie Différentielle Catégoriques, 24 no. 4 (1983), p. 381-391 (NUMDAM)

Discussion of cases where the inclusion of the Kleisli category into the Eilenberg-Moore category is a reflective subcategory is in

  • Marcelo Fiore and Matias Menni, Reflective Kleisli subcategories of the category of Eilenberg-Moore algebras for factorization monads, Theory and Applications of Categories, Vol. 15, CT2004, No. 2, pp 40-65. (TAC)

Discussion in internal category theory is in

  • Tomasz Brzeziński, Adrian Vazquez-Marquez, Internal Kleisli categories, Journal of Pure and Applied Algebra Volume 215, Issue 9, September 2011, Pages 2135–2147 (arXiv:0911.4048)

Discussion of Kleisli categories in type theory is in

  • Alex Simpson, Recursive types in Kleisli Categories (pdf)

Revised on December 8, 2013 02:59:04 by Urs Schreiber (