F coalgebra

Definition

An F -coalgebra for an endofunctor on the category C

is an object A of C together with a morphism

usually written as ( A , α ) .

An F -coalgebra homomorphism from ( A , α ) to another F -coalgebra ( B , β ) is a morphism

in C such that

Thus the F -coalgebras for a given functor F constitute a category.

Examples

Consider the functor F : S e t ⟶ S e t that sends X to X × A ∪ { 1 } , F -coalgebras α : X ⟶ X × A ∪ { 1 } = F X are then finite or infinite streams over the alphabet A , where X is the set of states and α is the state-transition function. Applying the state-transition function to a state may yield two possible results: either an element of A together with the next state of the stream, or the element of the singleton set { 1 } as a separate "final state" indicating that there are no more values in the stream.

In many practical applications, the state-transition function of such a coalgebraic object may be of the form X → f 1 × f 2 × … × f n , which readily factorizes into a collection of "selectors", "observers", "methods" X → f 1 , X → f 2 … X → f n . Special cases of practical interest include observers yielding attribute values, and mutator methods of the form X → X A 1 × … × A n taking additional parameters and yielding states. This decomposition is dual to the decomposition of initial F -algebras into sums of 'constructors'.

Let P be the power set construction on the category of sets, considered as a covariant functor. The P-coalgebras are in bijective correspondence with sets with a binary relation. Now fix another set, A: coalgebras for the endofunctor P(A×(-)) are in bijective correspondence with labelled transition systems. Homomorphisms between coalgebras correspond to functional bisimulations between labelled transition systems.

Applications

In computer science, coalgebra has emerged as a convenient and suitably general way of specifying the behaviour of systems and data structures that are potentially infinite, for example classes in object-oriented programming, streams and transition systems. While algebraic specification deals with functional behaviour, typically using inductive datatypes generated by constructors, coalgebraic specification is concerned with behaviour modelled by coinductive process types that are observable by selectors, much in the spirit of automata theory. An important role is played here by final coalgebras, which are complete sets of possibly infinite behaviours, such as streams. The natural logic to express properties of such systems is coalgebraic modal logic.