Welcome to destall.com on July 5 2009.
This is an internet experiment running to monitor browsing habbits of individuals through wikipedia contents.

F-coalgebra

From Wikipedia, the free encyclopedia

Jump to: navigation, search

In mathematics, specifically in category theory, an F-coalgebra for an endofunctor

F : \mathcal{C}\longrightarrow \mathcal{C}

is an object A of \mathcal{C} together with a \mathcal{C}-morphism

\alpha : A \longrightarrow FA.

In this sense F-coalgebras are dual to F-algebras.

Homomorphisms of F-coalgebras are morphisms

f:A\longrightarrow B

in \mathcal{C} such that

 Ff\circ \alpha = \beta \circ f.

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

Contents

[edit] Examples

Consider the functor F: \mathbf{Set} \longrightarrow \mathbf{Set} that sends X to X\times A+1, F-coalgebras \alpha : X \longrightarrow X\times A+1 = FX are then finite or infinite streams over the alphabet A, where X is the set of states, α is the state-transition function, and the element of the singleton set 1 indicates that there are no more A's in the stream.

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.

[edit] Applications

In computer science, coalgebra has emerged as a convenient and suitably general way of specifying the reactive behaviour of systems. While algebraic specification deals with functional behaviour, typically using inductive datatypes generated by constructors, coalgebraic specification is concerned with reactive 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.

[edit] References

[edit] External links

[edit] See also

Personal tools

Visit joltnews for the latest headlines
Visit bloit.com for company information
Geed Media does computer consulting on long island.
This page viewed times. See Logs