An algebra for an endofunctor on a category is an object together with a morphism .
A coalgebra for an endofunctor on a category is an object together with a morphism .
Examples
The endofunctor on Set, has as algebras sets with a designated element and unary function. Initial algebra is the natural numbers with and successor. Coalgebras are partially defined unary functions. Terminal coalgebra is , with function undefined at , predecessor at a finite natural number, and .
For , the initial algebra consists of lists (finite sequences) of elements of ; the final coalgebra consists of streams (finite or infinite sequences) of elements of .
For , the inital algebra is empty; the final coalgebra consists of (infinite) sequences of elements of A.
The endofunctor on Classes of sets which sends a class to the class of subclasses of which are sets has as initial algebra the class of sets and as final coalgebra the class of non-well-founded sets.
The link between coalgebra and modal logic. Given a duality such as between Stone and Bool Alg?, with endofunctors on each (see p. 3 of Strongly Complete Logics for Coalgebras), the initial L-algebra is isomorphic to the terminal T-coalgebra, so modal sentences characterise behaviour.
There appears to be an imbalance in the amount of algebraic to coalgebraic thinking within mathematics. Some options:
It’s not a distinction worth making –- a coalgebra for is an algebra for .
It is a distinction worth making, but there’s plenty of coalgebraic thinking going on –- it’s just not flagged as such.
Coalgebra is a small industry providing a few tools for specific situations, largely in computer science, but with occasional uses in topology, etc.
Last revised on July 12, 2012 at 16:16:03. See the history of this page for a list of all contributions to it.