nLab comonad

Redirected from "comonads".
Contents

Contents

Definition

A comonad (or cotriple) on a category AA is a comonoid in the monoidal category of endofunctors AAA \to A. More generally, a comonad in a 2-category EE is a comonoid in the monoidal category E(X,X)E(X,X) for some object XKX\in K.

Just as a monad may be defined for any 2-category, EE, as a lax 2-functor from 1\mathbf{1} to EE, so a comonad in EE is an oplax 2-functor from 1E\mathbf{1} \to E.

See at monad for more.

Properties

Coalgebras

A coalgebra over a comonad (or comodule) over a comonad CC on a category AA is an object aAa\in A with a map aCaa\to C a satisfying dual axioms to those for an algebra over a monad. The category of coalgebras is called its (co-)Eilenberg-Moore category and satisfies a universal property dual to that of the Eilenberg-Moore object for a monad; it can thereby be internalized to any 2-category. The forgetful functor from the category of coalgebras to the category AA is called a comonadic functor. Similarly, a comonad also has a co-Kleisli category.

Comonadic homology and descent

Any comonad on AA induces an augmented simplicial endofunctor of AA consisting of its iterates. If AA is an abelian category and the comonad is additive, then this is the basis of comonadic homology?. Comodules (= coalgebras) over the comonad with underlying endofunctor M RM R RSM_R\mapsto M_R\otimes_R S in RR-ModMod for the extension of rings RSR\hookrightarrow S correspond to the descent data for that extension. Gluing of categories from localizations may also be formalized via comonads.

Mixed distributive laws

Distributive laws between a monad and a comonad are so-called mixed distributive laws; a special case has been rediscovered in physics under the name entwining structures (Brzeziński, Majid 1997). Their theory is often studied in the connection with the theory of comonads in the bicategory of rings, modules and morphisms of modules, that is corings. There is a homomorphism of bicategories from a bicategory of entwinings to a bicategory of corings (Škoda 2008), which is an analogue of the 2-functor compcomp (R. Street, Formal theory of monads, JPAA 1972) of strict 2-categories in the case of distributive laws of monads (recall also that a distributive law among monads corresponds to a monad in the 2-category of monads).

Examples

References

General

Some introductory material on comonads, coalgebras and co-Kleisli morphisms can be found in

  • Paolo Perrone, Notes on Category Theory with examples from basic mathematics, Chapter 5. (arXiv)

As contexts in computer science

On comonads in computer science:

Game comonads in logic

Comonads encode positions in back-and-forth games and bisimulations in various fragments of first-order and modal logics. See, for example, the Ehrenfeucht-Fraïssé comonad.

  • Samson Abramsky. Structure and Power: an emerging landscape. Fundamenta Informaticae 186(1-4) : 1–26, 2022 (doi:10.3233/FI-222116, arXiv:quant-ph/2206.07393)

  • Samson Abramsky and Nihil Shah?, Relating Structure and Power: Comonadic Semantics for Computational Resources (arXiv:1806.09031)

  • Samson Abramsky, Anuj Dawar, and Pengming Wang. The pebbling comonad in finite model theory. 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). IEEE, 2017 (arXiv:1704.05124)

  • Samson Abramsky and Dan Marsden. Comonadic semantics for guarded fragments. 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). IEEE, 2021. (arXiv:2008.11094)

  • Adam Ó Conghaile and Anuj Dawar. Game Comonads & Generalised Quantifiers. 29th EACSL Annual Conference on Computer Science Logic. 2021. (arXiv:2006.16039)

  • Yoàv Montacute and Nihil Shah. The pebble-relation comonad in finite model theory. Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science. 2022. (arXiv:2110.08196)

Last revised on June 21, 2024 at 08:25:52. See the history of this page for a list of all contributions to it.